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 <bits/stdc++.h>
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;

const int INF = 2100100100;
const int MOD = 1e9 + 7;

// 多次元 vector 生成
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
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 N, M, K, Q, W, H, R, C;
int dp[200][200];

int main() {
    // cin.tie(0);
    // ios::sync_with_stdio(false);

    cin >> N;
    vector<int> a(N), b(N);
    REP(i, N) cin >> a.at(i) >> b.at(i);

    REP(i, N + 1) {
        REP(j, N + 1) {
            dp[i][j] = INF;
            if (i + 1 == j) dp[i][j] = 0;
        }
    }

    FOR(len, 1, N) {
        REP(l, N) {
            int r = l + len + 1;
            if (r <= N) {
                FOR(h, l + 1, r) { chmin(dp[l][r], dp[l][h] + dp[h][r] + a[l] * b[h - 1] * b[r - 1]); }
            }
        }
    }

    cout << dp[0][N] << endl;

    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
#include <cstdlib>
#define INT_MAX 2147483647
#define INT_MIN -2147483646
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#define Loop1(i, n) for(int i = 1; i <= (int)n; i++)
#define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = (int)n; i >= 1; i--)
using namespace std;
typedef long long int ll;

int memo[105][105];
int r[105], c[105];

int func(int a, int b) {
	if (memo[a][b] != INT_MIN) return memo[a][b];
	if (b - a == 0) { 
		memo[a][b] = 0;
	}
	else {
		int m = INT_MAX;
		for (int k = a;k < b;k++) {
			m = min(m, func(a, k) + func(k + 1, b) + r[a] * c[k] * c[b]);
		}
		memo[a][b] = m;
	}
	return memo[a][b];
}

int main() {
	int n;
	cin >> n;
	Loop(i, n) {
		Loop(j, n) {
			memo[i][j] = INT_MIN;
		}
	}
	Loop(i, n) {
		cin >> r[i] >> c[i];
	}
	cout << func(0, n - 1) << endl;
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<stdlib.h>

using namespace std;

int minana(int a,int b){
  if(a<b){
    return a;
  }
  else if(a>b){
    return b;
  }
  else return a;
}


int main(){
  int n;
  cin>>n;
  int r[100];
  int m[101][101];
  int j;
  int q=0;
  //int c[n];
  for(int i=1;i<=n;i++){
    cin>>r[i-1]>>r[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;k++){
	q=m[i][k]+m[k+1][j]+r[i-1]*r[k]*r[j];
	m[i][j]=minana(m[i][j],q);
      }
    }
  }
  
  cout<<m[1][n]<<endl;
  return 0;
}

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

template <typename TYPE>
void print_vec(const vector<TYPE>& v){
	for(int i=0; i<v.size(); i++){
		cout << v[i] << " ";
	}
	cout << endl;
}

template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
  cout << endl; cout << "       ";
  for(int i=0; i<v[0].size(); i++) cout << i << "   "; 
  cout << endl;
	for(int i=0; i<v.size(); i++){
		cout << "i=" << i << ":   ";
		for(int j=0; j<v[i].size(); j++){
			if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << "   ";
      else cout << "\x1B[31m" << v[i][j] << "   ";//https://stackoverrun.com/ja/q/12618775
		}
		cout << "\x1B[0m" << endl;
	}
}
 
ll chmin(ll &a, ll b) {return a = min(a, b);}

int main(){
	int n;
	cin >> n;
	vector<ll> row(n), col(n);// 計算に使うんでllにしときます
	for(int i=0; i<n; i++) cin >> row[i] >> col[i];
	const ll INF = 100100100100100;
	// dp[l][r]: 区間[l,r]の行列の積を計算するのに必要なスカラー乗算の最小回数 
	// ll ans = dp[0][n-1] となるよ
	vector<vector<ll>> dp(n+1, vector<ll>(n+1, INF));
	
	//初期化
	for(int l=0; l<n; l++){
		dp[l][l] = 0;//行列1つだけじゃあ計算回数は0
	}

	for(int w=1; w<n; w++){
		for(int l=0; l+w<n; l++){
			int r = l+w;
			for(int mid=l; mid<r; mid++){// 結合する位置をずらしていく
				ll num = row[l] * col[mid] * col[r];// a×b と b×c の計算回数は a * b * c
				num = row[l] * row[mid+1] * col[r];//こっちでもよい
				chmin(dp[l][r], dp[l][mid] + num + dp[mid+1][r]);// 例  a×b と b×c　と c×d　の計算回数は a*b*c + a*c*d 　と  b*c*d + a*b*d  の小さいほう 
			}
		}
	}

	cout << dp[0][n-1] << endl;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>

#define INF 100000001

using namespace std;

int DP[101][101];
int *p;

int rec(int r,int c){
    int Min = INF;
    int num = c - r;
    
    for (int i = 0; i < num; i++) {
        Min = min(Min , DP[r][r+i] + DP[r+i+1][c] + p[r-1]*p[r+i]*p[c]);
    }
    return Min;
}

int main(){
    int N;
    cin >> N;
    for (int i = 1; i <= N; i++) DP[i][i] = 0;
    
    p = (int *)malloc(sizeof(int)* (N+1));
    
    cin >> p[0];
    cin >> p[1];
    int bb;
    for (int i = 2; i <= N; i++) {
        cin >> bb;
        cin >> p[i];
    }
    
    for (int i = 1; i < N; i++) DP[i][i+1] = p[i-1]*p[i]*p[i+1];
    
    
    for (int j = 0; j <= N-3 ; j++) {//?????????????????????
        for (int i = 3+j; i <= N; i++) {//????????°???????????????
            DP[i-2-j][i] = rec(i-2-j,i);
        }
    }
    
    cout << DP[1][N] << endl;
    
    return 0;
}