MIXTURES  Mixtures
Harry Potter has n mixtures in front of him, arranged in a row. Each mixture has one of 100 different colors (colors have numbers from 0 to 99).
He wants to mix all these mixtures together. At each step, he is going to take two mixtures that stand next to each other and mix them together, and put the resulting mixture in their place.
When mixing two mixtures of colors a and b, the resulting mixture will have the color (a+b) mod 100.
Also, there will be some smoke in the process. The amount of smoke generated when mixing two mixtures of colors a and b is a*b.
Find out what is the minimum amount of smoke that Harry can get when mixing all the mixtures together.
Input
There will be a number of test cases in the input.
The first line of each test case will contain n, the number of mixtures, 1 <= n <= 100.
The second line will contain n integers between 0 and 99  the initial colors of the mixtures.
Output
For each test case, output the minimum amount of smoke.
Example
Input: 2 18 19 3 40 60 20 Output: 342 2400
In the second test case, there are two possibilities:
 first mix 40 and 60 (smoke: 2400), getting 0, then mix 0 and 20 (smoke: 0); total amount of smoke is 2400
 first mix 60 and 20 (smoke: 1200), getting 80, then mix 40 and 80 (smoke: 3200); total amount of smoke is 4400
The first scenario is a much better way to proceed.
hide comments
roopansh:
20170201 14:25:57
don't use "ios_base::sync_with_stdio(false);cin.tie(0);"


flyingduchman_:
20161224 14:26:04
It is a modified matrix chain multiplication(MCM) problem.


kira28:
20161219 18:18:15
Nice DP...


ov3rk1ll:
20161127 07:54:36
use scanf/printf got tle with cin/cout


shubham2305:
20161115 16:47:43
compliation error C++ 4.3.2 but ac c++14 

adichd123:
20160722 07:08:48
Nice question for learning MCM!! 

sonali9696:
20160717 23:11:29
while(scanf("%d",&n)) gives TLE as EOF returns EOF whose value is 1. Thus write while(scanf("%d",&n) > 0) OR while(scanf("%d",&n) == 1) OR while(scanf("%d",&n) != 1) Last edit: 20160717 23:13:32 

Aman Agarwal:
20160625 14:28:38
matrix chain multiplication ✌ Last edit: 20160625 14:29:12 

TP:
20160623 10:44:04
Must check for n=1 , it costs me a WA. Simple Dp :) 

try2catch:
20160120 10:38:45
Spoiler Alert!  "Solution"

Added by:  Tomek Czajka 
Date:  20050503 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 VB.NET 
Resource:  Purdue Programming Contest Training 