POJ1423Stirling__大N阶乘的位数

点我
直接上代码

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<cmath>
#define Xiaobo main
#define _USE_MATH_DEFINES
using namespace std;
const int maxn=1e5+5;
const int mod=1e9+7;
const int INF=0x3f3f3f;
const double e=2.71828182845900452354;
const double pi=3.141592653589793239;
typedef long long ll;
int n,m;
int num[maxn];
double str_ling(int n) {
	return 0.5*log10(2*pi*n)+n*log10(n/e);//公式推导可以自行百度吧 记住公式会用就OK了
}
int Xiaobo()
{
	int t,m;
	cin>>t;
	while(t--) {
		cin>>m;
		cout<<(int)str_ling(m)+1<<endl;
	}
	return 0;
}