杭电5591 ZYB's Game

ZYB's Game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 361    Accepted Submission(s): 301

Problem Description

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 of  X  that the second player
will win when  X  is in  [1,N] .

 

Input

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

 

Output

For each testcase,print the ans.

 

Sample Input

  
  

   
   1
3
  
  

 

Sample Output

  
  

   
   1
  
  

 

Source

BestCoder Round #65

 

Recommend

hujie   |   We have carefully selected several similar problems for you:   5594  5593  5592  5589  5588 

 

简单博弈，问1~N里边有一个Ｘ，A和Ｂ都知道这个数，然后从　两头开始缩小空间，先取到Ｘ的输，所以就是如果Ｎ是奇数，则Ｘ为最中间那个，否则先手必输：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int i,j,k;
int main()
{
	scanf("%d",&j);
	while(j--)
	{
		scanf("%d",&k);
		if(k&1)
		printf("1\n");
		else 
		printf("0\n");
	}
}