Go: package main

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

type Matrix struct {
	r int // num of row
	c int // num of column
}

type Range struct {
	start int // index, inclusive
	end   int // index, inclusive
}

func calcMultiplication(x, y Matrix) (Matrix, int) {
	if x.c != y.r {
		panic("cannnot calculate")
	}
	return Matrix{x.r, y.c}, x.r * y.c * x.c
}

func calcMinMatrixChainMultiplication(matrices []Matrix, r Range, memo map[Range]int) (Matrix, int) {
	if v, ok := memo[r]; ok {
		return Matrix{matrices[0].r, matrices[len(matrices)-1].c}, v
	}
	if len(matrices) == 0 {
		panic("must not be empty")
	} else if len(matrices) == 1 {
		return matrices[0], 0
	}

	var minCount int = math.MaxInt32

	for i := 0; i < len(matrices)-1; i++ {
		formerMatrices := matrices[:i+1]
		latterMatrices := matrices[i+1:]
		matF, countF := calcMinMatrixChainMultiplication(formerMatrices, Range{0, i}, memo)
		matL, countL := calcMinMatrixChainMultiplication(latterMatrices, Range{i + 1, len(matrices) - 1}, memo)
		_, countFL := calcMultiplication(matF, matL)
		count := countF + countL + countFL
		if count < minCount {
			minCount = count
		}
	}
	memo[r] = minCount
	return Matrix{matrices[0].r, matrices[len(matrices)-1].c}, minCount
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	n, _ := nextInt(sc)
	matrices := make([]Matrix, n)
	for i := 0; i < n; i++ {
		r, _ := nextInt(sc)
		c, _ := nextInt(sc)
		matrices[i] = Matrix{r, c}
	}
	memo := make(map[Range]int)
	_, resultCount := calcMinMatrixChainMultiplication(matrices, Range{0, len(matrices) - 1}, memo)
	fmt.Println(resultCount)
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

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

int main() 
{
    int n, p[210], m[110][110];
    cin >> n;
    for (int i = 1; i <= n; ++i) 
    {
        cin >> p[i-1] >> p[i];
    }
    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] = (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 <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
#define INF 1<<25

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int a[105];
int dp[105][105];

int main()
{
	memset (a, 0, sizeof (a ) );
	memset (dp, 0, sizeof (dp ) );

	ios_base::sync_with_stdio(0);
	int n; cin >> n;

	rep (i, n+1 ) for (int j = i+1; j < n+1; j++ ) dp[i][j] = INF;

	
	rep (i, n ){
		int r, c; cin >> r >> c;
		a[i] = r; a[i+1] = c;
	} // end rep

	for (int i = n; i >= 1; i-- ){
		for (int j = i; j <= n; j++ ){
			for (int k = i; k < j; k++ ){
				int curr = dp[i][k] + dp[k+1][j];
				dp[i][j] = min (dp[i][j], curr + a[i-1]*a[k]*a[j] );
			} // end for
		} // end for
	} // end for

	int res = dp[1][n];
	cout << res << endl;

	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n);++i)
using namespace std;
template <class _t> inline bool chmax (_t& a,_t b){if(a<b){a=b;return true;}return false;} template <class _t> inline bool chmin (_t& a,_t b){if(a>b){a=b;return true;}return false;}

const long long inf = 1ll << 60;
const long long mod = 1000000007;

int dx[4] = {1,0,-1,0};int dy[4] = {0,-1,0,1};

int main() {
    int n;cin >> n;
    vector<int> p(n+1,0);
    for(int i=0;i<n;i++){
	cin >> p[i] >> p[i+1];
	//p[0] M1の行 p[1] M１の列
    }
    vector<vector<int> > dp(n+1,vector<int>(n+1,(1<<21)));
    rep(i,n+1) dp[i][i] = 0;
    for(int t = 2;t<=n;t++){
	for(int i=1;i<=n-t+1;i++){
	    int j=i+t-1;
	    for(int k=i;k<=j-1;k++){
		chmin(dp[i][j],dp[i][k]+dp[k+1][j]+p[i-1]*p[k]*p[j]);
	    }
	}
    }
    /*
    for(int i=0;i<=n;i++){
	for(int j=0;j<=n;j++){
	    cout << dp[i][j] << " ";
	}
	cout << endl;
    }
    */
    cout << dp[1][n] << endl;
    return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
#define MAX_N 100
#define INF (1 << 21)
int cost[MAX_N][MAX_N];
int rc[MAX_N+1];

int main() {
  int n; cin >> n;
  for(int i=0;i<n;i++) {
    int tmp;
    if(i==0) {
      cin >> rc[i] >> rc[i+1];
    }
    else {
      cin >> tmp >> rc[i+1];
    }
  }

  // cost[i][i] = 0
  /*
  for(int i=0;i<n;i++) {
    cost[i][i] = 0;
  }
  */
  // cost[i][i+1] = rc[i]*rc[i+1]*rc[i+2]
  for(int i=0;i<n-1;i++) {
    cost[i][i+1] = rc[i]*rc[i+1]*rc[i+2];
  }
  // calculation cost[i][i+j]
  for(int j=2;j<n;j++) {
    for(int i=0;i+j<n;i++) {
      cost[i][i+j] = INF;
      for(int k=i+1;k<=i+j;k++) {
        cost[i][i+j] = min(cost[i][i+j], cost[i][k-1] + cost[k][i+j] + rc[i]*rc[k]*rc[i+j+1]);
      }
    }
  }

  cout << cost[0][n-1] << endl;
}

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++: #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <utility>
#include <numeric>

using namespace std;
typedef long long llong;
typedef unsigned long long ullong;

const ullong MOD = 1000000000 + 7;

const int N = 101;

int main()
{
	int n;
	cin >> n;

	vector<int> p(N);
	for (int i = 1; i <= n; i++)
	{
		cin >> p.at(i - 1) >> p.at(i);
	}

	vector<vector<int>> m(N, vector<int>(N));

	for (int l = 2; l <= n; l++)
	{
		for (int i = 1; i <= n - l + 1; i++)
		{
			int j = i + l - 1;
			m.at(i).at(j) = (1 << 21);
			for (int k = i; k < j; k++)
			{
				m.at(i).at(j) = min(m.at(i).at(j), m.at(i).at(k) + m.at(k + 1).at(j) + p.at(i - 1) * p.at(k) * p.at(j));
			}
		}
	}

	cout << m.at(1).at(n) << endl;
}