Length of nyoj-Number

Number of length time limit: 3000 MS | memory limit: 65535 kb difficulty: 1

Description

N! Factorial is a very large number. We all know that the formula is n! = N * (N-1) · * 2*1. Now your task is to calculate n! How many digits are there (in decimal )?

Input

Input N in the first line to indicate the number of groups of test data (n <10)
N (0 <n <1000000)

Output

For each number N, output n! In decimal format.

Sample Input

31332000

Sample output

11130271

Reference code:

#include<stdio.h>#include<math.h>int main(){int n,a,i;double sum;scanf("%d",&n);while(n--){scanf("%d",&a);sum=0;for(i=1;i<=a;++i)sum+=log10(i);printf("%d\n",(int)sum+1);}return 0;}

Length of nyoj-Number