1018: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 ≤ 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
来自杭电HDUOJ的附加信息
Recommend JGShining

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1018

最后修改于 2020-10-25 22:41:25 UTC 由爬虫自动更新

共提交 15

通过率 60.0%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)

·

·

·

·

登陆或注册以提交代码