**Nimble Game**

### Problem Statement :

Two people are playing Nimble! The rules of the game are: The game is played on a line of squares, indexed from to . Each square (where ) contains coins. For example: The players move in alternating turns. During each move, the current player must remove exactly coin from square and move it to square if and only if . The game ends when all coins are in square and nobody can make a move. The first player to have no available move loses the game. Given the value of and the number of coins in each square, 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: An integer, , denoting the number of squares. space-separated integers, , where each describes the number of coins at square .

### Solution :

` ````
Solution in C :
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int i,j,t,n,c,result;
scanf("%d", &t);
for (i=1; i<=t; i++) {
scanf("%d", &n);
result = 0;
if (n==0) {
printf("Second\n");
continue;
}
scanf("%d", &c);
if (n==1) {
printf("Second\n");
continue;
}
for(j=1; j<n; j++) {
scanf("%d", &c);
if (c%2) {
result ^= j;
}
}
if (result) {
printf("First\n");
} else {
printf("Second\n");
}
}
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--)
{
ll res=0,x;
scanf("%ld",&n);
for (long i=0; i<n; ++i)
{
scanf("%lld",&x);
if (x&1LL && i>0) res^=i;
}
if (n==1) puts("Second");
else puts((!res)?"Second":"First");
}
}
```

` ````
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: Nimble Game
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;
int nimsum;
for(int tt =0;tt<t;tt++){
n = in.nextInt();
if( n==1 ) {
n=in.nextInt();//consume it
System.out.println("Second");
} else {//n>1
for(i = 0;i<n;i++){
s[i]=in.nextInt();
}
nimsum = 0;
for(i = 1;i<n;i++){
nimsum^=(s[i]%2==1)?i:0;
}
if (nimsum > 0) System.out.println("First");
else System.out.println("Second");
}
}
}
}
```

` ````
Solution in Python :
In Python3 :
test = int(input())
for _ in range(test):
n = int(input())
ar = list(map(int,input().strip().split()))
#print(n,ar)
result = []
for i in range(len(ar)):
result.append(ar[i]%2)
#print(result)
xor = 0
for i,n in enumerate(result):
xor = xor ^(i*n)
if xor==0:
print('Second')
else:
print('First')
```

## View More Similar Problems

## Waiter

You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the

View Solution →## Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →## 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 →