POJ 2484

时间：2014-05-09 12:53:42 阅读：265 评论：0 收藏：0 [点我收藏+]

A Funny Game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3861		Accepted: 2311

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.)
bubuko.com,布布扣

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

Sample Output

Alice
Alice
Bob

Source

POJ Contest,Author:Mathematica@ZSU

当N <= 2 时，必定是alice 赢否则，bob只有吧剩下的个数取到偶数就必胜。

 1 #include <iostream>
 2 #include <cstdio>
 3 
 4 using namespace std;
 5 
 6 int N;
 7 int main()
 8 {
 9     while(~scanf("%d",&N) && N) {
10             printf("%s\n",N <= 2 ? "Alice" : "Bob");
11     }
12     //cout << "Hello world!" << endl;
13     return 0;
14 }

View Code

POJ 2484,布布扣,bubuko.com

POJ 2484

标签：des style blog class code tar

原文地址：http://www.cnblogs.com/hyxsolitude/p/3718451.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行