poj 1423 Big Number

Big Number

Time Limit: 1000MS
Memory Limit: 65536K

Total Submissions: 20374
Accepted: 6472

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 <= m <= 10^7 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

 

#include<iostream>

#include<math.h>

using namespace std;

int main()

{

    int N;

    cin>>N;

    double in;

    double out;

    while(N--)

    {

        cin>>in;

        if(in==1)

            cout<<1<<endl;

        else

        {

            out=(log10(sqrt(4*acos(0.0)*in))+in*(log10(in)-log10(exp(1.0))))+1;

            cout<<(int)out<<endl;

        }

    }

    return 0;

}