**Game of Stones**

### Problem Statement :

Two players called and are playing a game with a starting number of stones. Player always plays first, and the two players move in alternating turns. The game's rules are as follows: In a single move, a player can remove either , , or stones from the game board. If a player is unable to make a move, that player loses the game. Given the starting number of stones, find and print the name of the winner. is named First and is named Second. Each player plays optimally, meaning they will not make a move that causes them to lose the game if a winning move exists. For example, if , can make the following moves: removes stones leaving . will then remove stones and win. removes stones leaving . cannot move and loses. would make the second play and win the game. Function Description Complete the gameOfStones function in the editor below. It should return a string, either First or Second. gameOfStones has the following parameter(s): n: an integer that represents the starting number of stones Input Format The first line contains an integer , the number of test cases. Each of the next lines contains an integer , the number of stones in a test case. Output Format On a new line for each test case, print First if the first player is the winner. Otherwise print Second.

### Solution :

` ````
Solution in C :
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
int dp[n+1];
dp[0]=dp[1]=1;
dp[4]=dp[2]=dp[3]=dp[5]=0;
int i;
for(i=6;i<=n;i++)
{
if(dp[i-5]||dp[i-2]||dp[i-3])
dp[i]=0;
else
dp[i]=1;
}
if(dp[n])
printf("Second\n");
else
printf("First\n");
}
return 0;
}
```

` ````
Solution in C++ :
In C++ :
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
long DP[101];
bool dp(long x)
{
if (DP[x]!=-1) return DP[x];
bool res=!dp(x-2);
if (x>3) res=res|(!dp(x-3));
if (x>5) res=res|(!dp(x-5));
DP[x]=res;
return res;
}
int main()
{
long nTest,n;
memset(DP,-1,sizeof(DP));
DP[1]=0;
DP[2]=DP[3]=DP[5]=1;
scanf("%ld",&nTest);
while (nTest--)
{
scanf("%ld",&n);
puts(dp(n)?"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 {
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int no_of_testcases=Integer.parseInt(br.readLine());
while(no_of_testcases-->0){
int number=Integer.parseInt(br.readLine());
if(number%7==0 || number%7==1){
System.out.println("Second");
}
else{
System.out.println("First");
}
}
}
}
```

` ````
Solution in Python :
In Python3 :
def get_winner(n):
ans=[None]*(n+1)
ans[0]=False
ans[1]=False
for i in range(n+1):
if ans[i]==False:
for j in [i+2,i+3,i+5]:
if j<n+1:
ans[j]=True
elif ans[i] is None:
for j in [i-2, i-3, i-5]:
if j>0 and ans[j]!=True:
print('??',i,j,ans[j])
ans[i]=False
for j in [i+2,i+3,i+5]:
if j<n+1:
ans[j]=True
# print(i,ans)
return ans
w=get_winner(100)
for _ in range(int(input().strip())):
print('First' if w[int(input().strip())] else 'Second')
```

## View More Similar Problems

## Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →## Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →## Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →## The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →## Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →## Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →