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<iostream>
#include<cstdio>
#include<string>
#include<algorithm>

#define INF 100000001

using namespace std;

int DP[101][101];
int *p;

int rec(int r,int c){
    int Min = INF;
    int num = c - r;
    
    for (int i = 0; i < num; i++) {
        Min = min(Min , DP[r][r+i] + DP[r+i+1][c] + p[r-1]*p[r+i]*p[c]);
    }
    return Min;
}

int main(){
    int N;
    cin >> N;
    for (int i = 1; i <= N; i++) DP[i][i] = 0;
    
    p = (int *)malloc(sizeof(int)* (N+1));
    
    cin >> p[0];
    cin >> p[1];
    int bb;
    for (int i = 2; i <= N; i++) {
        cin >> bb;
        cin >> p[i];
    }
    
    for (int i = 1; i < N; i++) DP[i][i+1] = p[i-1]*p[i]*p[i+1];
    
    
    for (int j = 0; j <= N-3 ; j++) {//?????????????????????
        for (int i = 3+j; i <= N; i++) {//????????°???????????????
            DP[i-2-j][i] = rec(i-2-j,i);
        }
    }
    
    cout << DP[1][N] << endl;
    
    return 0;
}

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

void solve(){
  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));
  for(int i = 1; i <= n; i++) m[i][i] = 0;
  for(int i = 2; i <= n; i++){
    for(int j = 1; j <= n - i + 1; j++){
      int t = 1000000000;
      for(int k = j; k <= j + i - 2; k++){
        t = min(m[j][k] + m[k + 1][j + i - 1] + p[j - 1] * p[k] * p[j + i - 1], t);
      }
      m[j][j + i - 1] = t;
    }
  }
  cout << m[1][n] << endl;
  return;
}

int main(){
  solve();
  return 0;
}

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

int c[100][100];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, t;
    int M[101];
    cin>>n;
    cin>>M[0]>>M[1];
    for(int i=2; i<=n; i++) {
        cin>>t>>M[i];
    }
    for(int l=1; l<n; l++) {
        for(int i=0; i+l<n; i++) {
            int cost=numeric_limits<int>::max();
            for(int j=i+1; j<=i+l; j++) {
                cost=min(cost, c[i][j-1]+M[i]*M[j]*M[i+l+1]+c[j][i+l]);
            }
            c[i][i+l]=cost;
        }
    }
    cout<<c[0][n-1]<<'\n';
}

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

static const int N= 100;
int p[N+1], m[N+1][N+1];

int main() {
    ios::sync_with_stdio(false);
    int n;
    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++){ //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;
}

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<iostream>
#include<climits>
#include<algorithm>
using namespace std;
struct mat{
  int w,h;
};
vector<mat> v;
int memo[101][101];

int solve(int l,int r){
  if(memo[l][r] > 0)return memo[l][r];
  //cout << l << ' ' << r << endl;
  if(l == r)return 0;
  int ret = INT_MAX;
  for(int i = l; i < r; i++){
    int ans = solve(l,i) + solve(i+1,r) + v[l].h * v[i].w * v[r].w;
    ret = min(ret,ans);
  }
  return memo[l][r] = ret;
}
int main(){
  fill(*memo,*(memo+101),-1);
  int n;
  cin >> n;
  for(int i = 0;i < n;i++){
    int r,c;
    cin >> r >> c;
    v.push_back({c,r});
  }
  cout << solve(0,n-1) << endl;
}

C++: #include <iostream> 
#include <cmath> 
#include <climits>
 
using namespace std; 
 
int r[45] = {0}; 
int a[100][100] = {0}; 
 
int f(int n, int m); 
int f(int n, int k, int m); 
 
 
int f(int n, int k, int m) 
{ 
    return f(n,k) * f(k+1,m) + (r[n] * r[k+1] * r[m+1]); 
} 
 
int f(int n, int m) 
{ 
    if (n==m) return 1; 
    int & ra = a[n][m]; 
    if (ra) return ra; 
    ra = INT_MAX; 
    for (int k=n;k<m;k++) 
    { 
        int ans = f(n,k,m); 
        if (ans < ra) ra = ans; 
    } 
    return ra; 
} 
 
int main() 
{ 
    int rr = 0; 
    int cc = 0; 
    int n = 0; 
    cin >> n; 
    for (int i=0;i<n;i++) 
    { 
        cin >> rr >> cc; 
        r[i]=rr; 
        r[i+1]=cc; 
    } 
    for (int i=0;i<n-1;i++) 
    { 
        a[i][i+1] = r[i] * r[i+1] * r[i+2]; 
    } 
    int ans = f(0,n-1); 
    cout << ans << endl; 
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#define Lens 105

using namespace std;
int p[Lens];
int C[Lens][Lens];
int N;

int main()
{
	cin >> N;
	for (int i = 1; i <= N; i++)
	{
		cin >> p[i - 1] >> p[i];
		C[i][i] = 0;
	}
	for (int k = 1; k < N; k++)
	{
		for (int i = 1; i <= N-k; i++)
		{
			int j = i + k;
			C[i][j] = C[i][i] + C[i + 1][j]+p[i-1]*p[i]*p[j];
			for (int t = i+1; t < j; t++)
			{                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                
				C[i][j] = min(C[i][j], C[i][t] + C[t+1][j] + p[i - 1] * p[t] * p[j]);
			}
		}
	}
	cout << C[1][N];
	return 0;

}

C++: #include<stdio.h>

int main(void) {
  int n, p[101], m[101][101], i, l, j, k, non, temp;
  
  scanf("%d", &n);
  for (i = 0; i < n; i++)
  {
    if (i == 0) scanf("%d %d", &p[0], &p[1]);
    else scanf("%d %d", &non, &p[i + 1]);
  }
  
  for (i = 1; i <= n; i++) m[i][i] = 0;
  
  for (l = 2; l <= n; l++)
  {
    for (i = 1; i <= n - l + 1; i++)
    {
      j = i + l - 1;
      m[i][j] = 10000000000;
      for (k = i; k <= j - 1; k++)
      {
        if (m[i][j] > m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j])
        {
          m[i][j] = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
        }
      }
    }
  }
  
  printf("%d\n", m[i][j]);
  return 0;
}