pku 1014 Dividing dp 多重背包

还是比较简单的一题，只是将num[j]=num[j-i]+1;写成了num[i]=num[j-i]+1;WA了无数次，终于发现错误了

#include<stdio.h>
#include<string.h>
#define max 60010
int dp[max];
int num[max];
int n[7];
int main(){
    int i,j;
    int sum,cas=0;
    while(scanf("%d%d%d%d%d%d",&n[1],&n[2],&n[3],&n[4],&n[5],&n[6])){
        if(n[1]==0&&n[2]==0&&n[3]==0&&n[4]==0&&n[5]==0&&n[6]==0)
            break;
        sum=n[1]*1+n[2]*2+n[3]*3+n[4]*4+n[5]*5+n[6]*6;
        if(sum%2==1){
            printf("Collection #%d:/nCan't be divided./n/n",++cas);
            continue;
        }
        sum/=2;
        memset(dp,0,sizeof(dp));
        dp[0]=1;
        for(i=1;i<=6;i++){
            memset(num,0,sizeof(num));
            for(j=i;j<=sum;j++){
                if(dp[j]==0&&dp[j-i]==1&&(num[j-i]+1<=n[i])){
                    dp[j]=1;
                    num[j]=num[j-i]+1;
                }   
            }
        }
        if(dp[sum]==1)
             printf("Collection #%d:/nCan be divided./n/n",++cas);
        else
             printf("Collection #%d:/nCan't be divided./n/n",++cas);

        }
   
    return 0;
 }