poj A Funny Game

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. 

题目大意

两个人轮流从一圈硬币中取硬币，每次可以取一个或相邻的两个，谁取完最后一个就赢了，给出n，问谁能赢。

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枚硬币排成一行，无论如何先手必胜：只要先手第一步将棋子全部取光（n=1或2）或将棋子分为2段数量一样的，之后就必胜了。

若将硬币练成一圈则相当于后手变为一排硬币时的先手，所以除了n=1或2时，后手必胜。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
int n;
int main()
{
	while(scanf("%d",&n)&&n)
	   {if(n==1||n==2) printf("Alice\n");
	    else printf("Bob\n");
	   }
	return 0;
}