Misère Nim
Problem Statement :
Two people are playing game of Misère Nim. The basic rules for this game are as follows: The game starts with piles of stones indexed from to . Each pile (where ) has stones. The players move in alternating turns. During each move, the current player must remove one or more stones from a single pile. The player who removes the last stone loses the game. Given the value of and the number of stones in each pile, determine whether the person who wins the game is the first or second person to move. If the first player to move wins, print First on a new line; otherwise, print Second. Assume both players move optimally. There is no permutation of optimal moves where player 2 wins. For example, player 1 chooses the first pile. If player 2 chooses 1 from another pile, player 1 will choose the pile with 2 left. If player 2 chooses a pile of 2, player 1 chooses 1 from the remaining pile leaving the last stone for player 2. Return First. Function Description Complete the misereNim function in the editor below. misereNim has the following parameters: int s[n]: the number of stones in each pile Returns string: either First or Second Input Format The first line contains an integer, , the number of test cases. Each test case is described over two lines: An integer, , the number of piles. space-separated integers, , that describe the number of stones at pile .
Solution :
Solution in C :
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int num_tests = 0;
int number_of_piles = 0;
int *piles = NULL;
int idx, idx1;
int total = 0;
int pile_more_than_one_true = 0;
scanf("%d", &num_tests);
for (idx = 0; idx < num_tests; idx++) {
scanf("%d", &number_of_piles);
piles = malloc(number_of_piles*sizeof(int));
for (idx1 = 0; idx1 < number_of_piles; idx1++){
scanf("%d", &piles[idx1]);
if (piles[idx1] > 1)
pile_more_than_one_true = 1;
total ^= piles[idx1];
}
if (pile_more_than_one_true && total == 0)
printf("Second\n");
else if (!pile_more_than_one_true && total == 1)
printf("Second\n");
else
printf("First\n");
total = 0;
number_of_piles = 0;
free(piles);
pile_more_than_one_true = 0;
}
return 0;
}
Solution in C++ :
In C++ :
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
long nTest,n;
scanf("%ld",&nTest);
while (nTest--)
{
long res=0,cnt=0,x;
scanf("%ld",&n);
for (long i=0; i<n; ++i)
{
scanf("%ld",&x);
if (x==1) ++cnt;
res^=x;
}
if (cnt==n) puts((cnt&1)?"Second":"First");
else puts((res>0)?"First":"Second");
}
}
Solution in Java :
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
//Day 2: Misere Nim
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int t = in.nextInt();
int[] s = new int[100];
int i,j,n, max;
int nimsum;
for(int tt =0;tt<t;tt++){
n = in.nextInt();
max = 0;
for(i = 0;i<n;i++){
s[i]=in.nextInt();
max = Math.max(s[i], max);
}
nimsum = s[0];
for(i = 1;i<n;i++){
nimsum^=s[i];
}
if (max==1 && nimsum == 1 || max>1 && nimsum==0) System.out.println("Second");
else System.out.println("First");
}
}
}
Solution in Python :
In Python3 :
test = int (input ())
for _ in range (test):
pile = int (input ())
ar = list (map (int, input (). strip (). split ()))
xor = 0
for n in ar:
xor = xor ^ n
if ar == [1] * len (ar):
if len (ar)% 2 == 0:
print ('First')
else:
print ('Second')
else:
if xor == 0:
print ('Second')
else:
print ('First')
View More Similar Problems
Castle on the Grid
You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):
View Solution →Down to Zero II
You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.
View Solution →Truck Tour
Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr
View Solution →Queries with Fixed Length
Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon
View Solution →QHEAP1
This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element
View Solution →Jesse and Cookies
Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t
View Solution →