Go: package main

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

type Matrix struct {
	r int // num of row
	c int // num of column
}

type Range struct {
	start int // index, inclusive
	end   int // index, inclusive
}

func calcMultiplication(x, y Matrix) (Matrix, int) {
	if x.c != y.r {
		panic("cannnot calculate")
	}
	return Matrix{x.r, y.c}, x.r * y.c * x.c
}

func calcMinMatrixChainMultiplication(matrices []Matrix, r Range, memo map[Range]int) (Matrix, int) {
	if v, ok := memo[r]; ok {
		return Matrix{matrices[0].r, matrices[len(matrices)-1].c}, v
	}
	if len(matrices) == 0 {
		panic("must not be empty")
	} else if len(matrices) == 1 {
		return matrices[0], 0
	} else if len(matrices) == 2 {
		return calcMultiplication(matrices[0], matrices[1])
	}

	var minCount int = math.MaxInt32

	for i := 0; i < len(matrices)-1; i++ {
		formerMatrices := matrices[:i+1]
		latterMatrices := matrices[i+1:]
		matF, countF := calcMinMatrixChainMultiplication(formerMatrices, Range{0, i}, memo)
		matL, countL := calcMinMatrixChainMultiplication(latterMatrices, Range{i + 1, len(matrices) - 1}, memo)
		_, countFL := calcMultiplication(matF, matL)
		count := countF + countL + countFL
		if count < minCount {
			minCount = count
		}
	}
	return Matrix{matrices[0].r, matrices[len(matrices)-1].c}, minCount
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	n, _ := nextInt(sc)
	matrices := make([]Matrix, n)
	for i := 0; i < n; i++ {
		r, _ := nextInt(sc)
		c, _ := nextInt(sc)
		matrices[i] = Matrix{r, c}
	}
	memo := make(map[Range]int)
	_, resultCount := calcMinMatrixChainMultiplication(matrices, Range{0, len(matrices) - 1}, memo)
	fmt.Println(resultCount)
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

C++: #ifdef BUILT_LOCAL

#include "niklib.h"

#endif

#include <iostream>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <string>
#include <cstdio>
#include <map>
#include <cmath>
#include <set>
#include <list>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
constexpr ll mod = 1000000007;

int n, r[100], c[100];
ll dp[101][101];

ll rec(int s, int t) {
    if (s + 1 == t) return 0;
    if (dp[s][t] == 0) {
        dp[s][t] = INT32_MAX;
        for (int i = s + 1; i < t; i++) {
            dp[s][t] = min(dp[s][t], rec(s, i) + rec(i, t) + r[s] * r[i] * c[t - 1]);
        }
    }
    return dp[s][t];
}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> r[i] >> c[i];
    cout << rec(0, n) << endl;
}

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

int min(int n1,int n2){
  if(n1>=n2) return n2;
  else return n1;
}

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(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[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j]);
      }
    }
  }
  
  printf("%d\n",m[i][n]+1000);
  
  return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define INFTY 2000000001
#define MAX 101

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

void mcm() {
  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; k++) {
        m[i][j] = min(m[i][j], m[i][k]+m[k+1][j]+p[i-1]*p[j]*p[k]);
      }
    }
  }
}

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

C++: #include<stdio.h>
#include<algorithm>
using namespace std;

#define N 100

int main(){

  int n, p[N + 1], m[N + 1][N + 1];
  int i, j, k, l;
  
  scanf("%d", &n);
  
  for(i = 1; i <= n; i++){
    scanf("%d", &p[i - 1]);
    scanf("%d", &p[i]);
  }
  
  for(i = 0; i <= n; i++){
    m[i][i] = 0;
  }
  
  for(l = 2; l <= n; l++){
    for(i = 1; i <= n - l + 1; i++){
      int 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]);
      }
    }
  }
  
  printf("%d\n", m[1][n]);
  
  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<n;i++)
#define rrep(i, n) for(int i=n;i>=0;i--)
#define MAX 100
#define INF 100000001
template<typename T>T chmin(T& a, T b){return a=(a<b)?a:b;}

using namespace std;
// Matrix chain
int matrixes[MAX+1];
int m[MAX+1][MAX+1];

int mco(int i, int j){
  if (m[i][j]!=INF) return m[i][j];
  for (int div=i;div<j;div++)
    chmin(m[i][j], mco(i, div)+mco(div+1, j)+ matrixes[i-1]*matrixes[div]*matrixes[j]);
  return m[i][j];
}

int main(){
  int n;
  scanf("%d", &n);
  rep(i, n)
    scanf("%d%d", matrixes+i,matrixes+i+1);

  for(int i=1;i<n+1;i++){
    for(int j=1;j<n+1;j++){
      m[i][j] = (i!=j)?INF:0;
    }
  }

  printf("%d\n", mco(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>
using namespace std;
typedef long long ll;
const ll INF = (1LL << 58);
int n;
int S[110];
ll C[110][110];

int main(void) {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int r, c;
        cin >> r >> c;
        S[i] = r; S[i + 1] = c;
    }

    n++;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) C[i][j] = INF;

    for (int i = 1; i <= n; i++) C[i][i] = 0;

    for (int j = 1; j <= n - 1; j++) {
        for (int i = 1; i <= n - j; i++) {
            for (int k = 1; k <= i + j; k++) {
                C[i][i + j]  = min(C[i][i + j], C[i][k - 1] + C[k][i + j] + S[i] * S[k] * S[i + j + 1]);
            }
        }
    }

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

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

int lcs(std::string x, std::string y) {
	int c[101][101];
	int m = x.size();
	int n = y.size();
	int maxl = 0;
	x = ' ' + x;
	y = ' ' + y;
	for (int i = 1; i <= m; i++) {
		c[i][0] = 0;
	}
	for (int i = 1; i <= n; i++) {
		c[0][j] = 0;
	}

	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) {
			if (x[i] == y[j]) {
				c[i][j] = c[i - 1][j - 1] + 1;
			} else {
				c[i][j] = std::max(c[i - 1][j], c[i][j - 1]);
			}
			maxl = std::max(maxl, c[i][j]);
		}
	}
	return maxl;
}


int main() {
	std::string s1, s2;
	int n;
	std::cin >> n;
	for (int i = 0; i < n; i++) {
		std::cin >> s1 >> s2;
		std::cout << lcs(s1, s2) << std::endl;
	}
	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;
}