Go: package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

var cache [100][100]int

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Scan()
	num, _ := strconv.Atoi(sc.Text())
	tables := []table{}
	for i := 0; i < num; i++ {
		sc.Scan()
		num1, _ := strconv.Atoi(sc.Text())
		sc.Scan()
		num2, _ := strconv.Atoi(sc.Text())
		t := table{num1, num2}
		tables = append(tables, t)
	}

	fmt.Println(minimum(0, len(tables)-1, tables))
}

type table struct {
	v int
	h int
}

func minimum(i int, j int, t []table) int {
	if i == j {
		return 0
	}

	// fmt.Printf("i:%v j:%v\n", i, j)
	if cache[i][j] != 0 {
		return cache[i][j]
	}

	min := math.MaxInt64
	for k := i; k < j; k++ {
		p := t[i].v
		n := t[k].h
		q := t[j].h
		val := minimum(i, k, t) + minimum(k+1, j, t) + p*n*q
		if val < min {
			min = val
		}
	}

	cache[i][j] = min
	return min
}

C++: // http://algorithms.blog55.fc2.com/blog-entry-66.html

#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>

#define MAX 100

int SIZE;
int R[MAX + 2];
int C[MAX+1][MAX+1]; // cost table
int B[MAX+1][MAX+1]; // best table

void compute(){
	int i=0,j,k;
	memset(C,99,sizeof(C));
    
    for (i = 0; i < SIZE; i++ ) C[i][i] = 0;
    
    for (j = 1; j < SIZE; j++ ){
        for (i = 0; i < SIZE - j; i++ ){
            for (k = i; k < i + j; k++ ){
                // C[i][i+j] = min( C[i][i+j], 
                //                  C[i][k-1] + C[k][i+j] + R[i]*R[k]*R[i+j+1]);
                int cost = C[i][k] + C[k+1][i+j] + R[i]*R[k+1]*R[i+j+1];
                if ( cost < C[i][i+j] ){
                    C[i][i+j] =  cost;
                    B[i][i+j] = k;
                }
                
            }
        }
    }
}

void order( int i, int j ){
    if ( i == j ) cout << "M" << i;
    else{
        cout << "(";
        order( i, B[i][j]-1 ); order(B[i][j], j);
        cout << ")";
    }
}

void input(){
    cin >> SIZE;
	int z,i=0;
    for (; i < SIZE; i++ ) cin >> R[i]>>z;
	R[i]=z;
	//SIZE++;
}

void output(){
    cout <<  C[0][SIZE-1] << endl;
    //order(1, SIZE);
    //cout << endl;
}

main(){
    input();
    compute();
    output();
}

C++: // http://algorithms.blog55.fc2.com/blog-entry-66.html

#include <iostream>
using namespace std;
#include <stdio.h>

#define MAX 100
#define INFTY (1 << 21)

int SIZE;
int R[MAX + 2];
int C[MAX+1][MAX+1]; // cost table
int B[MAX+1][MAX+1]; // best table

void compute(){
	int i=0,j,k;
    for (; i <= SIZE; i++ )
    for (j = 0; j <= SIZE; j++ ) C[i][j] = INFTY;
    
    for (i = 0; i <= SIZE; i++ ) C[i][i] = 0;
    
    for (j = 1; j < SIZE; j++ ){
        for (i = 0; i < SIZE - j; i++ ){
            for (k = i; k < i + j; k++ ){
                // C[i][i+j] = min( C[i][i+j], 
                //                  C[i][k-1] + C[k][i+j] + R[i]*R[k]*R[i+j+1]);
                int cost = C[i][k] + C[k+1][i+j] + R[i]*R[k+1]*R[i+j+1];
                if ( cost < C[i][i+j] ){
                    C[i][i+j] =  cost;
                    B[i][i+j] = k;
                }
                
            }
        }
    }
}

void order( int i, int j ){
    if ( i == j ) cout << "M" << i;
    else{
        cout << "(";
        order( i, B[i][j]-1 ); order(B[i][j], j);
        cout << ")";
    }
}

void input(){
    cin >> SIZE;
	int z,i=0;
    for (; i < SIZE; i++ ) cin >> R[i]>>z;
	R[i]=z;
	//SIZE++;
}

void output(){
    cout <<  C[0][SIZE-1] << endl;
    //order(1, SIZE);
    //cout << endl;
}

main(){
    input();
    compute();
    output();
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

const int N = 100;

int main() {
     int n, p[N + 1], m[N + 1][N + 1];
     cin >> n;
     for ( int i = 1; i <= n; i++ ) {
          cin >> p[i - 1] >> p[i];
     }

     for ( int i = 1; i <= n; i++ )   m[i][i] = 0;
     for ( int l = 2; l <= n; l++ ) {
          for ( i = 1; i <= n - l + 1; i++ ) {
               int j = i + l - 1;
               m[i][j] = (1 << 21);
               for ( int k = i; k <= j - 1; k ++ ) {
                    m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
               }
          }
     }
     cout << m[1][n] << endl;

     return 0;
}

C++: #include <iostream>
#define NMAX 100
#define MAX 100000000
using namespace std;

struct Matrix{
  long long r;
  long long c;
};

Matrix m[NMAX];
int n;

long long minmulti_[NMAX][NMAX];

long long minmulti(int begin,int end){
  if(begin==end){return 0;}
  if(begin+1==end){return m[begin].r*m[begin].c*m[end].c;}
  if(minmulti_[begin][end]!=0) return minmulti_[begin][end];
  long long min=MAX;
  long long num;
  for(int i=begin;i<end;i++){
     num = minmulti(begin,i) + minmulti(i+1,end);
     num += m[begin].r*m[i].c*m[end].c;
     if(num<min){min=num;}
  }
  minmulti_[begin][end]=min;
  return min;
}

int main(){
  for(int i=0;i<NMAX;i++){
    for(int j=0;j<NMAX;j++){
      minmulti_[i][j]=0;
    }
  }
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>m[i].r>>m[i].c;
  }
  cout<<minmulti(0,n-1)<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    long long p[n + 1];
    for (int i = 0; i < n; i++)
    {
        cin >> p[i] >> p[i + 1];
    }
    long long m[n + 1][n + 1];
    for (int i = 1; i <= n; i++)
        m[i][i] = 0;

    for (int l = 2; l <= n; l++)
    {
        for (int i = 1; i <= n - l + 1; i++)
        {
            int j = i + l - 1;
            m[i][j] = 1 << 21;
            for (int k = i; k <= j; k++)
            {
                m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
            }
        }
    }
    cout << m[1][n] << endl;
}

C++: #include<iostream>
#include<climits>
#include<utility>
#include<algorithm>
#include<cstring>

using namespace std;

long long calc_min_cost(pair<int, int>*, int);

int main() {
	int n,mini;
	cin >> n;
	pair<int, int>* mat = new pair<int, int>[n];
	for (int i = 0;i < n;i++) {
		cin >> mat[i].first >> mat[i].second;
	}
	if (n == 1) {
		cout << "0\n";
		return 0;
	}
	int** first_last = new int* [n];
	for (int i = 0;i < n;i++) {
		first_last[i] = new int[n - i];
		first_last[i][0] = 0;
	}
	for (int i = 1;i < n;i++) {
		for (int j = 0;j < n - i;j++) {
			mini = INT_MAX;
			for (int k = 0;k < i;k++) {
				mini = min(mini, first_last[j][k] + first_last[j + k + 1][i - k - 1] + mat[j].first * mat[j + k].second * mat[j + i].second);
			}
			first_last[j][i] = mini;
		}
	}
	cout << first_last[0][n - 1] << endl;
}

long long calc_min_cost(pair<int, int>* mat, int n) {
	pair<int, int> *tmp = new pair<int,int>[n];
	long long cost=-1, mini = INT_MAX;
	if (n == 2) {
		return mat[0].first * mat[0].second * mat[1].second;
	}
	for (int i = 0;i < n-1;i++) {
			cost = (long long)(mat[i].first) * mat[i].second * mat[i+1].second;
			memcpy(tmp, mat, sizeof(pair<int,int>) * n);
			tmp[i].second = tmp[i+1].second;
			for (int j = i+1;j < n-1;j++) {
				tmp[j] = tmp[j + 1];
			}
			cost += calc_min_cost(tmp, n - 1);
			mini = min(mini, cost);
	}
	free(tmp);
	return mini;
}

C++: #include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define inf 1e9+7

int n;
ll dp[102][102];
ll p[102];

void init(){
    for(int i=0;i<=n;i++){
        for(int j=0;j<=n;j++){
            dp[i][j]=inf;
        }
        dp[i][i]=0;
    }
}

void cal(int l, int r){
    if(l>=r)return;
    if(dp[l][r]<inf)return;
    for(int k=l;k<r;k++){
        cal(l,k);
        cal(k+1,r);
        dp[l][r] = min(dp[l][r], dp[l][k]+dp[k+1][r]+p[l]*p[k+1]*p[r+1]);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    init();
    cin >> p[0] >> p[1];
    ll a,b;
    for(int i=1;i<n;i++){
        cin >> a >> b;
        p[i+1]=b;
    }
    cal(0,n-1);
    cout << dp[0][n-1] << endl;
    return 0;
}