4871150_tle.cpp

部分PKU上的源码

#include<iostream>
using namespace std;
int x[7];
int used[7];
bool can;
int sum;
void slove(int now,int nm)
{
	int i;
	if(now==6) 
	{
		if(sum==nm) can=true;
		return;
	}
	for(i=0;i<=x[now];i++)
	{
		if(nm>sum) return;
		slove(now+1,nm);
		nm+=now+1;
	}
}
int main()
{
	int count=1;
	while(1)
	{
		int i;
		sum=0;
		for(i=0;i<6;i++){cin>>x[i];sum+=x[i]*(i+1);}
		if(sum==0) break;
		if(sum%2==1) can=false;
		else
		{
			sum/=2;
			can=false;
			slove(0,0);
		}
		printf("Collection #%d:\n",count);
		count++;
		if(can) cout<<"Can be divided.\n\n";
		else cout<<"Can't be divided.\n\n";
	}
	return 0;
}