HDU-1059-Dividing

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn=120001;
int dp[maxn],a[7],sum;
void CompletePack(int cost)
{
for(int i=cost;i<=sum;i++)
dp[i]=max(dp[i-cost]+cost,dp[i]);
}
void ZeroOnePack(int cost)
{
for(int i=sum;i>=cost;i--)
dp[i]=max(dp[i-cost]+cost,dp[i]);
}
void Multiplay(int cost,int amount)
{
if(cost*amount>=sum)
CompletePack(cost);
else
{
int k=1;
while(k<amount)
{
ZeroOnePack(k*cost);
amount-=k;
k<<=1;
}
}
ZeroOnePack(amount*cost);
}
int main()
{
int cas=1;
while(scanf("%d",&a[1])!=EOF)
{
sum=a[1];
memset(dp,0,sizeof(dp));
for(int i=2;i<=6;i++)
{
scanf("%d",&a[i]);
sum+=a[i]*i;
}
if(!sum)
break;
printf("Collection #%d:\n",cas++);
if(sum&1)
printf("Can't be divided.\n");
else
{
sum/=2;
for(int i=1;i<=6;i++)
Multiplay(i,a[i]);
if(dp[sum]==sum)
printf("Can be divided.\n");
else
printf("Can't be divided.\n");
}
printf("\n");
}
return 0;
}