← All problemsSign in

Srikant And The Box

Srikant has got a box which can only be opened by a password. There is a number $N$ written on box. Srikant has figured out that the password is least significant $k$ digits of $N!$ after all trailing zeros are removed from $N!$ . For example, if $N=5$ and $k=2$ then password is $21$ as $5!=120$ and if we remove the trailing zero least significant two digits are $2,1$ . Similarly if $N=10$ and $k=

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

Sign in to chat with the tutor and save your progress.

Sign in to start