Skip to content
Related Articles

Related Articles

Find the number of consecutive zero at the end after multiplying n numbers
  • Last Updated : 13 Apr, 2021

Given an array with n numbers. The task is to print number of consecutive zero’s at the end after multiplying all the n number. 
Examples : 
 

Input : arr[] = {100, 10}
Output : 3
Explanation : 100 x 10 = 1000,
3 zero's at the end.

Input : arr[] = {100, 10, 5, 25, 35, 14}
Output : 4
Explanation :
100 x 10 x 5 x 25 x 35 x 14 = 61250000,
4 zero's at the end

 

Naive Approach : 
First multiple all the number and save into the string(because if the multiplicative number is big as 2^64 then it give wrong, so store every multiple in string) and then count the number of zero’s.
Efficient approach : 
First count the 2’s factor of n numbers and then count the 5’s factor of all n number then print the smallest one.
For Example – 
 

n_number's  | 2's factor | 5's factor 
100         |     2      |    2
10          |     1      |    1
5           |     0      |    1
25          |     0      |    2
35          |     0      |    1 
14          |     1      |    0
Total       |     4      |    7

we can take a minimum so there number of 
zero's is 4

Below is the implementation of above approach : 
 

C++




// CPP program to find the number of consecutive zero
// at the end after multiplying n numbers
#include<iostream>
using namespace std;
 
// Function to count two's factor
int two_factor(int n)
{   
    // Count number of 2s present in n
    int twocount = 0;
    while (n % 2 == 0)
    {
        twocount++;
        n = n / 2;
    }
    return twocount;
}
 
// Function to count five's factor
int five_factor(int n)
{
    int fivecount = 0;
    while (n % 5 == 0)
    {
        fivecount++;
        n = n / 5;
    }
    return fivecount;
}
 
// Function to count number of zeros
int find_con_zero(int arr[], int n)
{
    int twocount = 0;
    int fivecount = 0;
    for (int i = 0; i < n; i++) {
 
        // Count the two's factor of n number
        twocount += two_factor(arr[i]);
 
        // Count the five's factor of n number
        fivecount += five_factor(arr[i]);
    }
 
    // Return the minimum
    if (twocount < fivecount)
        return twocount;
    else
        return fivecount;
}
 
// Driver Code
int main()
{
    int arr[] = { 100, 10, 5, 25, 35, 14 };
    int n = 6;
    cout << find_con_zero(arr, n);
}
Java



// Java program to find the number
// of consecutive zero at the end
// after multiplying n numbers
 
public class GfG{
 
    // Function to count two's factor
    static int two_factor(int n)
    {    
        // Count number of 2s
        // present in n
        int twocount = 0;
        while (n % 2 == 0)
        {
            twocount++;
            n = n / 2;
        }
        return twocount;
    }
 
    // Function to count five's
    // factor
    static int five_factor(int n)
    {
        int fivecount = 0;
        while (n % 5 == 0)
        {
            fivecount++;
            n = n / 5;
        }
        return fivecount;
    }
 
    // Function to count number of zeros
    static int find_con_zero(int arr[], int n)
    {
        int twocount = 0;
        int fivecount = 0; 
         
        for (int i = 0; i < n; i++) {  
 
            // Count the two's factor
            // of n number
            twocount += two_factor(arr[i]);
 
            // Count the five's factor
            // of n number
            fivecount += five_factor(arr[i]);
        }
 
        // Return the minimum
        if (twocount < fivecount)
            return twocount;
        else
            return fivecount;
    }
     
    // driver function
    public static void main(String s[])
    {
        int arr[] = { 100, 10, 5, 25, 35, 14 };
        int n = 6;
        System.out.println(find_con_zero(arr, n));    
    }
}
 
// This code is contributed by Gitanjali
Python3



# Python3 code to find the number of consecutive zero
# at the end after multiplying n numbers
 
# Function to count two's factor
def two_factor( n ):
 
    # Count number of 2s present in n
    twocount = 0
    while n % 2 == 0:
        twocount+=1
        n =int( n / 2)
    return twocount
     
# Function to count five's factor
def five_factor( n ):
    fivecount = 0
    while n % 5 == 0:
        fivecount+=1
        n = int(n / 5)
    return fivecount
 
# Function to count number of zeros
def find_con_zero( arr, n ):
    twocount = 0
    fivecount = 0
    for i in range(n):
 
        # Count the two's factor of n number
        twocount += two_factor(arr[i])
         
        # Count the five's factor of n number
        fivecount += five_factor(arr[i])
     
    # Return the minimum
    if twocount < fivecount:
        return twocount
    else:
        return fivecount
 
# Driver Code
arr = [ 100, 10, 5, 25, 35, 14 ]
n = 6
print(find_con_zero(arr, n))
 
# This code is contributed by "Sharad_Bhardwaj".
C#



// C# program to find the number
// of consecutive zero at the end
// after multiplying n numbers
using System;
 
public class GfG {
 
    // Function to count two's factor
    static int two_factor(int n)
    {
         
        // Count number of 2s
        // present in n
        int twocount = 0;
         
        while (n % 2 == 0)
        {
            twocount++;
            n = n / 2;
        }
         
        return twocount;
    }
 
    // Function to count five's
    // factor
    static int five_factor(int n)
    {
        int fivecount = 0;
         
        while (n % 5 == 0)
        {
            fivecount++;
            n = n / 5;
        }
         
        return fivecount;
    }
 
    // Function to count number of zeros
    static int find_con_zero(int []arr, int n)
    {
        int twocount = 0;
        int fivecount = 0;
         
        for (int i = 0; i < n; i++) {
 
            // Count the two's factor
            // of n number
            twocount += two_factor(arr[i]);
 
            // Count the five's factor
            // of n number
            fivecount += five_factor(arr[i]);
        }
 
        // Return the minimum
        if (twocount < fivecount)
            return twocount;
        else
            return fivecount;
    }
     
    // driver function
    public static void Main()
    {
         
        int []arr = { 100, 10, 5, 25, 35, 14 };
        int n = 6;
         
        Console.WriteLine(find_con_zero(arr, n));
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// PHP program to find the number
// of consecutive zero at the end
// after multiplying n numbers
 
// Function to count two's factor
function two_factor($n)
{
    // Count number of
    // 2s present in n
    $twocount = 0;
    while ($n % 2 == 0)
    {
        $twocount++;
        $n = (int)($n / 2);
    }
    return $twocount;
}
 
// Function to count
// five's factor
function five_factor($n)
{
    $fivecount = 0;
    while ($n % 5 == 0)
    {
        $fivecount++;
        $n = (int)($n / 5);
    }
    return $fivecount;
}
 
// Function to count
// number of zeros
function find_con_zero($arr, $n)
{
    $twocount = 0;
    $fivecount = 0;
    for ($i = 0; $i < $n; $i++)
    {
 
        // Count the two's
        // factor of n number
        $twocount += two_factor($arr[$i]);
 
        // Count the five's
        // factor of n number
        $fivecount += five_factor($arr[$i]);
    }
 
    // Return the minimum
    if ($twocount < $fivecount)
        return $twocount;
    else
        return $fivecount;
}
 
// Driver Code
$arr= array(100, 10, 5,
            25, 35, 14);
$n = 6;
echo find_con_zero($arr, $n);
 
// This code is contributed by mits
?>
Javascript



<script>
 
// JavaScript program to find the number
// of consecutive zero at the end
// after multiplying n numbers
 
    // Function to count two's factor
    function two_factor(n)
    {    
     
        // Count number of 2s
        // present in n
        let twocount = 0;
        while (n % 2 == 0)
        {
            twocount++;
            n = n / 2;
        }
        return twocount;
    }
   
    // Function to count five's
    // factor
    function five_factor(n)
    {
        let fivecount = 0;
        while (n % 5 == 0)
        {
            fivecount++;
            n = n / 5;
        }
        return fivecount;
    }
   
    // Function to count number of zeros
    function find_con_zero(arr, n)
    {
        let twocount = 0;
        let fivecount = 0; 
           
        for (let i = 0; i < n; i++)
        {  
   
            // Count the two's factor
            // of n number
            twocount += two_factor(arr[i]);
   
            // Count the five's factor
            // of n number
            fivecount += five_factor(arr[i]);
        }
   
        // Return the minimum
        if (twocount < fivecount)
            return twocount;
        else
            return fivecount;
    }
  
// Driver code           
        let arr = [ 100, 10, 5, 25, 35, 14 ];
        let n = 6;
        document.write(find_con_zero(arr, n));
          
         // This code is contributed by code_hunt.
</script>
Output : 
 
4
 
Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.



My Personal Notes
arrow_drop_up
Previous
Python program to count number of vowels using sets in given string
Next

Python | Reverse an array upto a given position
Recommended Articles
Page :
Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
22, Jan 19
Find Kth number from sorted array formed by multiplying any two numbers in the array
18, Feb 20
Maximize the subarray sum after multiplying all elements of any subarray with X
24, Apr 19
Print Matrix after multiplying Matrix elements N times
05, Nov 20
Queries to calculate GCD of an array after multiplying first or last K elements by X
22, Feb 21
Maximize the sum of array after multiplying a prefix and suffix by -1
09, Apr 20
Remove all zero-rows and all zero-columns from a Matrix
06, Jan 21
Check if elements of array can be made equal by multiplying given prime numbers
20, Feb 17
Find Number of Even cells in a Zero Matrix after Q queries
09, Jan 20
Double the first element and move zero to end
17, Dec 17
Find the player to reach at least N by multiplying with any value from given range
24, Jan 21
Min operations to reduce N by multiplying by any number or taking square root
13, Jul 20
Count number of pairs (i, j) up to N that can be made equal on multiplying with a pair from the range [1, N / 2]
30, Apr 21
Find the index which is the last to be reduced to zero after performing a given operation
15, May 19
Maximize the sum of array by multiplying prefix of array with -1
01, Nov 18
Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
12, Jul 19
Convert 1 into X in min steps by multiplying with 2 or 3 or by adding 1
15, Jul 20
Reach A and B by multiplying them with K and K^2 at every step
26, Mar 18
Minimum steps to reach N from 1 by multiplying each step by 2, 3, 4 or 5
07, May 20
Maximum subsequence sum possible by multiplying each element by its index
16, Sep 20
Minimum operations required to convert X to Y by multiplying X with the given co-primes
15, Jul 19
Check if N can be obtained from 1 by repetitively multiplying by 10 or 20
25, Jun 20
Reduce sum of any subset of an array to 1 by multiplying all its elements by any value
25, Feb 21
Maximize matrix sum by repeatedly multiplying pairs of adjacent elements with -1
14, Feb 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
DevanshuAgarwal
@DevanshuAgarwal
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox