博弈,找规律_______A Funny Game(poj 2484)

Description

Alice and Bob decide to play a funny game. At the beginning of the game they pick n(1 <= n <= 10 ⁶) coins in a circle, as Figure 1 shows. A move consists in removing one or two adjacent coins, leaving all other coins untouched. At least one coin must be removed. Players alternate moves with Alice starting. The player that removes the last coin wins. (The last player to move wins. If you can't move, you lose.) 
 
Figure 1
Note: For n > 3, we use c1, c2, ..., cn to denote the coins clockwise and if Alice remove c2, then c1 and c3 are NOT adjacent! (Because there is an empty place between c1 and c3.) 

Suppose that both Alice and Bob do their best in the game. 
You are to write a program to determine who will finally win the game.

Input

There are several test cases. Each test case has only one line, which contains a positive integer n (1 <= n <= 10 ⁶). There are no blank lines between cases. A line with a single 0 terminates the input. 

Output

For each test case, if Alice win the game,output "Alice", otherwise output "Bob". 

Sample Input

1
2
3
0

Sample Output

Alice
Alice
Bob

题目意思：

给出N个硬币围成一个圈，然后两个人从这圈硬币中轮流拿1个或毗邻的2个硬币。直到全部拿完为止，最后一个拿的人为，胜者。

分析：

当n==1 || n==2时，明显先手必胜。
当n==3时，明显先手必败。
由于每次只可取1或2个，而取2个时，2个必须相邻，推断有：
当n>3时，
若n为偶数，先手无论如何取，后手可在先手对称的位置上取同等数量，于是先手必败。
若n为奇数，先手取1个时，后手可在先手对称的位置上取2个，之后无论先手如何取，后手都可在先手对称的
位置上取同等数量，先手必败。
先手一开始取2个时，可如上推出先手必败。

代码：

#include <iostream>  
#include <cstdio>  
#include <string>  
#include <string.h>  
#include <map>  
#include <vector>  
#include <cstdlib>  
#include <cmath>  
#include <algorithm>  
#include <cmath>  
#include <queue>  
#include <set>  
#include <stack>  
using namespace std;  
  
int main()  
{  
    int n;  
    while(scanf("%d", &n))  
    {  
        if(n==0)  
            break;  
        if(n <= 2)  
            printf("Alice\n");  
        else  
            printf("Bob\n");  
    }  
    return 0;  
}