FCTRL - Editorial

editorial
, , ,
1

PROBLEM LINKS by RAJKUMAR:

Practice

Author: ADMIN

Editorialist: SUSHANT AGARWAL

DIFFICULTY:

EASY

PREREQUISITES:

Basic looping,Basic Maths(Number Theory)

PROBLEM:

Find the Number of Trailing Zeroes at the end of N!

EXPLANATION:

Let us look at some examples and develop the algorithm step by step as we go along.

Suppose I need to find out how many times 10 is a factor in the expansion of 23!.

A number gets a zero at the end of it if the number has 10 as a factor. For instance, 10 is a factor of 50, 120, and 1234567890.Since 5×2 = 10, I need to account for all the products of 5 and 2. Looking at the factors in the expansion of a factorial, there are many more numbers that are multiples of 2 (2, 4, 6, 8, 10, 12, 14,…)than are multiples of 5 (5, 10, 15,…). That is, if I take all the numbers with 5 as a factor, I’ll have way more than enough even numbers to pair with them to get factors of 10 (and another trailing zero on my factorial). So to find the number of times 10 is a factor, all I really need to worry about is how many times 5 is a factor in all of the numbers between 1 and 23.
How many multiples of 5 are between 1 and 23? There is 5, 10, 15, and 20, for four multiples of 5. Paired with 2’s from the even factors, this makes for four factors of 10, so:

23! has four trailing zeroes

Find the number of trailing zeroes in 101!
Okay, how many multiples of 5 are there in the numbers from 1 to 101? There’s 5, 10, 15, 20, 25,…
Oh, heck; let’s do this the short way: 100 is the closest multiple of 5 below 101, and 100 ÷ 5 = 20, so there are twenty multiples of 5 between 1 and 101.

But wait: 25 is 5Ă—5, so each multiple of 25 has an extra factor of 5 that I need to account for. How many multiples of 25 are between 1 and 101? Since 100 Ă· 25 = 4, there are four multiples of 25 between 1 and 101.

Adding these, I get 20 + 4 = 24 trailing zeroes in 101!

Find the number of trailing zeroes in the expansion of 1000!
Okay, there are 1000 ÷ 5 = 200 multiples of 5 between 1 and 1000. The next power of 5, namely 25, has 1000 ÷ 25 = 40 multiples between 1 and 1000. The next power of 5, namely 125, will also fit in the expansion, and has 1000 ÷ 125 = 8 multiples between 1 and 1000. The next power of 5, namely 625, also fits in the expansion, and has 1000 ÷ 625 = 1.6.625 has 1 multiple between 1 and 1000. (I don’t care about the 0.6 “multiples”, only the one full multiple, so I truncate my division down to a whole number.)
In total, I have 200 + 40 + 8 + 1 = 249 copies of the factor 5 in the expansion, and thus:
249 trailing zeroes in the expansion of 1000!

The General Algorithm to be followed is given below:

  • Take the number that you’ve been given the factorial of.
  • Divide by 5; if you get a decimal, truncate to a whole number.
  • Divide by 5^2 = 25; if you get a decimal, truncate to a whole number.
  • Divide by 5^3 = 125; if you get a decimal, truncate to a whole number.
  • Continue with ever-higher powers of 5, until your division results in a number less than 1. Once the division is less than 1, stop.
  • Sum all the whole numbers you got in your divisions. This is the number of trailing zeroes.

Here’s how the algorithm works. How many trailing zeroes would be found in 4617!, upon expansion? I’ll apply the procedure from above:

  • 5^1 : 4617 Ă· 5 = 923.4, so I get 923 factors of 5
  • 5^2 : 4617 Ă· 25 = 184.68, so I get 184 additional factors of 5
  • 5^3 : 4617 Ă· 125 = 36.936, so I get 36 additional factors of 5
  • 5^4 : 4617 Ă· 625 = 7.3872, so I get 7 additional factors of 5
  • 5^5 : 4617 Ă· 3125 = 1.47744, so I get 1 more factor of 5
  • 5^6 : 4617 Ă· 15625 = 0.295488, which is less than 1, so I stop here.
  • Then 4617! has 923 + 184 + 36 + 7 + 1 = 1151 trailing zeroes.

EDITORIALIST’S SOLUTION:

Editorialist’s solution can be found here.

3 Likes
2

#include
#include
using namespace std;

int main()
{
int t;
cin >> t;
 
for (int k = 0; k < t; k++)
{
int n;
scanf("%d", &n);
 
int c = 0;
while (n >= 5)
{
n /= 5;
c += n;
}
 
printf("%d\n", c);
}
 
return 0;
}

Hmmm

3

There is a bit simpler solution to this problem.

  1. start with the number n you’ve been given the factorial of
  2. divide n by 5. truncate the result tmp to a whole number and save it as a variable trailingZeros
  3. divide tmp by 5. truncate the result to a whole number and add it to trailingZeros
  4. … repeat until result < 1
  5. the sum trailingZeros is the number of trailing zeros in n

Example:

int getTrailingZeros(int n) {
  int trailingZeros = 0;
  int tmp;
  while ((tmp = n / 5) >= 1) {
    trailingZeros+=tmp;
    n = tmp;
  }
  return trailingZeros;
}

See also here.

4

Python:

def z(n):
    zeros=0
    i=1
    while n//5**i>0:
        zeros=zeros+n//5**i
        i=i+1
    return zeros
t=int(input())
while t>0:
    n=int(input())
    print(z(n))
    t=t-1
5

#include<stdio.h>
int main()
{
long long int j, a, i, z,T,N,count;

scanf("%lld",&T);
for(i=0;i<T;i++)
{
scanf("%lld",&N);
count=0;
for(j=1;j<=N;j++)
{
a=j;
if(a%5==0)
while(a)
{
if(a%5==0)
count++;
a=a/5;

	}

}
printf("%lld\n",count);
}

return 0;

i want to ask why isnt it working ?

6

#include <stdio.h>
#include <math.h>
#include <stdlib.h>

main(){
int i=0,j,l,a,b;
scanf("%d",&j);
for(i=0;i<j;i=i+1){
scanf("%d",&l);
a=fact(l);
b=cntz(a);

printf("%d\n",b);
}
}
/----- For the Factorial-----/
int fact(int n){
int m=0,facto=1;
for(m=n;m>0;m–){
facto=facto*m;
}
return(facto);

}

/------For Counting Zeros-----/
int cntz(int x){
int y=0,z;
while(z==0){
z=x%10;
if(z==0){
y=y+1;
x=x/10;}

	}
	return(y);

}
7

can anyone tell me whats wrong in this code?
thank you
#include
#include<math.h>
using namespace std;

int main() {
int n,a,ans=0;
cin>>n;
while(n!=0)
{
cin>>a;
for(int i=1;pow(5,i)<a;++i)
{
ans=ans+(a/pow(5,i));
}
cout<<ans<<"\n";
ans=0;
n–;
}
}

the code gave me exact answer as given in example in IDE, but showed me wrong after submission.

8

WHY IS THIS ANSWER WRONG ?

#include <stdio.h>
#include <math.h>
main()
{
int s,x,i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x);
s=x/5+x/25+x/125+x/625+x/3125+x/15625+x/pow(5,7)+x/pow(5,8)+x/pow(5,9)+x/pow(5,10)+x/pow(5,11)+x/pow(5,12)+x/pow(5,13);
printf("%d\n",s);
}
return 0;
}

9

Hello I am doing it with python. All of test cases are passing but My solution is not accepted .Can someone help please.
Here is my code :

  def fact(x):
    count=0
    while x/5>0:
        count+=x/5
        x=x/5
    #print("hello")
    print (count)
t=int(input())

for i in range(t):
    fact(int(input()))
10

import java.util.;
import java.io.;

public class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int noftimes=sc.nextInt();
for (int i = 0; i < noftimes; i++) {
int value=sc.nextInt();
int count=getValue(value/5);
System.out.println(String.valueOf(count));
}

}
private static int getValue(int n) {
if (n <= 5) {
return n;
}
return getValue(n / 5) + n;
}
}

11

#include<stdio.h>
int main()
{
unsigned n, mul;
unsigned t=0,i,z=0,temp,c2=0,c5=0;
scanf ( “%u”, &t );
while ( t-- ) {
c5=0;
c2=0;
scanf ( "u", &n ); for ( i = 1 ;i <= n ; i++){ mul *= i; temp = i; while ( temp 5 == 0 && temp > 0){
c5++;
temp = temp / 5 ;
}
while ( temp % 2 == 0 && temp > 0){
c2++;
temp = temp / 2 ;
}
}
printf("%u\n",c5);
}
return 0;
}

why is this not running in console? why are judges facing infiniteloop here.

12

#include<stdio.h>
int fact(int);
int zeroes(int);
main()
{
int p,i,j,a,b;
printf(“enter the number of numbers to be entered”);scanf("%d",&p);
for(i=0;i<p;i++){scanf("%d",&j);a=fact(j);b=zeroes(a);printf("%d",b);}}
int fact(int j)
{int f;if(n==1)f=1;else f=f*fact(j-1);return f;}
int zeroes(int a);
{int y=0,z;while(z==0){z=a%10;if(z==0){y=y+1;a=a%10}}return y;}

13

#include<stdio.h>
int fact(int);
int zeroes(int);
main()
{
int p,i,j,a,b;
printf(“enter the number of numbers to be entered”);scanf("%d",&p);
for(i=0;i<p;i++){scanf("%d",&j);a=fact(j);b=zeroes(a);printf("%d",b);}}
int fact(int j)
{int f;if(n==1)f=1;else f=f*fact(j-1);return f;}
int zeroes(int a);
{int y=0,z;while(z==0){z=a%10;if(z==0){y=y+1;a=a%10}}return y;}

14

#include
#include
using namespace std;
int main()
{
unsigned long long int t, n, i, maxpo, sum;
cin>>t;
while(t–)
{
cin>>n;
maxpo = sum = 0;
maxpo = (int)(log(n)/log(5));
for(i = 1;i <= maxpo;i++)
sum += n/pow(5,i);
cout<<sum<<endl;
}
}

15

instead of finding the factors why can’t we actually count the no of zero’s of that number using “number modulo 10” which gives us the last digit in that number

16

can we solve this by actually counting the trailing zero’s and not by the factor method? Won’t that be much simpler?

17

#include<stdio.h>
int calc (int entr);
int main(void)
{
long num;
scanf("%ld",&num);
long entr[num];
long fact[num];
for(int i=0;i<num;i++)
{
scanf("%ld",&entr[i]);
fact[i]=calc(entr[i]);

}
for(int i=0;i<num;i++)
    printf("%ld\n",fact[i]);
return 0;

}
int calc (int entr)
{
int fin= entr/5;
if(fin==0)
return 0;
else
return fin+calc(fin);

}

18

#include<stdio.h>
int calc (int entr);
int main(void)
{
long num;
scanf("%ld",&num);
long entr[num];
long fact[num];
for(int i=0;i<num;i++)
{
scanf("%ld",&entr[i]);
fact[i]=calc(entr[i]);

}
for(int i=0;i<num;i++)
    printf("%ld\n",fact[i]);
return 0;

}
int calc (int entr)
{
int fin= entr/5;
if(fin==0)
return 0;
else
return fin+calc(fin);

}

19

#include<stdio.h>
#include<math.h>
long int zeroes(long int a);
int main()
{
int n,i=0;
long int k[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%ld\n",&k[i]);
}
for(i=0;i<n;i++)
{
zeroes(k[i]);
}
return 0;
}
long int zeroes(long int a)
{
int z=1,b=0,i=0;
while(a>5*z)
{
z=pow(5,i+1);
b+=a/z;
i+=1;
}
printf("%ld\n",b);
}

why wrong?

20

#include
using namespace std;
int main()
{int x,t,i;
cin>>t;
if(t<=10000)
{for(int j=0;j<t;j++)
{int count=0;
cin>>x;
if(x<=1000000000 && x>=1)
{for(i=5;x/i>=1;i=i*5)
{count=count+(x/i);}
cout<<count<<"\n";}
else
break;
}}

}