【多重背包】HDU 1059

#define N 10
int num[N];
int dp[120010];
int V;//容量
void zeroone(int cost,int val){//费用，价值
    int i;
    for(i=V;i>=cost;i--){
        if(dp[i]<dp[i-cost]+val){
            dp[i] = dp[i-cost]+val;
        }
    }
}
void complete(int cost,int val){//费用，价值
    int i;
    for(i=cost;i<=V;i++){
        if(dp[i]<dp[i-cost]+val){
            dp[i] = dp[i-cost]+val;
        }
    }
}
void multi(int cost,int val,int cnt){//费用，价值，数量
    if(cost*cnt>=V){
        complete(cost,val);
        return ;
    }
    int k = 1;
    while(k<cnt){
        zeroone(k*cost,k*val);
        cnt -= k;
        k *= 2;
    }
    zeroone(cnt*cost,cnt*val);
}
int main(){
    int n;
    int i,j;
    int ca=1;
    while(1){
        bool ok = 0;
        int sum=0;
        memset(dp,0,sizeof(dp));
        for(i=1;i<=6;i++){
            scanf("%d",&num[i]);
            sum += i*num[i];
            if(num[i])ok=1;
        }
        if(!ok)break;
        V = sum/2;//cout<<sum<<endl;
        printf("Collection #%d:\n",ca++);
        if(sum&1){
            puts("Can't be divided.");
            puts("");
            continue;
        }
        for(i=1;i<=6;i++){
            multi(i,i,num[i]);
        }
        if(dp[V] != V)puts("Can't be divided.");
        else puts("Can be divided.");
        puts("");
    }
    return 0;
}