Nim游戏证明参见:
刘汝佳训练指南P135—写的很酷!
知乎上SimonS关于Nim博弈的回答!
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int Max_n=1100;
int n;
int s[Max_n];
void solve(){
int ans=0;
for(int i=1;i<=n;i++)
ans^=s[i];
//ans不为0 先手胜,否则后手胜
printf("%c\n",ans?'A':'B');
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&s[i]);
solve();
return 0;
}