POJ-1704 Georgia and Bob (阶梯博弈)
来源:互联网 发布:加密视频破解软件 编辑:程序博客网 时间:2024/06/06 18:33
Georgia and Bob
Georgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the grids from left to right by 1, 2, 3, ..., and place N chessmen on different grids, as shown in the following figure for example:
Georgia and Bob move the chessmen in turn. Every time a player will choose a chessman, and move it to the left without going over any other chessmen or across the left edge. The player can freely choose number of steps the chessman moves, with the constraint that the chessman must be moved at least ONE step and one grid can at most contains ONE single chessman. The player who cannot make a move loses the game.
Georgia always plays first since "Lady first". Suppose that Georgia and Bob both do their best in the game, i.e., if one of them knows a way to win the game, he or she will be able to carry it out.
Given the initial positions of the n chessmen, can you predict who will finally win the game?
Input The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case contains two lines. The first line consists of one integer N (1 <= N <= 1000), indicating the number of chessmen. The second line contains N different integers P1, P2 ... Pn (1 <= Pi <= 10000), which are the initial positions of the n chessmen. Output For each test case, prints a single line, "Georgia will win", if Georgia will win the game; "Bob will win", if Bob will win the game; otherwise 'Not sure'. Sample Input 231 2 381 5 6 7 9 12 14 17
Sample Output Bob will winGeorgia will win
Georgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the grids from left to right by 1, 2, 3, ..., and place N chessmen on different grids, as shown in the following figure for example:
Georgia and Bob move the chessmen in turn. Every time a player will choose a chessman, and move it to the left without going over any other chessmen or across the left edge. The player can freely choose number of steps the chessman moves, with the constraint that the chessman must be moved at least ONE step and one grid can at most contains ONE single chessman. The player who cannot make a move loses the game.
Georgia always plays first since "Lady first". Suppose that Georgia and Bob both do their best in the game, i.e., if one of them knows a way to win the game, he or she will be able to carry it out.
Given the initial positions of the n chessmen, can you predict who will finally win the game?
Georgia and Bob move the chessmen in turn. Every time a player will choose a chessman, and move it to the left without going over any other chessmen or across the left edge. The player can freely choose number of steps the chessman moves, with the constraint that the chessman must be moved at least ONE step and one grid can at most contains ONE single chessman. The player who cannot make a move loses the game.
Georgia always plays first since "Lady first". Suppose that Georgia and Bob both do their best in the game, i.e., if one of them knows a way to win the game, he or she will be able to carry it out.
Given the initial positions of the n chessmen, can you predict who will finally win the game?
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case contains two lines. The first line consists of one integer N (1 <= N <= 1000), indicating the number of chessmen. The second line contains N different integers P1, P2 ... Pn (1 <= Pi <= 10000), which are the initial positions of the n chessmen.
For each test case, prints a single line, "Georgia will win", if Georgia will win the game; "Bob will win", if Bob will win the game; otherwise 'Not sure'.
231 2 381 5 6 7 9 12 14 17
Bob will winGeorgia will win
阶梯博弈详解:http://blog.csdn.net/shahdza/article/details/7858032
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cstdlib>#include <cmath>#include <vector>#include <queue>#include <map>#include <algorithm>#include <set>#include <functional>using namespace std;typedef long long LL;typedef unsigned long long ULL;const int INF = 1e9 + 5;const int MAXN = 305;const int MOD = 1000000007;const double eps = 1e-8;const double PI = acos(-1.0);int num[1005];int main(){int T,N;int ans;scanf("%d", &T);while (T--){scanf("%d", &N);for (int i = 0; i < N; i++)scanf("%d", &num[i]);sort(num, num + N);if (N % 2 == 0){ans = num[1] - num[0] - 1;for (int i = 3; i < N; i+=2)ans ^= num[i] - num[i - 1] - 1;}else{ans = num[0] - 1;for (int i = 2; i < N; i+=2)ans ^= num[i] - num[i - 1] - 1;}if (ans == 0)printf("Bob will win\n");elseprintf("Georgia will win\n");}}
阅读全文
0 0
- poj 1704 Georgia and Bob 阶梯博弈
- POJ 1704:Georgia and Bob 阶梯博弈
- POJ 1704 Georgia and Bob(阶梯博弈)
- [阶梯博弈] POJ 1704 Georgia and Bob
- POJ-1704 Georgia and Bob (阶梯博弈)
- poj 1704 Georgia and Bob(阶梯博弈)
- POJ-1704 Georgia and Bob (阶梯博弈)
- POJ 1704-Georgia and Bob(阶梯博弈)
- poj 1704 Georgia and Bob (阶梯博弈)
- POJ 1704 Georgia and Bob 阶梯尼姆博弈
- POJ 1704 Georgia and Bob ( 阶梯博弈 模板 )
- poj1704 Georgia and Bob(阶梯博弈)
- POJ1704 Georgia and Bob Nim阶梯博弈
- poj1704 Georgia and Bob(阶梯博弈)
- [POJ1704]Georgia and Bob(阶梯博弈)
- poj 1704 Georgia and Bob(博弈)
- POJ 1704(Georgia and Bob-Nim博弈)
- poj 1704 Georgia and Bob 博弈
- Oracle database 11g安装
- 网络广播--随笔记
- maven 内置属性
- 开源 java CMS
- HDU
- POJ-1704 Georgia and Bob (阶梯博弈)
- 安装J2EE的SDK报错:could not find the required version of the Java(TM)2 Runtime Environment in '(null)'的解决
- Binary Search Tree Iterator问题及解法
- 好用的下载器,不止有迅雷哟~
- k-近邻(KNN)算法
- 网易2018校招内推题目记录
- 树-堆结构练习——合并果子之哈夫曼树
- HDU 1030 Delta-wave(找规律)
- UDP打洞原理总结