Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

Two players 'X' and 'Y', are playing a coin game. Initially, there are 'N' coins. Each player can pick exactly 'A' coins or 'B' coins or 1 coin. A player loses the game if he is not able to pick any coins. 'X' always starts the game, and each player plays optimally. You are supposed to find which player wins the coin game.

Detailed explanation

```
1 <= T <= 10
1 <= N <= 10^5
Time limit: 1 sec
```

```
2
5 3 4
4 2 3
```

```
1
0
```

```
For the first test case, There are 5 coins, every player can pick 1 or 3 or 4 coins on his/her turn. X picks 3 coins in the first turn, now the remaining coins are 2, Y can only pick 1 coin. So, X wins by picking the last coin.
For the second test case, No, matter what coins X picks, Y always wins.
```

```
2
8 2 4
9 3 4
```

```
1
0
```