传送门:http://www.lydsy.com:808/JudgeOnline/problem.php?id=1115
请自行百度:阶梯Nim
Code:
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e3+10;
int T,n;
int a[maxn];
int main(){
scanf("%d",&T);
while(T--){
scanf("%d",&n);
int ans=0;
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=n;i>1;i-=2)ans^=a[i]-a[i-1];
ans^=a[1]*(n&1);
puts(ans?"TAK":"NIE");
}
return 0;
}