杭电1059

//简单的背包应用，奈何我摔了好几次
#include<stdio.h>
#include<string.h>
#define maxn 120000
int n[6];
int a[maxn];
int Room;
void zero_one_bag(int);
void complete_bag(int);
void multiple_bag(int,int);
int main()
{
    int ant=0;
    while(~scanf("%d%d%d%d%d%d",&n[0],&n[1],&n[2],&n[3],&n[4],&n[5]) && n[0]+n[1]+n[2]+n[3]+n[4]+n[5])
    {
        printf("Collection #%d:
",++ant);
        Room=n[0]*1+n[1]*2+n[2]*3+n[3]*4+n[4]*5+n[5]*6;
        if(Room%2)
            puts("Can't be divided.
");
        else
        {
            memset(a,0,sizeof a);
            a[0]=1;
            Room/=2;
            for(int i=0; i<6; ++i)
                if(n[i])
                    multiple_bag(i+1,n[i]);
            if(a[Room])
                puts("Can be divided.
");
            else
                puts("Can't be divided.
");
        }
    }
}

void zero_one_bag(int room)
{
    for(int i=Room; i>=room; --i)
    {
        if(a[i-room])
            a[i]=1;
    }
}

void complete_bag(int room)
{
    for(int i=room; i<=Room; ++i)
    {
        if(a[i-room])
            a[i]=1;
    }
}

void multiple_bag(int room,int num)
{
    if(room * num >= Room)
    {
        complete_bag(room);
        return ;
    }

    for(int k=1; k<num; k*=2)
    {
        zero_one_bag(room*k);
        num-=k;
    }
    zero_one_bag(room*num);
}