[BOJ 8279] Double Factorial

View as PDF

Submit solution

Points: 3
Time limit: 1.0s
Memory limit: 128M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

For a positive integer n, its factorial is defined as the product of all integers from 1 to n, denoted as n!. Now n double factorial is the product of 1 factorial, 2 factorial, ..., up to n factorial: 1! · 2! · 3! · ... · n!. Given n, find the number of trailing zeros of a decimal representation of n double factorial.

입력 형식

The first and only line of the standard input contains an integer n (1 ≤ n ≤ 1018).

출력 형식

The first and only line of the standard output should contain the number of trailing zeros of n double factorial.

예제 입력

11

예제 출력

9

힌트

11 double factorial equals 265 790 267 296 391 946 810 949 632 000 000 000. This number has 9 trailing zeros.


Comments

There are no comments at the moment.