poj2484A Funny Game+对称博弈
2016-07-22 22:00
393 查看
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
1
2
3
0
Sample Output
Alice
Alice
Bob
/*
0000 0000
000 000
00 00
0 0
*/
由上式可得如果存在一种状态能是两个对称的链,先手怎么取
后手都能让这个状态再次回到对称的状态
环状取了之后便是链装,只要取走之后变成对称链,便能赢。
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
1
2
3
0
Sample Output
Alice
Alice
Bob
/*
0000 0000
000 000
00 00
0 0
*/
由上式可得如果存在一种状态能是两个对称的链,先手怎么取
后手都能让这个状态再次回到对称的状态
环状取了之后便是链装,只要取走之后变成对称链,便能赢。
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main(){ int n; while(scanf("%d",&n),n!=0){ if(n<3) printf("Alice\n"); else printf("Bob\n"); } return 0; }
相关文章推荐
- 构造方法
- Notification,PendingIntent和Intent区别,Phone联系人数据表,存放地址
- Linux文件处理命令
- 一个图文混排问题的解决过程
- HDU 5676 ztr loves lucky numbers (模拟)
- LaTeX双线页眉
- CodeForces 346A--博弈
- HDU 1010 Tempter of the Bone 搜索 奇偶剪枝
- 百鸡问题
- KMP算法讲解
- 【嵌入式学习日记】2016年7月22日
- cocos实现按钮多种状态监听
- [Asp.Net]登录协同工作平台安全解决方案(优化版)
- linux下用mii-tool和ethtool 查看网线是否正确连接到网卡
- 复杂链表的复制
- 利用pxe和kickstart批量安装Linux客户端CentOS6.5
- 前端书籍推荐
- 读书笔记-现代操作系统-8多处理机-8.3虚拟化
- Task set generation
- docker容器扫盲