poj 1423 Big Number——斯特林公式

最新推荐文章于 2021-02-17 21:35:59 发布

five_east_west

最新推荐文章于 2021-02-17 21:35:59 发布

阅读量229

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM

本文链接：https://blog.csdn.net/five_east_west/article/details/109047649

ACM 专栏收录该内容

40 篇文章

订阅专栏

本文介绍如何利用Stirling公式解决实际问题，即给定一个大整数n，快速计算其阶乘的位数。通过C++代码实现并提供了一个实例，展示了如何通过对数运算和数学公式简化计算过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Big Number

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 <= m <= 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！求以10为底的对数就行。

c++ AC 代码：

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	int test,n;
	long long int s;
	const long double c1 = 0.798179868358; //lg(2*pi)
	const long double c2 = 0.434294481903; //lg(e)
	long double c3;
	cin >> test;
	while(--test+1)
	{
		cin >> n;
		c3 = log10((double)n);
		s = 1;
		if(n > 3)
		{
			s = (c3 + c1)/2 + n * (c3 - c2) + 1;
			cout << s << endl;
		}
		else	cout << 1 << endl; 
	}
	return 0;
}