Go: package main

/*
連鎖行列積
*/

import (
	"bufio"
	"bytes"
	"fmt"
	"log"
	"math"
	"os"
	"strconv"
	"strings"
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

type mem *[][]int

func main() {
	scanner := makeScanner(1024)
	n := eGetInt(scanner)
	p := make([]int, n+1)
	for i := 0; i < n; i++ {
		rowcol := eGetInts(scanner)
		p[i] = rowcol[0]
		p[i+1] = rowcol[1]
	}
	m := make([][]int, n)
	for i := 0; i < n; i++ {
		m[i] = make([]int, n)
	}
	// 初期値の格納
	for i := 0; i < n; i++ {
		for j := i; j < n; j++ {
			if i == j {
				m[i][j] = 0 //  同じ行列へのコストは当然0
			} else {
				m[i][j] = math.MaxInt64
			}
		}
	}

	// num : 行列の数. num == 1の場合は初期値0を格納ずみ
	for num := 2; num <= n; num++ {
		// s : スタート行列番号
		for s := 0; s+num <= n; s++ {
			// t : 終了行列番号
			t := s + num - 1
			// k : 仕切
			for k := s; k < t; k++ {
				m[s][t] = min(m[s][t], m[s][k]+m[k+1][t]+p[s]*p[k+1]*p[t+1])
			}
		}
	}
	fmt.Println(m[0][n-1])
}

////////////////////////////////////////////////////////////////////////////////
// ライブラリ
////////////////////////////////////////////////////////////////////////////////
func makeScanner(maxByte int) *bufio.Scanner {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Buffer(make([]uint8, 0, 8192), maxByte)
	return scanner
}
func makeWordScanner() *bufio.Scanner {
	scanner := makeScanner(8192)
	scanner.Split(bufio.ScanWords)
	return scanner
}
func eGetLine(r *bufio.Scanner) string {
	if r.Scan() {
		return r.Text()
	}
	err := r.Err()
	if err != nil {
		log.Fatal(err)
	}
	// EOF
	return ""
}
func eGetInt(r *bufio.Scanner) int {
	line := eGetLine(r)
	return eAtoi(line)
}
func eGetFields(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Fields(line)
}
func eGetInts(r *bufio.Scanner) []int {
	fields := eGetFields(r)
	ints := make([]int, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoi(fields[i])
	}
	return ints
}
func eGetChars(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Split(line, "")
}
func eAtoi(s string) int {
	n, err := strconv.Atoi(s)
	if err != nil {
		log.Fatal(err)
	}
	return n
}

type ints []int

func (s ints) String() string {
	var buf bytes.Buffer
	buf.WriteString("[")
	sep := ""
	for _, v := range s {
		buf.WriteString(fmt.Sprintf("%s%d", sep, v))
		sep = ", "
	}
	buf.WriteString("]")
	return buf.String()
}

func reverse(a ints) ints {
	r := make(ints, len(a))
	for i := 0; i < len(a); i++ {
		r[i] = a[len(a)-1-i]
	}
	return r
}
func max(a ints) (int, bool) {
	if len(a) == 0 {
		return 0, false
	}
	m := a[0]
	for _, e := range a {
		if e > m {
			m = e
		}
	}
	return m, true
}

// func min(a []int) int {
// 	m := a[0]
// 	for _, v := range a {
// 		if v < m {
// 			m = v
// 		}
// 	}
// 	return m
// }

func sum(a ints) int {
	if len(a) == 0 {
		return 0
	}
	sum := 0
	for _, e := range a {
		sum += e
	}
	return sum
}
func find(n int, a ints) int {
	for i, v := range a {
		if n == v {
			return i
		}
	}
	return -1
}

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];
    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 k=2;k<=n;k++){
        for(int i=1;i<=n-k+1;i++){
            int j=i+k-1;
            b[i][j]=(1<<21);
            for(int m=i;m<=j-1;m++){
                b[i][j]=min(b[i][j],b[i][m]+b[m+1][j]+a[i-1]*a[m]*a[j]);
            }
        }
    }
    
    cout << b[1][n] << endl;
    return 0;
}

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<bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i=0;i<(n);++i)
#define per(i, n) for(int i=(n)-1;i>=0;--i)
#define repa(i, n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
const ll MOD = (ll)1e9+7;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
using namespace std;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}

ll modpow(ll x, ll b){
	ll res = 1;
	while(b){
		if(b&1)res = res * x % MOD;
		x = x * x % MOD;
		b>>=1;
	}
	return res;
}

ll modinv(ll x){
	return modpow(x, MOD-2);
}

int n;
vector<pll> line;
vvector<ll> dp;

ll func(int l, int r){
	if(l==r)return 0;
	if(dp[l][r]>=0)return dp[l][r];
	ll res = INFLL;
	for(int mid=l;mid<r;++mid){
		chmin(res, func(l, mid) + func(mid+1, r) + line[l].first * line[mid].second * line[r].second);
	}
	return dp[l][r] = res;
}

int main(){
	cin >> n;
	line.resize(n);
	dp.resize(n, vector<ll>(n, -1));
	foreach(i, line)cin>>i.first>>i.second;
	cout << func(0, n-1) << endl;
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define INF 100000000
int n,m[101][101],p[101];
void dp();

int main(){
  cin>>n;
  for(int i=0;i<n;i++)cin>>p[i-1]>>p[i];
  dp();
  cout<<m[1][n]<<endl;
  return 0;
}
void dp(){
  for(int i=0;i<n-1;i++)
    for(int j=1;j<n-i;j++){
     int a=j+i+1;
     m[j][a]=INF;
     for(int k=j;k<a;k++){
       int b=m[j][k]+m[k+1][a]+p[j-2]*p[k-1]*p[a-1];
       if(m[j][a]>b)m[j][a]=b;
     }
    } 
}

C++: #include <iostream>
#include <string>
#include <climits>
using namespace std;
const int INFY = INT_MAX;
int p[101], M[101][101];

void matrixCahinOrder(int length){
    int n = length - 1;
    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] = INFY;
            for (int k = i; k <= j-1; k++){
                int q = M[i][k] + M[k+1][j] + p[i-1]*p[k]*p[j];
                M[i][j] = min(M[i][j], q);
            }
        }
    }
}
int main(int argc, char* argv[]) {
    int n, tmp;
    cin >> n;
    for (int i = 0; i < n; i++){
            cin >> p[i] >> tmp;
    }
    p[n] = tmp;

    /*
    for (int i = 0; i <= n; i++){
        cout << p[i] << endl;
    }
    */
    matrixCahinOrder(n+1);
    cout << M[1][n] << endl;
    return 0;
}

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

#define INFINITY 10000000

using namespace std;


int main(void){

  int N;
  scanf("%d",&N);
  
  int* p = new int [N+1];

  int** m = new int* [N+1];
  for(int i=0;i<N+1;i++){
    m[i] = new int [N+1];
  }

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

  for(int i=0;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] = INFINITY;
      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]);
      }
    
    }
  
  }

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

  delete [] p;
  for(int i=0;i<N+1;i++){
    delete [] m[i];
  }
  delete [] m;


  return 0;
}