ch 5e07多重背包

严重感觉二进制和单调队列的耗时差别不大（自我安慰）

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define IMAX 2147483646
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace::std;

int a[8],f[250000],len, num,mul;
int main() {
	while (scanf("%d%d%d%d%d%d", a + 1, a + 2, a + 3, a + 4, a + 5, a + 6)) {
		memset(f, 0, sizeof(f));
		len = 0;
		for (int i = 1; i <= 6; i++)len += i * a[i];
		if (len == 0)break;
		if (len % 2) {
			printf("Can't\n");
			continue;
		}
		f[0] = 1;
		for (int i = 1; i <= 6; i++) {
			num = a[i];
			for (int k = 1; num > 0; k <<= 1) {
				mul = min(k, num);
				for (int j = len; j >= i * mul; j--) 
					f[j] |= f[j - i * mul];
				num -= mul;
			}
		}
		if (f[len / 2])printf("Can\n");
		else printf("Can't\n");
	}

	return 0;
}