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<iostream>
using namespace std;

int mcm(int n,int p[]){
	int m[n+1][n+1]={0};
	for(int s=0;s<n;s++){
		for(int i=1,j=s+2;j<=n;i++,j++){
			m[i][j]=1<<30;
			for(int k=i;k<j;k++){
				int tmp=m[i][k];
				tmp+=m[k+1][j];
				tmp+=p[i-1]*p[k]*p[j];
				m[i][j]=min(m[i][j],tmp);
			}
		}
	}
	return m[1][n];
}

int main(){
	int n;
	cin >> n;
	int p[n+1];
	for(int i=0;i<n;i++){
		int n1,n2;
		cin >> n1 >> n2;
		p[i]=n1;
		if(i==n-1) p[i+1]=n2;
	}
	
	cout << mcm(n,p) << endl;
	return 0;
}

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

void fnInput(vector<int>& rvnMtrx)
{
  int nMaxSiz;
  cin >> nMaxSiz;
  rvnMtrx.resize(nMaxSiz + 1);

  for (int i = 0; i < rvnMtrx.size() - 1; ++i)
    cin >> rvnMtrx[i] >> rvnMtrx[i + 1];
}

int fnMtrxChainMultpl(vector<vector<int>>& rvvnDetDP, const vector<int>& cnrvnMtrx)
{
  for (int i = 1; i < cnrvnMtrx.size(); ++i)  rvvnDetDP[i][i] = 0;

  const int cnMaxSiz = cnrvnMtrx.size() - 1;
  for (int nDif = 1; nDif <= cnMaxSiz - 1; ++nDif)
    for (int nRow = 1; nRow <= cnMaxSiz - nDif; ++nRow)
    {
      int nCol = nRow + nDif;
      for (int nx = nRow; nx <= nCol - 1; ++nx)
        rvvnDetDP[nRow][nCol] =
          min(rvvnDetDP[nRow][nCol],
              rvvnDetDP[nRow][nx] + rvvnDetDP[nx + 1][nCol] 
                                  + cnrvnMtrx[nRow - 1] * cnrvnMtrx[nx] * cnrvnMtrx[nCol]);
    }
}

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  vector<vector<int>> vvnDetDP; 
  vector<int> vnMtrx;

  fnInput(vnMtrx);
  vvnDetDP.resize(vnMtrx.size(), vector<int>(vnMtrx.size(), INT_MAX));

  fnMtrxChainMultpl(vvnDetDP, vnMtrx);
  cout << vvnDetDP[1][vnMtrx.size() - 1] << endl;
  return 0;
}

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 <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;
using ll = long long;

signed
main(){
		int N;
		cin >> N;
		vector<ll> a(N+1);
		for(int i=0;i<N;i++){
				cin >> a[i] >> a[i+1];
		}
	
		vector<vector<ll> > m(N+1, vector<ll>(N+1,INT_MAX));

		for(int i=0;i<=N;i++)
				m[i][i] = 0;
		for(int i=0;i<N;i++)
				m[i][i+1] = 0;


		for(int sa=2;sa<=N;sa++){
				for(int b=0;b<=N-sa;b++){
						int e = b + sa;
						for(int med=b;med<=e;med++){
								m[b][e] = min(m[b][e], m[b][med] + m[med][e] + a[b]*a[med]*a[e]);
						}
				}
		}
		cout << m[0][N] << endl;

}

C++: #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

ll m[101][101];
vector<ll> p;

int main() {

    int n;
    cin >> n;
    ll a, b;
    for (int i = 0; i < n; i++) {
        cin >> a >> b;
        if (i == 0) 
            p.push_back(a);
        p.push_back(b);
    }

    for (int i = 0; i < n; i++) 
        m[i][i] = 0;
    // l: length
    for (int l = 1; l < n; l++) {
        for (int i = 0; i < n - l; i++) {
            int j = i + l;
            m[i][j] = (1 << 21);
            for (int k = i; k < j; k++) {
                ll q = m[i][k] + m[k+1][j] + p[i] * p[k+1] * p[j+1];
                
                if( q < m[i][j] )
                    m[i][j] = q;
            }
        }
    }

    cout << m[0][n-1] << '\n';
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <stdlib.h>
#include <math.h>
#define MAX 100
void min(int,int);
int p[MAX]={},m[MAX][MAX]={},i,j,k;

void min(int n1,int n2){
  if(n1>n2) n2=n1;
}
    
int main()
{
  int n,r,l;

  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=1;i<=n-l+1;i++){
      j=i+l-1;
      m[i][j]=(1<<21);
      for(k=i;k<=j-1;k++){
	min(m[i][j],m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j]);
      }
    }
  }

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

  return 0;
}

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

int n;
int r[101],c[101];
long long int dp[101][101];
int null = -1;
long long int ans;
long long int inf = 1<<24;
long long int dfs(int i,int j){
    long long int res=inf;
    if(dp[i][j] != null){
        return dp[i][j];
    }
    else if(i == j){
        res = 0;
    }
    else{
        for(int k=i;k<j;k++){
            res = min(dfs(i,k) + dfs(k+1,j) + r[i]*c[k]*c[j],res);
        }
    }

    dp[i][j] = res;
    //cout << i << " " << j << " " << dp[i][j] << endl;
    return res;
}

int main(){
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> r[i] >> c[i];
    }
    for(int i=0;i<=n;i++){
        for(int j=0;j<=n;j++){
            dp[i][j] = null;
        }
    }
    ans = dfs(0,n-1);
    cout << ans << endl;
    return 0;

}