多重背包 O

O
Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value.
Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.
Input
Each line in the input describes one collection of marbles to be divided. The lines consist of six non-negative integers n1, n2, …, n6, where ni is the number of marbles of value i. So, the example from above would be described by the input-line ``1 0 1 2 0 0’’. The maximum total number of marbles will be 20000.

The last line of the input file will be 0 0 0 0 0 0''; do not process this line. Output For each colletcion, outputCollection #k:’’, where k is the number of the test case, and then either Can be divided.'' orCan’t be divided.’’.

Output a blank line after each test case.
Sample Input
1 0 1 2 0 0
1 0 0 0 1 1
0 0 0 0 0 0
Sample Output
Collection #1:
Can’t be divided.

Collection #2:
Can be divided.
题目大意是又价值为1 2 3 4 5 6 的物品a[i]个，问你能不能把他们平均分为两堆。
题解：用多重背包的二进制优化，再用01背包来装调整价格后的这些物品。
完整代码

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<cstdio>
#include<vector>
#include<set>
#include<cstring>
#include<cstdlib>
#include<time.h>
#include<stack>
#define INF 0x3f3f3f3f
using namespace std;
#define maxn 100005
int v[maxn],n[maxn],w[maxn];
int f[maxn];
int main()
{
	for(int i=1;i<=6;i++)
		v[i]=i;
	int t=1;
	while(1){
		int sum=0;
		for(int i=1;i<=6;i++){
			scanf("%d",&n[i]);
			sum=sum+n[i]*v[i];
		}
		if(sum==0) break;
		int min=sum/2;
		printf("Collection #%d:\n",t++);
		if(sum%2) printf("Can't be divided.\n\n");
		else{
			int cnt=1;
			memset(f,0,sizeof(f));
			for(int i=1;i<=6;i++){
				for(int j=1;j<=n[i];j<<=1){
					w[cnt++]=j*v[i];
					n[i]=n[i]-j;
				}
				if(n[i]>0){
					w[cnt++]=n[i]*v[i];
				}
			}
		for(int i=0;i<cnt;i++)
			for(int j=min;j>=w[i];j--)
				f[j]=max(f[j],f[j-w[i]]+w[i]);
		if(f[min]==min) 
			printf("Can be divided.\n\n");
		else
			printf("Can't be divided.\n\n");
		}
	}
  return 0;
}