2 shunfurh shunfurh 于 2017.06.19 13:35 提问

Big Number

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

Output
The output contains the number of digits in the factorial of the integers appearing in the input.

Sample Input
2
10
20

Sample Output
7
19

3个回答

caozhy
caozhy   Ds   Rxr 2017.06.19 23:57
已采纳
shen_wei
shen_wei   Ds   Rxr 2017.06.19 14:33
qq_34523482
qq_34523482   2017.06.19 14:57
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!