Big Number

Big Number

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5271    Accepted Submission(s): 2406

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

http://acm.hdu.edu.cn/showproblem.php?pid=1018

由于只需要求阶乘的数有多少位，所以没必要去精确地求出阶乘再算它的位数，那样肯定超时。用到数学里面的一个公式即可

#include<cstdio> 
#include<cmath> 
int main() 
{ 
    long n,i,k; 
    double sum; 
    long temp; 
    scanf("%d",&k);
    while(k--) 
    { 
        scanf("%d",&n);
        sum=0.0; 
        for(i=1;i<=n;i++)
            sum+=log10((double)i); 
        temp=long(sum+1); 
        printf("%ld/n",temp); 
    } 
    return 0; 
}