From 67f2a3cf0076f2303b6c36a44311316af431e425 Mon Sep 17 00:00:00 2001 From: Swastika Gupta <64654203+Swastyy@users.noreply.github.com> Date: Sun, 25 Jul 2021 23:38:23 +0530 Subject: [PATCH] Update bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp Co-authored-by: David Leal --- .../count_of_trailing_ciphers_in_factorial_n.cpp | 9 +++------ 1 file changed, 3 insertions(+), 6 deletions(-) diff --git a/bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp b/bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp index 8f8cacf40..5242fa9e3 100644 --- a/bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp +++ b/bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp @@ -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) */