POJ1014 Diving bitset优化背包

dp小水题，结果我还WA了一遍qwq

#include <cstdio>
#include <bitset>
#define maxn 120010
using namespace std;
bitset<maxn> bit;
int a[20],tot,T;
void work(){
    bit.reset();
    bit[0]=1,tot/=2;
    for(int i=1;i<=6;i++){
        int k=1;
        while(a[i]-k>=0){
            bit|=bit<<(k*i);
            a[i]-=k;
            k<<=1;
            if(bit[tot]){printf("Can be divided.\n\n");return;}
        }
        if(a[i]) bit|=bit<<(a[i]*i);
    }
    printf("Can't be divided.\n\n");
}
int main(){
    while(1){
        tot=0;
        for(int i=1;i<=6;i++) scanf("%d",&a[i]),tot+=a[i]*i;
        if(!tot) break;
        printf("Collection #%d:\n",++T);
        if(tot&1) printf("Can't be divided.\n\n");
        else work();
    }
}