HDU 5591 ZYB's Game

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\le T\le 100000$,$1\le N\le 10000000$

Output

For each testcase,print the ans.

Sample Input

13

Sample Output

1

简单题，直接推导一下就好

#include<cmath>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;typedef long long LL;const int maxn = 1e7 + 5;int T, n, m;int main(){    scanf("%d", &T);    while (T--)    {        scanf("%d", &n);        printf("%d\n", n & 1);    }    return 0;}