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 <string>
#include <sstream>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <cstring>
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))

using namespace std;

const int N_MAX = 1000000;

int rows[N_MAX];
int cols[N_MAX];
int dp[101][101];

int main(){
  int n;
  cin >> n;
  
  rep(i, 0, n) cin >> rows[i] >> cols[i];
  rep(i, 0, n){
    rep(j, 0, n){
      dp[i][j] = INT_MAX;
    }
  }
  // init
  rep(i, 0, n-1) dp[i][i+1] = rows[i] * rows[i+1] * cols[i+1];
  
  // strtegy
  /*
    dp[i][j] ... minimum multiplication times i to j
    dp[i][j] = dp[i][k] + dp[k+1][j] + row[i] * col[k] * col[j] for all i < k < j-1

    (i, j) -> (0, 1), (1, 2), ..., (0, 2), (1, 3), ..., (0, n-1), ...
   */
  
  // iteration
  rep(k, 2, n){
    rep(i, 0, n){
      int j = i + k;
      //cout << i << ", " << j << endl;
      if(j >= n) break;
      int tmp = INT_MAX;
      for(int l=i; l < j; l++){
	// cout << i << ", " << l << ", " << j << endl;
	int residue = rows[i] * cols[l] * cols[j];
	int cand_min = dp[i][l] + dp[l+1][j] + residue;
	if(i == l) cand_min = dp[l+1][j] + residue;
	if(j == l+1) cand_min = dp[i][l] +  residue;
	if(tmp > cand_min) tmp = cand_min;
      }
      if(dp[i][j] > tmp) dp[i][j] = tmp;
    }
  }
  
  /*
  for(int k=2; k<n; k++){
    for(int row=0; row+k < n; row++){
      int col = row+k;
      if(dp[row][col-1] < dp[row+1][col]){
	dp[row][col] = dp[row][col-1] + rows[row] * rows[col] * cols[col];
      }
      else{
	dp[row][col] = dp[row+1][col] + rows[row] * cols[row] * cols[col];
      }
      cout << "row: " << row << ", col: " << col << ", dp[row][col]: " << dp[row][col] << endl;
      cout << rows[row] << ", " << cols[row] << ", " << cols[col] << endl;
    }
    }*/
  /*
    rep(i, 0, n){
    rep(j, 0, n){
      cout << dp[i][j] << " ";
    }
    cout << endl;
  }
  */
  if(n==1) cout << 0 << endl;
  else{
    cout << dp[0][n-1] << endl;
  }
  // multiple the result
  
  return 0;
}

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

static const int N=100;

int main(){
  int i,l,n,p[N+1],m[N+1][N+1];
  cin >> n;
  for(i=1;i<=n;i++) cin >> 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-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 <algorithm>
using namespace std;

static const int N= 100;
int p[N+1], m[N+1][N+1];

int main() {
    ios::sync_with_stdio(false);
    int n;
    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++){ //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;
}

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


std::vector<std::vector<int>> mats, cost;


int calcMin(int start, int end) {
    if (cost[start][end] != -1) return cost[start][end];

    int min_cost;
    for (int i = start; i < end; i++) {
        int tmp_cost = calcMin(start, i) + calcMin(i + 1, end)
            + mats[start][0] * mats[i][1] * mats[end][1];
        if (i == start) {
            min_cost = tmp_cost;
        }
        if (min_cost > tmp_cost) min_cost = tmp_cost;
    }
    cost[start][end] = min_cost;
    return cost[start][end];
}

int main() {
    int n;
    std::cin >> n;
    
    mats = std::vector<std::vector<int>>(n, std::vector<int>(2));
    cost = std::vector<std::vector<int>> (n, std::vector<int>(n, -1));

    for (int i = 0; i < n; i++) {
        std::cin >> mats[i][0] >> mats[i][1];
    }

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

    std::cout << calcMin(0, n - 1) << std::endl;
}