2960 S-Nim 取石子的个数有限定集合尼姆博弈
2010-08-05 09:40
253 查看
S-Nim
Description
Arthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows:
The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.
The players take turns chosing a heap and removing a positive number of beads from it.
The first player not able to make a move, loses.
Arthur and Caroll really enjoyed playing this simple game until they
recently learned an easy way to always be able to find the best move:
Xor the number of beads in the heaps in the current position (i.e. if we have 2, 4 and 7 the xor-sum will be 1 as 2 xor 4 xor 7 = 1).
If the xor-sum is 0, too bad, you will lose.
Otherwise, move such that the xor-sum becomes 0. This is always possible.
It is quite easy to convince oneself that this works. Consider these facts:
The player that takes the last bead wins.
After the winning player's last move the xor-sum will be 0.
The xor-sum will change after every move.
Which means that if you make sure that the xor-sum always is 0 when you have made your move, your opponent will never be able to win, and, thus, you will win.
Understandibly it is no fun to play a game when both players know how to play perfectly (ignorance is bliss). Fourtunately, Arthur and Caroll soon came up with a similar game, S-Nim, that seemed to solve this problem. Each player is now only allowed to remove a number of beads in some predefined set S, e.g. if we have S = f2, 5g each player is only allowed to remove 2 or 5 beads. Now it is not always possible to make the xor-sum 0 and, thus, the strategy above is useless. Or is it?
your job is to write a program that determines if a position of S-Nim is a losing or a winning position. A position is a winning position if there is at least one move to a losing position. A position is a losing position if there are no moves to a losing position. This means, as expected, that a position with no legal moves is a losing position.
Input
Input consists of a number of test cases.
For each test case: The first line contains a number k (0 < k ≤ 100) describing the size of S, followed by k numbers si (0 < si ≤ 10000) describing S. The second line contains a number m (0 < m ≤ 100) describing the number of positions to evaluate. The next m lines each contain a number l (0 < l ≤ 100) describing the number of heaps and l numbers hi (0 ≤ hi ≤ 10000) describing the number of beads in the heaps.
The last test case is followed by a 0 on a line of its own.
Output
For each position: If the described position is a winning position print a 'W'.If the described position is a losing position print an 'L'.
Print a newline after each test case.
Sample Input
Sample Output
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 1005 | Accepted: 571 |
Arthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows:
The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.
The players take turns chosing a heap and removing a positive number of beads from it.
The first player not able to make a move, loses.
Arthur and Caroll really enjoyed playing this simple game until they
recently learned an easy way to always be able to find the best move:
Xor the number of beads in the heaps in the current position (i.e. if we have 2, 4 and 7 the xor-sum will be 1 as 2 xor 4 xor 7 = 1).
If the xor-sum is 0, too bad, you will lose.
Otherwise, move such that the xor-sum becomes 0. This is always possible.
It is quite easy to convince oneself that this works. Consider these facts:
The player that takes the last bead wins.
After the winning player's last move the xor-sum will be 0.
The xor-sum will change after every move.
Which means that if you make sure that the xor-sum always is 0 when you have made your move, your opponent will never be able to win, and, thus, you will win.
Understandibly it is no fun to play a game when both players know how to play perfectly (ignorance is bliss). Fourtunately, Arthur and Caroll soon came up with a similar game, S-Nim, that seemed to solve this problem. Each player is now only allowed to remove a number of beads in some predefined set S, e.g. if we have S = f2, 5g each player is only allowed to remove 2 or 5 beads. Now it is not always possible to make the xor-sum 0 and, thus, the strategy above is useless. Or is it?
your job is to write a program that determines if a position of S-Nim is a losing or a winning position. A position is a winning position if there is at least one move to a losing position. A position is a losing position if there are no moves to a losing position. This means, as expected, that a position with no legal moves is a losing position.
Input
Input consists of a number of test cases.
For each test case: The first line contains a number k (0 < k ≤ 100) describing the size of S, followed by k numbers si (0 < si ≤ 10000) describing S. The second line contains a number m (0 < m ≤ 100) describing the number of positions to evaluate. The next m lines each contain a number l (0 < l ≤ 100) describing the number of heaps and l numbers hi (0 ≤ hi ≤ 10000) describing the number of beads in the heaps.
The last test case is followed by a 0 on a line of its own.
Output
For each position: If the described position is a winning position print a 'W'.If the described position is a losing position print an 'L'.
Print a newline after each test case.
Sample Input
2 2 5 3 2 5 12 3 2 4 7 4 2 3 7 12 5 1 2 3 4 5 3 2 5 12 3 2 4 7 4 2 3 7 12 0
Sample Output
LWW WWL
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int flag[11000],sg[11000];//sg函数 int t,a[110];//集合元素 void get_sg()//求sg函数 { memset(sg,0,sizeof(sg)); for(int i=1;i<11000;i++) { memset(flag,0,sizeof(flag)); for(int j=0;j<t;j++) { if(i-a[j]>=0) flag[sg[i-a[j]]]=1;//important } int j; for(j=0;j<11000;j++) { if(flag[j]==0) break; } sg[i]=j; } } int main() { while(cin>>t&&t) { for(int i=0;i<t;i++) cin>>a[i]; get_sg(); int m; cin>>m; for(int i=1;i<=m;i++) { int ans=0; int n;cin>>n; for(int i=0;i<n;i++) { int x; cin>>x; ans^=sg[x]; } if(ans) cout<<"W"; else cout<<"L"; } cout<<endl; } return 0; }
相关文章推荐
- anti_nim反尼姆博弈 hdu2509
- NYOJ 题目585取石子(六)(nim博弈)
- poj 2960,hdu 1536 S-NIM 博弈
- Fibonacci again and again (尼姆博弈 nim game)
- poj 2975 Nim 尼姆博弈
- 巴氏(bash)威佐夫(Wythoff)尼姆(Nim)博弈之模板
- [ACM] hdu 2176 取(m堆)石子游戏(Nim博弈)
- [ACM] hdu 2176 取(m堆)石子游戏(Nim博弈)
- POJ2960 S-Nim (sg博弈模板)
- [ACM] hdu 2176 取(m堆)石子游戏(Nim博弈)
- HDOJ2176取(m堆)石子游戏尼姆博弈 -输出取法
- hdu 2176 取(m堆)石子游戏(Nim博弈)
- poj2960 S-Nim(博弈SG函数)
- 取石子游戏之尼姆博弈
- (转)巴氏(bash)威佐夫(Wythoff)尼姆(Nim)博弈之模板
- POJ 2960 S-Nim(博弈)
- 尼姆博弈(Nimm's Game) 取石子
- 【 数论 Nim博弈 】HDU 2176 取(m堆)石子游戏
- HDU 2176 取(m堆)石子游戏(Nim博弈)
- hdu2176 取(m堆)石子游戏(nim博弈)