MCM

#include<iostream>
using namespace std;

int MCM(int p[7],int n)
{
    int m[n][n];
    int q,i,j,k,l;
    for(i=1;i<n;i++){
        m[i][i]=0;
    }
    for(int l=2;l<n;l++){
       for(int i=1;i<n-l+1;i++){
           j=i+l-1;
        m[i][j]=10000000;
       for(int k=i;k<=j-1;k++){
         q=m[i][k]+m[k+1][j]+p[i-1]*p[k]*p[j];
         if(q<m[i][j]){
             m[i][j]=q;
            //s[i][k]=k;
         }
       }
       }
    }

    return m[1][n-1];
}

int main(){
    int p[]={30,35,15,5,10,20,25};
    int n=7;
    int ans=MCM(p,n);
    cout<<"Minimum number of multiplications :"<<ans<<endl;

return 0;
}