Go: package main

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

const N = 100

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

func answer(reader io.Reader) string {
	sc := bufio.NewScanner(reader)
	sc.Split(bufio.ScanWords)

	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())

	var p [N]int
	var m [N + 1][N + 1]int
	for i := 1; i <= n; i++ {
		sc.Scan()
		p[i-1], _ = strconv.Atoi(sc.Text())
		sc.Scan()
		p[i], _ = strconv.Atoi(sc.Text())
	}

	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])
			}
		}
	}

	return fmt.Sprintf("%d", m[1][n])
}

func main() {
	fmt.Println(answer(os.Stdin))
}

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

static const int N = 1000;
#define INF (1 << 20)

int p[N];
int m[N][N];

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
    int n;scanf("%d",&n);
    vector<pair<int,int>> m(n);
    for(int i=0;i<n;i++)scanf("%d%d",&m[i].first,&m[i].second);
    int dp[n][n];
    fill(dp[0],dp[0]+n*n,1e9);
    for(int i=0;i<n;i++)dp[i][i]=0;
    for(int k=1;k<n;k++){
        for(int i=0;i<n-k;i++){
            int j=i+k;
            for(int l=i;l<j;l++){
                dp[i][j]=min(dp[i][j],dp[i][l]+dp[l+1][j]+m[i].first*m[l].second*m[j].second);
            }
        }
    }
    printf("%d\n",dp[0][n-1]);
    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 <bits/stdc++.h>
#define INF 1e9
using namespace std;


int main(){
  int n;
  cin>>n;
  int a[105];
  for(int i=1;i<=n;i++)cin>>a[i-1]>>a[i];

  int dp[105][105]={};
  for(int i=0;i<105;i++)
    for(int j=0;j<105;j++)dp[i][j]=INF*(i!=j);

  for(int l=0;l<n;l++){
    for(int i=0;i<n-l;i++){
      int j=i+l;
      for(int k=i;k<j;k++){
	dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+a[i]*a[k+1]*a[j+1]);
      }
    }
  }

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

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

using namespace std;
static const int N = 100;

#define INT_MIN     (-2147483647 - 1) /* minimum (signed) int value */
#define INT_MAX       2147483647    /* maximum (signed) int value */

void solve(vector<int> &data)
{
	vector<vector<int> > dp(N + 1, vector<int>(N + 1, 0));

	int nums = data.size() - 1;
	for (int len = 2; len <= nums; ++len)
	{
		for (int l = 1; l <= nums - len + 1; ++l)
		{
			int r = l + len - 1;
			dp[l][r] = INT_MAX;
			for (int m = l; m <= r - 1; ++m)
			{
				cout << len << " " << l << " " << r << endl;
				dp[l][r] = min(dp[l][r], dp[l][m] + dp[m+1][r] + data[l - 1] * data[m] * data[r]);
			}
		}
	}

	cout << dp[1][nums] << endl;
}

int main()
{
	int num; cin >> num;
	vector<int> data(num + 1);
	for (int i = 1; i <= num; ++i)
		cin >> data[i-1] >> data[i];

	solve(data);
}

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

static const int maxn=44;

int DP[45];

int Fibonacci(int n) {
  if (n==0 or n==1) {
    return DP[n]=1;
  }
  if (DP[n]!=(-1)) {
    return DP[n];
  }
  return DP[n]=Fibonacci(n-1)+Fibonacci(n-2);
}
int main() {
  std::ios::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  memset(DP,(-1),sizeof(DP));
  Fibonacci(maxn);
  int n;
  cin>>n;
  cout<<DP[n]<<endl;
  return 0;
}

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


int main()
{
    int n,p[101];
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>p[i-1]>>p[i];
    int m[100][100];
    for(int i=0;i<n;i++)
        m[i][i]=0;
    for(int len=2;len<=n;len++)
        for(int i=0;i<n-len+1;i++)
        {
            int j=i+len-1;
            m[i][j]=1<<20;
            for(int k=i;k<i+len-1;k++)
                m[i][j]=min(m[i][j],m[i][k]+m[k+1][j]+p[i]*p[k+1]*p[j+1]);
        }
    cout<<m[0][n-1]<<endl;
    return 0;

}

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

int main() {
  int n;
  cin >> n;
  
  vector<int> p(n + 1);
  for (int i = 0; i < n; i++) {
    cin >> p.at(i) >> p.at(i + 1);
  }
  
  vector<vector<int> > m(n + 1, vector<int> (n + 1));
  
  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;
}

C++: #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long

//----***型定義***----
using ll = long long;
using P = pair<int,int>;

//----***Like a Pythonista***----
#define REP(ii,jj,nn) for (ll ii=jj;ii<(nn);ii++)
#define RREP(ii,nn,jj) for (ll ii = nn; jj<ii;ii--)
#define each(i,...) for (auto&& i:__VA_ARGS__)
#define ALL(vec) (vec).begin(),(vec).end()
#define sum(...) accumulate(ALL(__VA_ARGS__),0LL)
#define dsum(...) accumulate(ALL(__VA_ARGS__),0.0)
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
template<class T> inline auto max(const T& a){ return *max_element(ALL(a)); }
template<class T> inline auto min(const T& a){ return *min_element(ALL(a)); }
inline ll gcd(ll a,ll b){if(b == 0) return a;return  gcd(b,a%b);}
inline ll lcm(ll a,ll b){ll g = gcd(a,b);return a / g * b;}

//----***定数***----
#define MOD 1000000007
#define INF 100000000000000000
#define EPS 1e-9
const vector<vector<int>> DXY={{-1,0},{1,0},{0,-1},{0,1}};

//----***パーツ***----
#define fr first
#define se second
#define pb push_back

//----***入出力***---
#define print(out) cout<< out  << "\n";
#define debug(var)  do{std::cerr << #var << " ↓ "<<"\n";view(var);}while(0);
#define dbg cerr<<"🥺🥺🥺🥺🥺🥺"<<endl;
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }

//----***初期時読み込み***----
struct initial{initial(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(15);};}initial_;

vector<vector<int>>dp(30,vector<int>(500,0));

signed main(){
  int N;cin>>N;
  vector<P> M(N);
  REP(i,0,N)cin>>M[i].fr>>M[i].se;
  vector<vector<int>> dp(N+1,vector<int>(N+1,INF));
  REP(i,0,N+1)dp[i][i]=0;

  REP(w,1,N)REP(i,0,N-w){
    int j=i+w;
    REP(k,i,j){
        int prod=M[i].fr*M[k].se*M[j].se;
        dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]+prod);
    }
  }
  print(dp[0][N-1])
}