A Simple Nim(博弈----Multi-SG打表找规律）

最新推荐文章于 2019-05-18 15:58:00 发布

短发--短发

最新推荐文章于 2019-05-18 15:58:00 发布

阅读量335

点赞数

分类专栏：博弈SG函数

本文链接：https://blog.csdn.net/qq_41593380/article/details/80059812

版权

博弈SG函数专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Problem Description

Two players take turns picking candies from n heaps,the player who picks the last one will win the game.On each turn they can pick any number of candies which come from the same heap(picking no candy is not allowed).To make the game more interesting,players can separate one heap into three smaller heaps(no empty heaps)instead of the picking operation.Please find out which player will win the game if each of them never make mistakes.

Input

Intput 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≤106,1≤s[i]≤109)

Output

For each test case,output a line whick contains either"First player wins."or"Second player wins".

Sample Input

   224 431 2 4 
 

Sample Output

   Second player wins.First player wins. 
 

题意：一堆糖果两人轮流进行操作

1 ，在一堆中取任意个糖果

2 ，将一堆糖果分成三堆（每堆非空）

分成三堆可以这样分，或者其他操作只要能使其相加等于该数即可

	for(int j = 1 ; j <= i ; j++)//分成三堆 
		{
			for(int k = 1 ; k <= i ; k++)
			{
				for(int o = 1 ; o <= i ; o++)
				{
					if(j + k + o == i)
					{
						Hash[sg[j] ^ sg[k] ^sg[o]] = 1;
					}
				}
			}
		 }

仅仅是通过打表找个规律，再根据规律来写，所以这里不考虑时间复杂度。

SG打表代码：

int sg[maxn] , Hash[maxn];
void getsg(int x)
{
	memset(sg , 0 , sizeof(sg));
	for(int i = 0 ; i <= x ; i++)
	{
		memset(Hash , 0 , sizeof(Hash));
		for(int j = 1 ; j <= i ; j++)
		{
			Hash[sg[i-j]] = 1;//取任意数字 
		}
		for(int j = 1 ; j <= i ; j++)//分成三堆 
		{
			for(int k = 1 ; k <= i ; k++)
			{
				for(int o = 1 ; o <= i ; o++)
				{
					if(j + k + o == i)
					{
						Hash[sg[j] ^ sg[k] ^sg[o]] = 1;
					}
				}
			}
		 } 
		 for(int j = 0 ; j<= x ; j++)
		 {
		 	if(Hash[j] == 0)
		 	{
		 		sg[i] = j;
		 		break;
			 }
		 }
		 cout << i << ":" << sg[i] << endl;
	}
}

由此发现规律；

x%8 == 0 时， sg[x] = x-1;

x%8 == 7 时， sg[x] = x+1;

因此代码如下：

#include <stdio.h>
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
	int n , t , x , flag;
	while(~scanf("%d" , &n))
	{
		while(n--)
		{
			 flag = 0 ;
			scanf("%d" , &t);
			while(t--)
			{
				scanf("%d" , &x);
				if(x % 8 == 0)
				{
					flag ^= x-1;
				}
				else if(x%8 == 7)
				{
					flag ^= x+1;
				 } 
				 else
				 {
				 	flag ^= x;
				 }
			
			}
			if(flag == 0)
			{
				printf("Second player wins.\n");
			}
			else
			{
				printf("First player wins.\n");
			}
		}
	}
	return 0;
 }