#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int T,n,d[2000],i;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&d[i]);
if((n%2)==1)
d[n++]=0;
sort(d,d+n);
int f=0;
for(i=0;i+1<n;i+=2)
{
f^=(d[i+1]-d[i]-1);
}
if(f==0)
printf("Bob will win\n");
else
printf("Georgia will win\n");
}
}
poj 1704 阶梯博弈
最新推荐文章于 2018-05-04 16:56:59 发布