Big Number

最新推荐文章于 2018-11-05 19:13:02 发布

朝向高处的旅途

最新推荐文章于 2018-11-05 19:13:02 发布

阅读量433

点赞数

分类专栏： ACM/ICPC

本文链接：https://blog.csdn.net/airuozhaoyang/article/details/8223666

版权

ACM/ICPC 专栏收录该内容

102 篇文章 0 订阅

订阅专栏

Big Number

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

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

Sample Output

这道题一开始我使用long计数，后来发现范围有限，会导致溢出，便想用字符串处理，但字符串不可以完成计算
仔细观察题目，虽然数字之间相乘或相加后溢出，但单个数字可以进行运算，因为要输出十进制的位数，所以用math.h库中的lg函数，格式是 1g10（x）。。x为double类型，注意使用类型转换，位数的初始值是1，
这样数字分别取lg再相加，强制类型转换为int就可了
。

#include<stdio.h>
#include<math.h>
int main()
{
    int nl,i;
    long  n;
    double lg_n,ndigits;
    scanf("%d",&nl);
    while(nl--)
    {
        ndigits=1;
        scanf("%ld",&n);
        for(i=1;i<=n;i++)
        {
            ndigits+=log10((double)i);

        }
        printf("%d\n",(int)ndigits);
    }
    return 0;
}