BZOJ 1115: [POI2009]石子游戏Kam (阶梯nim)

#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=1e6+10,INF=1e9+10;
inline char nc()
{
    static char buf[MAXN],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,MAXN,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
    char c=nc();int x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=nc();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=nc();}
    return x*f;
}
int a[MAXN];
main()
{
    #ifdef WIN32 
    freopen("a.in","r",stdin);
    #else
    #endif
    int QWQ=read();
    while(QWQ--)
    {
        int N=read(),ans=0;
        for(int i=1;i<=N;i++) a[i]=read();
        for(int i=N;i>=2;i--) a[i]=a[i]-a[i-1];
        for(int i=N;i>=1;i--) 
            if( (N-i+1)&1 ) ans=ans^a[i];
        puts(ans?"TAK":"NIE");
    }
    return 0;
}