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 ≤ 10[sup]7[/sup] 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
代码
#include <stdio.h>
#include <math.h>
int main(void)
{
int n;
scanf("%d",&n);
while(n--)
{
int a,i;
double cnt=0;
scanf("%d",&a);
for(i=1;i<=a;i++)
{
cnt+=log10(i);
}
printf("%d\n",(int)cnt+1);
}
return 0;
}
吐槽:开始用的传统方法:求阶乘、求位数,可能因为数据太大没通过。最后只能借助神奇的百度,学到了一种神奇的方法。
求一个数是几位数可以用log10(n)+1来求
而log10(n!)+1=log10(123*…*n)+1=log10(1)+log10(2)+log10(3)+…+log10(n)+1