Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40707 Accepted Submission(s): 19900
Problem Description
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
21020
Sample Output
719
斯特灵公式:
有关大数阶乘的重要公式
#include<iostream>
#include<cmath>
const double PI=3.14159265358979;
const double e=2.718281828;
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,ans;
cin>>n;
ans=0.5*log10(2*PI*n)+n*log10(n/e)+1;
cout<<ans<<endl;
}
}
顺便补一下大数阶乘模拟
如有更好的方法,欢迎大家指出,共同进步
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
int n,s[100000];
while(scanf("%d",&n)!=EOF)
{
int count=1,temp,k=0;
memset(s,0,sizeof(s));
s[0]=1;
for(int i=1;i<=n;i++)
{
for(int j=0;j<count;j++)
{
temp=s[j]*i+k;
s[j]=temp%10;
k=temp/10;
}
while(k)
{
s[count++]=k%10;
k/=10;
}
}
for(int i=count-1;i>=0;i--)
cout<<s[i];
cout<<endl;
}
}