HUSTOJ 基础题组3 问题 P S-Nim

题目描述

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 =(2, 5) 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 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.

输出

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.

样例输入 Copy

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

样例输出 Copy

LWW
WWL

#include<iostream>
#include<algorithm>
using namespace std;
#define MAX 200

int sg[10010];
int S[MAX];
int s_size;

int SG_dfs(int pos) {
	if (sg[pos] != -1)   //如果已经算过了，那就不需要再计算了
		return sg[pos];

	//初始化vis，一开始都没有访问过
	bool vis[MAX];
	for (int i = 0; i < MAX; i++)
		vis[i] = 0;

	for (int i = 0; i < s_size; i++) {
		if (pos >= S[i]) {        //如果该位置满足S集合中的取走卡牌数量，也就是该位置的卡牌数是足够的
			SG_dfs(pos - S[i]);     //那么就去找sg[pos-S[i]]这个东西的值，因为后面需要用到它
			vis[sg[pos - S[i]]] = 1;    //标记已经被访问
		}
	}

	int min_num;
	for (int i = 0;; i++) {    
		if (!vis[i]) {
			min_num = i;
			break;
		}
	}
	return sg[pos] = min_num;
}

int main()
{
	while (scanf("%d", &s_size) == 1) {
		if (s_size == 0)
			break;

		//读入集合S，表明可移动的数量
		for (int i = 0; i < s_size; i++)
			scanf("%d", &S[i]);

		sort(S, S + s_size);

		//初始化sg数组
		for (int i = 0; i < 10010; i++)
			sg[i] = -1;

		int test_numbers;
		scanf("%d", &test_numbers);

		while (test_numbers--) {
			int card_piles;
			scanf("%d", &card_piles);

			int ans = 0;

			while (card_piles--) {
				int card_number;
				scanf("%d", &card_number);
				ans ^= SG_dfs(card_number);
			}
			if (ans == 0)
				printf("L");
			else
				printf("W");
		}
		printf("\n");
	}
	return 0;
}

关注B站 阳哥在路上