Go: package main

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

var cache [100][100]int

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Scan()
	num, _ := strconv.Atoi(sc.Text())
	tables := []table{}
	for i := 0; i < num; i++ {
		sc.Scan()
		num1, _ := strconv.Atoi(sc.Text())
		sc.Scan()
		num2, _ := strconv.Atoi(sc.Text())
		t := table{num1, num2}
		tables = append(tables, t)
	}

	fmt.Println(minimum(0, len(tables)-1, tables))
}

type table struct {
	v int
	h int
}

func minimum(i int, j int, t []table) int {
	if i == j {
		return 0
	}

	// fmt.Printf("i:%v j:%v\n", i, j)
	if cache[i][j] != 0 {
		return cache[i][j]
	}

	min := math.MaxInt64
	for k := i; k < j; k++ {
		p := t[i].v
		n := t[k].h
		q := t[j].h
		val := minimum(i, k, t) + minimum(k+1, j, t) + p*n*q
		if val < min {
			min = val
		}
	}

	cache[i][j] = min
	return min
}

C++: #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
constexpr int MAX = 101;
int main() {
	int n; cin >> n;
	vi z(MAX);
	vv(int, m, MAX, MAX, 0);
	rep(i, 1, n + 1) {
		cin >> z[i - 1] >> z[i];
	}
	int j;
	rep(l, 2, n + 1) {
		rep(i, 1, n - l + 2) {
			j = i + l - 1;
			m[i][j] = 1e8;
			rep(k, i, j) {
				m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + z[i - 1] * z[k] * z[j]);
			}
		}
	}
	P(m[1][n]);
	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 << 30);
            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 <climits>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<pair<int, int>> m(n);
    for (int i = 0; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        m[i] = make_pair(a, b);
    }

    vector<vector<int>> v(n, vector<int>(n, INT_MAX));
    for (int i = 0; i < n; ++i)
        v[i][i] = 0;

    for (int width = 2; width <= n; ++width) {
        for (int i = 0; i < n - width + 1; ++i) {
            int j = i + width - 1;
            for (int k = i; k < j; ++k) {
                v[i][j] =
                    min(v[i][j], v[i][k] + v[k + 1][j] +
                                     m[i].first * m[k].second * m[j].second);
            }
        }
    }
    cout << v[0][n - 1] << '\n';
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define MEMSET(v, h) memset((v), h, sizeof(v))
#define sqr(x) ((x) * (x))
#define bit(n) (1LL<<(n))
#define pcnt(x) __builtin_popcountll(x)
#define PB push_back
#define MP make_pair
#define endl "\n"
using Edge = pair<int,int>;
using Graph = vector<vector<Edge>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll dp[110][110];
const ll MAX = 1001001001001001;

int main() {
  int n; cin >> n;
  ll p[n+1];
  FOR(i,0,n-1){
    cin >> p[i] >> p[i+1];
  }
  FOR(i,1,n){
    FOR(j,1,n){
      if(i==j) continue;
      else dp[i][j] = MAX;
    }
  }
  
  FOR(l,2,n){
    FOR(i,1,n-l+1){ //連鎖長がlのものでループ
      int j = i+l-1;
      FOR(k,i,j-1){
        ll q = dp[i][k] + dp[k+1][j] + p[i-1]*p[k]*p[j];
        chmin(dp[i][j],q);
      }
    }
  }
  cout << dp[1][n] << "\n";

}

C++: // -*- mode:c++; coding:utf-8; c-basic-offset:2; -*-
// ALDS1_10_B: Matrix Chain Multiplication

#include <algorithm>
#include <climits>
#include <cstdio>

using uint = unsigned int;

static uint matrix_chain_multiplication(const uint p[], const uint n)
{
  uint m[n][n];
  for (auto i = 0u; i < n; ++i) m[i][i] = 0u;

  for (auto d = 1u; d < n; ++d) {
    for (auto i = 0u, j = i+d; j < n; ++i, ++j) {
      auto min = UINT_MAX;
      for (auto k = i; k < j; ++k) {
        // min(Mi..j = (Mi..k) * (Mk+1..j)
        //           = (Mi..k) + (Mk+1..j) + p[i]*p[k+1]*p[j+1])
        auto cost = m[i][k] + m[k+1][j] + p[i]*p[k+1]*p[j+1];
        min = std::min(min, cost);
      }
      m[i][j] = min;
    }
  }
  return m[0][n-1];
}

int main()
{
  uint n;
  std::scanf("%u", &n);
  uint p[n+1];
  for (auto i = 0u; i < n; ++i) {
    std::scanf("%u %u", &p[i], &p[i+1]);
  }
  auto c = matrix_chain_multiplication(p, n);
  std::printf("%u\n", c);
}

// eof

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

#define ASC(vec) vec.begin(), vec.end()		// 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend()	// 降順ソート 例:sort(DESC(vec));
#define rep(i, n) for(int i = 0; i < (n); i++)
#define Rep(i, n) for(int i = 1; i < n; i++)

const int mod = 1000000007;
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;

using ii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vii = vector<pair<int, int>>;

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return (a * b) / GCD(a, b); }
int round_int(int a, int b) { return (a + (b - 1)) / b; }

// 素因数分解; 返り値は(素数, 乗数)のvector配列
vector<pair<ll, int>> factorize(ll n) {
	vector<pair<ll, int>> res;
	for (ll i = 2; i * i <= n; ++i) {
		if (n % i) continue;
		res.emplace_back(i, 0);
		while (n % i == 0) {
			n /= i;
			res.back().second++;
		}
	}
	if (n != 1) res.emplace_back(n, 1);
	return res;
}

constexpr array<int, 9> dx = { 0, 1, 0, -1, -1, 1, 1, -1, 0 };
constexpr array<int, 9> dy = { 1, 0, -1, 0, 1, 1, -1, -1, 0 };
//constexpr auto MAX = 100000;

// ──────────────────────────────────────────────────────────────────


#define N 101

int dp[N + 1][N + 1], p[N + 1];

int main() {
    int n;

    cin >> n;
    for(int i = 1; i < n + 1; ++i) {
        cin >> p[i - 1] >> p[i];
    }

    for(int l = 2; l < n + 1; ++l) {
        for(int i = 1; i < n - l + 2; ++i) {// 対象とする行列の数
            int j = i + l - 1;
            dp[i][j] = (1 << 20); // dp[i][j] := [Mi, Mj]の最小回数
            for(int k = i; k < j; ++k) {
                //cout << l << " " << i << " " << j << " " << k << endl;
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + p[i - 1] * p[k] * p[j]);
            }
        }
    }

    cout << dp[1][n] << endl;

    return 0;
}