DP重点：多重背包+二进制优化

快做死人了这题。。。
1014:Dividing

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<queue>
#include<iomanip>
#include<stack>
#include<utility>
#include<set>
#include<map>
using namespace std;
typedef long long ll;

int dp[120005]; //多重背包问题，用二进制优化
//让一个人最多取一半的石子，看他能不能取到一半
//如果能，说明可以平分
int a[10];
int v[120005];
int num;

int main()
{
	int tot = 1;
	while (1)
	{
		int sum = 0;
		for (int i = 1; i <= 6; i++)
		{
			cin >> a[i];
			sum += a[i]*i;
		}
		int flag = 1;
		if (sum == 0) break;
		cout << "Collection #" << tot++ << ":" << endl;
		if (sum % 2 != 0) { 
			cout << "Can't be divided." << endl;
			cout << endl;
			continue;
		}
		num = 0;
		for (int i = 1; i <= 6; i++)
		{
			for (int j = 1; j <= a[i]; j *= 2)
			{
				v[++num] = j * i;//把j个i组成一组
				a[i] -= j;
			}
			if (a[i] > 0)
			{
				v[++num] = a[i] * i;
			}
		}
		memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= num; i++)
		{
			for (int j = sum / 2; j >= v[i]; j--)
			{
				dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
			}
		}
		if (dp[sum / 2] == sum / 2)
		{
			cout << "Can be divided." << endl;
		}
		else
		{
			cout << "Can't be divided." << endl;
		}
		cout << endl;
	}
	return 0;
}