Go: package main

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

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	N := sc.nextInt()
	p := make([]int, N+1)
	dp := make([][]int, N+1)
	for i, _ := range dp {
		dp[i] = make([]int, N+1)
	}
	for i := 0; i < N; i++ {
		p[i] = sc.nextInt()
		p[i+1] = sc.nextInt()
	}
	for i := 1; i <= N; i++ {
		dp[i][i] = 0
	}
	for l := 2; l <= N; l++ {
		for i := 1; i <= N-l+1; i++ {
			j := i + l - 1
			dp[i][j] = 1 << 60
			for 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])
			}
		}
	}

	fmt.Fprintln(wtr, dp[1][N])
	wtr.Flush()
}

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

const int INF = 1e9;

int N;
vector<int> R, C;
vector<vector<int> > dp;

int dfs(int l, int r) {
  if ( r == l ) return 0;
  if ( dp[l][r] ) return dp[l][r];

  int ret = INF;
  for ( int i = l; i < r; i++ ) {
    ret = min(ret, dfs(l, i)+dfs(i+1, r)+R[l]*C[i]*C[r]);
  }
  
  return dp[l][r] = ret;
}

int main() {  
  cin >> N;

  R = vector<int>(N);
  C = vector<int>(N);
  for ( int i = 0; i < N; i++ ) {
    cin >> R[i] >> C[i];
  }

  dp = vector<vector<int> >(N, vector<int>(N, 0));

  cout << dfs(0, N-1) << endl;
  
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

int dp[102][102],p[102];
const int INF=1000100010;
int main(){
    int n,l,r;
    cin>>n;
    rep(i,n){
        cin>>l>>r;
        if(i!=n-1) p[i]=l;
        else p[i]=l,p[i+1]=r;
    }
    FOR(i,1,n+1)FOR(j,1,n+1){
        if(i!=j)dp[i][j]=INF;
        else dp[i][j]=0;
    }
    FOR(i,1,n+1)FOR(l,1,n-i+1)FOR(r,l+1,i+l+1){
        dp[l][i+l]=min(dp[l][i+l],dp[l][r-1]+dp[r][i+l]+p[l-1]*p[r-1]*p[l+i]);
    }
    cout<<dp[1][n]<<endl;
    return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <stdio.h>
#include <memory.h>
using namespace std;

struct matrix {
	int row;
	int col;
};
int main()
{
	int N;
	scanf("%d", &N);
	matrix vec[100];
	memset(vec, 0, sizeof(vec));
	for (int i = 0; i < N; ++i) {
		scanf("%d %d", &vec[i].row, &vec[i].col);
		//cin >> vec[i].row >> vec[i].col;
	}
	//vector<vector<int>> dp(N, vector<int>(N));
	int dp[100][100];
	memset(dp, 0, sizeof(dp));
	for (int len = 1; len < N; ++len) {
		for (int i = 0; i + len < N; ++i) {
			int j = i + len;
			dp[i][j] = 2147483647;
			for (int k = i; k < i + len; ++k) {
				dp[i][j] = min(dp[i][k] + dp[k + 1][j] + vec[i].row * vec[k].col * vec[j].col, dp[i][j]);
			}
		}
	}
	printf("%d\n", dp[0][N - 1]);
	//cout << dp[0][N - 1] <<endl;
	return 0;
}

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

#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>

#define M 100

int N,R[M+1],C[M][M],B[M][M];

void compute(){
	int i=0,j,k,cost;
	memset(C,99,sizeof(C));
	for(;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++ ){
				cost = C[i][k] + C[k+1][i+j] + R[i]*R[k+1]*R[i+j+1];
				if(cost<C[i][i+j])C[i][i+j]=cost,B[i][i+j]=k; 
			}
		}
	}
}

void order( int i, int j ){
	if ( i == j ) cout << "M" << i;
	else{
		cout << "(";
		order( i, B[i][j]-1 ); order(B[i][j], j);
		cout << ")";
	}
}

void input(){
	cin >> N;
	int z,i=0;
	for (; i < N; i++ ) cin >> R[i]>>z;
	R[i]=z;
	//SIZE++;
}

void output(){
	cout <<  C[0][N-1] << endl;
	//order(0, N);
	//cout << endl;
}

main(){
	input();
	compute();
	output();
}

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];  //??´?????????????¬¬i??????????????????p[i-1]*p[i]??????m[i][j]???????????????i??°j??????????????????????§£
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>p[i]>>p[i+1];

    //init
    for(int i=1;i<=n;i++) m[i][i]=0;
    for(int l=2;l<=n;l++) //?????????2????????????????§???????????????´????????°?????????n
    {
        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;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<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;

int n;
int num[101][101];
int p[101];

void matrixChainMultiplication(){
  for(int l=2;l<=n;l++){
    for(int i=1;i<=n-l+1;i++){
      int j=i+l-1;
      num[i][j]=INT_MAX;
      for(int k=i;k<=j-1;k++)
	num[i][j]=min(num[i][j],num[i][k]+num[k+1][j]+p[i-1]*p[k]*p[j]);
    }   
  }
  cout<<num[1][n]<<endl;
}

int main(){
  cin>>n;
  for(int i=1;i<=n;i++) cin>>p[i-1]>>p[i];
 
  for(int i=1;i<=n;i++)num[i][i]==0;
  
  matrixChainMultiplication();
      
  return 0;
}

C++: #include<iostream>
#include<cstdio>
#define INT_MAX 100000000
using namespace std;
int sentinel;
int Mi[1000][1000];

void calc(int p[]);

int main(){
  int p[1000],a,b;
  scanf("%d",&sentinel);
  for(int i=0;i<sentinel;i++){
    scanf("%d %d",&a,&b);
    p[i] = a;
    if(i == sentinel-1)p[i+1] = b;
  }

  sentinel = sentinel+1;
  calc(p);

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

void calc(int p[]){
  int n = sentinel-1,j,q,l,k;
  for(int i=1;i<=n;i++)Mi[i][i]=0;
  for(int l=2;l<=n;l++){
    for(int i=1;i<=n-l+1;i++){
      j = i+l-1;
      Mi[i][j] = INT_MAX;
      for(int k=i;k<=j-1;k++){
        q = Mi[i][k] + Mi[k+1][j] + p[i-1]*p[k]*p[j];
        if(q<Mi[i][j]){
          Mi[i][j] = q;
        }
      }
    }
  }
}