hdu 1018 Big Number

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

21020

 

Sample Output

719
求n的阶乘的位数；
我采用的是采用log10;
进行对数运算；
#include<iostream>#include<cstring>#include<string>#include<cstdio>#include<algorithm>#include<cmath>using namespace std;int main(){    int T;    while(scanf("%d",&T)!=EOF)    {        int n;        while(T--)        {            scanf("%d",&n);            double sum=0;            int ans;            for(int i=1;i<=n;++i)            {                sum+=log10(i);            }            ans=sum+1;            cout<<ans<<endl;        }    }    return 0;}