数论 斯特林公式 HDU 1018 Big Number

Big Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 41597    Accepted Submission(s): 20377

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⁷ 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

 1.运用斯特林公式便可以轻松解决，但是一定要注意，sum一定要定义成double的形式。

2.log10(i)；得到的是double形式的数据。

#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
	int c,n;
	double sum=0;
	cin>>c;
	while(c--)
	{
		cin>>n;
		sum=0;
		for(int i=1;i<=n;i++)
		   sum=sum+log10(i);
		cout<<(int)sum+1<<endl;
	}
	return 0;
} 

第二种：

   1.纯正的用斯特林公式，但一定要注意记住 π和e的取值。

   2.还要牢牢记住公式：

     

  

  log10(n!)=0.5*log10(2πn)+n*log10(n)-n*log10(e).

 

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
#define pi 3.14159265358
#define e   2.71828182
int main()
{
	double sum=0;
	int c,n;
	cin>>c;
	while(c--)
	{
		sum=0;
		cin>>n;
		sum=0.5*(log10(2*pi*n))+log10(n)*n-log10(e)*n;
		cout<<(int)sum+1<<endl;
	}
	return 0;
}