Trailing Zeros

CSESIntroductory ProblemsOpen on judge ↗

Your task is to calculate the number of trailing zeros in the factorial n!. For example, 20!=2432902008176640000 and it has 4 trailing zeros. Input The only input line has an integer n. Output Print the number of trailing zeros in n!. Constraints - 1 \le n \le 10^9 Example Input: 20 Output: 4

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