COMPLICATED PROBLEM

CodeChefOpen on judge ↗

Mr. Vaibhav asks all the great programmers of the round 1 codezilla Qualifiers to solve a compilcated problem. He gives them an integer m and asks for the number of positive integers n, such that the factorial of n ends with exactly m zeroes. Are you among those great programmers of codeZilla'17 who can solve this problem? Mr Vaibhav wants to know Output First print k — the number of values of

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