Go: package main

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

const N = 100

func min(x, y int) int {
	if x < y {
		return x
	} else {
		return y
	}
}

func main() {
	var n int
	fmt.Scan(&n)
	p := make([]int, N+1)
	m := make([][]int, N+1)
	for i := range m {
		m[i] = make([]int, N+1)
	}
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Split(bufio.ScanWords)
	for i := 1; i <= n; i++ {
		scanner.Scan()
		p[i-1], _ = strconv.Atoi(scanner.Text())
		scanner.Scan()
		p[i], _ = strconv.Atoi(scanner.Text())
	}
	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])
			}
		}
	}
	fmt.Println(m[1][n])
}

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

using namespace std;

int main(){
  int N; cin >> N;
  int dp[101][101];
  fill((int*)dp, (int*)dp+101*101, 1234567890);

  vector<int> r(N), c(N);
  for(int i=0;i<N;++i){
	cin >> r[i] >> c[i];
	dp[i][i+1] = 0;
  }
  
  for(int l=2;l<=N;++l){
	for(int i=0;i+l<=N;++i){
	  for(int j=i+1;j<i+l;++j){
		dp[i][i+l] = min(dp[i][j] + dp[j][i+l] + r[i]*c[i+l-1]*r[j], dp[i][i+l]);
	  }
	}
  }
  cout << dp[0][N] << endl;
  
  return 0;
}

C++: #include <iostream>
using namespace std;
#define MAX 200
#define INFTY (1<<21)

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

void matrix()
{
    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] = INFTY;
            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]);
        }
    }
}
int main()
{
    cin >> n;
    for(int i=1; i<=n; i++)
        cin >> p[i-1] >> p[i];
    matrix();
    cout << m[1][n] << endl;
    return 0;
}

C++: #include<stdio.h>

static const int N = 100;

int min(int a, int b){
  return a < b ? a : b;
}

int main(){
  int N1[N+1],N2[N+1][N+1];
  int i,j,k,l,n;
 
  scanf("%d",&n);
  for(i=1;i<=n;i++){
    scanf("%d %d",&N1[i-1],&N1[i]);
  }

  for(i=1;i<=n;i++)N2[i][i] = 0;
  for(l=2;l<=n;l++){
    for(i=0;i<=n-l+1;i++){
      j = i+l-1;
      N2[i][j] = (1<<21);
      for(k = i;k <= j-1;k++){
	N2[i][j] = min(N2[i][j],N2[i][k] + N2[k+1][j] + N1[i-1]*N1[k]*N1[j]);
      }
    }
  }

  printf("%d\n",N2[1][n]);
  
  return 0;
}

C++: #include <bits/stdc++.h>

#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)

using namespace std;

// data
const int MAX_N = 100;
int A[MAX_N][2]; // 0-col, 1-row
enum
{
    row, col
};

// dp
int dp[MAX_N+1][MAX_N]; // k number from A_i;
const int INF = 1 << 29;

int main(){
    int n; cin >> n;
    rep(i, n){
        cin >> A[i][row] >> A[i][col];
    }

    rep(k, n+1){
        rep(i, n){
            if (k <= 1)
                dp[k][i] = 0;
            else    
                dp[k][i] = INF;
        }
    }

    rep(k, n+1){
        rep(i, n){
            rep(j, k)
                dp[k][i] = min(dp[k][i], 
                    dp[j][i] + dp[k-j][i+j] + A[i][row]*A[i+j][row]*A[i+k-1][col]);
        }
    }

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

}

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

const int N=100;

int main(){
	int n;
	long m[N+1][N+1], p[N+1];
	
	scanf(" %d", &n);
	for(int i=1; i<=n; ++i)
		scanf(" %ld %ld", &p[i-1], &p[i]);
		
	for(int i=0; i<=n; ++i) printf("p[%d]=%ld\n", i, p[i]);
		
	for(int i=1; i<=n; ++i) m[i][i]=0;
	
	for(int s=2; s<=n; ++s){ //s??????????????????
		for(int i=1; i+s-1<=n; ++i){ //?§????i
			int j=i+s-1; //??????j
			m[i][j]=100000000; //????????§???????????§?????????
			for(int k=i; k<=j-1; ++k){ //?????????k
				m[i][j]=min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j]);
				//printf("go %d %d %d\n",i, j, k);
			}
		}
	}
	
	printf("%ld\n", m[1][n]);
}

C++: // Chain matrix multiplication (DP)

#include <algorithm>
#include <iostream>
#include <limits>
#include <vector>

using namespace std;
int main() {
  int n;
  cin >> n;

  int a, b;
  vector<int> A, B;
  while (cin >> a >> b) {
    A.push_back(a);
    B.push_back(b);
  }

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

  // len=0 => cost = 0, the default value
  for (int len = 1; len < n; ++len) {
    for (int i = 0; i < n - len; ++i) {
      int j = i + len;
      int best = numeric_limits<int>::max();
      for (int k = i; k < j; ++k) {
        best = min(best, cost[i][k] + cost[k + 1][j] + A[i] * B[k] * B[j]);
      }
      cost[i][j] = best;
    }
  }

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

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<<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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)

struct Matrix {
  int low;
  int col;
};

int main() {
  int n; cin >> n;
  vector<Matrix> l(n);
  rep(i, n) {
    int a, b; cin >> a >> b;
    l.at(i).low = a;
    l.at(i).col = b;
  }

  vector<vector<int>> dp(n, vector<int>(n));
  rep(i, n) {
    dp.at(i).at(i) = 0;
  }

  for (int j = 1; j<n; j++) {
    int i = j-1;
    while (i>=0) {
      int k = i;
      int mi = 100000000;
      while (k < j) {
        mi = min(mi, (l.at(i).low * l.at(k).col * l.at(j).col) + dp.at(i).at(k) + dp.at(k+1).at(j));
        k++;
      }
      dp.at(i).at(j) = mi;
      i--;
    }
  }
  cout << dp.at(0).at(n-1) << endl;
}

C++: #include<stdio.h>
#include<cstdlib>

#define INF 2147483647

int n;

void P(){
  printf("\ntest\n");
}

int min(int a, int b){
  return a < b ? a : b;
}

int matrixChainOrder(int *P, int p, int l){
  int i, j, k, m[100][100], q;
  for(i = 1; i < n+1; i++){
    m[i][i] = 0;
  }
  for(i = 1; i < n; i++){ // tonaridousi de keisan
    m[i][i+1] = P[i-1] * P[i] * P[i+1];
  }
  for(i = 2; i <= n-1; i++){ // habahirogeru
    for(j = 1; j+i <= n; j++){ // dokokarahajimerukakimeru
      q = INF;
      for(k = 0; k < i; k++){
	q = min(q, m[j][j+k] + m[j+k+1][j+i] + P[j-1] * P[j+k] * P[j+i]);
	//printf("i:%d j:%d k:%d\n", i, j, k);
      }
      m[j][j+i] = q;
    }
  }

  return m[p][l];
}

int main(){
  int i, *P;

  scanf("%d", &n);
  P = (int *)malloc(sizeof(int) * n + 1);
  for(i = 0; i < n; i++){
    scanf("%d %d", &P[i], &P[i+1]);
  }

  printf("%d\n" ,matrixChainOrder(P, 1, n));

  return 0;
}