Game theory AcWing 891. Nim game

Original link

AcWing 891. Nim game

Algorithm tags

Math knowledge Game theory Nim game

Ideas

Basic concepts of game theory

The conclusion proves that

Code

#include<bits/stdc++.h>
#define int long long
#define abs fabs
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>=b;--i)
using namespace std;
const int N = 5015;
int pr[N], st[N], s[N], cnt;
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n=read();
    int ans=0; 
    while(n--){
        int a=read();
        ans^=a;
    }
    if(ans){
        puts("Yes");
    }else{
        puts("No");
    }
}

Originality is not easy.
Reprint please indicate the source
If it helps you Don't forget to praise and support