Big Event in HDU HDU - 1171（母函数）

mdzz，不知道为什么最后判断系数>0不行，要用非等于0。

/*痛みを受け取れ，痛みを知れ*/
#include<bits/stdc++.h>
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ff(i,a,b) for(register int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
const ll mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double tiaohe = 0.57721566490153286060651209;
ll oula(ll x) { ll res = x;f(i, 2, x / i) { if (x % i == 0) { res = res / i * (i - 1);while (x % i == 0) x /= i; } }if (x > 1) res = res / x * (x - 1);return res; }
ll quickmod(ll a, ll n, ll m) { ll s = 1;while (n) { if (n & 1) { s = s * a % m; }a = (a*a) % m;n = n / 2; }return s; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
void ex_gcd(ll a, ll b, ll &x, ll &y, ll &d) { if (!b) { d = a, x = 1, y = 0; } else { ex_gcd(b, a % b, y, x, d);y -= x * (a / b); } }
ll inv(ll t, ll p) { ll d, x, y;ex_gcd(t, p, x, y, d);return d == 1 ? (x % p + p) % p : -1; }
bool isPrime(ll x) { if (x == 2)return true;if (x % 2 == 0)return false;for (ll i = 2;i*i <= x;i++) if (x % i == 0)return false; return true; }
//double a = log(n) +tiaohe + 1.0 / (2 * n);
double eqa = (1 + sqrt(5.0)) / 2.0;
const int N = 55,M=250010;
int mx,n,w[N],num[N];
ll a[M+1],b[M+1];
int main()
{
	//freopen("in.txt", "r", stdin);
	while (cin >> n)
	{
		if (n <0)break;
		f(i, 1, n)scanf("%d%d", &w[i], &num[i]);

		a[0] = 1;
		int last = 0;
		f(i, 1, n)//枚举每个价值的母函数
		{
			int last2 = last + w[i] * num[i];//当前上界
			f(j, 0, last2)b[j] = 0;
			for (int j = 0;j <= num[i];j++)
			{
				for (int k = 0;k <= last;k++)//last是上次更新的上界
					b[j*w[i] + k] += a[k];//j*w[i]是母函数中的系数
			}
			f(j, 0, last2)a[j] = b[j];
			last = last2;
		}
		for (int j = last / 2;j >= 0;j--)
			if(a[j]) { printf("%d %d\n", last - j, j);break; }
	}
	return 0;
}