Go: package main

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

const N = 100

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

func answer(reader io.Reader) string {
	sc := bufio.NewScanner(reader)
	sc.Split(bufio.ScanWords)

	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())

	var p [N]int
	var m [N + 1][N + 1]int
	for i := 1; i <= n; i++ {
		sc.Scan()
		p[i-1], _ = strconv.Atoi(sc.Text())
		sc.Scan()
		p[i], _ = strconv.Atoi(sc.Text())
	}

	for l := 2; l <= n; l++ {
		for i := 1; i <= n-l+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])
			}
		}
	}

	return fmt.Sprintf("%d", m[1][n])
}

func main() {
	fmt.Println(answer(os.Stdin))
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll INF = (1LL << 60);

pair<ll, ll> A[110];
ll dp[110][110];

ll matrix_chain(int i, int j){
	if(i == j) return 0;
	if(dp[i][j] != INF) return dp[i][j];
	for(int k = i;k < j; ++k) dp[i][j] = min(dp[i][j], matrix_chain(i, k) 
			+ matrix_chain(k+1, j) + A[i].first*A[k].second*A[j].second);
	return dp[i][j];
}

int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;

	for(int i=0;i<n;++i) for(int j=0;j<n;++j) dp[i][j]=INF;

	for(int i=0;i<n;i++) cin >> A[i].first >> A[i].second;
	
	cout << matrix_chain(0, n-1);

	return 0;
} // br1

C++: #pragma GCC optimize ("O3")

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << "\n";
}

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;
//
//ll matrix_chain_multiplications(vector<int>& p) {
//    int n = p.size() - 1; // num of matrix
//    vector<vll> dp(n + 1, vll(n + 1, INF));
//
//    // init
//    FOR(i, 1, n + 1) dp[i][i] = 0;
//
//    FOR(l, 2, n + 1) {
//        FOR(i, 1, n - l + 2) {
//            int j = i + l - 1;
//            FOR(k, i, j) {
//                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + p[i - 1] * p[k] * p[j]);
//            }
//        }
//    }
//
//    return dp[1][n];
//}

// 0-indexed
ll matrix_chain_multiplications(vector<int>& p) {
    int n = p.size() - 1; // num of matrix
    vector<vll> dp(n, vll(n, INF)); // dp[l][r] = minimum cost of [l, r], 0 <= l, r < n

    // init
    FOR(i, 0, n) dp[i][i] = 0;

    FOR(l, 2, n + 1) { // l = 2 ~ n
        REP(i, n - l + 1) {
            int j = i + l - 1;
            FOR(k, i, j) {
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + p[i] * p[k + 1] * p[j + 1]);
            }
        }
    }

    return dp[0][n - 1];
}


int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int n; cin >> n;

    vi p(n + 1);
    REP(i, n) cin >> p[i] >> p[i + 1];

    print(matrix_chain_multiplications(p));
}

C++: #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;

struct mat {
    int row = -1;
    int col = -1;
};

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

    int N;
    cin >> N;
    vector<mat> M(N);
    rep(i, N) {
        int a, b;
        cin >> a >> b;
        M[i].row = a, M[i].col = b;
    }

    vector<vector<ll>> dp(N + 5, vector<ll>(N + 5, INF));
    rep(i, N + 5) { dp[i][i] = 0; }

    for (int w = 1; w < N; w++) {
        for (int i = 0; i < N; i++) {
            if (i + w >= N)
                continue;
            int j = i + w;
            for (int k = i; k < j; k++) {
                ll num_pro = M[i].row * M[k].col * M[j].col;
                dp[i][i + w] =
                    min(dp[i][i + w], dp[i][k] + dp[k + 1][i + w] + num_pro);
            }
        }
    }

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

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

int calcDpTable(int i, int j, int ** dpTable, const int *p) {
	int minValue = INT_MAX; 
	for (int k = i; k < j; ++k) {
		minValue = min(dpTable[i][k - i] + dpTable[k + 1][j - k - 1] + p[i] * p[k + 1] * p[j + 1], minValue);
	}
	//dpTable[0][0] = 1;
	return minValue;
}

int minNumOfMultiplications(const int *p, int n) {
	int **dpTable = new int*[n];
	for (int i = 0; i < n; ++i) {
		dpTable[i] = new int[n - i];
		dpTable[i][0] = 0;
	}

	int d = 1;
	for (int to = n - 2; to >= 0; --to) {
		for (int i = 0; i <= to; ++i) {
			int j = i + d;
			dpTable[i][j - i] = calcDpTable(i, j, dpTable, p);
		}
		++d;
	}
	int ret = dpTable[0][n - 1];
	
	for (int i = 0; i < n; ++i) {
		delete[] dpTable[i];
	}
	delete[] dpTable;

	return ret;
}

int main() {
	int n;
	cin >> n;
	int *p = new int[n + 1];
	for (int i = 0; i < n; ++i) {
		cin >> p[i] >> p[i + 1];
	}
	cout << minNumOfMultiplications(p, n) << endl;
}

C++: #include<cstdio>
#include<climits>
#include<algorithm>
using namespace std;
int AskMCM(int *p,int n){
    int cost[n+1][n+1];
    for(int i = 1;i <= n;++i) cost[i][i] =0;
    for(int l = 2;l <= n; l++){
        for(int i = 1;i <= n - l + 1;i++){
            int j = i+l -1;
            int min_cost = INT_MAX;
            for(int k = i;k < j;++k) min_cost = min(min_cost,cost[i][k] + cost[k+1][j] + p[i-1] * p[k] * p[j]);
            cost[i][j] = min_cost;
        }
    }
    return cost[1][n];
}

int main(){
    int n,r,tmp;
    scanf("%d",&n);
    int p[n+1];
    for(int i = 1;i <= n;++i) scanf("%d %d",&p[i-1],&p[i]);
    printf("%d\n",AskMCM(p,n));
}

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

int main(void){
    int n,i,k,a[110],min,x;
    
    int dp[110][110];
    int length,left,mid,right;
    
    cin>>n;
    
    cin>>a[0]>>a[1];
    for(i=2;i<n+1;i++){
        cin>>x>>a[i];
    }
    
    for(i=0;i<n;i++){
        dp[i][i]=0;
    }

    for(length=1;length<n;length++){
        for(left=0;left<n-length;left++){
            min=1000000000;
            right=left+length;
            for(mid=left;mid<right;mid++){
                x=dp[left][mid]+dp[mid+1][right]+a[left]*a[mid+1]*a[right+1];
                if(x<min)min=x;
            }
            dp[left][right]=min;
        }
    
    }

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

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

int calc(const vector<pair<int, int> >& M, int idx_b, int idx_e) {
    if (idx_b == idx_e) return 0;
    int min = 2e9;
    for (int i = idx_b; i < idx_e; i++) {
        int val = 0;
        val = calc(M, idx_b, i);
        val += calc(M, i + 1, idx_e);
        val += M[idx_b].first * M[i].second * M[idx_e].second;
        if (val < min) min = val;
    }
    return min;
}

int main(){
    int n;
    cin >> n;
    vector<pair<int, int> > M;

    for (int i = 0; i < n; i++) {
        pair<int, int> input;
        cin >> input.first >> input.second;
        M.push_back(input);
    }
    cout << calc(M, 0, M.size() - 1) << endl;

    return 0;
}