POJ 2484 A Funny Game(博弈论)
2016-07-26 00:43
489 查看
题目链接: 传送门
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.)
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.
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.
For each test case, if Alice win the game,output "Alice", otherwise output "Bob".
这类问题,其实可以根据对称性来接,Alice先手,所以Bob可以根据链的奇偶性取走一枚或两枚硬币,然后分成两个长度相同的链,每次取走硬币与Alice相同,最后必然是Bob最后取走。
A Funny Game
Time Limit: 1000MS Memory Limit: 10000K
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.)
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
1 2 3 0
Sample Output
Alice Alice Bob
解题思路
这类问题,其实可以根据对称性来接,Alice先手,所以Bob可以根据链的奇偶性取走一枚或两枚硬币,然后分成两个长度相同的链,每次取走硬币与Alice相同,最后必然是Bob最后取走。
#include<cstdio> int main() { int N; while (~scanf("%d",&N) && N) { if (N <= 2) { printf("Alice\n"); } else { printf("Bob\n"); } } return 0; }
相关文章推荐
- 几个关于内存的问题
- Android 练手程序之蹲坑进行时v1.01
- 【FJOI2014[bzoj4016]】最短路径树问题
- 如何获取浏览器的DNS解析时间
- ejs母版
- 结合EL表达式通过小例子体验JSTF的用法
- Codeforces 493C 暴力
- RBTree红黑树
- SCU 4522 寻找fly真迹(二分图染色)
- 20160725学习
- 换种思路解释自我管理
- 面试总结【1】
- 字符串的全排列
- 【C语言】到底能喝几瓶汽水?
- 小夏-ping1.bat
- C++——C++函数调用机制(3)
- 网页黑名单系统的算法核心
- 二叉搜索树与双向链表
- c++计算器后续(1)
- ubnutu-server-16.04版本上 搭建ftp服务器