Go: package main

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

//util
var sc = bufio.NewScanner(os.Stdin)

func nextStr() string {
	sc.Scan()
	return sc.Text()
}

func nextInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func printList(list []int) {
	buf := bufio.NewWriter(os.Stdout)
	for _, v := range list {
		buf.Write([]byte(fmt.Sprintf(" %d", v)))
	}
	buf.Write([]byte("\n"))
	buf.Flush()
}

//solve
//単純な場合
func matrixChainMultiplication() {
	//行列が1つだけのとき
	for i := 1; i <= n; i++ {
		m[i][i] = 0
	}
	for l := 2; l <= n; l++ {
		for i := 1; i <= n-l+1; i++ {
			j := i + l - 1
			m[i][j] = 1 << 21
			//kまでで区切る
			for 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])
			}
		}
	}
}

func max(a, b int) int {
	if a > b {
		return a
	} else {
		return b
	}
}

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

const MAX = 100

var n int
var p [MAX + 1]int

//m[i][j]: Mi * Mi+1 * ... * Mjを計算するときに必要なスカラー乗算の最小回数
var m [MAX + 1][MAX + 1]int

func main() {
	sc.Split(bufio.ScanWords)
	n = nextInt()
	for i := 1; i <= n; i++ {

		p[i-1] = nextInt() //行数
		p[i] = nextInt()   //列数
	}

	matrixChainMultiplication()
	fmt.Println(m[1][n])
}

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

typedef pair<int, int> pii;

int main(int argc, char *argv[]){
  int n;
  cin >> n;
  pii mat[n];
  int dp[n][n];
  int p[n + 1];

  //????????????
  for (int i = 0; i < n; i++) {
    cin >> mat[i].first >> mat[i].second;
  }
  for (int i = 0; i < n; i++) {
    p[i] = mat[i].first;
  }
  p[n] = mat[n - 1].second;
  for (int i = 0; i < n; i++) {
    for (int j = i; j < n; j++) {
      if(i != j)dp[i][j] = 1e9;
      else dp[i][j] = 0;
    }
  }
  //???????????§?????????
  //????????????DP
  for (int l = 2; l <= n; l++) {
    for (int i = 0; i <= n - l; i++) {
      int j = i + l - 1;
      for (int k = i; k < j; k++) {
        dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] +
                       p[i]*p[k + 1]*p[j + 1]);
      }
    }
  }
  std::cout << dp[0][n - 1] << std::endl;
            
  return 0;
}

C++: #include <iostream>
#include <vector>
int INF = 1e9;
int main(){
    int n;
    std::cin >> n;
    std::vector<int> g(n), re(n);
    for(int i = 0; i < n; i++) std::cin >> g[i] >> re[i];
    int dp[n + 1][n + 1];
    for(int i = 0; i < n + 1; i++){
        for(int j = 0; j < n + 1; j++) dp[i][j] = INF;
        if(i < n) dp[i][i + 1] = 0;
        dp[i][i] = 0;
    }
    for(int w = 1; w < n + 1; w++){
        for(int l = 0; l < n; l++){
            int r = l + w;
            if(r > n) break;
            if(r - l == 2) dp[l][r] = g[l]*re[l + 1]*g[r - 1];
            for(int mid = l + 1; mid < r; mid++){
                dp[l][r] = std::min(dp[l][mid] + dp[mid][r] + g[l]*re[r- 1]*re[mid - 1], dp[l][r]);
            }
        }
    }
    std::cout << dp[0][n] << std::endl;
}

C++: #include<iostream>
#include<algorithm>
#define N 100
using namespace std;

int main() {
  int n, p[N + 1], m[N + 1][N + 1], i, j, k, l;
  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 - l + 1; i++) {
      j = i + l - 1;
      m[i][j] = (1 << 21);
      for(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 <cstdio>
#include <climits>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>

#define MAX 200000
#define INFTY 1<<30

using namespace std;

static const int N = 1000;

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++)//???????????° 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;
  return 0;
}

C++: #include <stdio.h>
#include <limits.h>
#include <math.h>
#define INF INT_MAX

int n,p[101],m[101][101];

void matrixChainOrder(){
  int i,j,k,l,q;
  for(i=0;i<n;i++)m[i][i]=0;
  for(l=1;l<n;l++)
    for(i=0;i<n-l;i++){
      j=i+l;
      m[i][j]=INF;
      for(k=i;k<j;k++){
	q=m[i][k]+m[k+1][j]+p[i]*p[k+1]*p[j+1];
	m[i][j]=fmin(m[i][j],q);
      }
    }
}

int main(){
  int i;
  scanf("%d",&n);
  for(i=0;i<2*n;i++)scanf("%d",&p[i]);
  matrixChainOrder();
  printf("%d\n",m[0][n-1]);
  return 0;
}

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

template<typename T, typename U> void dmin(T &x, U y) { if(x > y) x = y; }

const int MAX_N = 100;
const int INF = 1001001001;

int main() {
  int n, r, c;
  int rc[MAX_N][2];
  cin >> n;
  for (int i=0; i<n; i++) {
    cin >> r >> c;
    rc[i][0] = r; rc[i][1] = c;
  }

  int dp[MAX_N][MAX_N];
  for (int i=0; i<n; i++) {
    for (int j=0; j<n; j++) {
      dp[i][j] = INF;
    }
    dp[i][i] = 0;
  }

  for (int l=2; l<=n; l++) {
    for (int i=0; i+l-1<n; i++) {
      for (int j=1; j<l; j++) {
        dmin(dp[i][i+l-1], dp[i][i+j-1] + rc[i][0]*rc[i+j-1][1]*rc[i+l-1][1] + dp[i+j][i+l-1]);
      }
    }
  }

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

C++: #include<bits/stdc++.h>
#define INF (1e9)
#define N 105
using namespace std;
int n,r[N],c[N],dp[N][N];

void matrixChainOrder(){
  for(int l=2;l<=n;l++){
    for(int i=0;i<=n-l;i++){
      int j=i+l-1;
      dp[i][j]=INF;
      for(int k=i;k<j;k++)
	dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+r[i]*c[k]*c[j]);
    }
  }
}

int main(){
  cin>>n;
  for(int i=0;i<n;i++)
    cin>>r[i]>>c[i];
  matrixChainOrder();
  cout<<dp[0][n-1]<<endl;
  return 0;
}

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

using namespace std;

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

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

int main()
{
  int n;
  std::cin >> n;
  std::vector<std::pair<int, int>> data;
  for (int i = 0; i < n; i++){
    int l , r;
    std::cin>> l >> r;
    data.push_back(std::make_pair(l, r));
  }

  std::vector<std::vector<int>> dp(n+1, std::vector<int>(n+1, 0));
  for (int w = 2; w <= n; w++){
    for (int l = 0; l < n; l++){
      int r = l+w;
      if(r>n)continue;
      dp[l][r] = 100000000;
      for (int mid = l+1; mid < r; mid++){
        dp[l][r] = std::min(dp[l][r], dp[l][mid] + dp[mid][r] + data[l].first*data[mid].first*data[r-1].second);
      }
    }
  }
  std::cout << dp[0][n] << std::endl;
}