hdu 1018 计算一个数阶乘的位数

最新推荐文章于 2022-02-09 12:21:06 发布

原创最新推荐文章于 2022-02-09 12:21:06 发布 · 513 阅读

0 ·

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

杂乱同时被 2 个专栏收录

35 篇文章

订阅专栏

数学问题

4 篇文章

订阅专栏

该博客介绍了一个计算数阶乘位数的方法，利用数学知识将问题转化为求和log10，避免了直接计算阶乘可能导致的整型溢出。通过循环累加每个数的log10值，然后取整加1得到结果。代码中使用C语言实现，包含<stdio.h>和<math.h>库，读取测试用例并输出答案。

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

题意：求一个数的阶乘的位数

因为根据数学知识可以知道：

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

又因为阶乘很可能超出整形，不容易计算，所以就应用log进行计数

#include<stdio.h>
#include<math.h>
int main()
{
    int t,m;
    scanf("%d",&t);
    while(t--)
    {
        double sum=0;
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
         sum+=log10(i);
         printf("%d\n",((int)sum)+1);
    }
    return 0;
}