POJ-1704-Georgia and Bob
2014-07-24 01:47
239 查看
这个题可以转成Nim博弈,将相邻2个之差转为Nim博弈中的石子(如果n为奇数,那么第一个特殊处理),最后判断即可
代码:
代码:
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int maxn=1100; int n,a[maxn]; int main() { int T; scanf("%d",&T); while(T--) { scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); int ans=n&1?a[0]-1:0; for(int i=n&1?2:1;i<n;i+=2) ans^=a[i]-a[i-1]-1; if(!ans) printf("Bob will win\n"); else printf("Georgia will win\n"); } return 0; }
相关文章推荐
- poj 1704 Georgia and Bob(博弈)
- poj 1704 Georgia and Bob (nim)
- poj 1704 Georgia and Bob 博弈
- 数论练习2:K - Georgia and Bob(POJ 1704) SG函数运用:尼姆博奕(Nimm Game)
- poj 1704 Georgia and Bob(阶梯博弈)
- POJ 1704 Georgia and Bob
- POJ 1704 Georgia and Bob【Nim博弈】
- poj 1704 Georgia and Bob
- POJ 1704 Georgia and Bob
- poj_Georgia and Bob_1704
- POJ1704 Georgia and Bob(Nim问题)
- [原博客] POJ 1704 Georgia and Bob
- POJ 1704 Georgia and Bob [博弈]
- POJ 1704(Georgia and Bob-Nim博弈)
- 【博弈】poj1704 Georgia and Bob
- poj1704 Georgia and Bob(阶梯博弈)
- poj&nbsp;1704&nbsp;Georgia&nbsp;and&nbsp;Bob(博奕)
- POJ 1704 Georgia and Bob (Nim游戏变形)
- POJ-1704 Georgia and Bob (阶梯博弈)
- poj1704 Georgia and Bob