Clowns Ordeal

CodeChefOpen on judge ↗

One day there was a naughty kid in the circus. The kid challenged the head clown in a very strange manner. The kid gave him a problem which he knew that the clown wont be able to solve as he was the dumbest person on earth. Now, you being the head assistant have been asked by the circusmaster to help the clown save his face. The question goes like this: How many strings are possible such that no

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