Nim v2

CodeChefOpen on judge ↗

Problem description. Alice and Bob are bored with the usual game of Nim . Their school has taught them that the initial state of the game determines the winner if games are played optimally(No intention of losing for either player). So, Alice and Bob decide to create a new version of the game called Nim 2.0 . This is like the usual game of Nim except it uses only 2 piles of stones(v2.0, see?).

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