51nod 1069 Nim游戏

Nim Game 有n堆石子，对每堆石子数量亦或，最终为0则B（后手）胜，否则先手胜

#include<iostream>#include<cstdio>#include<map>#include<set>#include<vector>#include<queue>#include<stack>#include<cmath>#include<algorithm>#include<cstring>#include<string>using namespace std;#define INF 0x3f3f3f3ftypedef long long LL;const int MAXN=1e9;int T,n;int main(){    int ok=0;    cin>>T;    while(T--){        cin>>n;        ok^=n;    }    if(!ok)cout<<"B\n";    else cout<<"A\n";    return 0;}