题解:将一组看成一个局面,打表算出SG,找规律
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N=1e4+10;
int n;
int dfs(int x,int y)//这个规律很神奇
{
long long tmp=2;
for (int Ans=0;;Ans++,tmp*=2)//tmp最大2^32
if ((x-1)%tmp<tmp/2 && (y-1)%tmp<tmp/2)return Ans;
}
void work()
{
scanf("%d",&n);
int Ans=0;
for (int i=0;i<n/2;i++){
int x,y;scanf("%d%d",&x,&y);
Ans^=dfs(x,y);
}
if (Ans)puts("YES");else puts("NO");
}
int main()
{
//freopen("1.txt","w",stdout);
int Case;scanf("%d",&Case);
while (Case--)work();
return 0;
}