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
题解:题意是求 n 阶 阶乘 的位数,很显然 求位数要取对数,故显然可知
lg(n!)=lg1+lg2+lg3+......+lg(n-1)+lgn;
网上也能用Stirling公式(斯特灵公式);
斯特灵公式如下;
同样取对数即可;
代码:
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
double sum=0;
for(int i=1;i<=n;i++)
sum+=log10(i);
cout<<(int)sum+1<<endl;
}
return 0;
}