HDU 1018 Big Number 【暴力】【斯特林公式】

最新推荐文章于 2020-07-24 11:37:03 发布

紫芝

最新推荐文章于 2020-07-24 11:37:03 发布

阅读量341

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/qq_40507857/article/details/82594111

版权

数论专栏收录该内容

27 篇文章 1 订阅

订阅专栏

Big Number

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

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 ≤ 107 on each line.

Output

The output contains the number of digits in the factorial of the integers appearing in the input.

Sample Input

Sample Output

7 19

Source

Asia 2002, Dhaka (Bengal)

Recommend

JGShining

题意：

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

分析：

方法1：暴力求解

10^m=a,a的位数为m+1，(int)log10(a)+1就是a的位数

log10(n!)=log10(1*2*3*4.......*(n-1)*n)=log10(1)+log10(2)+log10(3)+log10(4)+.......+log10(n)

n!的位数为 floor(log(n!))+1

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e7+7;
typedef long long LL;
//double num[maxn];//内存超限

int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        double ans=0.0;
        for(int i=1;i<=n;i++)
        ans+=log10(i);
        printf("%d\n",(int)ans+1);
    }
}

方法二：斯特林公式

利用Stirling公式计算n!结果的位数时，可以两边取对数(底数为e），得:

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e7+7;
typedef long long LL;
//double num[maxn];
#define e 2.71828
#define pi acos(-1)
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        double ans=0.0;
        ans=log10(2.0*pi*n)/2+n*(log10(n)-1/log(10));
        printf("%d\n",(int)ans+1);
    }
}
//10000000

方法三：java大数【超时】

import java.util.*;
import java.math.*;

public class Main{
	
	public static void main(String[] args){
		Scanner cin=new Scanner(System.in);
		int T=cin.nextInt();
		while((T--)!=0) {
			int n=cin.nextInt();
			BigInteger ans=BigInteger.ONE;
			for(int i=1;i<=n;i++) {
				ans=ans.multiply(BigInteger.valueOf(i));
			}
			System.out.println(ans.toString().length());
		}
		cin.close();
	}
}