hdu3032 Nim or not Nim?(SG函数)
来源:互联网 发布:c语言打印倒九九乘法表 编辑:程序博客网 时间:2024/05/20 03:07
Nim or not Nim?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1710 Accepted Submission(s): 845
Problem Description
Nim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects provided they all come from the same heap.
Nim is usually played as a misere game, in which the player to take the last object loses. Nim can also be played as a normal play game, which means that the person who makes the last move (i.e., who takes the last object) wins. This is called normal play because most games follow this convention, even though Nim usually does not.
Alice and Bob is tired of playing Nim under the standard rule, so they make a difference by also allowing the player to separate one of the heaps into two smaller ones. That is, each turn the player may either remove any number of objects from a heap or separate a heap into two smaller ones, and the one who takes the last object wins.
Nim is usually played as a misere game, in which the player to take the last object loses. Nim can also be played as a normal play game, which means that the person who makes the last move (i.e., who takes the last object) wins. This is called normal play because most games follow this convention, even though Nim usually does not.
Alice and Bob is tired of playing Nim under the standard rule, so they make a difference by also allowing the player to separate one of the heaps into two smaller ones. That is, each turn the player may either remove any number of objects from a heap or separate a heap into two smaller ones, and the one who takes the last object wins.
Input
Input contains multiple test cases. The first line is an integer 1 ≤ T ≤ 100, the number of test cases. Each case begins with an integer N, indicating the number of the heaps, the next line contains N integers s[0], s[1], ...., s[N-1], representing heaps with s[0], s[1], ..., s[N-1] objects respectively.(1 ≤ N ≤ 10^6, 1 ≤ S[i] ≤ 2^31 - 1)
Output
For each test case, output a line which contains either "Alice" or "Bob", which is the winner of this game. Alice will play first. You may asume they never make mistakes.
Sample Input
232 2 323 3
Sample Output
AliceBob
Source
2009 Multi-University Training Contest 13 - Host by HIT
题意:nim博弈的变形,n堆石头,每次可以在一堆中取任意数目的石头,或者把它分成两堆不为0的堆;最后取完的获胜。
分析:一步一步的推SG值...
很明显sg[0]=0, sg[1]=1;
然后状态2的后继有:0,1和(1, 1), 他们的sg值为0,1,0;所以sg[2]=2;
然后状态3的后继有:0,1,2和(1, 2), 他们的sg值为0,1,2,3;所以sg[3]=4;
然后状态4的后继有:0,1,2,3、(1, 3)和(2, 2), 他们的sg值为0,1,2,4,5,0;所以sg[4]=3;
..........
最后根据所推出的sg值,得到:对于所有的k >= 0,有 sg( 4k+1 ) = 4k+1; sg( 4k+2 ) = 4k+2; sg( 4k+3 )= 4k+4; sg( 4k+4 ) = 4k+3。
#include <iostream>#include <cstdio>#include <cstring>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <cmath>#include <algorithm>using namespace std;const double eps = 1e-6;const double pi = acos(-1.0);const int INF = 1e9;const int MOD = 1e9+7;#define ll long long#define CL(a,b) memset(a,b,sizeof(a))#define lson (i<<1)#define rson ((i<<1)|1)#define N 1000010int gcd(int a,int b){return b?gcd(b,a%b):a;}int main(){ int T,n,x; scanf("%d",&T); while(T--) { scanf("%d",&n); int ans = 0; for(int i=1; i<=n; i++) { scanf("%d",&x); if(x%4==0) ans ^= (x-1); else if(x%4==1||x%4==2) ans ^= x; else ans ^= (x+1); } if(ans) cout<<"Alice"<<endl; else cout<<"Bob"<<endl; } return 0;}
0 0
- hdu3032 Nim or not Nim?(SG函数)
- HDU3032 Nim or not Nim?(SG函数)
- SG函数找规律练习-HDU3032- Nim or not Nim?
- [HDU3032]Nim or not Nim?(博弈Multi-SG游戏)
- Nim or not Nim?(hdu3032+SG函数)取走-分割游戏,经典
- hdu3032 Nim or not Nim? SG打表找规律
- hdu3032 Nim or not Nim?
- HDU3032-Nim or not Nim?
- 【HDU3032】【Lasker's Nim(一种Nim游戏)】Nim or not Nim? Multi-SG博弈、打表
- HDU 3032 Nim or not Nim? (sg函数求解)
- HDU 3032 Nim or not Nim? (SG函数应用)
- hdu 3032 Nim or not Nim? (sg函数规律)
- hdu 3032 Nim or not Nim? (Multi-SG函数)
- hdu3032 Nim or not Nim?-----sg打表找规律 允许把一堆石子分成两堆小的
- HDU 3032 Nim or not Nim? (sg函数)
- HDU 3032 Nim or not Nim?(sg函数博弈)
- HDU 3032-Nim or not Nim?(sg函数打表)
- (HDU 3032) Nim or not Nim(SG函数、博弈)
- js中"Maximum call stack size exceeded"解决方法
- 《JavaBean》----Java中的内省机制二
- Library Module详解
- MDI/MDIX接口
- (9)算数运算符
- hdu3032 Nim or not Nim?(SG函数)
- Java源码-目录遍历
- HDU 1874 畅通问题续 最短路径 迪杰斯特拉算法
- mtd编译
- 函数声明、函数表达式、匿名函数、立即执行函数
- hdoj 1596 1598 <变形最短路之最优路---贪心--枚举>
- Android从入门到放弃系列--目录
- No new migrations found. Your system is up-to-date.
- 初识AndroLua+