HDU 1171 Big Event in HDU

Big Event in HDU

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27176 Accepted Submission(s): 9580


Problem Description
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002.
The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).


Input
Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different.
A test case starting with a negative integer terminates input and this test case is not to be processed.


Output
For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.


Sample Input
2
10 1
20 1
3
10 1
20 2
30 1
-1


Sample Output
20 10

40 40

唉，，一到很好写的母函数的题，卡在清空数组上好长时间了。这道题如果不清空数组会影响到下一组测试数据！

#include <iostream>
#include <cstdio>
#include <memory.h>
using namespace std;

int a[100000],b[100000];

void mother(int i,int num,int n)
{//i代表第i个元素，第i个元素的数量有num个，需要计算的最大指数n
    for(int j=0;j<=n;j++)
        for(int k=0;k<=num&&k*i+j<=n;k++)
        b[k*i+j]+=a[j];
    for(int j=0;j<=n;j++)
    {
        a[j]=b[j];
        b[j]=0;
    }
}
int main(void)
{
    //freopen("D.txt","r",stdin);
    int n;
    int c1[100];
    int c2[100];
    while(scanf("%d",&n),n!=-1)
    {
         int sum=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&c1[i],&c2[i]);
            sum+=c1[i]*c2[i];
           // a[c1[i]]=1;
        }
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        a[0]=1;
            int ans1=sum/2;
        for(int i=1;i<=n;i++)
            mother(c1[i],c2[i],ans1);
          //  for(int i=0;i<=sum;i++)
         //   printf("%d\n",a[i]);
           // continue;
         //  for(int i=1;i<=ans1;i++)
           // printf("%d\n",a[i]);
         for(int i=ans1;i>=0;i--)
         {
             if(a[i])
             {
                  printf("%d %d\n",sum-i,i);
                  break;
             }
         }
    }

    return 0;
}