HDU1518&&ZOJ1909-Square

Square

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

Total Submission(s) : 147   Accepted Submission(s) : 51

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

Source

University of Waterloo Local Contest 2002.09.21

题意：给出n根短棒，问能否组成一个正方形

#include <stdio.h>
#include <string.h>

int n,sum,l;
int a[30],vis[30];
int flag;

void dfs(int bian,int l,int k)
{
    if(bian==5)
    {
        flag = 1;
        return ;
    }
    if(l == sum) dfs(bian+1,0,0);
    if(flag==1) return ;
    for(int i = k; i<n; i++)
    {
        if(!vis[i] && l+a[i]<=sum)
        {
            vis[i] = 1;
            dfs(bian,a[i]+l,i+1);
            vis[i] = 0;
        }
    }
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        sum = 0;
        scanf("%d",&n);
        for(int i = 0; i<n; i++)
        {
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        if(sum%4!=0)
        {
            printf("no\n");
            continue;
        }
        sum = sum/4;
        memset(vis,0,sizeof(vis));
        flag = 0;
        dfs(1,0,0);
        if(flag) printf("yes\n");
        else printf("no\n");
    }
    return 0;
}