hdu1059

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
//#define maxx(a,b) (a>b?a:b)
using namespace std;
int a[10],w[100005],dp[100005];
int main(){
int i,j,sum,cur,temp;
cur=1;
while(scanf("%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5])!=EOF,a[0]+a[1]+a[2]+a[3]+a[4]+a[5]){
memset(dp,0,sizeof(dp));
sum=temp=0;
for(i=0;i<6;i++){
sum+=(a[i]*(i+1));
for(j=1;j<=a[i];j<<=1){
w[temp++]=j*(i+1);
a[i]-=j;
}
if(a[i]>0)
w[temp++]=a[i]*(i+1);                   //二进制分解，我推荐看下面这个博客
}                                           //http://blog.csdn.net/lyhvoyage/article/details/8545852
printf("Collection #%d:\n",cur++);
if(sum%2){                                  //sum为奇数时直接输出，并且不要忘记输出
printf("Can't be divided.\n\n");        //Collection #%d:这句话
continue;
}
sum/=2;
for(i=0;i<temp;i++)                         //之后就可以转换问为01背包求解
for(j=sum;j>=w[i];j--)
dp[j]=max(dp[j],dp[j-w[i]]+w[i]);
if(dp[sum]==sum)
printf("Can be divided.\n\n");
else
printf("Can't be divided.\n\n");
}
return 0;
}