大数字
在许多应用中都需要很大的整数。这些应用中的一部分使用密码来确保数据的运输,encryption(加密),等等。在这个问题中给出一个数字,你必须确定数字的阶乘中的位数
输入:
输入由几行整数组成。第一行包含一个整数n,为需要测试的样例数目,接下来n行,每行一个整数n(1<=n<=1e7).
输出
输出包含输入中出现的整数的阶乘中的位数。
Big Number
1000ms 32768K
描述:
In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you have to determine the number of digits in the factorial of the number.
输入:
Input consists of several lines of integer numbers. The first line contains an integer n, which is the number of cases to be tested, followed by n lines, one integer 1 ≤ n ≤ 107 on each line.
输出:
The output contains the number of digits in the factorial of the integers appearing in the input.
样例输入:
2 10 20
样例输出:
7 19
题目网址:Big Number | JXNUOJ