Yeh ho gaya to Pawri krenge!

CodeChefOpen on judge ↗

Jeb Patel's favourite number is $9$. When you ask him the number of $9's$ present in a decimal number $1001001295100169$, he will say $5$ because he counts the binary representations(with intersections) of $9$ too. Jeb wants to find the number of decimal numbers having $N$ digits and having exactly $K$ $9's$ in each of them (don't forget to count the binary representation along with $9's$). So giv

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