UVA 12293 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 (2 ≤ n ≤ 109) 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

题目的意思是，有两个盒子，一个盒子里有n个球，另外一个盒子里只有一个球，每一次将球数较少的盒子清空，然后分配球数较多的盒子中间的球。

我还是太天真了，我居然想着直接模拟出答案······压根就没有想到找规律这种事·····

然后  这个的规律就是  如果n==2^k-1，那么就是Bob赢，反之就是Alice赢

代码：

#include<stdio.h>
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        n++;
        while(n%2==0)//如果n+1是2的k次方的话，除到最后就剩下一个1了
            n/=2;
        if(n==1)
            printf("Bob\n");
        else
            printf("Alice\n");
    }
    return 0;
}