ROUNDDANCE

CodeChefOpen on judge ↗

There are $N$ students standing in a circle in some order. The index of the $i$-th student is $Pi$ it is guaranteed that all indices of students are distinct integers from $1$ to $N$ (i.e. they form a permutation). Students want to start a round dance. A $clockwise$ round dance can be started if the student $2$ comes right after the student $1$ in clockwise order (there are no students between

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