2014-04-30 16:12
原题:
The beauty of a number X is the number of 1s in the binary representation of X. Two players are plaing a game. There is number n written on a black board. The game is played as following: Each time a player chooses an integer number ( <= k) so that ^k is less than n and (n-^k) has as beautiful as n.
Next he removes n from blackboard and writes n-^k instead.
The player that can not continue the game (there is no such k that satisfies the constrains) looses the game. The First player starts the game and they play in turns alternatively. Knowing that both two players play optimally you have to specify the winner. Input: First line of the Input contains an integer T, the number of testcase. <= T <= . Then follow T lines, each containing an integer n. n more than and less than ^ +. Output For each testcase print "First Player" if first player can win the game and "Second Player" otherwise. Sample Input Sample Output Second Player
First Player
First Player
Second Player
Second Player
First Player
Second Player Explanation In the first example n is and first player can't change it so the winner is the second player. In the second example n is , so the first player subtracts (^) from n and the second player looses the game.
题目：两人玩一个数字游戏，开始在黑板上写一个正整数。两人轮流对该数执行一种操作：将这个数换成一个更小的正整数，但得保证变化之后的数在二进制表示里具有相同个数的‘1’。比如5变到3就满足条件，两者的二进制里都有两个‘1’。如果轮到某人时，无法找到更小且满足条件的数，则此人输掉游戏。给定一个初始的数字n，请判断在双方都最优策略的情况下，谁一定会赢？有必胜策略吗？
解法：从题目里看这就像个博弈的题，于是我在错误的思路下进行了第一次尝试，最终明白这题似乎不用博弈。用一个例子来观察这种游戏规则：“100110”，这个数可以变成“10110”、“100101”。可以发现都是在“10”的地方变成了“01”，也就是把其中一个“1”向右移动一位。那么游戏何时结束？到了“111”就结束了，因为没有多余的“0”可供移动了。起点和终点都清楚了，并且每次只能移动一位，所以游戏的回合数其实是固定的，根据这个回合数的奇偶就知道谁输谁赢了。算法可以在O(log(n))时间内完成。
代码：
// http://www.careercup.com/question?id=5110993575215104
#include <cstdio>
using namespace std; int main()
{
int nzero;
int sum;
int n; while (scanf("%d", &n) == && n > ) {
sum = ;
nzero = ;
while (n > ) {
if (n & ) {
sum += nzero;
} else {
++nzero;
}
n >>= ;
}
printf((sum & ) ? "First player wins.\n" : "Second player wins.\n");
} return ;
}