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
Dynamic Array
Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.
View Solution →Left Rotation
A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d
View Solution →Sparse Arrays
There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun
View Solution →Array Manipulation
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu
View Solution →Print the Elements of a Linked List
This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode
View Solution →Insert a Node at the Tail of a Linked List
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink
View Solution →