Poker Nim


Problem Statement :


Poker Nim is another -player game that's a simple variation on a Nim game. The rules of the games are as follows:

The game starts with  piles of chips indexed from  to . Each pile  (where ) has  chips.
The players move in alternating turns. During each move, the current player must perform either of the following actions:

Remove one or more chips from a single pile.
Add one or more chips to a single pile.
At least  chip must be added or removed during each turn.

To ensure that the game ends in finite time, a player cannot add chips to any pile  more than  times.
The player who removes the last chip wins the game.
Given the values of , , and the numbers of chips in each of the  piles, determine whether the person who wins the game is the first or second person to move. Assume both players move optimally.


Input Format

The first line contains an integer, , denoting the number of test cases.
Each of the  subsequent lines defines a test case. Each test case is described over the following two lines:

Two space-separated integers,  (the number of piles) and  (the maximum number of times an individual player can add chips to some pile ), respectively.
 space-separated integers, , where each  describes the number of chips at pile .


Output Format

For each test case, print the name of the winner on a new line (i.e., either  First or  Second ).



Solution :


                        In   C  :





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

int main() {
    int tc,n,k,i,j;
    long int a[100],ans;
    scanf("%d",&tc);
    for(i=0;i<tc;i++)
        {
        scanf("%d %d",&n,&k);
        for(j=0;j<n;j++)
            {
            scanf("%ld",&a[j]);
        }
        ans=0;
        //while(l)
          //  {
            for(j=0;j<n;j++)
                {
                ans=ans^a[j];
            }
        //}
        if(ans==0)
            printf("Second\n");
        else 
            printf("First\n");
    }
    return 0;
}
                    

                        In  C  ++  :





#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

int main()
{
	long nTest,n,res,x,k;
	scanf("%ld",&nTest);
	while (nTest--)
	{
		scanf("%ld%ld%ld",&n,&k,&res);
		for (long i=1; i<n; ++i) scanf("%ld",&x),res^=x;
		puts((!res)?"Second":"First");
	}
}
                    

                        In  Java :





import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        int[] s = new int[100];
        int i,j,k,n;
        
        int nimsum;
        for(int tt =0;tt<t;tt++){
            n = in.nextInt();
            k = in.nextInt();
            for(i = 0;i<n;i++){
                s[i]=in.nextInt();
            }
            nimsum = s[0];
            for(i = 1;i<n;i++){
                nimsum^=s[i];
            }
            
            if (nimsum > 0) System.out.println("First");
            else System.out.println("Second");
        }
    }
}
                    

                        In  Python3 :





def nim(array):
    ans = 0
    while array:
        ans ^= array.pop()
    return ans

def main():
    for _ in range(int(input())):
        input()
        print(['Second', 'First'][bool(nim(list(map(int, input().split()))))])

if __name__ == '__main__':
    main()
                    



Copyrights © ClownMonster's Inc