Go: package main

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

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	N := sc.nextInt()
	p := make([]int, N+1)
	dp := make([][]int, N+1)
	for i, _ := range dp {
		dp[i] = make([]int, N+1)
	}
	for i := 0; i < N; i++ {
		p[i] = sc.nextInt()
		p[i+1] = sc.nextInt()
	}
	for i := 1; i <= N; i++ {
		dp[i][i] = 0
	}
	for l := 2; l <= N; l++ {
		for i := 1; i <= N-l+1; i++ {
			j := i + l - 1
			dp[i][j] = 1 << 60
			for 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])
			}
		}
	}

	fmt.Fprintln(wtr, dp[1][N])
	wtr.Flush()
}

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

static const int N=100;

//求解矩阵链乘法的最优解
//p 用于存储矩阵的行和列的
//dp[i][j] 表示从矩阵i乘到矩阵j的最小乘法次数

int main(){
    int n;
    int p[N+1],dp[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++){
        dp[i][i]=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]=(1<<21);//取一个很大的值
            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]);
            }
        }
    }

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

    return 0;
}

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

using namespace std;
typedef long long ll;

const int MAX = 100;



int main() {


	int n, p[MAX + 1], m[MAX + 1][MAX + 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 calcLen = 2;calcLen <= n;calcLen++) {

		for (int st = 1;st <= n - calcLen + 1;st++) {
			int ed = st + calcLen - 1;
			m[st][ed] = (1 << 21);

			for (int divP = st;divP <= ed-1;divP++) {
				m[st][ed] = min(m[st][ed], m[st][divP] + m[divP + 1][ed] + p[st - 1] * p[divP] * p[ed]);
			}
		}
	}
	cout << m[1][n] << endl;

	return 0;
}

C++: #include<iostream>
#define MAX 99999999;
using namespace std;
int p[102];
int mcm[102][102];
int n;
int min(int x,int y) {
	int m = MAX;
	int cost = 0;
	for (int j = x; j < y; j++) {
		cost = mcm[x][j] + mcm[j + 1][y] + p[x-1]*p[j]*p[y];
		if (cost < m) {
			m = cost;
		}
	}
	return m;
}
int calMcm() {
	for (int j = 2; j <= n; j++) {
		for (int i = 1; i <= n-j+1; i++) {
			mcm[i][j+i-1] = min(i, j+i-1);
		}
	}
	return mcm[1][n];
}
int main() {
	int t;

	cin >> n;
	cin >> p[0];
	cin >> p[1];
	for (int i = 2; i <= n; i++) {
		cin >> t >> p[i];
	}

	/*for (int i = 0; i <= n; i++) {
		cout << p[i] << " ";
	}
	cout << endl;*/

	cout << calMcm() << endl;
}

C++: #include <iostream>
#include <bits/stdc++.h>
#define endl '\n'
#define MAXN 1000000000
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
using namespace std;


long long dp[101][101];
int s[101][101];
void order(int i,int j){
    int k;
    if(i==j) printf("A%d",i);
    else{
        k=s[i][j];
        printf("(");
        order(i,k);
        order(k+1,j);
        printf(")");
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, n1; cin >> n; n1 = n;
    vi dim;
//    dim.push_back(0);
    int r, c;
    cin >> r >> c;
    dim.push_back(r);
    dim.push_back(c);
    n1--;
    while(n1--){
        cin >> r >> c;
        dim.push_back(c);
    }
    n++;
    for (int i = 0; i < n; ++i) {
        dp[i][i] = 0;
    }
    long long cost = 0;
//    n = dim.size() - 1;
    long long mincost = -MAXN;
    for (int len = 2; len < n; ++len) {
        for (int i = 1; i < n - len + 1; ++i) {
            int j = i + len - 1;
            dp[i][j] = MAXN;
            for (int k = i; k < j; ++k) {
                cost = dp[i][k] + dp[k + 1][j] + dim[i - 1] * dim[j] * dim[k];
                if(cost < dp[i][j]){
                    mincost = cost;
                    dp[i][j] = cost;
                    s[i][j] = k;
                }
            }
        }
    }
//    for (int l = 0; l <= n; ++l) {
//        for (int i = 0; i <= n; ++i) {
//            cout << dp[l][i] << " ";
//        }
//        cout << endl;
//    }
//    printf("Minimum Multiplication : %Ld\n",dp[1][n]);
//    printf("Order : ");
//    order(1,n);
//    printf("\n\n");
    cout << dp[1][n - 1] << endl;
//    cout << dp[2][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;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;
const int N = 102;

int main() {
    int n; cin >> n;
    int p[N+1], m[N+1][N+1];
    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;

void dp_solve(vector<vector<long long>> &dp, int l, int r, vector<pair<int, int>> &vp)
{
    if (dp[l][r] != -1)
    {
        return;
    }
    if (l == r)
    {
        dp[l][r] = 0;
        return;
    }
    for (int i = 0; i < r - l; i++)
    {
        dp_solve(dp, l, l + i, vp);
        dp_solve(dp, l + i + 1, r, vp);
    }
    dp[l][r] = 10000000000;
    for (int i = 0; i < r - l; i++)
    {
        dp[l][r] = min(dp[l][r], dp[l][l + i] + dp[l + i + 1][r] + vp[l].first * vp[l + i].second * vp[r].second);
    }
}

int main()
{
    int n;
    cin >> n;
    vector<vector<long long>> dp(n + 1, vector<long long>(n + 1, -1));
    vector<pair<int, int>> vp(n + 1);
    for (int i = 1; i <= n; i++)
    {
        int r, c;
        cin >> r >> c;
        vp[i] = make_pair(r, c);
    }
    dp_solve(dp, 1, n, vp);
    cout << dp[1][n] << endl;
}