LENGFACT  Factorial length
Given integer n, print length of n! (which is factorial of n).
Input
The first line of the standard input contains one integer t (t < 10001) which is the number of test cases.
In each of the next t lines there is number n (0 <= n <= 5*10^9).
Output
For each test, print the length of n! (which is factorial of n).
Example
Input:
3
1
10
100
Output:
1
7
158
hide comments
raghav6:
20190117 11:22:46
Google Kamenetsky's formula 

jmr99:
20181016 12:27:05
use Kamenetsky’s formula . 

ameyanator:
20180925 14:52:00
How in the name of hamburgers is someone supposed to come up with this on his own????!


sonuverma:
20180107 15:03:55
in c, use PI=acos(1); under math.h :) 

dsri_99:
20171220 14:34:54
define a variable called pi upto as many digits as possible and then do it. Good formula based problem.


prabodh prakash:
20170607 21:09:01
In Python, I used 22/7 for pi and was getting WA. then I used math.pi and got Accepted. 

nesbak:
20170531 13:29:00
i am getting wrong answer even after getting right answer on ideone for of the cases and i have kamenetskys formula only


rakcode1998:
20170411 12:34:34
Keep 0 in mind


nilabja16180:
20170313 17:32:21
use long long for input type of n, costed few WA! 

kass_97:
20161231 23:15:05
Simply formula based, AC in 0.02 
Added by:  Piotr Kąkol 
Date:  20100119 
Time limit:  0.694s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Copy of the problem: FACTLENG with different assessment 