首页 > 代码库 > poj 2484
poj 2484
A Funny Game
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 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 <= 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 Source POJ Contest,Author:Mathematica@ZSU |
[Submit] [Go Back] [Status] [Discuss]
Home Page 
Go Back 
To top
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<string>#include<algorithm>using namespace std;int n;int main(){ while(scanf("%d",&n)!=EOF) { if(n==0) break; if(n==1||n==2) printf("Alice\n"); else printf("Bob\n"); } return 0;}
poj 2484
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。