You are viewing a single comment's thread. Return to all comments →
int main() { long long int a[MAX][MAX],n,i,j,k,x,temp=0,b; cin>>n; a[0][0]=0; a[1][0]=1; for(i=2;i<=n;i++) temp=i/2; b=a[i-1][temp]; { for(j=0,k=j;j
Why it is showing output as: 0 0 0 0 0 0
Project Euler #103: Special subset sums: optimum
You are viewing a single comment's thread. Return to all comments →
int main() { long long int a[MAX][MAX],n,i,j,k,x,temp=0,b; cin>>n; a[0][0]=0; a[1][0]=1; for(i=2;i<=n;i++) temp=i/2; b=a[i-1][temp]; { for(j=0,k=j;j
Why it is showing output as: 0 0 0 0 0 0