Poj 1401 Factorial 题解

Poj 1401 Factorial

题目信息

Description

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. 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.

Output

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

Sample Input

• 6
• 3
• 60
• 100
• 1024
• 23456
• 8735373

Sample Output

• 0
• 14
• 24
• 253
• 5861
• 2183837

个人理解

题意理解

求一个数 N 的阶乘 N! 的结果的末尾的零 0 的个数

问题分析

例如求 60 的阶乘 60! 的零的个数,相当于计算 60! 结果,计算零的个数(1 * 2 * 3 * … 60),但是这种方法肯定是会超时的,所以我们需要换个思路,为什么会参数 0 呢,最终都会化为 2 * 5 的形式,所以题目转化为求 (2, 5) 的个数,同时又因为,2 的个数远远大于 5 的个数,题目转化为求因子 5 的个数,即将

(1 * 2 * 3 * 4 * 5 * 10 * 25 * … *60)
转化为

((1) * (2) * (3) * (4) * (5) * (2 * 5) * ( 5 * 5) * … * (2 * 2 * 3 * 5 ))

那么以 60 为例:

• 60 / 5 = 12 表示 1 - 60 中有 12 个数是 5 的倍数
• 12 / 5 = 2 表示 1 - 60 中有 2 个数是 25 的倍数

代码(java)

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // 创建一个 Scanner 对象
        Scanner cin = new Scanner(System.in);
        // 获取到数据的行数
        int rows = cin.nextInt();
        // 循环遍历 rows 行数据,并输出结果
        for (int i = 0; i < rows; i++) {
            int number = cin.nextInt();
            // 阶乘结果尾部 0 的个数
            int zeroCount = 0;
            while (number / 5 != 0) {
                seroCount += number / 5;
                number /= 5;
            }
            System.out.println(zeroCount);
        }
    }

}