Coins

CodeChefOpen on judge ↗

Problem description. Dwij and Harshad are playing a game. In the game there are N heaps of coins where the ith heap has A[i] number of coins, where 1 - The players take turns alternately, starting with the first player. - At each move, the player removes a positive number of coins from one heap. - The player who removes the last coin wins. - Both players play optimally. Find out the number

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI