From c438baaf31cc1b33611b0b402dd56dc071063db4 Mon Sep 17 00:00:00 2001
From: Sanya Kumari <1701sanya@gmail.com>
Date: Thu, 11 Jun 2020 06:00:47 +0530
Subject: [PATCH] Create MIXTURES

---
 SPOJ/MIXTURES | 58 +++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 SPOJ/MIXTURES

diff --git a/SPOJ/MIXTURES b/SPOJ/MIXTURES
new file mode 100644
index 0000000..72fce5e
--- /dev/null
+++ b/SPOJ/MIXTURES
@@ -0,0 +1,58 @@
+#include <iostream>
+#include<climits>
+using namespace std;
+
+int a[1000];
+long long dp[1000][1000];
+
+long long sum(int s,int e){
+    long long ans = 0;
+    for(int i=s;i<=e;i++){
+        ans += a[i];
+        ans %= 100;
+    }
+    return ans;
+}
+
+long long solveMixtures(int i,int j){
+    //Base case
+    if(i>=j){
+        return 0;
+    }
+    
+    //If the answer already there
+    if(dp[i][j]!=-1){
+        return dp[i][j];
+    }
+    //We to break our expression at every possible k 
+    
+    dp[i][j] = INT_MAX;
+    for(int k=i;k<=j;k++){
+        dp[i][j] = min(dp[i][j], solveMixtures(i,k)+solveMixtures(k+1,j)+sum(i,k)*sum(k+1,j));
+    }
+    return dp[i][j];
+}
+
+
+int main() {
+    
+    int n;
+    
+    while((scanf("%d",&n))!=EOF){
+        
+        //Read N integers
+        for(int i=0;i<n;i++){
+            cin>>a[i];
+        }
+        
+        //Init dp with -1
+        for(int i=0;i<=n;i++){
+            for(int j=0;j<=n;j++){
+                dp[i][j] = -1;
+            }
+        }
+        cout<<solveMixtures(0,n-1)<<endl;
+        
+    }
+    
+}