[sicily online1087. A Funny Game

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

Alice and Bob decide to play a funny game. At the beginning of the game they pick n(1 <= n <= 106) coins in a circle, as Figure 1 shows. A move consists in removing one or twoadjacent 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 <= 106). 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

1230

Sample Output

AliceAliceBob

題目解析：

一直希望能往動態規划上靠，結果靠了半天靠不上。

網上牛人解答：

不管先選的人怎麼選，候選的人都在對稱位置選擇，使得剩下的數量為偶數，之後不管對方怎麼選，候選者都在對稱位置坐相同操作。總是後者勝。

比如：有偶數個，先選選了一個，候選者就在對稱位置選2個。

早知道，多試幾組資料，估計也能看出來

http://blog.csdn.net/titikdhu/article/details/5746349

#include<iostream>#include<stdio.h>#include<cmath>#include<iomanip>#include<list>#include <map>#include <vector>#include <string>#include <algorithm>#include <sstream>#include <stack>#include<queue>#include<string.h>using namespace std;int main(){int n;while(cin>>n&&n!=0){if(n==1||n==2)cout<<"Alice"<<endl;else cout<<"Bob"<<endl;}}