hdu 1171 母函數 之 再次探索

#include<stdio.h>#include<string.h>int c1[999999];int c2[999999];int val[999999];int num[999999];int main(){int i,j,t,s,n,k;while(scanf("%d",&n)!=EOF  && n>=0 ){memset(c1,0,sizeof(c1));memset(c2,0,sizeof(c2));memset(val,0,sizeof(val));memset(num,0,sizeof(num));s=0;for(i=1;i<=n;i++){scanf("%d%d",&val[i],&num[i]);s+=val[i]*num[i];}/*for(i=0;i<=s;i++){c1[i]=0;c2[i]=0;}*/c1[0]=1;for(i=1;i<=num[1];i++)c1[i*val[1]]=1;for(i=2;i<=n;i++){for(j=0;j<=s;j++)for(k=0;k<=val[i]*num[i];k+=val[i])c2[j+k]+=c1[j];for(j=0;j<=s;j++){c1[j]=c2[j];c2[j]=0;}} for (i=s/2;i>=0;i--)   {              if (c1[i]!=0)              {                  printf("%d %d\n",s-i,i);                  break;              }   }}return 0;}

值得注意的是代碼最後的輸出，因為s/2可能不能整除、