NIM游戏

原创 2016年05月31日 08:54:37

(一)NIM simplfied

          现在有一堆棋子,共有n颗,两人轮流取子,每次能取1或2颗,谁取到最后一颗棋子谁就是loser,你先开始取

          输入:n

          输出:必胜第一次应该取出的棋子数量,如果必败,则输出为0

         分析:关键在于n%3——如果n%3=1则不可能获胜,必败;如果n%3=2则输出为1给最后对手剩一个;如果 n%3=0则输出为2给最后对手剩1个

              错位组合~

#include <stdio.h>
#include <stdlib.h>

  int main()
{
int N,n;
int i;
scanf("%d",&N);
for(i=0;i<N;i++)
{
scanf("%d",&n);
int j;
j=n%3;
if(j==0)
printf("2\n");
else if(j==1)
printf("0\n");
else
printf("1\n");
}
return 0;
}


(二)NIM——POJ2975

    

Description

Nim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her turn, a player’s move consists of removing one or more stones from any single pile. Play ends when all the stones have been removed, at which point the last player to have moved is declared the winner. Given a position in Nim, your task is to determine how many winning moves there are in that position.

A position in Nim is called “losing” if the first player to move from that position would lose if both sides played perfectly. A “winning move,” then, is a move that leaves the game in a losing position. There is a famous theorem that classifies all losing positions. Suppose a Nim position contains n piles having k1, k2, …, kn stones respectively; in such a position, there are k1 + k2 + … + kn possible moves. We write each ki in binary (base 2). Then, the Nim position is losing if and only if, among all the ki’s, there are an even number of 1’s in each digit position. In other words, the Nim position is losing if and only if the xor of the ki’s is 0.

Consider the position with three piles given by k1 = 7, k2 = 11, and k3 = 13. In binary, these values are as follows:


  111
1011
1101

There are an odd number of 1’s among the rightmost digits, so this position is not losing. However, suppose k3 were changed to be 12. Then, there would be exactly two 1’s in each digit position, and thus, the Nim position would become losing. Since a winning move is any move that leaves the game in a losing position, it follows that removing one stone from the third pile is a winning move when k1 = 7, k2 = 11, and k3 = 13. In fact, there are exactly three winning moves from this position: namely removing one stone from any of the three piles.

Input

The input test file will contain multiple test cases, each of which begins with a line indicating the number of piles, 1 ≤ n ≤ 1000. On the next line, there are n positive integers, 1 ≤ ki ≤ 1, 000, 000, 000, indicating the number of stones in each pile. The end-of-file is marked by a test case with n = 0 and should not be processed.

Output

For each test case, write a single line with an integer indicating the number of winning moves from the given Nim position.

Sample Input

 
3
7 11 13
2
1000000000 1000000000
0

Sample Output

 
3
0


分析给定n堆石子,如果你必输,输出0,否则输出一个方案数,表明总共有多少总策略可以保证自己必胜

题目给出了必输的要求是n堆石子全部异或xor如果结果为0,则此状态必输。必胜的关键就是我们要在其中一堆石子中拿取一定量的石头使n堆石子异或结果为0。

题目要求输出在几堆石子中取子后能满足要求

array[i]^array[i]=0,则remain^array[i]是如果第i堆石头不加入异或时,其他石头总的异或值。

只要array[i]>remain^array[i],则第i堆石头可行。

PS:注意是大于而不是大于等于,每一局都需要取一颗或以上的石头。

#include<stdio.h>
int main()
{
int maxn=1001;
int n,a[maxn];
    while(scanf("%d",&n)&&n)
    {
int t=0,i=0;
for(i=0;i<n;i++)
{
    scanf("%d",&a[i]);
    t=t^a[i];
}
int ans=0;
for(i=0;i<n;i++)
{
if((t^a[i])<a[i])
ans++;
}
  printf("%d\n",ans);
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

组合数学取子游戏nim

  • 2013年03月31日 14:32
  • 19KB
  • 下载

Nim游戏博弈(收集完全版)

Nim游戏的概述: 还记得这个游戏吗? 给出n列珍珠,两人轮流取珍珠,每次在某一列中取至少1颗珍珠,但不能在两列中取。最后拿光珍珠的人输。 后来,在一份资料上看到,这种游戏称为“拈(Nim)”。...
  • No0ne
  • No0ne
  • 2014年12月12日 18:08
  • 269

Qt 实现NIM游戏

  • 2016年10月26日 17:18
  • 6KB
  • 下载

Nim游戏

题目1 : 博弈游戏·Nim游戏 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 今天我们要认识一对新朋友,Alice与Bob。 Alice与Bob总是在进行...

BZOJ 3105 [cqoi2013]新Nim游戏 拟阵

BZOJ 3105 [cqoi2013]新Nim游戏 拟阵
  • wzq_QwQ
  • wzq_QwQ
  • 2015年08月26日 16:00
  • 925

【编程之美】1.11 NIM(1) —— 排石头的游戏

题目大意如下: N块石头排列成一行,每块石头对应一个编号。两个玩家依次取石头,每次取只能取任意一块或者相邻的两块。 石头在游戏过程中不能移位,最后将剩下的石头一次取光的玩家获胜。 问:该游戏是否存...

《挑战程序设计竞赛》4.2.2 游戏必胜策略-Nim与Grundy数 POJ2975 1704 2311 3537 2315 CF138D(2)

POJ 2975 取石头问题http://poj.org/problem?id=2975题意有n堆石头,甲乙两个人轮流拿,每次从某堆石头中拿出至少一个。若轮到某人时无石可拿,此人输。 当甲存在必赢策...

Nim游戏和sg函数

整里如下: Nim游戏是组合游戏(Combinatorial Games)的一种,准确来说,属于“Impartial Combinatori Games”(以下简称 ICG)。满足以...
  • atupal
  • atupal
  • 2012年09月04日 10:36
  • 903

[ACM] hdu 2176 取(m堆)石子游戏(Nim博弈)

取(m堆)石子游戏 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:NIM游戏
举报原因:
原因补充:

(最多只允许输入30个字)