题目:
Big Number
描述:
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 ≤ 10 7 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
翻译:
描述:
在许多应用软件中需要非常大的整数,一些应用软件正在使用钥匙进行数据的安全传送,加密,等等,在这些问题中,给出一个数,你必须确定数字的阶乘中的位数。
输入:
输入包含几行整数,第一行包含一个整数n,为测试的用例数,接下来的n 行,每一行一个整数1 ≤ n ≤ 10 7。
输出:
输出包含输入中出现的整数的阶乘中的位数。