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

Python: N = int(input())
R = [0]*N
C = [0]*N
for i in range(N):
    R[i], C[i] = map(int, input().split())

INF = 10**18
dp = [[INF]*N for i in range(N)]
for i in range(N):
    dp[i][i] = 0
for l in range(1, N):
    for i in range(N-l):
        a0 = R[i]
        c0 = C[i+l]
        dp[i][i+l] = min(a0*C[j]*c0 + dp[i][j] + dp[j+1][i+l] for j in range(i, i+l))
print(dp[0][N-1])

Python: def s():
 n=int(input())+1
 e=[input().split()for _  in[0]*~-n]
 p=[int(e[0][0])]+list(int(x[1])for x in e)
 m=[[0]*n for _ in[0]*n]
 for i in range(n):
  for r in range(n-i-1):
   c=r+i+1
   for j in range(r+1,c):
    x=m[r][j]+m[j][c]+p[r]*p[j]*p[c]
    if not 0<m[r][c]<=x:m[r][c]=x
 print(m[r][c])
if'__main__'==__name__:s()

Python: INFTY = 100 * 100 * 100 + 1  # 1 ≤ r,c ≤ 100


n = int(input())

p = [None for _ in range(n + 1)]
m = [[None] * (n + 1) for _ in range(n + 1)]

for i in range(n):
    r, c = map(int, input().split())

    if i == 0:
        p[0] = r

    p[i + 1] = c

def matrix_chain_multiplication():
    for i in range(1, n + 1):
        m[i][i] = 0

    for l in range(2, n + 1):
        for i in range(1, n - l + 1 + 1):
            j = i + l - 1
            m[i][j] = INFTY
            for k in range(i, j - 1 + 1):
                m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j])


matrix_chain_multiplication()
print(m[1][n])

Python: def main():
    n=int(input())
    lst=tuple(tuple(map(int,input().split())) for _ in range(n))

    dp=[[0]*n for _ in range(n)]
    for i in range(1,n):
        for j in range(0,n-i):
            dp[j][j+i]=dp[j+1][j+i]+lst[j][0]*lst[j][1]*lst[j+i][1]
            for k in range(1,i):
                nwork=dp[j][j+k]+dp[j+k+1][j+i]+lst[j][0]*lst[j+k][1]*lst[j+i][1]
                if dp[j][j+i]>nwork : dp[j][j+i]=nwork
    
    print(dp[0][n-1])

main()

Python: n = int(input())
c = [0]*(n+1)
c[0], c[1] = map(int, input().split())
for i in range(2, n+1):
    c[i] = int(input().split()[1])

dp = [[10**7]*(n+1) for i in range(n+1)]  # dp[i][j] <- M_i~M_j

for i in range(1, n+1):  # l=1
    dp[i][i] = 0

for l in range(2, n+1):  # l=j-i+1(length of chain)
    for i in range(1, n-l+2):
        j = i+l-1
        for k in range(i, j):  # kirutokoro
            dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j] + c[i-1]*c[k]*c[j])

print(dp[1][n])

Python: n = int(input())
RC = [list(map(int, input().split())) for _ in range(n)]
R = [RC[i][0] for i in range(n)]
C = [RC[i][1] for i in range(n)]

#n = 6
#R = [30, 35, 15, 5, 10, 20]
#C = [35, 15, 5, 10, 20, 25]

m = [[10**18]*(n+1) for _ in range(n+1)]
for i in range(n+1):
    m[i][i] = 0
    
for l in range(1, n):
    for i in range(1, n+1-l):
        m[i][i+l] = min([m[i][j] + m[j+1][i+l] + R[i-1]*C[j-1]*C[i+l-1] for j in range(i, i+l)])
        #print(i, i+l)
print(m[1][n])

Python: import sys
import itertools
# import numpy as np
import time
import math
import heapq
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10 ** 9 + 7

# map(int, input().split())
# list(map(int, input().split()))

N = int(input())
M = [0] * N
for i in range(N):
    M[i] = tuple(map(int, input().split()))

dp = [[INF] * (N) for _ in range(N)]
for i in range(N):
    dp[i][i] = 0

def rec(l, r):
    if dp[l][r] != INF:
        return dp[l][r]
    res = INF
    for mid in range(l, r):
        res = min(res, rec(l, mid) + rec(mid + 1, r) + M[l][0] * M[mid][1] * M[r][1])
    dp[l][r] = res
    return res
print(rec(0, N - 1))

Python: #!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


def mat_mul_opt(_mat_info):
    rc_info = list(map(int, _mat_info[0]))
    rc_info.extend(list(map(lambda x: int(x[1]), _mat_info[1:])))

    ans = [[0] * (mat_num + 1) for _ in range(mat_num + 1)]

    for l in range(1, mat_num):
        for i in range(1, mat_num - l + 1):
            j = i + l
            ans[i][j] = 1e7
            for k in range(i, j):
                ans[i][j] = min(ans[i][j], ans[i][k] + ans[k + 1][j] +
                                rc_info[i - 1] * rc_info[k] * rc_info[j])

    return ans[1][mat_num]


if __name__ == '__main__':
    _input = sys.stdin.readlines()
    mat_num = int(_input[0])
    mat_info = tuple(map(lambda x: x.split(), _input[1:]))
    # assert len(mat_info) == mat_num

    print(mat_mul_opt(mat_info))

Python: def Matrix_Chain_Multiplication(M, p, N):
    
    for l in range(2, N + 1):
        for i in range(1, N - l + 1 + 1):
            j = i + l - 1

            M[i][j] = 500000000

            for k in range(i , j):
                M[i][j] = min(M[i][j], M[i][k] + M[k + 1][j] + p[i - 1] * p[k] * p[j])
    
    return M[1][N]

def Main():
    N = int(input())

    p = [0 for i in range(N+1)]
    M = [[0]*(N+1) for i in range(N+1) ] 

    i = 0
    for n in range(N):
        r, c = map(int, input().split())

        if n == 0:
            p[i] = r
            i += 1
            p[i] = c
            i += 1
        else:
            p[i] = c
            i += 1

    print(Matrix_Chain_Multiplication(M, p, N))

Main()

Python: def matrixChainMultiplication(n):
    m = [[0 for x in range(n + 1)] for y in range(n + 1)]
    for l in range(2, n + 1):
        for i in range(1, n - l + 2):
            j = i + l - 1
            m[i][j] = 99000001
            for k in range(i, j):
                m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j])
    print(m[1][n])


p = []

n = int(input())

for i in range(n):
    listed_input = input().split()
    p.append(int(listed_input[0]))

p.append(int(listed_input[1]))

matrixChainMultiplication(n)

Python: #!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin


def main():
    num_mat = int(stdin.readline())
    data = [int(s) for s in stdin.readline().split()]
    for _ in range(num_mat-1):
        _, row = (int(s) for s in stdin.readline().split())
        data.append(row)
    num_dat = len(data)

    bin_op = tuple(data[i]*data[i+1]*data[i+2] for i in range(num_dat-2))
    parts = [(data[0]*data[1], data[-2]*data[-1]), bin_op]

    for j in range(3, num_mat):
        part = parts[-1]
        new_part = []
        for i in range(num_dat-j):
            a = data[i]
            b = data[i+1]
            c = data[i+j-1]
            d = data[i+j]
            new_part.append(min(part[i] + a*c*d, part[i+1] + a*b*d))
        parts.append(new_part)

    L = data
    print(min(parts[i][0] + parts[-(i+1)][-1] +
              L[0]*L[i+1]*L[-1] for i in range(len(parts))))


main()

Python: n=int(input())+1
e=[input().split()for _  in[0]*~-n]
p=[int(e[0][0])]+list(int(x[1])for x in e)
m=[[0]*n for _ in[0]*n]
for l in range(2,n):
 for i in range(1,n-l+1):
  j=i+l-1;m[i][j]=1e6
  for k in range(i,j):m[i][j]=min(m[i][j],m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j])
print(m[1][n-1])