backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-06-10 12:06:29 +08:00
Code Issues Projects Releases Wiki Activity

Update bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Swastika Gupta
2021-07-25 23:38:23 +05:30
committed by GitHub
parent b6a8021e35
commit 67f2a3cf00
1 changed files with 3 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp
View File

@@ -8,12 +8,9 @@
* that number. A factorial of a number N is a product of all numbers in the
range [1, N].
* We know that we get a trailing zero only if the number is multiple of 10 or
has a factor pair (2,5). In all factorials of
* any number greater than 5, we have many 2s more than 5s in the prime
factorization of that number. Dividing a
* number by powers of 5 will give us the count of 5s in its factors. So, the
number of 5s will tell us the number of trailing zeroes.
* We know that we get a trailing zero only if the number is multiple of 10 or has a factor pair (2,5). In all factorials of
* any number greater than 5, we have many 2s more than 5s in the prime factorization of that number. Dividing a
* number by powers of 5 will give us the count of 5s in its factors. So, the number of 5s will tell us the number of trailing zeroes.
* @author [Swastika Gupta](https://github.com/Swastyy)
*/