#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int n,a[2001];
bool found;
int dfs(int x,int used,int now)
{
if(x==n+1)
{
if(!now&&used>0)found=1;
return 0;
}
dfs(x+1,used,now);
dfs(x+1,used+1,now^a[x]);
}
int main()
{
for(int t=1;t<=10;t++)
{
found=0;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
dfs(1,0,0);
if(found)puts("NO");
else puts("YES");
}
return 0;
}
bzoj1299: [LLH邀请赛]巧克力棒 博弈
最新推荐文章于 2020-05-15 11:10:02 发布