Square（搜索+剪枝）

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

题意：给一堆木棒，我们得将他们全部用上，然后组成一个正方形，问能不能行。

思路：给出了各种木棍的长度，我们可以计算木棍长的和sum，从而可以计算出正方形的边长，枚举各种组合情况，但也得添加剪枝。当sum%4！=0时直接不成立或者最大的段超出平均值，同时当新组合的边达到三条时可直接判定成功。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int a[21],in[21],n,sum,ave;
int dfs(int res,int sums,int cur)