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;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
int main(void){
	int n,p[N+1],m[N+1][N+1];
	cin>>n;

	loop(i,1,n+1){
		cin>>p[i-1]>>p[i];
	}

	loop(i,1,n+2)m[i][i] = 0;

	loop(l,2,n+1){
		loop(i,1,n-l+2){
			int j = i + l - 1;
			m[i][j] = (1<<21);
			loop(k,i,j){
				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>

int main() {
	int n, p[101], m[101][101];
	std::cin >> n;
	for (int i = 1; i <= n; i++) {
		std::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 - 1; i++) {
			int j = i + l - 1;
			m[i][j] = (1 << 21);
			for (int k = i; k <= j - 1; k++) {
				m[i][j] = std::min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j]);
			}
		}
	}
	std::cout << m[1][n] << std::endl;
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 100
#define INF 1<<30

int main(void){
  int n, p[MAX+1], m[MAX][MAX];
  cin >> n;
  for(int i=0; i<n; i++){
    cin >> p[i] >> p[i+1];
  }

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

  for(int l=1; l<n; l++){ // iとjの差を1からn-1まで変化させる
    for(int i=1; i<=n-l; i++){
      int j = i + l; // l-1がiとjの差
      m[i][j] = INF;
      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;
  return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
const int N = 100;
int main() {
	int n;
    int p[N + 1], a[N + 1][N + 1];
	cin >> n;
	for( int i = 0; i < n; ++i ) {
		cin >> p[i] >> p[i + 1];
	}
	for( int i = 1; i <= n; i++ ) a[i][i] = 0;

	for( int m = 2; m <= n; m++ ) { 
		for( int i = 1; i <= n - m + 1; i++ ) {
			int j = i + m - 1;
			a[i][j] = ( 1 << 21 );
			for( int k = i; k<=j - 1; k++) {
				a[i][j] = min(a[i][j], a[i][k] + a[k+1][j] + 
					p[i-1] * p[k] * p[j] );
			}
		}
	}
	cout << a[1][n] << endl;
}

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

int x[101];
int S[101][101];

int solve(int n){
  for(int i = 2; i <= n; i++){
    for ( int l = 1; l <= n - i + 1 ; l++){
      // l は 始まりの数
      int j = l + i - 1; // 終わりの数
      S[l][j] = 100000;
      for ( int k = l; k <= j-1; k++){
        S[l][j] = min(S[l][j], S[l][k] + S[k+1][j] + x[l-1]*x[k]*x[j]);
      }
    }
  }

 return S[1][n];
}

int main(){
  int n;
  cin >> n;
  int r, c;
  for ( int i = 0; i < n; i++){
    cin >> r >> c;
    if(i == 0){
      x[0] = r;
      x[1] = c;
   } else {
     x[i+1] = c;
   }
  }

  // init
  for ( int i = 0; i <= n; i++){
    S[i][i] = 0;
  }

  cout << solve(n) << endl;

  return 0;
}

C++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_B&lang=ja
//Matrix Chain Multiplication
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll=long long;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
template<class T>bool chmax(T &a, const T &b) {if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) {if (b<a) { a=b; return 1; } return 0;}
int main() {
#if LOCAL&01
	//std::ifstream in("./test/sample-1.in");
	std::ifstream in("./input.txt");
	std::cin.rdbuf(in.rdbuf());
#else
	cin.tie(0);
	ios::sync_with_stdio(false);
#endif
  ll n; cin>>n;
  vector<pair<ll,ll>> rcn(n);
  for(auto&& rc:rcn){
   cin>>rc.first>>rc.second;
  }
	vector<vector<ll>> dp(n,vector<ll>(n+1,-1));
  auto dfs = [&](auto&& self, ll l, ll r)->ll{
    if(l+1>=r)return 0;
		if(dp[l][r]>=0)return dp[l][r];
    ll ret=INT64_MAX;
    FOR(k,l+1,r){
      ll mulnum = rcn.at(l).first * rcn.at(k).first * rcn.at(r-1).second;
      chmin(ret, self(self,l,k)+self(self,k,r) + mulnum);
    }
		dump(l,r,ret);
		dp[l][r]=ret;
    return ret;
  };

	ll ans=dfs(dfs,0,n);
	cout<<ans<<endl;

  return 0;
}

C++: #include<stdio.h>
int main()
{
  int n,r[100],c[100][100];
  int i,j,k,l,m;
   
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d%d",&r[i],&j);
  }
  r[n]=j;
  for(i=1;i<=n;i++){
    c[i][i]=0;
  }
     
  for(l=2;l<=n;l++){
    for(i=1;i<=n-l+1;i++){
      j =i+l-1;
      c[i][j]=1000000;
      for(k=i;k<=j-1;k++){
    m=c[i][k]+c[k+1][j]+(r[i-1]*r[k]*r[j]);
       
    if(c[i][j]>m){
      c[i][j]=m;
    }
      }
    }
  }
  printf("%d\n",c[1][n]);
   
  return 0;
}