Big Number

最新推荐文章于 2024-08-08 07:34:26 发布

指尖的摩擦

最新推荐文章于 2024-08-08 07:34:26 发布

阅读量99

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/qq_42282577/article/details/97059617

版权

C++ 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 47282 Accepted Submission(s): 23263

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
2
10
20

Sample Output
7
19
这题比较简单，不用去尝试把N！的具体值求解出来，这样肯定会导致时间超时，所以我们可以查一下如何计算大数直接相乘的位数，有兴趣的同学可以度一下，下面贴上代码

#include<iostream>
#include<cmath>
using namespace std;
int main(){
    int n;           //数据组数
    cin>>n;
    int a;
    double sum;          //double精确计算
    while(n--){
        sum=0;
        cin>>a;
        while(a){
            sum=sum+log10(a);         //数学思想
            a--;
        }
        cout<<(int)sum+1<<endl;
    }
    return 0;
}