UVA 12293 Box Game

Description

Box Game

There are two identical boxes. One of them contains n balls, while the other box contains one ball. Alice and Bob invented a game with the boxes and balls, which is played as follows:

Alice and Bob moves alternatively, Alice moves first. For each move, the player finds out the box having fewer number of balls inside, and empties that box (the balls inside will be removed forever), and redistribute the balls in the other box. After the redistribution, each box should contain at least one ball. If a player cannot perform a valid move, he loses. A typical game is shown below:

When both boxes contain only one ball, Bob cannot do anything more, so Alice wins.

Question: if Alice and Bob are both clever enough, who will win? Suppose both of them are very smart and always follows a perfect strategy.

Input 

There will be at most 300 test cases. Each test case contains an integer  n (  2n10⁹) in a single line. The input terminates by  n = 0.

Output 

For each test case, print a single line, the name of the winner.

Sample Input 

2
3
4
0

Sample Output 

Alice
Bob
Alice

---

The Seventh Hunan Collegiate Programming Contest 
Problemsetter: Rujia Liu, Special Thanks: Yiming Li & Jane Alam Jan

这个题的意思是刚开始有一个数和一个1，ALICE把两都之中较小的舍去，然后把较大的重新分成两个数，BOB重复ALICE的操作。两人轮流操作，谁最后要操作的数是（1，1）谁就输了，输出WINNER!。

#include<cstdio>
int main()
{
    int num;
    while(scanf("%u",&num),num)
    {
        if(((num+1)&num)==0)puts("Bob");
        else puts("Alice");
    }
    return 0;
}