Go: package main

/*
連鎖行列積
*/

import (
	"bufio"
	"bytes"
	"fmt"
	"log"
	"math"
	"os"
	"strconv"
	"strings"
)

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

type mem *[][]int

func main() {
	scanner := makeScanner(1024)
	n := eGetInt(scanner)
	p := make([]int, n+1)
	for i := 0; i < n; i++ {
		rowcol := eGetInts(scanner)
		p[i] = rowcol[0]
		p[i+1] = rowcol[1]
	}
	m := make([][]int, n)
	for i := 0; i < n; i++ {
		m[i] = make([]int, n)
	}
	// 初期値の格納
	for i := 0; i < n; i++ {
		for j := i; j < n; j++ {
			if i == j {
				m[i][j] = 0 //  同じ行列へのコストは当然0
			} else {
				m[i][j] = math.MaxInt64
			}
		}
	}

	// num : 行列の数. num == 1の場合は初期値0を格納ずみ
	for num := 2; num <= n; num++ {
		// s : スタート行列番号
		for s := 0; s+num <= n; s++ {
			// t : 終了行列番号
			t := s + num - 1
			// k : 仕切
			for k := s; k < t; k++ {
				m[s][t] = min(m[s][t], m[s][k]+m[k+1][t]+p[s]*p[k+1]*p[t+1])
			}
		}
	}
	fmt.Println(m[0][n-1])
}

////////////////////////////////////////////////////////////////////////////////
// ライブラリ
////////////////////////////////////////////////////////////////////////////////
func makeScanner(maxByte int) *bufio.Scanner {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Buffer(make([]uint8, 0, 8192), maxByte)
	return scanner
}
func makeWordScanner() *bufio.Scanner {
	scanner := makeScanner(8192)
	scanner.Split(bufio.ScanWords)
	return scanner
}
func eGetLine(r *bufio.Scanner) string {
	if r.Scan() {
		return r.Text()
	}
	err := r.Err()
	if err != nil {
		log.Fatal(err)
	}
	// EOF
	return ""
}
func eGetInt(r *bufio.Scanner) int {
	line := eGetLine(r)
	return eAtoi(line)
}
func eGetFields(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Fields(line)
}
func eGetInts(r *bufio.Scanner) []int {
	fields := eGetFields(r)
	ints := make([]int, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoi(fields[i])
	}
	return ints
}
func eGetChars(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Split(line, "")
}
func eAtoi(s string) int {
	n, err := strconv.Atoi(s)
	if err != nil {
		log.Fatal(err)
	}
	return n
}

type ints []int

func (s ints) String() string {
	var buf bytes.Buffer
	buf.WriteString("[")
	sep := ""
	for _, v := range s {
		buf.WriteString(fmt.Sprintf("%s%d", sep, v))
		sep = ", "
	}
	buf.WriteString("]")
	return buf.String()
}

func reverse(a ints) ints {
	r := make(ints, len(a))
	for i := 0; i < len(a); i++ {
		r[i] = a[len(a)-1-i]
	}
	return r
}
func max(a ints) (int, bool) {
	if len(a) == 0 {
		return 0, false
	}
	m := a[0]
	for _, e := range a {
		if e > m {
			m = e
		}
	}
	return m, true
}

// func min(a []int) int {
// 	m := a[0]
// 	for _, v := range a {
// 		if v < m {
// 			m = v
// 		}
// 	}
// 	return m
// }

func sum(a ints) int {
	if len(a) == 0 {
		return 0
	}
	sum := 0
	for _, e := range a {
		sum += e
	}
	return sum
}
func find(n int, a ints) int {
	for i, v := range a {
		if n == v {
			return i
		}
	}
	return -1
}

C++: #include <bits.stdc++.h>
#define MAX 100
using namespace std;

int M[MAX][MAX];
int P[MAX][MAX];
int main(){
  int n;
  cin >> n;
  for(i = 1; i <= n; i++){
    cin >> P[i-1] >> P[i];
  }
  Ans = matrixChainMultiplication();
  return 0;
}


int matrixChainMultiplication(){
  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] = INFINITY;
  }
  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 M[i][j];
}

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

struct Mat{
	  int r,l;
};

int main(){

	  int n; cin >> n;
	  vector<Mat> Mats(n);
	  for(int i=0; i<n; i++)
			cin >> Mats[i].r >> Mats[i].l;

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

	  for(int k=1; k<n; k++){
			for(int i=0; i+k<n; i++){
				  for(int j=i; j<i+k; j++){
						int num_prod = Mats[i].r * Mats[j+1].r * Mats[i+k].l;
						dp[i][i+k] = min(dp[i][i+k], dp[i][j] + dp[j+1][i+k] + num_prod);
				  }
			}
	  }
	  
	  cout << dp[0][n-1] << endl;
	  
			
}

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

using namespace std;


int main(){
	int n,minimum,tmp;
	scanf("%d",&n);
	int table[n][n];
	int data[n][2];

	for(int i=0;i<n;i++){
		for(int k=0;k<n;k++)table[i][k] = 0;
		scanf("%d %d",&data[i][0],&data[i][1]);
	}

	for(int i=n-2;i>=0;i--){
		for(int k=0;k<=i;k++){
			if(i==n-2){
				table[n-i-1][k] = data[k][0]*data[k][1]*data[k+1][1];
		}else{
				minimum = 2147483647;
				for(int p=0;p<=n-i-2;p++){
					tmp=(table[p][k]+table[n-i-p-2][k+p+1])+(data[k][0]*data[k+p][1]*data[k+n-i-1][1]);
					minimum = min(minimum,tmp);
				}
				table[n-i-1][k] = minimum;
			}
		}
	}

	printf("%d\n",table[n-1][0]);

    return 0;
}

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

int matrixChainOrder(vector<int> &p){
  auto n = p.size() - 1;
  int mat[n + 1][n + 1];
  for(auto i = 1; i <= n; i++){
    mat[i][i] = 0;
  }

  for(auto l = 2; l <= n; l++){
    for(auto i = 1; i <= n - l + 1; i++){
      auto j = i + l - 1;
      mat[i][j] = 1000000;

      for(auto k = i; k <= j - 1; k++){
        auto q = mat[i][k] + mat[k + 1][j] + p[i - 1] * p[k] * p[j];
        if(q < mat[i][j]){
          mat[i][j] = q;
        }
      }

    }
  }


  return mat[1][n];
}

int main(){
  int n;
  cin >> n;

  vector<int> mat(n + 1);
  for(auto i = 1; i <= n; i++){
    cin >> mat[i - 1] >> mat[i];
  }

  cout << matrixChainOrder(mat) << endl;

  return 0;
}

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

struct mat {
	int r, c;
	
	mat(int rv,int cv)
		:r{ rv }, c{ cv }{}
	mat() :r{}, c{} {}
	friend auto
		operator >> (std::istream&is, mat& m)->std::istream& {
		return
			is >> m.r >> m.c;
	}
};


using ui = unsigned int;
int main() {

	/*
	for (int l{ 2 }; l < 6; ++l) {

		for (int i{ 1 }; i < 6 - l + 1; ++i) {

			int j = i + l - 1;
			std::cout << "[ i, j ] = ( " << i << ", " << j << " ) >> k:";

			for (int k = i; k < j ; ++k)
				std::cout << " " << k;
			
			std::cout << "\n";
		}
		std::cout << std::endl;
	}*/
	

	int n;
	std::cin >> n;


	using ull = unsigned long long;
	using vu_t = std::vector<ull>;
	std::vector<vu_t> tab( n+1, vu_t(n+1, 0) );

	std::vector<mat> mv(n);
	for (auto&e : mv)
		std::cin >> e;

	
//	for (int i{}; i < n - 1; ++i) {
//		tab[i][i + 1] = mv[i].r * mv[i].c * mv[i + 1].c;
	//	std::cout << tab[i][i + 1] << " ";
//	}
	//std::cout << "\n";
	

	
	
	for (int l{ 2 }; l <= n; ++l) {
		for (int i{ 1 }; i <= n - l + 1; ++i) {
			ull t = (1 << 21);
			auto j = i + l - 1;
			for (int k{ i }; k <= j-1; ++k) {

				auto tt = tab[i][k] + tab[k + 1][j];
				auto c = mv[i-1].r * mv[k-1].c * mv[j-1].c;
				//std::cout << tt + c << "\t=\t" << tt << " + " << c << "\n";
				//std::cout << i << " " << k << " " << j << "\n";
				t = std::min(tt + c, t);
			}
			tab[i][j] = t;
		}
	}


//	for (const auto& e : tab) {
//		for (const auto&ee : e) {
//			std::cout << ee << "\t";
//		}std::cout << "\n";
//	}

//	put();
	std::cout << tab[1][n] << "\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+=2) 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; 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;
}