POJ - 2484 A Funny Game
2015-07-31 16:34
309 查看
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
Sample Output
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
#include <cstdio> int main() { int n; while (scanf("%d", &n) && n) { if (n <= 2) puts("Alice"); else puts("Bob"); } return 0; }
相关文章推荐
- 8数码问题的C++解决方案
- Android LaunchMode and StartActivityForResult
- Ehcache介绍
- 多播(组播)与广播的技术实现
- 20150726 Web前端开发基础html+css
- dwr js与java互相调用
- php函数注释
- SylixOS动态加载器系列文章(5) 应用程序加载原理
- 【CSS学习】CSS Text(文本)
- 接收广播BroadcastReceiver
- python数据结构与算法——栈
- TCP/IP
- Spark官方文档中推荐的硬件配置
- form表单无刷新上传文件
- 【Lua】loadfile、dofile、require详解
- leetcode 075 —— Sort Colors
- VC:CString.Format()函数详解
- Spark入门--倒排索引
- 如何为公司导入项目管理制度
- 插入数据时密码使用MD5加密算法加密