英语题翻译27

Factorial | JXNUOJ

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.

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

For every number N, output a single line containing the single non-negative integer Z(N).

翻译：

GSM 网络中最重要的部分是所谓的基站收发信台 (BTS)。这些收发器形成了称为小区的区域（这个术语赋予了蜂窝电话的名称），并且每部电话都以最强的信号连接到 BTS（在稍微简化的视图中）。当然，BTS 需要一些注意，技术人员需要定期检查它们的功能。ACM 技术人员最近遇到了一个非常有趣的问题。给定一组要访问的 BTS，他们需要找到访问所有给定点并返回中心公司大楼的最短路径。程序员花了几个月的时间研究这个问题，但没有结果。他们无法足够快地找到解决方案。很久之后，其中一位程序员在一篇会议文章中发现了这个问题。不幸的是，他发现这个问题就是所谓的“Travelling Salesman Problem”，而且很难解决。如果我们有 N 个要访问的 BTS，我们可以按任意顺序访问它们，给我们 N!个检查的可能性。表示该数字的函数称为阶乘，可以计算为乘积 1.2.3.4....N。即使对于相对较小的 N，这个数字也非常高。程序员明白他们没有机会解决问题。但因为他们已经获得了政府的研究资助，他们需要继续学习，至少取得一些成果。于是他们开始研究阶乘函数的行为。例如，他们定义了函数 Z。对于任何正整数 N，Z(N) 是数字 N! 的十进制形式末尾的零个数。他们注意到这个功能永远不会减少。如果我们有两个数 N1<N2，那么 Z(N1) <= Z(N2)。这是因为我们永远不能通过乘以任何正数来“丢失”任何尾随零。我们只能得到新的和新的零。函数 Z 非常有趣，因此我们需要一个能够有效确定其值的程序。

输入的第一行有一个正整数 T。表示跟随的数字的数量。然后有 T 行，每行正好包含一个正整数 N，1 <= N <= 1000000000。

对于每个数字 N，输出包含一个非负整数 Z(N) 的一行。