1014 Dividing DFS

#include<iostream>
using namespace std;

int n[7];  //价值为i的物品的个数
int SumValue;  //物品总价值
int HalfValue;  //物品平分价值
bool flag;    //标记是否能平分SumValue

void DFS(int value,int pre)
{
	if (flag) return;

	if (value==HalfValue)
	{
		flag=true;
		return;
	}

	for(int i=pre; i>=1; i--)
	{
		if( n[i] )
		{
			if (value+i<=HalfValue)
			{
				n[i]--;
				DFS(value+i,i);

				if(flag)
					break;
			}
		}
	}
	return;
}

int main()
{
	int test=1;
	while (true)
	{
		SumValue=0;  //物品总价值

		for(int i=1; i<=6; i++)
        { cin>>n[i]; SumValue+=i*n[i]; }

		if (SumValue==0) break;

		HalfValue=SumValue/2;
		flag=false;

		if (SumValue % 2==0)
		   DFS(0,6);

		if(flag)
		{
			cout<<"Collection #"<<test++<<':'<<endl;
			cout<<"Can be divided."<<endl<<endl;
			continue;
		}
		else
		{
			cout<<"Collection #"<<test++<<':'<<endl;
			cout<<"Can't be divided."<<endl<<endl;
			continue;
		}
	}
	return 0;
}