Go: package main

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

func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

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

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	n := nextInt(sc)

	P := make([]int, n+1)
	for i := 1; i <= n; i++ {
		l := nextInt(sc)
		P[i-1] = l
		m := nextInt(sc)
		P[i] = m
	}

	matrix := make([][]int, n+1)
	for i := 0; i < n+1; i++ {
		matrix[i] = make([]int, n+1)
	}

	for l := 2; l <= n; l++ {
		for i := 1; i <= n - l + 1; i++ {
			j := i + l - 1
			matrix[i][j] = (1 << 21)
			for k := i; k <= j-1; k++ {
				matrix[i][j] = min(matrix[i][j], matrix[i][k] + matrix[k+1][j] + P[i-1] * P[k] * P[j])
			}
		}
	}
	fmt.Println(matrix[1][n])
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <stdlib.h>
#include <math.h>
#define MAX 100
void min(int,int);
int p[MAX]={},m[MAX][MAX]={};

void min(int n1,int n2){
  if(n1>n2) n1=n2;
}
    
int main()
{
  int n,r,l,i,j,k;

  scanf("%d",&n);

  for(i=1;i<=n;i++){
    scanf("%d %d",&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++){
	min(m[i][j],m[i][k]+m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j]);
      }
    }
  }

  printf("%d\n",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 << 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<vector>
using namespace std;

int min_ex_o(int a,int b){
  if((a==0)||(b==0)){
    return a>b?a:b;
  }else{
    return a>b?b:a;
  }
}
int main(){
  vector<int> rc;
  vector<vector<int> > mm;
  int n;

  cin >> n;
  rc.resize(n+1);
  mm.resize(n+1);
  for(int i=0;i<n+1;i++){
    mm[i].resize(n+1);
  }
  for(int i=1;i<=n;i++){
    mm[i][i]=0;
  }
  for(int i=1;i<=n;i++){
    cin >> rc[i-1] >> rc[i];
  }

  for(int l=2;l<=n;l++){
    for(int i=1;i<=n-l+1;i++){
      int j=i+l-1;
      for(int k=i;k<=j-1;k++){
        mm[i][j]=min_ex_o(mm[i][j],mm[i][k]+mm[k+1][j]+rc[i-1]*rc[k]*rc[j]);
      }
    }
  }

  cout << mm[1][n] << endl;
}

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

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



	int dp[n][n];

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

	int p[n + 1];

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


	// |--**+-|

	// |+*---| l = 2, i = 0, j=0 : p(0) * P(1) * P (2)
	// |-+*--| l = 2, i = 1, j = 1 : p(1) * p(2) * p (3); p (i) * p(j+1) * p(i+l+1)
	// |---+*| l = 2, i = 1, j = 2
	// |-++*-| l = 3, i = 1, j = 3 : p(1) * p(3) * p(4)
	// |-****| 

	// 1 2 3   1 * 2 * 3

	for (int l = 2; l <= n; l++) {
		for (int i = 0; i < n - l + 1; i++) {
			int min = INT_MAX;
			for (int j = i; j < i + l - 1;j++ ) {
				int t = dp[i][j] + p[i] * p[j + 1] * p[i + l] + dp[j+1][i + l - 1];
				if (t < min) {
					min = t;
				}
			}
			dp[i][i + l - 1] = min;
			//cout << "i:" << i << " j:" << i + l - 1 << " max:" << min << endl;
		}
	}

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

C++: #include <iostream>
using namespace std;
int n, r[111], c[111], dp[111][111];
int main() {
	cin >> n;
	for(int i = 0; i < n; i++) cin >> r[i] >> c[i];
	for(int i = 2; i <= n; i++) {
		for(int j = 0; j <= n - i; j++) {
			int l = j, r = j + i; // [l, r)
			dp[l][r] = 999999999;
			for(int k = l + 1; k < r; k++) {
				dp[l][r] = min(dp[l][r], dp[l][k] + dp[k][r] + r[l] * c[r]);
			}
		}
	}
	cout << dp[0][n] << endl;
}

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;
}