poj2362解题报告

Square

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 12229		Accepted: 4223

Description

Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?

Input

The first line of input contains N, the number of test cases. Each test case begins with an integer 4 <= M <= 20, the number of sticks. M integers follow; each gives the length of a stick - an integer between 1 and 10,000.

Output

For each case, output a line containing "yes" if is is possible to form a square; otherwise output "no".

Sample Input

3
4 1 1 1 1
5 10 20 30 40 50
8 1 7 2 6 4 4 3 5

Sample Output

yes
no
yes

题目大姨：给定N跟木棒长度，判断是否能用其拼成一个正方形。。

思路：枚举每根木棒，暴搜300+MS。。。。

#include<iostream>
using namespace std;
int t,N,lenth[30],lock[30],sumlenth;
int find(int th,int now,int left,int nn)
{
	int i;
	if(th==4&&left==sumlenth/4)
		return 1;
	else if(th==4)
		return 0;

	if(nn==N)
		return 0;
	for(i=nn+1;i<=N;i++)
		if(now+lenth[i]<=sumlenth/4&&lock[i]==0)
		{
			lock[i]=1;
			if(now+lenth[i]==sumlenth/4)
			{
				if(find(th+1,0,left-lenth[i],0))
					return 1;
			}
			else if(find(th,now+lenth[i],left-lenth[i],i))
				return 1;
			lock[i]=0;
		}
	return 0;
}
int main()
{
	int i,j;
	cin>>t;
	while(t--)
	{
		cin>>N;
		sumlenth=0;
		memset(lock,0,sizeof(lock));
		for(i=1;i<=N;i++)
		{
			cin>>lenth[i];
			sumlenth+=lenth[i];
		}
		if(sumlenth%4)
			cout<<"no"<<endl;
		else if(find(1,0,sumlenth,0))
			cout<<"yes"<<endl;
		else
			cout<<"no"<<endl;

	}

	return 0;
}