HDU 1018 Big Number（斯特林公式）

最新推荐文章于 2018-03-03 19:12:57 发布

原创最新推荐文章于 2018-03-03 19:12:57 发布 · 575 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

ACM__数论&&数学技巧专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种计算非常大的整数阶乘位数的方法。通过使用对数属性和斯特林公式，可以在短时间内准确地计算出任意大整数阶乘的位数。文章提供了两种实现方式的代码示例。

Big Number

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

【思路分析】
求n!的位数。首先对于一个整数n，它的位数为log10(n) + 1，则log10(n!) = log10(n * (n - 1) * (n - 2) * .......*1) = log10(n) + log10(n - 1) + log10(n - 2) + ........+ log10(1)。所以求n!的位数，根据上式一个for循环就可以搞定。
除此之外，还有一个斯特林公式可以在O(1)的时间内得到n!的位数s：s = (t * log(t) - t + 0.5 * log(2 * t * pi)) / log(10.0) + 1。

代码如下：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int n;
void init()
{
    scanf("%d",&n);
}
void solve()
{
    double sum = 0;
    for(int i = 1;i <= n;i++)
    {
        sum += log10(double(i));
    }
    printf("%d\n",(int)sum + 1);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        init();
        solve();
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const double pi = 3.1415926;
int n;
void init()
{
    scanf("%d",&n);
}
void solve()
{
    double s = n;
    s = (s * log(s) - s + 0.5 * log(2 * s * pi)) / log(10.0);
    printf("%d\n",(int)s+ 1);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        init();
        solve();
    }
    return 0;
}