题目链接:
FZU: -> Link <-
NYOJ
无意在FZU上看到这道题,以前在NYOJ上做过不过又忘了怎么做了;
网上找找才记起来这个斯特林大数公式;log(n!)=log10(sqrt(2*pi*n))+n*log10(n/e)+1;
log(n!)=log10(n)+log10(n-1)+...+log10(1)+1;
第一种代码:
#include<bits/stdc++.h>
#define e 2.718281828459045
#define pi 3.141592653589793239
using namespace std;
int main()
{
int cas,n;
scanf("%d",&cas);
while(cas--)
{
scanf("%d",&n);
double t=log10(sqrt(2*pi*n)) + n*log10(n/e);
printf ("%d\n",(int)t + 1);
}
return 0;
}
第二种代码:
int main()
{
int n;
while(~scanf("%d",&n))
{
double sum=0;
for(int i=1;i<=n;i++)
sum+=log(i)/log(10);//logX(Y)=log(X)/log(Y);
printf("%d\n",int(sum)+1);
}
return 0;
}