hdu 1059 Dividing(优化的多重背包 可达可不达)

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int dp[60010],use[60010],sum;
int num[10];
//优化的多重背包
void solve()
{
	sum = sum>>1;
	memset(dp,0,sizeof(dp));
	dp[0] = 1;

	for(int i = 1; i <= 6; i++)
	{
		if(num[i] > 0)
		{
			memset(use,0,sizeof(use));
			for(int j = i; j <= sum; j++)
			{
				if(dp[j-i] && !dp[j] && use[j-i] < num[i])
				{
					dp[j] = 1;
					use[j] = use[j-i]+1;
				}
			}
		}
	}

	if(dp[sum]) printf("Can be divided.\n\n");
	else printf("Can't be divided.\n\n");
}

int main()
{
	int item = 1;
	while(~scanf("%d %d %d %d %d %d",&num[1],&num[2],&num[3],&num[4],&num[5],&num[6]))
	{
		if(num[1]==0&&num[2]==0&&num[3]==0&&num[4]==0&&num[5]==0&&num[6]==0) break;

		sum = 0;
		for(int i = 1; i <= 6; i++)
			sum += num[i]*i;
		if(sum%2 != 0)
		{
			printf("Collection #%d:\nCan't be divided.\n\n",item++);
			continue;
		}
		else
		{
			printf("Collection #%d:\n",item++);
			solve();
		}

	}
	return 0;
}