HDU 5591 ZYB's Game(博弈水题)
2016-01-25 11:09
274 查看
ZYB’s Game
Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %I64d Java class name: Main
Submit Status
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
Time Limit: 1000msMemory Limit: 65536KB 64-bit integer IO format: %I64d Java class name: Main
Submit Status
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
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf("%d",&t); for(int i=1;i<=t;i++) { int x; scanf("%d",&x); printf("%d\n",x&1); } }
相关文章推荐
- Notification的使用
- Codeforces Round #340 (Div. 2) by komendart
- 《JAVA与模式》之简单工厂模式
- 月光博客: 个人用户如何安全地选择软件
- learn python the hard way(笨办法学python) 练习40 类的用法
- c#异常处理机制
- Android中的SharedPreferences存储数据方式
- linux修改hostname
- java基础篇--04<java基础类库>
- 在python3.3后urllib2已经不能再用,只能用urllib.request来代替
- OOP (Objects and Classes )
- FreeRTOS系列第14篇---FreeRTOS任务通知
- java中文乱码解决之道(九)—–总结
- 【链表】Linked List Cycle II
- python 常用模块
- 企业自托管代码管理gitlab的安装和相关配置
- Android studio Git功能使用教程
- xml格式解析
- Java数组的创建和使用
- String-常见工具收集