ZYB's Game

Time Limit: 20 Sec

Memory Limit: 256 MB

题目连接

http://acm.hdu.edu.cn/showproblem.php?pid=5591

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

HINT

题意

题解：

我们会发现这个模型其实是类比于左右两堆石子,每次可以在一堆里取任意多,取完的人胜利.当左右两堆石子相同时,我们可以简单的

构造后手胜利的方法:即在另一堆石子中取走同样多的石子,否则,先手可以取一些石子使得两堆石子相同.所以,当N是奇数输出1,否则输出0.

当然也可以直接sg函数打表，打出来就可以找到规律了

代码：

#include<iostream>
#include<stdio.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);}
}

转载于:https://www.cnblogs.com/qscqesze/p/5023324.html

hdu 5591 ZYB's Game 博弈论相关推荐

hdu 5592 ZYB's Premutation （线段树+二分查找）
链接: http://acm.hdu.edu.cn/showproblem.php?pid=5592 Problem Description ZYB has a premutation P,but h ...
hdu 5594 ZYB's Prime 最大流
ZYB's Prime Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5 ...
BestCoder Round #65 B C D || HDU 5591 5592 5593
B 题意:ZYB在远足中,和同学们玩了一个"数字炸弹"游戏:由主持人心里想一个在[1,N][1,N]中的数字XX,然后玩家们轮流猜一个数字,如果一个玩家恰好猜中XX则算负,否则主持 ...
HDU 6741 MUV LUV UNLIMITED (博弈论)
题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=6741 题解看完题解深刻地意识到自己是个智障. (1) 如果某个叶子节点的父亲有多于一个儿子,则为必胜 ...
HDU 5594(ZYB's Prime-网络流)
题意:给出N个数,现在要求将它们分成K 组(K≥1)(K\geq 1),每组数的个数都≥3,将每组中的数排成一个环,要求相邻的两个数加起来是个质数.对于这N个数,能不能将它们分组? 解法:先不考虑1, ...
bestcoder r44 p3 hdu 5270 ZYB loves Xor II
这是昨晚队友跟我说的题,不知道当时是什么玄幻的事件发生了,,我看成了两两相乘的XOR 纠结了好长时间间不知道该怎么办今天早上看了下这道题,发现是两两相加的XOR 然后就想了想昨晚的思路发现可做 ...
字典树，01字典树，可持续化01字典树（总结+例题）
目录字典树 01字典树字典树例题: power oj 2390: 查单词 HDU 1671 Phone List HDU 1004Let the Balloon Rise HDU 1075 Wha ...
HDU 1847 Good Luck in CET-4 Everybody!(巴什博弈论)
题目地址:HDU 1847 这题可以用NP状态转换. 首先0的时候就代表无法出牌了,所以是必败态.然后根据每一个可以一步到达必败态的是必胜态,不可以一步到达必败态的是必败态.可以推出状态转移方程,然后 ...
博弈论—NP图法kiki's game HDU - 2147
题解:这一题用NP图来进行求解,分别画出偶X奇,偶X偶,奇X奇的矩阵来找出规律来即可求出结果. NP图的画法: 博客: https://blog.csdn.net/Adusts/article/de ...

hdu 5591 ZYB's Game 博弈论

ZYB's Game

题目连接

Description

HINT

hdu 5591 ZYB's Game 博弈论相关推荐

最新文章

热门文章