Description
One day, zbybr is playing a game with blankcqk, here are the rules of the game:
There is a circle of N stones, zbybr and blankcqk take turns taking the stones.
Each time, one player can choose to take one stone or take two adjacent stones.
You should notice that if there are 4 stones, and zbybr takes the 2nd, the 1st and 3rd stones are still not adjacent.
The winner is the one who takes the last stone.
Now, the game begins and zbybr moves first.
If both of them will play with the best strategy, can you tell me who will win the game?
Input
The first line of input contains an integer T, indicating the number of test cases (T≈100000).
For each case, there is a positive integer N (N ≤ 10^18).
Output
Output the name of the winner.
Sample Input
2 1 2
Sample Output
zbybr zbybr
【分析】
经典题...石子游戏
如果只有一个或两个石头,先手胜
如果石头大于两个,先手取石子后会使石子变成两堆,这时后手只要将剩下的石子继续分成对称的两堆,那么后者一定会赢
【代码】
#include<stdio.h>
int main()
{
int pp;scanf("%d",&pp);
while(pp--)
{
long long n;scanf("%lld",&n);
if(n<3)
printf("zbybr\n");
else
printf("blankcqk\n");
}
return 0;
}