BestCoder Round #65 (ZYB's Game)
2015-12-05 22:01
141 查看
ZYB's Game
Accepts: 672Submissions: 1207Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionZYBZYBZYB played a game named NumberBombNumber BombNumberBomb with his classmates in hiking:a host keeps a number in [1,N][1,N][1,N] in mind,then players guess a number in turns,the player who exactly guesses XXX loses,or the host will tell all the players that the number now is bigger or smaller than XXX.After that,the range players can guess will decrease.The range is [1,N][1,N][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 XXX,if two persons all use the best strategy,and the first player guesses first.You are asked to find the number of XXX that the second player will win when XXX is in [1,N][1,N][1,N].InputIn the first line there is the number of testcases TTT.For each teatcase:the first line there is one number NNN.1≤T≤1000001 \leq T \leq 1000001≤T≤100000,1≤N≤100000001 \leq N \leq 100000001≤N≤10000000OutputFor each testcase,print the ans.Sample Input
1 3Sample Output
1 心得:总共才两个人,而且都知道X是多少(出题人在想什么?)先选的人先赢啊;
#include <iostream> using namespace std; int t,n; int main(){ cin>>t; for(int i=0;i<t;i++){ cin>>n; cout<<n%2<<endl; } return 0; }
相关文章推荐
- 20151205--JDBC-2
- python scikit learn 文本分类
- 【PAT】1104. Sum of Number Segments (20)
- HDU 5592 ZYB's Permutation(树状数组)
- 百度编辑器序号和项目符号不能显示解决
- LeetCode 29:Divide Two Integers
- HDOJ 5590 ZYB's Biology
- 从vware里克隆出的CentOS Linux,ifconfig 没有ip地址 和重启 Device eth0 does not seem to be present
- my.ini配置文件
- 在SpringMVC利用MockMvc进行单元测试
- 【PAT】1106. Lowest Price in Supply Chain (25)
- Django 数据导入
- GPU 加速NLP任务(Theano+CUDA)
- spring mvc 框架搭建及详解
- BestCoder Round #65 (ZYB's Biology)
- ospf BMA网络类型
- C++虚析构函数
- 【PAT】1107. Social Clusters (30)
- BZOJ-3211花神游历各国 并查集+树状数组
- UIButton 解析