Trailing Zero

CodeChefOpen on judge ↗

Given an integer N, the task is to find the number of trailing zeroes in the base 16 representation of the factorial of N. Inputs - The first and the only line contains an integer N . Outputs - Output a single integer , the number of trailing zeros in the base 16 representation of the factorial of N . Constraints - 1 ≤ N ≤ 109 . Example Input 1 6 Example Output 1 1 Example Input 2 100

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