Program to find trailing zeros in factorial of n in C++?

Suppose we have a number n, we have to find the number of trailing zeros of n!.

So, if the input is like n = 20, then the output will be 4, as 20! = 2432902008176640000

To solve this, we will follow these steps

• set count := 0

• for i := 5, (n/i) > 1, update i := i * 5, do

  • count := count + (n /i)

• return count

Let us see the following implementation to get better understanding

Example

 Live Demo

#include <iostream>
#include <cmath>
#define MAX 20
using namespace std;

int countTrailingZeros(int n) {
   int count = 0;

   for (int i = 5; n / i >= 1; i *= 5)
      count += n / i;

   return count;
}

main() {
   int n = 20;
   cout << "Number of trailing zeros: " << countTrailingZeros(n);
}

Input

20

Output

Number of trailing zeros: 4

Arnab Chakraborty

Published on 10-Nov-2020 09:24:02

• Related Questions & Answers
• Program to find trailing zeros in factorial of n in C++?\n
• Count trailing zeros in factorial of a number in C++
• Finding trailing zeros of a factorial JavaScript
• C program to find trailing zero in given factorial
• Factorial Trailing Zeroes in C++
• C/C++ Program to Count trailing zeroes in factorial of a number?
• Python Program to Count trailing zeroes in factorial of a number
• Java Program to Count trailing zeroes in factorial of a number
• Remove Trailing Zeros from string in C++
• C++ Program to Find Factorial
• C/C++ Programming to Count trailing zeroes in factorial of a number?
• C Program to count trailing and leading zeros in a binary number
• Count number of trailing zeros in product of array in C++
• C++ Program to Find Factorial of Large Numbers
• Add trailing Zeros to a Python string
• C++ program to find first digit in factorial of a number