Round Around

CodeChefOpen on judge ↗

Chef is standing in a lawn, shaped like a regular $N$ sided polygon. The vertices of the lawn are numbered ($1$ to $N$) in clockwise fashion. He can jump from a vertex to any of the adjacent vertices. His children are standing on vertices numbered $A$ and $B$. He wants to know what vertex he should stand on so that the sum of the minimum jumps required to reach $A$ and minimum jumps required to

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