Given two integer N or M find the number of zero’s trailing in product of factorials (N!*M!)?
Input : N = 4, M = 5 Output : 1 Explanation : 4! = 24, 5! = 120 Product has only 1 trailing 0. Input : N = 127!, M = 57! Output : 44
As discussed in number of zeros in N! can be calculated by recursively dividing N by 5 and adding up the quotients.
For example if N = 127, then
Number of 0 in 127! = 127/5 + 127/25 + 127/125 + 127/625
= 25 + 5 + 1 + 0
Number of 0s in N! = 31. Similarly, for M we can calculate and add both of them.
So, by above we can conclude that number of zeroes in N!*M! Is equal to sum of number of zeroes in N! and M!.
f(N) = floor(N/5) + floor(N/5^2) + … floor(N/5^3) + …
f(M) = floor(x/5) + floor(M/5^2) + … floor(M/5^3) + …
Then answer is f(N)+f(M)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Queries for the product of first N factorials
- Product of first N factorials
- Count number of trailing zeros in product of array
- GCD of factorials of two numbers
- Find last two digits of sum of N factorials
- Check if a given number divides the sum of the factorials of its digits
- Minimum number of Factorials whose sum is equal to N
- Count number of trailing zeros in Binary representation of a number using Bitset
- Count natural numbers whose factorials are divisible by x but not y
- Numbers whose factorials end with n zeros
- Calculating Factorials using Stirling Approximation
- Print factorials of a range in right aligned format
- Find the unit place digit of sum of N factorials
- Find sum of factorials in an array
- Sum of factorials of Prime numbers in a Linked list
- Count trailing zeroes in factorial of a number
- Smallest number with at least n trailing zeroes in factorial
- Smallest number divisible by n and has at-least k trailing zeros
- Largest number with maximum trailing nines which is less than N and greater than N-D
- Count number of trailing zeros in (1^1)*(2^2)*(3^3)*(4^4)*..
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : jit_t