FCTRL - Factorial


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.

ACM 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 "Travelling 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 behaviour 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 non-negative integer Z(N).

Example

Sample Input:

6
3
60
100
1024
23456
8735373

Sample Output:

0
14
24
253
5861
2183837

hide comments
nitishyadav169: 2018-07-21 17:17:46

In 1st go.log

green_arrow: 2018-07-10 21:25:40

Hello.... I am new to SPOJ, is there a way where i can check out the best solutions for a particular question in java ??
My answer was accepted in one go. But i do want to check out the best answers available for the same/

sahil_18: 2018-06-05 19:21:03


Last edit: 2018-06-05 19:27:02
kunal_sndly: 2018-06-01 23:50:08

https://www.youtube.com/watch?v=r5S7e4VAF7Q

imkiller: 2018-05-28 09:44:30

EasyOne but good logic.

pigpork: 2018-05-08 16:12:10

AC in 4th go thanks to a small mistake of placing break; in the middle of nowhere. Nice question :)

killercode: 2018-05-05 19:12:13

Why would I get "Wrong Answer" when example works perfectly as does all other numbers?

thunderbird18: 2018-04-25 08:29:53

thanks kolahzary!!! stupid mistake

arhaan: 2018-03-12 08:34:31

Why am I getting a tle with c++ even after implementing the thing to check only multiple of 5s?

ram777: 2018-02-11 05:22:57

thank for the link https://brilliant.org/wiki/trailing-number-of-zeros/


Added by:adrian
Date:2004-05-09
Time limit:6s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6 VB.NET
Resource:ACM Central European Programming Contest, Prague 2000