Dividing[多重背包]

传送门

多重背包二进制优化

f[i]=1表示i出现过

---

#include<cstdio>
#include<vector>
#include<cstring> 
#define N 200050
using namespace std;
int f[N],a[10],flag,sum,k;
vector<int> v;
void Yes(int x){printf("Collection #%d:\nCan be divided.\n\n",x);}
void No(int x){printf("Collection #%d:\nCan't be divided.\n\n",x);}
int main(){
	while(1){
		k++; sum=0; v.clear(); memset(f,0,sizeof(f));
		for(int i=1;i<=6;i++){
			scanf("%d",&a[i]); sum+=a[i]*i;
			for(int j=1;j<=a[i];j<<=1)
				v.push_back(i*j),a[i]-=j;
			if(a[i]) v.push_back(i*a[i]);
		}
		if(sum==0) break;
		if(sum&1) No(k);
		else{
			sum/=2 , f[0]=1;
			for(int i=0;i<v.size();i++){
				for(int j=sum;j>=v[i];j--)
					f[j]|=f[j-v[i]];
			}
			if(f[sum]) Yes(k); 
			else No(k); 
		}
	}return 0;
}