POJ-2484 A Funny Game (对称博弈)
来源:互联网 发布:单词卡片制作软件 编辑:程序博客网 时间:2024/05/26 09:57
A Funny Game
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3843 Accepted: 2298
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.
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
思路:
n > 3 时,先手必败。题目很简单,而关键在于思想;
对称博弈的典型题目:
当n > 3 时,无论A怎么选择,B可以选一个特殊的位置拿走1个连续的2个,将A取剩的环路剪成两条相同的链路,然后,无论A从那条链路中那个位置取几个,B都可以在另一条链路中采用相同的取法。此时,B慢A一步,即最后一个一定是B取到的,B必胜!
代码:
#include <stdio.h>int main(){int n;while(scanf("%d", &n), n){if(n <= 2)printf("Alice\n");elseprintf("Bob\n");}return 0;}
0 0
- POJ 2484-A Funny Game(对称博弈)
- (poj 2484)A Funny Game(博弈,对称)
- [ACM] poj 2484 A Funny Game(对称博弈)
- POJ-2484 A Funny Game (对称博弈)
- POJ 2484 A Funny Game(博弈)
- POJ 2484 A Funny Game (博弈)
- poj 2484 A Funny Game (博弈)
- POJ 2484 A Funny Game(对称思想)
- POJ 2484 A Funny Game 简单博弈
- POJ 2484 A Funny Game【博弈】
- POJ 2484A Funny Game【博弈】
- 【POJ 2484】A Funny Game 【简单博弈】
- 【POJ 2484 A Funny Game】+ 博弈
- POJ 2484 A Funny Game <简单博弈>
- POJ 2484 A Funny Game(简单博弈)
- poj 2484 A Funny Game 模仿对手做对称状态
- 【POJ 2484】A Funny Game 博弈找规律
- POJ 2599 A funny game(博弈搜索)
- 黑马程序员——学习日记8 java抽象类与接口
- java对象的序列化和反序列化
- Thinkphp html:list
- POJ-2352-Stars 树状数组
- oracle索引监控
- POJ-2484 A Funny Game (对称博弈)
- 精华资源网盘合集:
- C++与C不同之二——引用
- 机房收费系统个人重构关于SQLHelper
- IOMMU简述-上篇
- CocosBuilder学习之一:认识CocosBuilder
- NSString常用方法
- 黑马程序员——学习日记9 java面向对象之多态
- vs 2008 unsigned CString to char*