HDOJ 5591 ZYB's Game 【简单博弈 】

ZYB's Game

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 312 Accepted Submission(s): 260



[align=left]Problem Description[/align]
ZYB
played a game named NumberBomb
with his classmates in hiking:a host keeps a number in
[1,N]
in mind,then

players guess a number in turns,the player who exactly guesses
X
loses,or the host will tell all the players that

the number now is bigger or smaller than X.After
that,the range players can guess will decrease.The range is
[1,N]
at first,each player should guess in the legal range.

Now if only two players are play the game,and both of two players know the
X,if
two persons all use the best strategy,and the first player guesses first.You are asked to find the number ofX
that the second player

will win when X
is in [1,N].

[align=left]Input[/align]
In the first line there is the number of testcases
T.

For each teatcase:

the first line there is one number N.

1≤T≤100000,1≤N≤10000000

[align=left]Output[/align]
For each testcase,print the ans.

[align=left]Sample Input[/align]

1
3

[align=left]Sample Output[/align]

1

[align=left]Source[/align]
BestCoder Round #65

恩，读题要很仔细，读懂就很好做了

#include<cstdio>
#include<cstring>
int main()
{
int t,n;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
if(n&1)
printf("1\n");
else
printf("0\n");
}
return 0;
}