题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1518
思路:先判断基本的构成正方形的条件,就是main函数内两个判断,然后再dfs,先判断能否组成正方形的一条边,如果能组成,则从头开始搜索,继续找下一条边,如果不能组成一条边,则从当前位置继续搜索,直到找到满足条件的数字或结束
#include <stdio.h>
#include <string.h>
int nums[21],n,m,flag,sum;
int book[21];
void DFS(int count, int len, int index)
{
int i;
if(count == 5)
{
flag = 1;
return;
}
if(len == sum)//判断当前边是否符合条件
{
DFS(count+1,0,0);
if(flag)
return;
}
for(i = index; i < m; ++i)
{
if(book[i] == 0 && len+nums[i] <= sum)
{
book[i] = 1;
DFS(count,nums[i]+len,i+1);
if(flag)
return;
book[i] = 0;
}
}
return ;
}
int main()
{
int i;
scanf("%d",&n);
while(n--)
{
sum = 0;
memset(book,0,sizeof(book));
scanf("%d",&m);
for(i = 0; i < m; ++i)//输入给定的边
{
scanf("%d",&nums[i]);
sum += nums[i];
}
if(sum % 4 != 0)//判断
{
printf("no\n");
continue;
}
sum = sum/4;
for(i = 0; i < m; ++i)//判断
if(nums[i] > sum)
{
printf("no\n");
continue;
}
flag = 0;
DFS(1,0,0);//深搜
if(flag)
printf("yes\n");
else
printf("no\n");
}
return 0;
}