Go: package main

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

const N = 100

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

func main() {
	var n int
	fmt.Scan(&n)
	p := make([]int, N+1)
	m := make([][]int, N+1)
	for i := range m {
		m[i] = make([]int, N+1)
	}
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Split(bufio.ScanWords)
	for i := 1; i <= n; i++ {
		scanner.Scan()
		p[i-1], _ = strconv.Atoi(scanner.Text())
		scanner.Scan()
		p[i], _ = strconv.Atoi(scanner.Text())
	}
	for i := 1; i <= n; i++ {
		m[i][i] = 0
	}
	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])
			}
		}
	}
	fmt.Println(m[1][n])
}

C++: // matrix chain multiplication
#include<iostream>
#define MAX 2000000
void MatrixChainMultiplication(int*,int);
int **F;
int main(){
  int n,i,j,*matrix;
  std::cin >> n;
  matrix = new int[n+1];
  F = new int*[n+1];
  for(i=1; i<=n; i++) F[i] = new int[n+1];
  for(i=0; i<n; i++){
    std::cin >> matrix[i] >> (i != n - 1 ? j : matrix[i+1]);
  }
  MatrixChainMultiplication(matrix,n);
  std::cout << F[1][n] << "\n";
  return 0;
}

void MatrixChainMultiplication(int* p,int n){
  int i,j,k,l,q;
  for(i=1; i<=n; i++) F[i][i] = 0;
  for(l=2; l<=n; l++){
    for(i=1; i<=n-l+1; i++){
      j = i + l - 1;
      F[i][j] = MAX;
      for(k=i; k<=j-1; k++){
        q = F[i][k] + F[k+1][j] + p[i-1] * p[k] * p[j];
        F[i][j] = (F[i][j] < q ? F[i][j] : q);
      }
    }
  }
}

C++: #include<stdio.h>
#define N 100
#define INF 9999999

int m[N][N], p[N], n;

void matrixChainOrder(){

  int i, j, k, l, q;

  for(i = 1 ; i <= n ; i++){
    m[i][i] = 0;
  }
  for(l = 2 ; l <= n ; l++){
    for(i = 1 ; i <= n - l + 1 ; i++){
      j = i + l -1;
      m[i][j] = INF;
      for(k = i ; k <= j-1 ; k++){
	q = m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j];
	if(q < m[i][j]){
	  m[i][j] = q;
	}
      }
    }
  }
  
}

int main(){

  int  a, i;

  scanf("%d", &n);
  for(i = 0 ; i < n ; i++){
    scanf("%d%d", &p[i], &p[i+1]);
  }

  matrixChainOrder();
  
  printf("%d\n", m[1][n]);  

  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 <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int INF=(1<<21);

int n;
int dp[105][105], p[105];

void matrixChainMultiplication(){
    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]=INF;
            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]);
            }
        }
    }
}

int main(void){
    cin >> n;
    for(int i=0; i<n; i++){
        int a,b; cin >> a >> b;
        if(i==0){
            p[0]=a, p[1]=b;
        }
        else p[i+1]=b;
    }

    matrixChainMultiplication();

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

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

const int N=100;

int main(){
	int n;
	long m[N+1][N+1], p[N+1];
	
	scanf(" %d", &n);
	for(int i=1; i<=n; ++i)
		scanf(" %ld %ld", &p[i-1], &p[i]);
		
	for(int i=1; i<=n; ++i) m[i][i]=0;
	
	for(int s=2; s<=n; ++s){
		for(int i=1; i+s-1<=n; i++){
			int j=i+s-1;
			m[i][j]=100000000;
			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]);
			}
		}
	}
	
	printf("%ld\n", m[1][n]);
}

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

#define INF (100 * 100 * 100 * 100)

int n;
int m[110][110]; //minimum cost multiply matrixes from i to j

void matrixChainOrder(int *p){
  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] = INF;
      //search the minimun cost multiply matrixes from i to j
      for(int k = i;k <= j - 1;k++){
        int q = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
        m[i][j] = min(m[i][j], q);
      }
    }
  }
}

int main(){
  
  int p[110];

  //input
  cin >> n;
  
  for(int i = 0;i < n;i++){
    int r, c;

    //p[0] is the number of first matrix's row
    //p[i] is the number of matrixs' column
    cin >> r >> c;
    if(i) p[i + 1] = c;
    else{
      p[0] = r;
      p[1] = c;
    }
  }
  
  matrixChainOrder(p);

  //output
  cout << m[1][n] << endl;
  
  return 0;
}

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

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)

#define en "\n"

const double EPS = 1e-9;
const double PI  = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL<<60;
const long long MOD = 1000000007;

#define CLR(a) memset((a), 0, sizeof(a))

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

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; }

ll dp[101][101];
vector<ll> R(101), C(101);

ll rec(int l, int r){
    if(dp[l][r] != -1) return dp[l][r];
    if(r-l == 2) return dp[l][r] = R[l]*R[r-1]*C[r-1];
    if(r-l < 2) return dp[l][r] = 0;

    ll res = LL_INF;
    FOR(i,l+1,r){
        chmin(res, R[l]*R[i]*C[r-1]+(rec(l,i)+rec(i,r)));
    }
    return dp[l][r] = res;
}

int main(void){
    ll n; cin >> n;
    REP(i,n) cin >> R[i] >> C[i];
    REP(i,n+1)REP(j,n+1) dp[i][j] = -1;
    //REP(i,n+1)FOR(j,i+2,n+2) dp[i][j] = LL_INF;
    ll ans = rec(0,n);
    cout << ans << en;
    return 0;
}

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

int mcm(int N, vector<int>& p, vector<vector<int>>& M)
{
	for (int l = 1; l < N; l++)
	{
		for (int i = 1; i <= N - l; i++)
		{
			int j = i + l;
			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]);
			}
		}
	}
	return M[1][N];
}

int main(void)
{
	int N;
	cin >> N;
	vector<int> p;
	vector<vector<int>> M(N + 1, vector<int>(N + 1, 0));

	for (int i = 0; i < N; i++)
	{
		int x, z;
		cin >> x >> z;
		if (!i) p.push_back(x);
		p.push_back(z);
	}

	cout << mcm(N, p, M) << endl;

	return 0;
}

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

using namespace std;

const int kMax = 100 + 5;

int n;
int num[kMax], dp[kMax][kMax];

int main() {
    scanf("%d", &n);
    for(int i = 1;i <= n;++ i) scanf("%d%d", &num[i-1], &num[i]);
    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 << 30);
            for(int k = i;k < j;++ k) dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + num[i-1] * num[k] * num[j]);
        }
    }
    printf("%d\n", dp[1][n]);
    return 0;
}