Uva 12293 - Box Game

你为何这么叼！

Box Game 

Time limit: 1.000 seconds

 

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

 

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define maxn 61
int n,m,k;
int a[maxn];
int main(){
    for(int i=0;i<30;i++)a[i]=a[i-1]*2+1;
    while(scanf("%d",&n)&&n){
        for(k=0;k<30;k++)if(a[k]==n){puts("Bob");break;}
        if(k==30)puts("Alice");
    }
    return 0;
}