Big Number(Stirling估计式)

Big Number

点我找原题

   
   

    
    这个题的意思是：给你一个数，让你求出N！由多少位数构成，比如输出10，它的阶乖是3628800 由7位数构成，这时你要输出7；
   
   
   
   

    
    解题思路：
   
   
   
   

    
    1.可以暴力，N的阶乖的位数等于LOG10（N！）＝LOG10（1）＋.....LOG10（N）；
   
   
   
   

    
    2.
    
    Stirling估计式：n!与√(2πn) * n^n * e^(-n)的值十分接近
    
    

    
    故log10(n!) = log(n!) / log(10) = ( n*log(n) - n + 0.5*log(2*π*n))/log(10);
   
   
   
   

    
    暴力方法用时953ms，险些超时，使用Stirling估计式0ms就过了。
   
   

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 5   Accepted Submission(s) : 4

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

#include <iostream>
#include <cmath>
using namespace std;
int main(int argc, char *argv[])
{
	double t,n,i,num;
	double pi=2*asin(1);
	int a;
	cin>>t;
	while(t--)
	{
		cin>>n;
		num=(n*log(n)-n+0.5*log(2*pi*n))/log(10);
		a=num+1;
		cout<<a<<endl;
	}
	return 0;
}