Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func nextInt() int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return i
}
func main() {
	sc.Split(bufio.ScanWords)
	var n int
	var M [101][101]int

	n = nextInt()

	P := make([]int, n*2)

	for i := 1; i <= n; i++ {
		P[i-1] = nextInt()
		P[i] = nextInt()
	}
	for l := 2; l <= n; l++ {
		for i := 1; i <= n-l+1; i++ {
			j := i + l - 1
			M[i][j] = 1000000
			for k := i; k <= j-1; k++ {
				M[i][j] = int(math.Min(float64(M[i][j]), float64(M[i][k]+M[k+1][j]+P[i-1]*P[k]*P[j])))
			}
		}
	}
	fmt.Println(M[1][n])
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int limN = 105;

int xs[limN], ys[limN];
ll dp[limN][limN];
bool usd[limN][limN];

ll memo(int l, int r) {
    if(l>=r)
        return 0;
    if(usd[l][r])
        return dp[l][r];
    usd[l][r] = true;
    ll &ans = dp[l][r];
    ans = (1LL<<62);
    for(int i=l; i<r; i++) {
        // printf("%d %d %d\n", xs[l], ys[i], ys[i+1]);
        // printf("considerando %d %d %d => %d %lld %lld\n", l, i, r, xs[l]*ys[i]*ys[r], memo(l, i), memo(i+1, r));
        ans = min(ans, xs[l]*ys[i]*ys[r] + memo(l, i) + memo(i+1, r));
    }
    return ans;
}

int main() {
    int N ;
    scanf("%d", &N);
    for(int i=0; i<N; i++) {
        scanf("%d%d", &xs[i], &ys[i]);
    }
    printf("%lld\n", memo(0, N-1));
}

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

static const int N=100;

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

  for(i=1;i<=n;i++) m[i][i]=0;
  for(l=2;l<=n;l++){
    for(i=1;i<=n-1;i++){
      j=i+l-1;
      m[i][j]=(1 << 21);
      for(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<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 <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int n;//計算する行列の数
const int MAX_N =110;
int dp[MAX_N][MAX_N];//dp[i][j]:=Ai...Ajの計算に必要な最小のコスト
pii A[MAX_N];//行列firstを行secondを列とする。
int B[MAX_N+1][MAX_N+1]; //B[i][j]:=Ai...Ajに最適な括弧を挿入する場所
void init(){
	for(int i =0; i < n;i++){
		for(int j = 0;j < n;j++){
			dp[i][j]=INF;
			B[i][j]=0;
		}
	}
	for(int i =0;i < n;i++){
		dp[i][i]=0;
	}
}
//計算
int solve(){
	for(int k =1;k <n;k++){//個数
		for(int i =0;i <n-k;i++){//何処から始めるか
			for(int j =i;j <i+k;j++){//何処で終わるか
				int sz =A[i].first*A[j].second*A[i+k].second;
				int cost=dp[i][j]+dp[j+1][i+k]+sz;
				if(dp[i][i+k] >cost){
					dp[i][i+k]=cost;
					B[i][i+k]= j+1;//括弧を挿入する場所
				}

			}
		}
	}
	return dp[0][n-1];
}
//復元
void order(int i,int j){
	if(i==j){
		cout <<'A'<<i;
	}else{
		cout <<"(";
		order(i, B[i][j]-1);
		order(B[i][j], j);
		cout <<")";
	}
}

int main(){
	cin>>n;
	init();
	for(int i =0;i < n;i++){
		cin>>A[i].first>>A[i].second;
	}
	cout <<solve()<<endl;
	//order(0, n-1);
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n) ; i++)
#define rrep(i,n) for(int i = n-1; i >= 0 ; i--)
constexpr auto INF = 2147483647;
typedef long long ll;

// void DebugGrid(int row, int column, auto table){
//   cout << endl;
//   rep(i,row){
//     rep(j,column) cout << table[i][j] << " ";
//     cout << endl;
//   }
// }

int main(){

  ll ans, n, DP[100][100];
  vector<pair<int,int>> matrix;
  cin >> n;
  rep(i,n){
    pair<int,int> inp;
    cin >> inp.first >> inp.second;
    matrix.emplace_back(inp);
  }

  rep(i,n)rep(j,n) DP[i][j] = INF;
  for(int l=0; l<n; l++)for(int i=0; i<n-l; i++){
    if(l == 0) DP[i][i] = 0;
    else{
      for(int j=i;j<=i+l;j++){
      DP[i][i+l] = min(DP[i][i+l],DP[i][j]+DP[j+1][i+l] + (matrix[i].first*matrix[j].second*matrix[i+l].second));
      }
    }
  }

  // DebugGrid(n,n,DP);
  cout << DP[0][n-1] << endl;
  return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define show(a, n) rep(i,n) {cout<<a[i]<<' ';} cout<<endl;

using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;

const int INF = 1 << 30;
const long long INFL = 1LL << 62;
const int MOD = 1000000007;
const int MAX = 100000;
const int N = 100010;

struct mat {
	ll r, c;
};

int main() {
//	cout << fixed << setprecision(15);
	int n;
	cin >> n;
	vector<mat> m(n);
	rep(i, n) cin >> m[i].r >> m[i].c;

	if(n == 1) {cout << 0 << endl; return 0; }

	vector<vll> dp(n, vll(n));
	rep(i, n) dp[i][i] = 0;
	int l, r;
	for(int d = 1; d <= n - 1; d++) {
		for(l = 0; l + d < n; l++) {
			r = l + d;
			dp[l][r] = INFL;
			for(int k = l; k + 1 <= r; k++) {
				dp[l][r] = min(dp[l][k] + dp[k + 1][r] + m[l].r * m[k].c * m[r].c, dp[l][r]);
			}
		}
	}
	cout << dp[0][n - 1] << endl;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll mod2 = 998244353;
const int INF = (1<<21);

int main() {
  int n;
  cin >> n;
  int cnt[n][n];
  int p[n+1];
  rep(i, n) {
    cin >> p[i] >> p[i+1];
  }

  rep(i, n) {
    rep(j, n) {
      if (i == j) cnt[i][j] = 0;
      else cnt[i][j] = INF;
    }
  }

  FOR(l, 1, n) {
    rep(i, n-l) {
      int j = i+l;
      FOR(k, i, j) {
        cnt[i][j] = min(cnt[i][j], cnt[i][k] + cnt[k+1][j] + p[i] * p[k+1] * p[j+1]);
      }
    }
  }

  cout << cnt[0][n-1] << endl;



  
  return 0;
}

C++: #include <bits/stdc++.h>
#define N 110
using namespace std;
int A[N];
int dp[N][N];

int Min(int &a,int b){return a = min(a,b);}
int main(){
  int n;
  cin>>n;

  for(int i=0,cnt=0;i<n;i++){
    int a,b;
    cin>>a>>b;
    if(i == 0) A[cnt++] = a;
    A[cnt++] = b;
  }

  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++)dp[i][j] = 1e9;
    dp[i][i] = 0;
  }
  
  for(int len=0;len<n;len++)
    for(int l=1;l<n;l++){
      int r = l+len;
      for(int m = l;m<r;m++){
        Min(dp[l][r],dp[l][m] + dp[m+1][r] + A[l-1]*A[m]*A[r]);
      }
}
  
  cout<<dp[1][n]<<endl; 
  return 0;
}