Lohit versus Avinash

CodeChefOpen on judge ↗

Problem description. Lohit and Avinash are playing a game. The game is as follows: There are N rooks given on a chess board of infinite size(fitting exactly in 1st quadrant). Lohit has to divide the game into two minigames such that he wins both. Minigame 1 will have some rooks and rest of the rooks will be in minigame 2. Each minigame will be started by Avinash, where in a player can move t

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