← All problemsSign in

INTERESTING GAME

The President of Coding Club NIT Meghalaya hosted a game. He initially gives an array of $N (1Tushar and Utkarsh begin playing the game on this array. Players move one by one. First player can choose for his move a contiguous subsegment of non-zero length with an odd sum of numbers and remove it from the array, after that the remaining parts of the array are joined together into one array and the

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

Sign in to chat with the tutor and save your progress.

Sign in to start