类似取石子 POJ 1704 Georgia and Bob
2012-08-27 14:16
113 查看
/* http://poj.org/problem?id=1704 当n是奇数时,将第一个数的位置与0绑定,注意输入的数据不一定是按从小到大排序的,所以要进行排序 */ #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int ans[1111]; int main(){ #ifndef ONLINE_JUDGE freopen("in", "r", stdin); #endif int nCase; cin >>nCase; while(nCase--){ int n, res = 0; cin >>n; ans[0] = 0; for(int i=1; i<=n; i++) cin >>ans[i]; sort(ans, ans+n+1); int i; if(n%2 == 0) i = 2; else i = 1; for( ; i<=n; i+=2) res ^= ans[i]-ans[i-1]-1; if(res) cout <<"Georgia will win" <<endl; else cout <<"Bob will win" <<endl; } return 0; }
相关文章推荐
- 类似取石子 POJ 1704 Georgia and Bob
- POJ - 1704 Georgia and Bob
- Georgia and Bob(尼姆博弈)
- POJ 1704-Georgia and Bob(阶梯博弈)
- 1704 Georgia and Bob(尼姆博弈变形)
- POJ 1704 Georgia and Bob G++
- pku 1704 Georgia and Bob
- POJ 1704 Georgia and Bob(博弈)
- poj1704 Georgia and Bob(阶梯博弈)
- poj1704 Georgia and Bob(阶梯博弈)
- poj 1704 Georgia and Bob nim博弈
- POJ 1704 Georgia and Bob
- POJ 1704:Georgia and Bob 阶梯博弈
- POJ 1704 Georgia and Bob
- Georgia and Bob---博弈
- [POJ1704]Georgia and Bob
- Georgia and Bob(尼姆博弈)
- poj 1704 Georgia and Bob (尼姆博奕)
- poj Georgia and Bob + 蓝桥杯决赛原题:高僧斗法 阶梯博弈大法
- 【博弈】poj1704 Georgia and Bob