0分求助

#include <bits/stdc++.h>
using namespace std; 
int times[2000005],len[25],n;
bool ck[25];
void clear()
{
	memset(times,0,sizeof(times));
	memset(len,0,sizeof(len));
}
void dfs(int k,int cnt,int last)
{
	if(k==n+1) return;
	for(int i=last+1;i<=n;i++)
	{
		if(!ck[i]) 
		{
			times[cnt+len[i]]++;
			ck[i]=1;
			dfs(k+1,cnt+len[i],i);
			ck[i]=0;
		}
	}
} 
int main()
{
	int s;
	scanf("%d",&s);
	for(int i=1;i<=s;i++)
	{
		clear();
		scanf("%d",&n);	
		for(int i=1;i<=n;i++) 			        scanf("%d",&len[i]);
		dfs(1,0,0);
		for(int i=1;i<=2000005;i++) 
		if(times[i]>=4)
		{
			printf("yes\n");
			break;
		} 
		printf("no\n");
	}
	
}