Scribd Logo
Upload

Welcome to Scribd!

  • 78 views

    Factorial: Problem Code: FCTRL

    Uploaded by

    Nitish Kumar
    The document discusses calculating the number of trailing zeros in factorial values (Z(N)) efficiently for large numbers, as programmers were studying this function while trying to solve the traveling salesman problem of finding the shortest route to visit all base transceiver stations and return to their building. It provides sample input and output showing the number of trailing zeros calculated for various numbers up to millions, and includes C code to calculate the number of trailing zeros for a given number.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Factorial: Problem Code: FCTRL

    Uploaded by

    Nitish Kumar
    78 views4 pages
    The document discusses calculating the number of trailing zeros in factorial values (Z(N)) efficiently for large numbers, as programmers were studying this function while trying to solve the traveling salesman problem of finding the shortest route to visit all base transceiver stations and return to their building. It provides sample input and output showing the number of trailing zeros calculated for various numbers up to millions, and includes C code to calculate the number of trailing zeros for a given number.

    Original Title

    Factorial

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses calculating the number of trailing zeros in factorial values (Z(N)) efficiently for large numbers, as programmers were studying this function while trying to solve the traveling salesman problem of finding the shortest route to visit all base transceiver stations and return to their building. It provides sample input and output showing the number of trailing zeros calculated for various numbers up to millions, and includes C code to calculate the number of trailing zeros for a given number.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    78 views4 pages

    Factorial: Problem Code: FCTRL

    Uploaded by

    Nitish Kumar
    The document discusses calculating the number of trailing zeros in factorial values (Z(N)) efficiently for large numbers, as programmers were studying this function while trying to solve the traveling salesman problem of finding the shortest route to visit all base transceiver stations and return to their building. It provides sample input and output showing the number of trailing zeros calculated for various numbers up to millions, and includes C code to calculate the number of trailing zeros for a given number.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    Factorial

    Problem code: FCTRL

    SUBMIT ALL SUBMISSIONS

    The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and every phone connects to the BTS with the strongest signal (in a little simplified view). Of course, BTSes need some attention and technicians need to check their function periodically. The technicians faced a very interesting problem recently. Given a set of BTSes to visit, they needed to find the shortest path to visit all of the given points and return back to the central company building. Programmers have spent several months studying this problem but with no results. They were unable to find the solution fast enough. After a long time, one of the programmers found this problem in a conference article. Unfortunately, he found that the problem is so called "Traveling Salesman Problem" and it is very hard to solve. If we have N BTSes to be visited, we can visit them in any order, giving us N! possibilities to examine. The function expressing that number is called factorial and can be computed as a product 1.2.3.4....N. The number is very high even for a relatively small N. The programmers understood they had no chance to solve the problem. But because they have already received the research grant from the government, they needed to continue with their studies and produce at least some results. So they started to study behavior of the factorial function. For example, they defined the function Z. For any positive integer N, Z(N) is the number of zeros at the end of the decimal form of number N!. They noticed that this function never decreases. If we have two

    numbers N1<N2, then Z(N1) <= Z(N2). It is because we can never "lose" any trailing zero by multiplying by any positive number. We can only get new and new zeros. The function Z is very interesting, so we need a computer program that can determine its value efficiently.

    Input
    There is a single positive integer T on the first line of input (equal to about 100000). It stands for the number of numbers to follow. Then there are T lines, each containing exactly one positive integer number N, 1 <= N <= 1000000000.

    Output
    For every number N, output a single line containing the single nonnegative integer Z(N). Example
    Sample Input:

    6 3 60 100 1024 23456 8735373


    Sample Output:

    0 14 24 253 5861 2183837


    Date: 20081201 Time limit: 8s Source limit: 50000 Languages: C C99 strict C++ PAS gpc PAS fpc JAVA NICE JAR C# C#2 NEM ST ASM D FORT ADA BASH PERL PYTH RUBY LUA ICON PIKE PHP SCM guile SCM qobi LISP sbcl LISP clisp HASK CAML CLPS PRLG WSPC BF ICK TEXT

    #include<iostream.h> #include<conio.h> #include<stdio.h> #include<time.h> #include<math.h> void main() { clock_t start, end; unsigned long int a,b,c,d,e,f,g,n,m,s=0,l; long double r=0; clrscr(); start =clock(); cout<<"Enter the number of test cases less then 10"<<endl; cin>>a; for(n=0;n<a;n++) { char a1[13]; cout<<"\nEnter a number "<<endl; gets(a1); s=0; for(b=0;a1[b]!='\0';b++); b--; for(e=0;a1[e]!='\0';e++) { c=a1[b]-48;

    s=s+pow(10,e)*c; b--; } b=0; for(m=1;m<15;m++) { c=s/pow(5,m); b=b+c; } cout<<"\n"<<b; } end=clock(); cout<<"\nThe time was: \n"<<((end - start) / CLK_TCK); r=r+(double)((end - start) / CLK_TCK); cout<<"\nTotal time = "<<r; getch(); }

    You might also like