HDU1018 Big Number（Stirling公式）

题目链接

Big Number

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

 

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

2

10

20

Sample Output

7

19

 

n组测试数据，求一个数的阶乘的位数。

Stirling公式：    

一般来说，当n很大的时候，n阶乘的计算量十分大，所以斯特林公式十分好用，而且，即使在n很小的时候，斯特林公式的取值已经十分准确。

戳此查看百度百科-斯特林公式

一个数a的位数d=log10(a)+1，联立斯特林公式可求解

AC代码：

#include<iostream>
#include<sstream>
#include<algorithm>
#include<string>
#include<cstring>
#include<iomanip>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#define e 2.71828182
#define Pi 3.141592654
using namespace std;
int main()
{
	int n,a;
	cin>>n;
	while(n--)
	{
		cin>>a;
		int ans=(1.0/2*log10(2*Pi*a)+a*log10(a/e))+1;//联立求解 
		cout<<ans<<endl;
	}
}