/* Factorial Zeros The factorial of a non-negative integer n, denoted by n! is the product of all positive integers less than or equal to n. For example, 5! = 5 x 4 x 3 x 2 x 1 = 120. Write a program to calculate the number of trailing zeros in n! where n is any positive number less than 10^7. For Example: Input: 5 Output: 1 (5! = 120 has one trailing zero) Input: 10 Output: 2 (10! = 3628800 has two trailing zeroes) */ #include templatestruct F{ static const uintmax_t r = (uintmax_t)N * F::r ; }; template<>struct F<0>{ static const uintmax_t r = 1; }; templateclass FactorialZeros{ templatestruct GetTrailing0s{ static const int result = 0; }; templatestruct GetTrailing0s{ static const int result = 1 + GetTrailing0s::result ; }; public : static const int n = X; static const uintmax_t factorial = F::r ; static const int trailing_zeros = GetTrailing0s::result ; }; #include #define FACTORIAL_ZEROS( x ) { \ typedef FactorialZeros f ; \ \ std::cout << x \ << " : F = " \ << f::factorial \ << " , " \ << f::trailing_zeros \ << " zeros.\n"; \ } \ // int main() { FACTORIAL_ZEROS(0) FACTORIAL_ZEROS(1) FACTORIAL_ZEROS(2) FACTORIAL_ZEROS(5) FACTORIAL_ZEROS(10) FACTORIAL_ZEROS(19) FACTORIAL_ZEROS(20) return 0; }

[CHALLENGE] Factorial0s