斯特林公式

最新推荐文章于 2021-06-08 16:47:04 发布

weixin_30737363

最新推荐文章于 2021-06-08 16:47:04 发布

阅读量130

点赞数

文章标签： java

原文链接：http://www.cnblogs.com/Radium1209/p/10415382.html

版权

斯特林公式用于求n阶乘的近似值。

n!的位数：lg(n!)=lg1+lg2+...+lgn向下取整+1；

例题：

Big Number

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

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

21020

Sample Output

719

Source

HDU1018

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int n,t;
double ans;

int main()
{
	cin >> t;
	while(t--)
	{
		scanf("%d",&n);
		ans=0.0;
		for(int i=1;i<=n;i++)
			ans+=log10(i);
		printf("%d\n",(int)ans+1);  
	}
	return 0;  
}

转载于:https://www.cnblogs.com/Radium1209/p/10415382.html