Josephus Again !

CodeChefOpen on judge ↗

Josephus best friend Platypus challenged him to solve his problem. Can you help Josephus to solve the challenge? There are N people standing in a circle waiting to be executed numbered 1,2,3,..N. The counting out begin with 1st person standing in the circle and proceeds around the circle in a fixed direction(1->2->3...). There and M more people which are not currently part of circle and called a

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