hdu 1171 母函数 和 DP

#include<iostream>
#include<string.h>
using namespace std;
typedef struct
{
int v;
int m;
}P;
int c1[250010],c2[250010];
int main()
{
int n;
P a[110];
int sum;
int avg;
while (scanf("%d",&n)!=EOF&&n>0)
{
sum=0;
for(int i=1;i<=n;i++)   {scanf("%d%d",&a[i].v,&a[i].m);  sum+=(a[i].v*a[i].m); }
avg=sum/2;
memset(c1,0,sum*sizeof(c1[0]));
memset(c2,0,sum*sizeof(c2[0]));
for(int i=0;i<=a[1].m*a[1].v;i+=a[1].v)   { c1[i]=1; }
int count=a[1].m*a[1].v;
for(int i=2;i<=n;i++)
{
//count+=a[i-1].v*a[i-1].m;
for(int j=0;j<=count;j++)
{
for(int k=0;k<=a[i].m*a[i].v;k+=a[i].v)
{
c2[j+k]+=c1[j];
}
}
count+=a[i].v*a[i].m;
for(int j=0;j<=count;j++)    // 此处的 count 值为这次计算完后最大的指数值
{
c1[j]=c2[j];
c2[j]=0;
}
}
for(int i=avg;i>=0;i--)
{
if(c1[i]!=0)
{
printf("%d %d\n",sum-i,i);
break;
}
}
}
return 0;
}