2HnfuJ - Online IDE & Debugging Tool

#include<iostream>
#include<string>
#include<unordered_map>
#include<vector>
#include<climits>
using namespace std;

vector<vector<int>>dp;


int color_mix(vector<int>ans,int i,int j){
  if(dp[i][j]!=-1) return dp[i][j];
  if(i==j) return 0;
  if(j==i+1) return ans[i]*ans[j];
      int ele=INT_MAX;

    for(int k=i;k<j;k++){
      int f1=color_mix(ans,i,k);
      int f2=color_mix(ans,k+1,j);
      int sum_1=0;
      int sum_2=0;

      for(int a=i;a<=k;a++)  sum_1=(sum_1+ans[a])%100;

      for(int b=k+1;b<=j;b++)  sum_2=(sum_2+ans[b])%100;

      int f3=sum_1 * sum_2;
      ele=min(ele,f1+f2+f3);

    }
  return dp[i][j]=ele;

}


int main(){
int c;
  cin>>c;
vector<int>ans;
  while(c){
    int e;
    cin>>e;
    ans.push_back(e);
    c--;
  }
  int arr_size=ans.size();


dp.assign(arr_size+1,vector<int>(arr_size+1,-1));
   cout<< color_mix(ans,0,arr_size-1)<<endl;

}