[HDU 5795] A Simple Nim【博弈论&组合游戏】

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll n;
ll a;
ll ans = 0;
ll sg(ll i)
{
if(i%8==0)return i-1;
else if(i%8==7)return i+1;
else return i;
}
int main()
{
freopen("A.in","r",stdin);
freopen("A.out","w",stdout);
scanf("%I64d",&n);
for(ll i=1;i<=n;i++)
{
scanf("%I64d",&a);
ans^=sg(a);
}
if(ans)cout<<"First player wins.";
else cout<<"Second player wins.";
return 0;
}