多重背包问题:
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define LLEN 60005
int main() {
int n[7];
int cse = 1;
int flag = 0;
while(scanf("%d%d%d%d%d%d", &n[1], &n[2], &n[3], &n[4], &n[5], &n[6]) != EOF) {
if(n[1] == 0 && n[2] == 0 && n[3] == 0 && n[4] == 0 && n[5] == 0 && n[6] == 0) {
break;
}
int f[LLEN], value[LLEN], size[LLEN];
int ans = 0;
int k, count;
for(int i = 1; i <= 6; i++) {
ans += n[i] * i;
}
if(ans%2) {
printf("Collection #%d:\nCan't be divided.\n\n", cse++);
continue;
}
else {
ans /= 2;
count = 1;
f[0] = 0;
for(int i = 1; i < LLEN; i++) {
f[i] = INT_MIN;
}
for(int i = 1; i <= 6; i++) {
int c = n[i];
for(k = 1; k <= c; k *= 2) {
value[count] = k*i;
size[count++] = k*i;
c -= k;
}
if(c > 0) {
value[count] = c*i;
size[count++] = c*i;
}
}
for(int i = 1; i <= count-1; i++) {
for(int j = ans; j >= 0; j--) {
if(size[i] <= j) {
if(f[j] < f[j-size[i]]+value[i])
f[j] = f[j-size[i]]+value[i];
}
}
}
if(f[ans] == ans) {
printf("Collection #%d:\nCan be divided.\n\n", cse++);
}
else {
printf("Collection #%d:\nCan't be divided.\n\n", cse++);
}
}
}
return 0;
}