Big Number
Describe
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
普及一个斯特林公式,
limn→∞n!2πn−−−√(ne)n=1
利用这个公式可以近似计算出 n! 的值,并得出其位数。
#include<iostream>
#include<cmath>
#define pi 3.141592653589
#define e 2.718281828459
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int num;
long double temp;
cin>>num;
double n=(double)num;
if(num>1) temp=(long double)(log10(2*pi*n)/2+n*log10(n/e))+1;
else temp=1;
cout<<(int)temp<<endl;
}
return 0;
}