Go: package main

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

func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

func min(x, y int) int {
	if x > y {
		return y
	}
	return x
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	n := nextInt(sc)

	P := make([]int, n+1)
	for i := 1; i <= n; i++ {
		l := nextInt(sc)
		P[i-1] = l
		m := nextInt(sc)
		P[i] = m
	}

	matrix := make([][]int, n+1)
	for i := 0; i < n+1; i++ {
		matrix[i] = make([]int, n+1)
	}

	for l := 2; l <= n; l++ {
		for i := 1; i <= n - l + 1; i++ {
			j := i + l - 1
			matrix[i][j] = (1 << 21)
			for k := i; k <= j-1; k++ {
				matrix[i][j] = min(matrix[i][j], matrix[i][k] + matrix[k+1][j] + P[i-1] * P[k] * P[j])
			}
		}
	}
	fmt.Println(matrix[1][n])
}

C++: #include <iostream>
#include<climits>
#include<vector>
using namespace std;
 
int MCM(int p[],int n) {
    vector<vector<int> > m(n,vector<int>(n));
    for (int i = 0; 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] = INT_MAX;
            for (int k = i; k <= j-1; k++) {
                int q = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
                if (m[i][j] > q) {
                    m[i][j] = q;
                }
 
            }
        }
 
    }
    return m[1][n];
}
 
int main() {
    int n, p[200];
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> p[i] >> p[i + 1];
    }
    cout << MCM(p, 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++)
 
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 dp[100][100] = {{0}};
std::vector<int> r;
std::vector<int> c;
int N;

int dfs(int i, int j) {
	if (dp[i][j] != 0) {return dp[i][j];}
	if (j == i) {
		return 0;
	}
	if (j - i == 1) {
		return dp[i][j] = r[i] * c[i] * c[j];
	}
	int ans = 1000000000;
	for (int k = i; k < j; ++k) {
		ans = std::min(ans, dfs(i, k) + dfs(k + 1, j) + r[i] * c[k] * c[j]);
	}
	return dp[i][j] = ans;
}

int main(int argc, char const *argv[]) {
	cin >> N;
	for (int i = 0; i < N; ++i) {
		int a, b;
		cin >> a >> b;
		r.push_back(a);
		c.push_back(b);
	}
	int ans = dfs(0, N - 1);
	cout << ans << endl;

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000 // 10^12
#define MOD 1000000007 // 10^9+7
#define PB push_back
#define MP make_pair

const int MAX_N = 100;

int n;
int r[MAX_N], c[MAX_N];

int dp[MAX_N][MAX_N];

int main() {
    cin >> n;
    REP(i, n) cin >> r[i] >> c[i];

    REP(i, n) {
        REP(j, n) dp[i][j] = MOD;
    }

    REP(i, n) dp[i][i] = 0;

    REP2(k, 1, n) {
        REP(i, n - k) {
            int j = i + k;
            REP2(l, i, j) {
                dp[i][j] = min(dp[i][j], dp[i][l] + dp[l+1][j] + r[i]*c[l]*c[j]);
            }
        }
    }

    PRINT(dp[0][n-1]);
    return 0;
}

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

const ll INF = 1e+18 + 10;
const int MAX_N = 100;
ll dp[MAX_N][MAX_N];

int main()
{
    int n;
    cin >> n;
    vector<int> r;

    for (int i = 0; i < n; i++)
    {
        int row, col;
        cin >> row >> col;
        if (i == 0)
        {
            r.push_back(row);
        }
        r.push_back(col);
    }

    // DPの初期化
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (i == j)
            {
                dp[i][i] = 0;
            }
            else
            {
                dp[i][j] = INF;
            }
        }
    }

    // DPの更新
    for (int j = 1; j < n; j++)
    {
        for (int i = 0; i + j < n; i++)
        {
            for (int k = 0; k <= i + j; k++)
            {
                ll prod = r[i] * r[k + 1] * r[i + j + 1];
                dp[i][i + j] = min(dp[i][i + j], dp[i][k] + dp[k + 1][i + j] + prod);
            }
        }
    }

    cout << dp[0][n - 1] << endl;
    return 0;
}

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

int main(){
	int n, p[101],m[101][101];
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>p[i-1]>>p[i]
		}
		
	for(int i=1 ; i<=101 ; 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[l][n]<<endl;
	return 0;
	
}

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

#define MAX_N 10000
#define INF 10000000LL

long long n, j, x[MAX_N][MAX_N], p[MAX_N + 2], sum;

int matrix() {
	for (int i = 0; i < n; i++) { x[i][i] = 0; }
	for (int h = 2; h <= n; h++) {
		for (int i = 1; i <= n - h + 1; i++) {
			j = i + h - 1;
			x[i][j] = INF;
			for (int k = i; k < j; k++) {
				x[i][j] = min(x[i][j], x[i][k] + x[k + 1][j] + p[i - 1] * p[k] * p[j]);
			}
		}
	}
	sum = x[1][n];
	return sum;
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> p[i - 1] >> p[i];
	}
	cout << matrix() << endl;
	return 0;
}

C++: #include<bits/stdc++.h>
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>
using namespace std;
const int N=105;
const int INF=0x3f3f3f3f;
int n,r[N],c[N],f[N][N];
int dp(int i,int j){
	if(f[i][j])return f[i][j];
	if(i==j)return f[i][j]=0;
	if(i+1==j)return f[i][j]=r[i]*c[i]*c[j];
	int ans=INF;
	for(int k=i;k<j;k++){
		ans=min(ans,dp(i,k)+dp(k+1,j)+r[i]*c[k]*c[j]);
	}
	return f[i][j]=ans;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&r[i],&c[i]);
	}
	printf("%d\n",dp(1,n));
	return 0;
}

C++: #include<bits/stdc++.h>
#define pb push_back
#define ll long long

using namespace std;

ll dp[105][105];
vector<pair<ll,ll> >v;


ll mcm(int left,int right)
{

    if(left>=right) return 0;
    if(dp[left][right]!=INT_MAX) return dp[left][right];
//cout<<"ok"<<endl;
    ll ans=INT_MAX;

    for(int i=left;i<right;i++)
    {
        ll res_left= mcm(left,i);
        ll res_right= mcm(i+1,right);
        ll res=v[left].first*v[i].second*v[right].second;
        ans=min(ans, res+res_left+res_right);
        //cout<<ans<<endl;
    }
    return dp[left][right]=ans;
}



int main()
{
    for(int i=0;i<104;i++) for(int j=0;j<104;j++) dp[i][j]=INT_MAX;

    int n,temp; cin>>n;
    temp=n;
    while(temp--)
    {
        int a,b; cin>>a>>b;
        v.pb({a,b});
    }

    cout<<mcm(0,n-1)<<endl;

}