前言
思路
定理 :
a
1
∧
a
2
.
.
.
∧
a
n
=
0
a_1 \wedge a_2...\wedge a_n = 0
a1∧a2...∧an=0
先手必败,否则先手必胜
具体证明看 :
CODE
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define px first
#define py second
#define pb push_back
typedef pair<int,int> pii;
int dxy[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};
const int N = 40;
int n,m,t;
void cal()
{
}
void solve()
{
int n;
cin>>n;
int ans = 0 ;
for(int i = 1;i<=n;i++)
{
int x;cin>>x;
ans^=x;
}
if(ans)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
int main()
{
ios::sync_with_stdio(false);
solve();
return 0;
}