DCP-540: Pile game 1 Back to All Problems

Beginner Game Theory > Observations/Pattern finding

---

Alice and Bob are playing a new pile game. Initially on the table, there are **N** piles. Each time, the player has to take **2^i** piles **(i ≥ 0)**. The winner is the one who takes the last pile. Alice starts first, and you need to find the winner of the game if both of them play optimally well. Input: ------ Input starts with an integer **T (1<=100)**, denoting the number of test cases. Each test case contains an integer **N (1 ≤ N ≤ 10^9)** denoting the number of piles on the table. Output: ------- For each test, print **"First"** if Alice wins, and **"Second"** otherwise. Sample Input ------------ 2 2 3 Sample Output ------------- First Second

---

Problem Setter:

Mahmud Allahverdiyev

---

Please login to submit solution to this problem.