> 加上了这个优化，就过了，没想通如何证明。
> 代码如下：
> #include <iostream>
> #include <algorithm>
> #include <vector>
> 
> using namespace std;
> 
> int main(int argc,char* argv[])
> {
> 	int i,j,sum;
> 	bool flag;
> 	for(int count=1;;count++)
> 	{
> 		flag = false;
> 		vector<int> datapool;
> 		sum = 0;
> 		for(i=1;i<=6;i++)
> 		{
> 			cin>>j;
> 			flag = flag || j!=0 ;
> 
> 			j = j % 8; //这里！
> 			for(;j>0;j--)
> 			{
> 				datapool.push_back(i);
> 				sum += i;
> 			}
> 
> 		}
> 		if(!flag)
> 			break;
> 		int half = sum /2;
> 		if(sum % 2 != 0)
> 		{
> 			flag = false;
> 		}
> 		else
> 		{
> 			do
> 			{
> 				int partsum = 0;
> 				for(i=0;i<datapool.size();i++)
> 				{
> 					if(partsum==half)
> 					{
> 						flag = true;
> 						break;
> 					}
> 					else
> 					{
> 						partsum += datapool[i];
> 						if(partsum>half)
> 						{
> 							flag = false;
> 							break;
> 						}
> 						else
> 							continue;
> 					}
> 				}
> 				if(flag)
> 					break;
> 			}while(next_permutation(datapool.begin(),datapool.end()));
> 		}
> 		if(flag)
> 		{
> 			cout<<"Collection #"<<count<<":"<<endl;
> 			cout<<"Can be divided."<<endl<<endl;
> 		}
> 		else
> 		{
> 			cout<<"Collection #"<<count<<":"<<endl;
> 			cout<<"Can't be divided."<<endl<<endl;
> 		}
> 	}
> }

• 这个不知道 (79) sspp 2004-12-08 22:55:41