HDU1171 Big Event in HDU, 모함수, 최종 템플릿

/*******************************************************************************
 # Author : Neo Fung
 # Email : [email protected]
 # Last modified: 2012-06-26 19:57
 # Filename: HDU1171 Big Event in HDU.cpp
 # Description : 
 ******************************************************************************/
#ifdef _MSC_VER
#define DEBUG
#define _CRT_SECURE_NO_DEPRECATE
#endif

#include <fstream>
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <string>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <functional>
#include <ctype.h>
using namespace std;

const int kMAX=250010;
const double kEPS=10E-6;
int ans[kMAX],tans[kMAX];

int main(void)
{
#ifdef DEBUG  
  freopen("../stdin.txt","r",stdin);
  freopen("../stdout.txt","w",stdout); 
#endif  

  int n,num[60],value[60];

  while(~scanf("%d",&n) && n>-1)
  {
		int sum=0;
		for(int i=1;i<=n;++i)
		{
			scanf("%d%d",&value[i],&num[i]);
			sum+=value[i]*num[i];
		}

	  memset(tans,0,sizeof(tans));
	  memset(ans,0,sizeof(ans));
		ans[0]=1;

		for(int i=1;i<=n;++i)
		{
			for(int j=0;j<=sum;++j)
				if(ans[j])
				{
					for(int k=0,remain=num[i]+1;k+j<=sum&& remain;k+=value[i],--remain)	// remain=num[i]+1， k 0 ， value[i] 
						tans[k+j]+=ans[j];
				}
			memcpy(ans,tans,sizeof(tans));
			memset(tans,0,sizeof(tans));
		}

		int tmp=sum/2;
		while(!ans[tmp]) --tmp;
		printf("%d %d
",sum-tmp,tmp);
  }

  return 0;
}