突然忘记怎么写背包,数据量比较小干脆直接深搜了一下,感觉速度还可以,相当于从大到小开始选然后暴力搜索,搜索到结果以后跳出,没有任何剪枝优化= =
#include <iostream>
#include <memory.h>
#include <cstdio>
using namespace std;
int marble[7]={0};
int sum = 0;
int half = 0;
int caseID = 1;
bool flag = false;
void DFS(int value,int index){
//printf("value: %d\n",value);
if(flag)
return;
if(value == half){
//printf("final value: %d\n",value);
flag = true;
return;
}
for(int i=index;i>=1;--i){
if(marble[i]){
if(value + i <= half){
marble[i]--;
DFS(value + i,i);
}
}
//DFS(value,i-1);
if(flag)
break;
}
}
int main(){
while(true){
memset(marble,0,sizeof(marble));
sum = 0;
half = 0;
flag = false;
for(int i=1;i<=6;++i){
scanf("%d",&marble[i]);
sum += i*marble[i];
}
if(!sum)
break;
if(sum%2){
printf("Collection #%d:\n",caseID++);
printf("Can't be divided.\n\n");
continue;
}
half = sum/2;
DFS(0,6);
if(flag){
printf("Collection #%d:\n",caseID++);
printf("Can be divided.\n\n");
}
else{
printf("Collection #%d:\n",caseID++);
printf("Can't be divided.\n\n");
}
}
//system("pause");
return 0;
}