# 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;
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;
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 ==  * len (ar):
if len (ar)% 2 == 0:
print ('First')
else:
print ('Second')
else:
if xor == 0:
print ('Second')
else:
print ('First')```
```

## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .