POJ 2484 (博弈)

A Funny Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4695   Accepted: 2900 Description Alice and Bob decide to play a funny game. At the beginning of the game they pick n(1 <= n <= 10 6) 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 6). 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 Source POJ Contest,Author:Mathematica@ZSU

题意：给出n个硬币围成一圈，每次只能取一个或者连续的两个，取走最后一个硬币的人获胜。

已经做到过很多类似的题目。对于足够多的硬币，如果有偶数个，那么后手每次都在对称的位置和先手取一样数量的硬币，如果是奇数，那么在第一次的时候后手在对称的位置和先手取不同数量的硬币使得总硬币变成偶数个。先手胜当且仅当硬币数是一个或者两个。