hdu 2844 Coins 多重背包 二进制优化 算是否能组成的背包

#include<stdio.h>
#include<string.h>
#define size 100010
#define csize 110
int dp[size];
int c[csize];
int num[csize];
int v;
int max(int a,int b)
{
return a>b?a:b;
}
void ZeroOnePack(int cost,int weight)
{
int i;
for(i=v;i>=cost;i--)
{
if(dp[i-cost]==1)
dp[i]=1;
}
}
void CompletePack(int cost,int weight)
{
int i;
for(i=cost;i<=v;i++)
if(dp[i-cost]==1)
dp[i]=1;
}
void MultiplePack(int cost,int weight,int amount)
{
if(cost*amount>=v)
{
CompletePack(cost,weight);
return;
}
int k=1;
while(k<amount)
{
ZeroOnePack(k*cost,k*weight);
amount=amount-k;
k=k*2;
}
ZeroOnePack(amount*cost,amount*weight);
}

int main()
{
int i,m,n;
while(scanf("%d %d",&n,&m)&&m+n!=0)
{
v=m;
memset(dp,0,sizeof(dp));
dp[0]=1;
for(i=0;i<n;i++)
scanf("%d",&c[i]);
for(i=0;i<n;i++)
scanf("%d",&num[i]);
for(i=0;i<n;i++)
{
MultiplePack(c[i],1,num[i]);
}
int count=0;
for(i=1;i<=m;i++)
{
if(dp[i]!=0)
count++;
}
printf("%d\n",count);
}
return 0;
}