Game Of Life

CodeChefRating 2478Open on judge ↗

Joseph is captured along with N-1 of his soldier friends. The enemy has decided to play the following game. These N soldiers are seated in a circle. The seats are numbered from 1 to N in clockwise order. The enemy chooses a nonzero integer K. If K is positive the enemy kills the Kth guy in clockwise direction starting from 1 (the 1st guy starting from 1 is 1 itself). Then the (2K)th alive guy in

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