POJ-1014 多重背包

#include<cstdio>
#include<cstring>
#define max(a, b) (a > b ? a : b)

int a[10], sum, dp[10005 * 6];

int main() {
	int cnt = 0;
	while(true) {
		cnt++;
		sum = 0;
		memset(dp, 0, sizeof(dp));
		for(int i = 1; i <= 6; i++) {
			scanf("%d",&a[i]);
			sum += a[i] * i;
		}
		if(sum == 0) break;
		if(sum & 1) {
			printf("Collection #%d:\nCan't be divided.\n\n", cnt);
			continue;
		}
		sum /= 2;
		dp[0] = 0;
		for(int i = 1; i <= 6; i++) {
			for(int k = 1; k <= a[i]; a[i] -= k, k <<= 1) {
				for(int j = sum; j >= k * i; j--) {
					dp[j] = max(dp[j], dp[j - k * i] + k * i);
				}
			}
			if(a[i]) {
				for(int j = sum; j >= a[i] * i; j--) {
					dp[j] = max(dp[j], dp[j - a[i] * i] + a[i] * i);
				}
			}
		}
		printf("Collection #%d:\n", cnt);
		if(dp[sum] == sum) printf("Can be divided.\n\n");
		else printf("Can't be divided.\n\n");
	}
}