Go: package main

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

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords) // bufio.ScanLines
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	fmt.Println(resolve(parseProblem()))
}

type matrixSize struct{ row, col int }

func calcNum(i, j matrixSize) int {
	return i.row * j.col * i.col
}

func parseProblem() (int, []matrixSize) {
	n := scanInt(sc)
	sizes := make([]matrixSize, n)
	for i := 0; i < n; i++ {
		sizes[i] = matrixSize{row: scanInt(sc), col: scanInt(sc)}
	}
	return n, sizes
}

var dp [][]int

func initDP(n int) {
	dp = make([][]int, n+1)
	for i := 0; i < len(dp); i++ {
		dp[i] = make([]int, n+1)
		for j := 0; j < len(dp[i]); j++ {
			dp[i][j] = math.MaxInt64
		}
	}
}

func resolve(n int, sizes []matrixSize) int {
	// TODO 復習
	initDP(n)
	_rec(sizes, 0, n)
	return dp[0][n]
}

func _rec(sizes []matrixSize, l, r int) int {
	if dp[l][r] != math.MaxInt64 {
		return dp[l][r]
	}
	if r-l <= 1 {
		dp[l][r] = 0
		return 0
	}
	num := math.MaxInt64
	for i := l + 1; i < r; i++ {
		v := _rec(sizes, l, i) + _rec(sizes, i, r) + calcNum(matrixSize{sizes[l].row, sizes[i].row}, matrixSize{sizes[i].row, sizes[r-1].col})
		if v < num {
			num = v
		}
	}
	dp[l][r] = num
	return dp[l][r]
}

// snip-scan-funcs
func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, _ := strconv.Atoi(sc.Text())
	return int(i)
}
func scanString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

C++: #include<stdio.h>

static const int N = 100;

int min(int a, int b){ return a < b ? a : b; }

int main(){
  int i, j, k, l, v;
  int n, p[N+1], m[N+1][N+1];

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

  for ( i = 1; i <= n; i++ ) m[i][i] = 0;
  for ( l = 2; l <= n; l++ ){
    for ( i = 0; 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]);
	v = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j];
	//	printf("m[%d,%d] + m[%d,%d] + p[%d]p[%d]p[%d] = %d\n", i, k, k+1, j, i-1, k, j, v);
      }
    }
  }

  /*  for ( int i = 1; i <= n; i++ ){
    for ( int j = 1; j <= n; j++ ){
      printf("%6d ", m[i][j]);
    }
    printf("\n");
    }*/

  printf("%d\n", m[1][n]);
  
  return 0;
}

C++: #include <iostream>
using namespace std;
#define INF 1e9
int n;
int row[200], col[200];
int dp[200][200];

int dfs(int l, int r) {
  // row[i],col[i]=row[i+1],col[i+1]
  // row[i]*col[i]*col[i+1]
  if (l == r) return 0;
  if (dp[l][r] != INF) return dp[l][r];
  for (int c = l; c < r; c++) {
    dp[l][r] = min(dp[l][r], dfs(l,c)+dfs(c+1,r)+row[l]*col[c]*col[r]);
  }
  return dp[l][r];
}

int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> row[i] >> col[i];
  }
  for(int i=0;i<n;i++)
    for(int j=0;j<n;j++)
      dp[i][j]=INF;
  cout << dfs(0, n-1) << endl;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n;
int p[101];
const int INF=100000000;
long long dp[101][101];

void f(){
  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(){
  scanf("%d",&n);
  
  for(int i=1;i<=n;i++)scanf("%d %d",&p[i-1],&p[i]);
  f();
  printf("%d\n",dp[1][n]);
  return 0;
}

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

#define PB push_back
#define MP make_pair

void Input();
void Calc();
void Output();

int N=100;
int dp[100][100]; //100...行列の最大個数
vector<int> ivr;
int n,x;

int main(int argc,char* argv[]){

  memset(dp,15,sizeof(dp));
  for(int i=0;i<=100;i++) dp[1][i]=0;
  ivr.clear();
  
  Input();
  Calc();
  Output();
  return 0;
}

void Input(){
  ivr.PB(0);
  cin>>n;
  for(int i=0;i<2;i++){
    cin>>x;
    ivr.PB(x);
  }
  for(int i=1;i<n;i++){
    cin>>x;
    cin>>x;
    ivr.PB(x);
  }
}

void Calc(){

  for(int i=2;i<=n;i++){
    for(int j=1;j<=n-i+1;j++){
      for(int k=1;k<i;k++){
	dp[i][j]=min(dp[k][j]+dp[i-k][j+k]+ivr[j]*ivr[j+k]*ivr[i+j],dp[i][j]);
      }
    }
  }
}

void Output(){
  cout<<dp[n][1]<<endl;
}

C++: #include <stdio.h>
#include <algorithm>

using namespace std;


int main(){
	int n,minimum,tmp;
	scanf("%d",&n);
	int table[n][n];
	int data[n][2];

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

	for(int i=n-2;i>=0;i--){
		for(int k=0;k<=i;k++){
			if(i==n-2){
				table[n-i-1][k] = data[k][0]*data[k][1]*data[k+1][1];
		}else{
				minimum = 2147483647;
				for(int p=0;p<=n-i-2;p++){
					tmp=(table[p][k]+table[n-i-p-2][k+p+1])+(data[k][0]*data[k+p][1]*data[k+n-i-1][1]);
					minimum = min(minimum,tmp);
				}
				table[n-i-1][k] = minimum;
			}
		}
	}

	printf("%d\n",table[n-1][0]);

    return 0;
}

C++: #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cstring>
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))

using namespace std;

const int N_MAX = 1000000;

int rows[N_MAX];
int cols[N_MAX];
int dp[101][101];

int main(){
  int n;
  cin >> n;
  
  rep(i, 0, n) cin >> rows[i] >> cols[i];
  rep(i, 0, n){
    rep(j, 0, n){
      dp[i][j] = INT_MAX;
    }
  }
  // init
  rep(i, 0, n-1) dp[i][i+1] = rows[i] * rows[i+1] * cols[i+1];
  
  // strtegy
  /*
    dp[i][j] ... minimum multiplication times i to j
    dp[i][j] = dp[i][k] + dp[k+1][j] + row[i] * col[k] * col[j] for all i < k < j-1

    (i, j) -> (0, 1), (1, 2), ..., (0, 2), (1, 3), ..., (0, n-1), ...
   */
  
  // iteration
  rep(k, 2, n){
    rep(i, 0, n){
      int j = i + k;
      //cout << i << ", " << j << endl;
      if(j >= n) break;
      int tmp = INT_MAX;
      for(int l=i; l < j; l++){
	// cout << i << ", " << l << ", " << j << endl;
	int residue = rows[i] * cols[l] * cols[j];
	int cand_min = dp[i][l] + dp[l+1][j] + residue;
	if(i == l) cand_min = dp[l+1][j] + residue;
	if(j == l+1) cand_min = dp[i][l] +  residue;
	if(tmp > cand_min) tmp = cand_min;
      }
      if(dp[i][j] > tmp) dp[i][j] = tmp;
    }
  }
  
  /*
  for(int k=2; k<n; k++){
    for(int row=0; row+k < n; row++){
      int col = row+k;
      if(dp[row][col-1] < dp[row+1][col]){
	dp[row][col] = dp[row][col-1] + rows[row] * rows[col] * cols[col];
      }
      else{
	dp[row][col] = dp[row+1][col] + rows[row] * cols[row] * cols[col];
      }
      cout << "row: " << row << ", col: " << col << ", dp[row][col]: " << dp[row][col] << endl;
      cout << rows[row] << ", " << cols[row] << ", " << cols[col] << endl;
    }
    }*/
  /*
    rep(i, 0, n){
    rep(j, 0, n){
      cout << dp[i][j] << " ";
    }
    cout << endl;
  }
  */
  if(n==1) cout << 0 << endl;
  else{
    cout << dp[0][n-1] << endl;
  }
  // multiple the result
  
  return 0;
}

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

static const int N=100;

int main(){
  int i,l,n,p[N+1],m[N+1][N+1];
  cin >> n;
  for(i=1;i<=n;i++) cin >> p[i-1] >> p[i];

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