/*
求m!的位数,1<=m<=10^7.时间1s。
使用Stirling公式进行求解 n!~~~~~~(n/e)^n(2*pi*n)^(1/2)
*/
#include<iostream>
#include<cmath>
using namespace std;
const double e=2.7182818284590452354,pi=3.141592653589793239;
double str_ling(int n)
{
return 0.5*log10(2*pi*n)+n*log10(n/e);
}
int main()
{
int t,m;
cin>>t;
while(t--)
{
cin>>m;
cout<<(int)str_ling(m)+1<<endl;
}
return 0;
}
求m!的位数,1<=m<=10^7.时间1s。
使用Stirling公式进行求解 n!~~~~~~(n/e)^n(2*pi*n)^(1/2)
*/
#include<iostream>
#include<cmath>
using namespace std;
const double e=2.7182818284590452354,pi=3.141592653589793239;
double str_ling(int n)
{
return 0.5*log10(2*pi*n)+n*log10(n/e);
}
int main()
{
int t,m;
cin>>t;
while(t--)
{
cin>>m;
cout<<(int)str_ling(m)+1<<endl;
}
return 0;
}