A Problem on Sticks

CodeChefRating 1199Open on judge ↗

On a sunny day, Akbar and Birbal were taking a leisurely walk in palace gardens. Suddenly, Akbar noticed a bunch of sticks on the ground and decided to test Birbal's wits. There are $N$ stick holders with negligible size (numbered $1$ through $N$) in a row on the ground. Akbar places all the sticks in them vertically; for each valid $i$, the initial height of the stick in the $i$-th holder is $

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