hdu1171Big Event in HDU

题目：点击打开链接

#include<stdio.h>
#include<string.h>
struct node{
int v,u;
}num[1010];
int c1[100010],c2[100010];
int main()
{
int n,i,j,k,sum,use;
while(~scanf("%d",&n))
{
if(n<0)
break;
sum=0;
for(i=1;i<=n;i++)
{
scanf("%d%d",&num[i].v,&num[i].u);
sum+=num[i].v*num[i].u;
}
memset(c1,0,sizeof(c1));
memset(c2,0,sizeof(c2));
c1[0]=1;
for(i=num[1].v;i<=num[1].v*num[1].u;i+=num[1].v)
c1[i]=1;
for(i=2;i<=n;i++)
{
for(j=0;j<=sum/2;j++)
for(k=0;j+k<=sum/2&&k<=num[i].v*num[i].u;k+=num[i].v)
c2[j+k]+=c1[j];
for(j=0;j<=sum/2;j++)
{
c1[j]=c2[j];
c2[j]=1;
}
}
for(i=sum/2;i>=0;i--)
if(c1[i])
{
printf("%d %d\n",sum-i,i);
break;
}
}
return 0;
}