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++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const double PI = acos(-1);
const ll MOD = 1000000007;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
 
template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
  int N; cin >> N;
  vector<ll> r(N),c(N);
  rep(i,N) cin >> r[i] >> c[i];

  vector<vector<ll>> dp(N, vector<ll>(N,1e18));
  rep(i,N) dp[i][i] = 0;
  
  for (int j = 1; j < N; j++) {
    for (int i = 0; i < N-j; i++) {
      for (int k = i; k < i + j; k++) {
        chmin(dp[i][i+j],dp[i][k] + dp[k+1][i+j] + r[i] * c[k] * c[i+j]); 
      }
    }
  }

  cout << dp[0][N-1] << endl;
}

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

int main() {
    int n;
    scanf("%d", &n);

    int p[n+1], m[n][n];
    
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &p[i], &p[i+1]);
    }

    for (int i = 0; i < n; i++) { m[i][i] = 0; }

    for (int l = 1; l < n; l++) {
        for (int i = 0; i < n - l; i++) {
            int j = i + l;
            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] * p[k+1] * p[j+1]);
            }
            // printf("m[%d][%d] = %d\n", i, j, m[i][j]);
        }
        // printf("--\n");
    }
    printf("%d\n", m[0][n-1]);
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

#define INF (int)1e+9
using namespace std;

void dumpmat(vector<vector<int> >& a,int n){

  for( int i=1; i<=n; i++ ){
    for( int j=1; j<=n; j++ ){
      cout << a[i][j] << " ";
    }
    cout << "\n";
  }
  cout << "\n";
}

int main(){

  int n; cin >> n;
  vector<int> p(n+1);
  for(int i=0; i<n; i++) cin >> p[i] >> p[i+1];

  vector<vector<int> > m(n+1, vector<int>(n+1,INF));
  // dp[i][k] : i (0 <= i <= n-1)???????????? k (1 <= k <= n) ??????????????????????°????
  /*
  for(int i=0; i<=n; i++) m[i][1] = 0;
 
  for(int l=2; l<=n; l++){
    for(int i=1; i<n-l+1; i++){
      int j=i+l-1;
      dp[i][j]=INF;
      for(int k=i; k<=j-1; k++){
	dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + p[i-1]*p[k]*p[j]);
      }
      dumpmat(dp,n);
    }
  } 
  cout << dp[1][n] << endl;
*/
  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 - 1; k++ ) {
	m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
      }
      //      dumpmat(m,n);
    }
  }

  cout << m[1][n] << endl;
  return 0; 
}

C++: #include <stdio.h>
#include <iostream>
#include <utility>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
#define inf pow(100, 4) + 1

int dp[100][100] = {};
int n;
int getMCM(int r[], int c[])
{
    int k;
    for (int i = 1; i < n; i++)
    {
        k = 0;
        for (int j = i; j < n; j++)
        {
            dp[k][j] = inf;
            for (int l = k; l < j; l++)
            {
                dp[k][j] = min(dp[k][j], dp[k][l] + dp[l + 1][j] + r[k] * c[j] * c[l]);
            }
            k++;
        }
    }
    return dp[0][n - 1];
}

int main()
{
    cin >> n;
    int r[n], c[n];
    for (int i = 0; i < n; i++)
        cin >> r[i] >> c[i];

    cout << getMCM(r, c) << "\n";
    return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
static 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(int 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<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i) 
#define PI acos(-1)

using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;

template<class T> inline bool chmax(T& a, T b) {if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) {if (a > b) { a = b; return true; } return false; }

ll dpRec(int l, int r, vector<vector<ll>>& dp, vector<LP> rc) {
    if (dp[l][r] != INT_MAX) return dp[l][r];
    if (r - l == 1) {
        dp[l][r] = 0;
        return 0;
    }
    for (int i = l + 1; i < r; ++i) {
        chmin(dp[l][r], dpRec(l, i, dp, rc) + dpRec(i, r, dp, rc) + rc[l].first * rc[i].first * rc[r - 1].second);
    }
    return dp[l][r];
}

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

    int n;
    cin>>n;
    vector<LP> rc(n);
    rep(i, n) cin>>rc[i].first>>rc[i].second;

    vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, INT_MAX));
    // for (int i = 2; i < n + 1; ++i) {           // 行列をi個選ぶ
    //     for (int j = 0; j < n - i + 1; ++j) {   // j番目の行列以降から
    //         for (int k = 1; k < i; ++k) {       // j番目からk個までとそれ以降の積
    //             chmin(dp[i][j], dp[k][j] + dp[i - k][j + k] + rc[j].first * rc[j + k].first * rc[j + i].first);
    //         }
    //     }
    // }
    cout<<dpRec(0, n, dp, rc)<<endl;
}

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

static 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 j=2;j<=n;j++){
    for(int i=1;i<= n-j+1;i++){
      int l = i+j-1;
      m[i][l]=(1 << 21);
      for(int k=i;k<= l-1;k++){
	m[i][l]=min(m[i][l],m[i][k]+m[k+1][l]+p[i-1]*p[k]*p[l]);
      }
    }
  }

  cout << m[1][n] << endl;

  return 0;
}