Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Matrix-chain Multiplication

The goal of the matrix-chain multiplication problem is to find the most efficient way to multiply given $n$ matrices $M_1, M_2, M_3,...,M_n$.

Write a program which reads dimensions of $M_i$, and finds the minimum number of scalar multiplications to compute the maxrix-chain multiplication $M_1M_2...M_n$.

Input

In the first line, an integer $n$ is given. In the following $n$ lines, the dimension of matrix $M_i$ ($i = 1...n$) is given by two integers $r$ and $c$ which respectively represents the number of rows and columns of $M_i$.

Output

Print the minimum number of scalar multiplication in a line.

Constraints

$1 \leq n \leq 100$

$1 \leq r, c \leq 100$

Sample Input 1

6
30 35
35 15
15 5
5 10
10 20
20 25

Sample Output 1

15125

Solution in C# (judge verdict: Accepted)

using System;
using System.Linq;
using System.Collections.Generic;
using System.Text;


class B
{
    static int[,] m=new int[101,101];
    static int[] p=new int[101];
    public static void Main() {
        int n = int.Parse(System.Console.ReadLine());
        for(int i = 1; i <= n; i++) {
            string[] input = Console.ReadLine().Split(' ');
            p[i - 1] = int.Parse(input[0]);
            p[i] = int.Parse(input[1]);
        }
        matrixChainOrder(n);
        Console.WriteLine(m[1, n]);
    }
    static void matrixChainOrder(int n) {
        int j;
        for(int l = 2; l <= n; l++) {
            for(int i = 1; i <= n - l + 1; i++) {
                j = i + l - 1;
                m[i, j] = int.MaxValue;
                for(int k = i; k < j; k++) {
                    m[i, j] = Math.Min(m[i, j], m[i, k] + m[k + 1, j] + p[i - 1] * p[k] * p[j]);
                }
            }
        }
    }
}