Hard Luck

CodeChefOpen on judge ↗

*April 5, 2019* The nightmare is finally over for Kohli and RCB. Looking back at the season, Kohli observes his bad luck with tosses. Frustrated and bored, Kohli writes the result of his tosses as a boolean string('0' for a loss and '1' for a win) of length $N$. He calls a string beautiful if the string is non-empty and is non-decreasing. For example, the strings "01" and "00" are beautiful wh

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