HDU Square

Square

Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 200   Accepted Submission(s) : 73

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem 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
#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
int n, a[22],s;
bool b[22],bb;
using namespace std;
int main()
{
	void dfs(int,int,int);
	int R; scanf_s("%d", &R);
	while (R--)
	{
		bb = 0;
		memset(b, 0, sizeof(b));
		scanf_s("%d", &n);
		int sum = 0;
		for (int i = 1; i <= n; i++)
		{
			scanf_s("%d", &a[i]);
			sum += a[i];
		}
		if (sum % 4)
		{
			printf("no\n"); continue;
		}
		s = sum / 4;
		sort(a + 1, a + n + 1);
		if (a[n] > s)
		{
			printf("no\n"); continue;
		}
		dfs(1,0,0);
		if (bb == 0) printf("no\n");
	}
	return 0;
}
void dfs(int k,int sum, int t)
{
	if (t > 3)return;
	if (bb == 1) return;
	for (int i = k; i <= n; i++)
	{
		if (a[i] + sum > s) break;
		if (a[i] + sum < s && !b[i])
		{
			b[i] = 1;
			dfs(i+1,sum + a[i], t);//从i+1继续搜
			if (bb == 1) return;
			b[i] = 0;
		}
		else if (a[i] + sum == s && !b[i])
		{
			b[i] = 1;
			if (t == 3)
			{
				bb = 1; printf("yes\n"); return;
			}
			else
			{
				dfs(1,0, t + 1);
				if (bb == 1) return;
				b[i] = 0;
			}
		}
	}
}