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++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
        int n;
        cin>>n;
        int r[n], c[n], a[n][n];
        for(int i=0;i<n;i++) cin>>r[i]>>c[i];
        for(int i=0;i<n;i++)
                a[i][i] = 0;

        for(int i=1;i<n;i++){
                for(int j=0;j+i<n;j++){
                        a[j][j+i] = 2000000000;
                        for(int k=0;k+1<=i;k++)
                                a[j][j+i] = min(a[j][j+i], a[j][j+k]+a[j+k+1][j+i] + r[j]*c[j+k]*c[j+i]);
                }
        }
        cout<<a[0][n-1]<<endl;
        return 0;
}

C++: #include <iostream> 
#include <cmath> 
 
using namespace std; 
 
int r[45] = {0}; 
int a[100][100] = {0}; 
 
int f(int n, int m); 
int f(int n, int k, int m); 
 
 
int f(int n, int k, int m) 
{ 
    return f(n,k) * f(k+1,m) + (r[n] * r[k+1] * r[m+1]); 
} 
 
int f(int n, int m) 
{ 
    if (n==m) return 1; 
    int & ra = a[n][m]; 
    if (ra) return ra; 
    ra = INT_MAX; 
    for (int k=n;k<m;k++) 
    { 
        int ans = f(n,k,m); 
        if (ans < ra) ra = ans; 
    } 
    return ra; 
} 
 
int main() 
{ 
    int rr = 0; 
    int cc = 0; 
    int n = 0; 
    cin >> n; 
    for (int i=0;i<n;i++) 
    { 
        cin >> rr >> cc; 
        r[i]=rr; 
        r[i+1]=cc; 
    } 
    for (int i=0;i<n-1;i++) 
    { 
        a[i][i+1] = r[i] * r[i+1] * r[i+2]; 
    } 
    int ans = f(0,n-1); 
    cout << ans << endl; 
}

C++: #include<iostream>
#include<algorithm>
#define MAX 100
#define INF (1 << 30)
using namespace std;

int n, p[103], m[102][102];

int matrixChainMultiplication(void);

int main() {
	int i;

	cin >> n;
	for (i = 1; i <= n; i++) {
		cin >> p[i - 1] >> p[i];
	}

	cout << matrixChainMultiplication();

	return 0;
}

int matrixChainMultiplication(void) {
	int i, j, k;
	for (i = 1; i <= n; i++)m[i][i] = 0;
	for (j = 2; j <= n; j++) {
		for (i = j - 1; i >= 1; i--) {
			m[i][j] = INF;
			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 m[1][n];
}

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

static const in N = 100;

int main(){
  int n,p[N+1],m[N+1][N+1];
  cin>>n;

  for(int i = 0;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++){
      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<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>
#define INF 1000000001
using namespace std;
typedef long long ll;

int main()
{
  ll N;
  cin >> N;
  vector<pair<ll, ll>> M(N);
  for (ll i = 0; i < N; ++i)
  {
    cin >> M.at(i).first >> M.at(i).second;
  }
  vector<vector<ll>> dp(N, vector<ll>(N, INF));
  for (ll i = 0; i < N; ++i)
  {
    dp.at(i).at(i) = 0;
  }
  for (ll i = 0; i < N - 1; ++i)
  {
    dp.at(i).at(i + 1) = M.at(i).first * M.at(i).second * M.at(i + 1).second;
  }

  for (ll width = 1; width < N; ++width)
  {
    for (ll l = 0; l < N - width; ++l)
    {
      ll r = l + width;
      for (ll m = l + 1; m < r + 1; ++m)
      {
        dp.at(l).at(r) = min(dp.at(l).at(r), dp.at(l).at(m - 1) + dp.at(m).at(r) + M.at(l).first * M.at(m - 1).second * M.at(r).second);
      }
    }
  }
  cout << dp.at(0).at(N - 1) << endl;
  // for (ll i = 0; i < N; ++i)
  // {
  //   for (ll j = 0; j < N; ++j)
  //   {
  //     cout << dp.at(i).at(j) << ' ';
  //   }
  //   cout << endl;
  // }
}

C++: #include <iostream>
#include <cstdlib>
#include <climits>

/*
 * http://ttrsq.exblog.jp/24318687/
 */

const int MAX_N = 100;
int DP[MAX_N + 1][MAX_N + 1] = {0};
int *p;

int best(int r, int c) {
  int min = INT_MAX;
  int num = c - r;

  for (int i = 0; i < num; i++) {
    min = std::min(min, DP[r][r + i] + DP[r + i + 1][c] + p[r - 1] * p[r + i] * p[c]);
  }
  
  return min;
}

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

  int n = 0;
  std::cin >> n;

  if (n == 1) {
    std::cout << "0" << std::endl;
  }
  
  p = (int *) std::malloc(sizeof(int) * n + 1);

  int bb = 0;

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

  for (int i = 1; i < n; i++) {
    DP[i][i + 1] = p[i - 1] * p[i] * p[i + 1];
  }

  for (int j = 0; j <= n - 3; j++) {
    for (int i = j + 3; i <= n; i++) {
      DP[i - 2 - j][i] = best(i - 2 - j, i);
    }
  }

  std::cout << DP[1][n] << std::endl;

  return 0;
}

C++: //?????????B 
#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 <iostream>
#include <algorithm>
using namespace std;
#define INF (1 << 20)
int main()
{
    int n;
    cin >> n;
    int p[101];

    // i番目の行列は p[i]*p[i+1]
    for (int i = 0; i < n; i++)
    {
        cin >> p[i] >> p[i + 1];
    }

    // m[i][j] : i番目からj番目までの部分積でのスカラー乗算の最小回数
    //      i = 0,1, ... , n-1
    // m[i][i] := 0
    // m[i][j] = min_{i <= k < j} m[i][k] + m[k+1][j] + p[i]*p[k+1]*p[j+1]
    //      l = 2,3, ... , n
    //      i = 0,1, ... , n-l
    //          j = i+l-1
    //      k = i, i+1, ... , j-1
    // l = j-i
    int m[101][101];
    for (int i = 0; i < n; i++)
    {
        m[i][i] = 0;
    }

    for (int l = 2; l <= n; l++)
    {
        for (int i = 0; i <= n-l; i++)
        {
            int j = i + l - 1;
            int minv=INF;
            for (int k = i; k < j; k++)
            {
                minv = min(minv, m[i][k] + m[k + 1][j] + p[i] * p[k + 1] * p[j + 1]);
            }
            m[i][j] = minv;
            
            // cout << "m[ " << i<<" ][ "<<j<< " ] = " << minv << endl;
        }
    }
    cout << m[0][n-1] << endl;
    return 0;
}