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
7 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 |
Source
Asia 2002, Dhaka (Bengal)
|
Recommend
JGShining
|
解题思路:本题有两种思路。都是用到数n的位数=(int)log10(n)+1;
第一种:利用对数性质log(n!)=log(1)+log(2)+.......+log(n);
第二种:斯特林近似公式:n!≈sqrt(2*π*n)*(n/e)^n
log(n!)=(log(2*pi)+log(n))/2+n*(log(n)-log(e)); 然后也是(int)log(n)+1;
参考:http://blog.csdn.net/lishuhuakai/article/details/8017296
http://blog.csdn.net/martinue/article/details/48473475
http://blog.csdn.net/h1021456873/article/details/47664081
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
int i,t,n;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
double sum=0;
for(i=1;i<=n;i++)
sum+=log10(i);
printf("%d\n",(int)sum+1);
}
return 0;
}