Jumping Game

CodeChefOpen on judge ↗

Alice and Bob are playing a game. There have a very large checker board whose rows and columns are numbered from 0 onwards. A single counter is placed at an initial square (X,Y). Alice plays first and they take alternate turns. In each turn, if the counter was initially at square (x,y) then it can be moved to any square (a,b) which satisifes the following conditions : 1) 0 2) (a,b) must be VISIBL

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