Shivang Banega Crorepati!!!

CodeChefOpen on judge ↗

Shivang wants to be a $Crorepati$ so he started playing game of $Kaun$ $Banega$ $Crorepati$ with Nayse.But Nayse is very evil man and he doesn't want shivang to be $Crorepati$. So Nayse created a game in which Nayse have $N$ $Crorepati$ passes and $M$ $Roadpati$ passes.Nayse asks shivang that he can put any number of passes in any of the given $K$ envelopes.Then Nayse will choose one envelope dip

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