hdu 1518 Square

Square

                                                                                Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
                                                                                                 Total Submission(s): 8250    Accepted Submission(s): 2684

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<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,a[25],vis[25],sum;
int cmp(int a,int b)
{
    return a>b;
}
int dfs(int l,int x,int ans)
{
    int i;
    if(ans==3)
        return 1;
    for(i=x;i<n;i++)
    {
        if((l+a[i]<=sum/4)&&!vis[i])
        {
            vis[i]=1;
            int s=l+a[i];
            if(s==sum/4)
            {
                if(dfs(0,0,ans+1))
                    return 1;
            }
            else if(dfs(s,i+1,ans))
                  return 1;

                   vis[i]=0;
        }

    }

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