Square HDU - 1518

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int T,a[30],vis[30],n,flag,sum,goal,maxn; 

bool cmp(int a,int b)
{
    return a>b;
}

void dfs(int go,int k,int jt)
{
    if(flag) return;
    if(go == 0&&jt == n){flag = true; return;}
    if(go == 0) dfs(goal,0,jt);

    for(int i = k ; i < n ; i++)
    {
        if(!flag&&!vis[i]&&go>=a[i])
        {
            vis[i] = 1;
            dfs(go-a[i],i,jt+1);
            vis[i] = 0;

//          if(go = a[i]) return;
            if(go == goal) return;
            while(a[i] == a[i+1]) i++;
        }
    }

}

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        sum = 0;

        scanf("%d",&n);
        for(int i = 0 ; i < n ; i++)
        {
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        sort(a,a+n,cmp);
        goal = sum/4;
        if(sum%4!=0||a[0]>goal||(a[0]<goal&&a[0]+a[n-1]>goal))
        {
            cout<<"no"<<endl;
            continue;
        }

        flag = false;
        maxn = goal;

        memset(vis,0,sizeof(vis));

        dfs(maxn,0,0);
        if(flag) cout<<"yes"<<endl;
        else cout<<"no"<<endl;

    }
    return 0;
}