同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

21316_BigNumber

2022-5-16 18:19| 发布者: Hocassian| 查看: 38| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-4-89505140164700-Problem List-采集的数据-后羿采集器.html

Pro.ID

21316

Title

Big Number

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21316

AC

Submit

180

Ratio

35.00%

时间&空间限制

Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

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 ≤ m ≤ 10⁷ on each line.

0 < n < 2000

输出

Description

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 ≤ m ≤ 10⁷ on each line.

0 < n < 2000

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

Source

Dhaka 2002