编辑代码

#include <iostream>
using namespace std;

int a[15],m,sum;
bool flag;

void dfs(int step = 1,int u = 0,int d = 0,int l = 0,int r = 0)
{
    if(flag == true)    return;
    if(step > m)
    {
        if(u == d && l == r && u == l)
        {
            flag = 1;
        }
        return;
    }
    if(u + a[step] <= sum / 4)
        dfs(step+1,u + a[step],d,l,r);
    if(d + a[step] <= sum / 4)
        dfs(step+1,u,d + a[step],l,r);
    if(l + a[step] <= sum / 4)
        dfs(step+1,u,d,l + a[step],r);
    if(r + a[step] <= sum / 4)
        dfs(step+1,u,d,l,r + a[step]);
}

int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        cin>>m;
        sum = 0;
        for(int i = 1;i <= m;i++)
        {
            cin>>a[i];
            sum +=   a[i];
        }
        flag = 0;
        if(sum % 4 != 0)
        {
            cout<<"no"<<endl;
            continue;
        }
        dfs();
        if(flag == 1)
        {
            cout<<"yes"<<endl;
        }
        else
        {
            cout<<"no"<<endl;
        }
    }


	return 0;
}