Go: package main

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

const N = 100

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

func answer(reader io.Reader) string {
	sc := bufio.NewScanner(reader)
	sc.Split(bufio.ScanWords)

	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())

	var p [N]int
	var m [N + 1][N + 1]int
	for i := 1; i <= n; i++ {
		sc.Scan()
		p[i-1], _ = strconv.Atoi(sc.Text())
		sc.Scan()
		p[i], _ = strconv.Atoi(sc.Text())
	}

	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])
			}
		}
	}

	return fmt.Sprintf("%d", m[1][n])
}

func main() {
	fmt.Println(answer(os.Stdin))
}

C++: // http://algorithms.blog55.fc2.com/blog-entry-66.html

#include <stdio.h>
#include <string.h>

#define M 100
int R[M+1],C[M][M],B[M][M];
void D(int i,int j){
	if(i==j)printf("M%d",i);
	else printf("("),D(i,B[i][j]-1),D(B[i][j],j),printf(")");
}

main(){
	int N,i=0,j,k,c;
	scanf("%d",&N);
	for(;i<N;i++)scanf("%d%d",R+i,&c);
	R[i]=c;
	memset(C,99,sizeof(C));
	for(i=0;i<N;i++)C[i][i]=0;
	for(j=1;j<N;j++)for(i=0;i<N-j;i++)for(k=i;k<i+j;k++)
		if((c=C[i][k]+C[k+1][i+j]+R[i]*R[k+1]*R[i+j+1])<C[i][i+j])C[i][i+j]=c,B[i][i+j]=k;
	printf("%d\n",C[0][N-1]);
	//order(0,N);
	//puts("");
}

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

static const int N = 100;

int main(){
    int n,a[N + 1],b[N + 1][N + 1],k;
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> a[i - 1] >> a[i];
    }
    for(int i = 1;i <= n;i++){
        b[i][i] = 0;
    }
    for(int i = 2;i <= n;i++){
        for(int j = 1;j <= n - i + 1;j++){
            k = j + i - 1;
            b[j][k] = (1 << 21);
            for(int l = j;l <= k - 1;l++){
                b[j][k] = min(b[j][k],b[j][l] + b[l + 1][k] + a[j - 1]*a[l]*a[k]);
            }
        }
    }
    cout << b[1][n] << endl;
    return 0;
}

C++: #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>

#define FOR(i,a,b) for(int i=(a);i<(b);++(i))
#define REP(i,n) FOR(i,0,n)

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

using namespace std;

int main(void){
  int n,i;
  cin >> n;
  vector<int> input(n+1);
  REP(i,n) cin >> input[i] >> input[i+1];
  
  vector<vector<int>> res(n+1, vector<int>(n+1));
  vector<int> p(n+1);
  FOR(i,1,n+1) res[i][i]=0;
  FOR(l,2,n+1){
    FOR(i,1,n-l+2){
      int j = i+l-1;
      res[i][j] = (1<<21);
      FOR(k,i,j){
        res[i][j] = min(res[i][j],res[i][k]+res[k+1][j] + input[i-1]*input[k]*input[j]);

        
      }
    }
  }
  /*
  REP(i,n+1){
    REP(j,n+1){
      cout << res[i][j] << " ";
    }
    cout << endl;
  }
  */
  cout << res[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=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++){
      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 <vector>
#include <numeric>
#include <algorithm>

using vvi = std::vector<std::vector<int>>;

void solve()
{
    using namespace std;

    constexpr int inf = (1 << 23);

    int n;
    cin >> n;

    vector<int> d(n + 1);

    for (int i = 0; i < n; ++i)
    {
        cin >> d[i];
        if(i + 1 != n)
            cin.ignore(numeric_limits<streamsize>::max(), ' ');
    }

    cin.ignore(numeric_limits<streamsize>::max(), ' ');
    cin >> d[n];

    vvi dp (n, vector<int>(n, 0));

    //自分自身との積は乗算が発生しない
    for (int i = 0; i < n; ++i)
        dp[i][i] = 0;

    for (int l = 1; l < n; ++l)
    {
        for (int i = 0; i < n - l; ++i)
        {
            int j = i + l;
            dp[i][j] = inf;
            for (int k = i; k < j; ++k)
            {
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + d[i] * d[k + 1] * d[j + 1]);
            }
        }
    }

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

int main()
{
    solve();
        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 <iostream>
#include <vector>
#include <climits>
using namespace std;

vector<pair<int,int> > matrices;
vector<vector<int> > memoization;

int minCost(int i, int j) {
  if (j == i)
    return 0;
  if (memoization[i][j])
    return memoization[i][j];
  int current_min = INT_MAX;
  for (int k = i; k < j; k++) {
    int current_cost =
      matrices[i].first *
      matrices[k].second *
      matrices[j].second +
      minCost(i, k) + minCost(k+1, j);
    if (current_cost < current_min)
      current_min = current_cost;
  }
  memoization[i][j] = current_min;
  return memoization[i][j];
}

int main(int argc, char **argv) {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  matrices = vector<pair<int,int> > (n, pair<int,int>(0,0));
  memoization = vector<vector<int> > (n, vector<int> (n, 0));
  for (int i = 0; i < n; i++)
    cin >> matrices[i].first >> matrices[i].second;
  cout << minCost(0, n-1) << endl;
  return 0;
}

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

class TMinimumMultiplications
{
	std::vector<std::vector<int> > FTable;
	std::vector<std::pair<int, int> >& FMatrixChain;
	
	int GetMinimum(int Begin, int End);
public:
	TMinimumMultiplications(std::vector<std::pair<int, int> >& MatrixChain);
	
	int Get(int Begin, int End);
};

TMinimumMultiplications::TMinimumMultiplications(std::vector<std::pair<int, int> >& MatrixChain)
: FMatrixChain(MatrixChain), FTable(MatrixChain.size(), std::vector<int>(MatrixChain.size(), -1))
{
}

int TMinimumMultiplications::GetMinimum(int Begin, int End)
{
	int Minimum = INT_MAX;
	for(int i = Begin; i < End; ++i){
		int Total = Get(Begin, i) + Get(i + 1, End) + FMatrixChain[Begin].first * FMatrixChain[i + 1].first * FMatrixChain[End].second;
		if(Minimum > Total) Minimum = Total;
	}
	return Minimum;
}

int TMinimumMultiplications::Get(int Begin, int End)
{
	if(Begin == End) return 0;
	if(FTable[Begin][End] < 0){
		FTable[Begin][End] = GetMinimum(Begin, End);
	}
	return FTable[Begin][End];
}

int main()
{
	int Count;
	std::cin >> Count;
	std::vector<std::pair<int, int> > MatrixChain;
	for(int i = 0; i < Count; ++i){
		int Row, Col;
		std::cin >> Row >> Col;
		MatrixChain.push_back(std::make_pair(Row, Col));
	}
	TMinimumMultiplications Minimum(MatrixChain);
	std::cout << Minimum.Get(0, MatrixChain.size() - 1) << std::endl;
	return 0;
}