Oh My Hats

CodeChefOpen on judge ↗

Fantasize an auditorium with a total of $N$ seats, each carrying a hat on it in the upright (erect or non-inverted) manner. Now, $N$ fellows shall be entering the auditorium, but, to your astonishment, none of them would be taking any seat. They will rather play the following prank with you: The $ith$ person $(1<=i<=N)$ will approach the first seat, invert the hat, then approach $(i+1)th$ seat,

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