## this is my knowledge

my name is jiang he

# 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 ≤ 107 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 Source Asia 2002, Dhaka (Bengal) Recommend JGShining weishu qu log  ac #include #include #include using namespace std; int main() { double t; double sum; int n; cin>>n; int x; int i,j; int sum1; while(n--) { sum=0; cin>>x; for(i=x;i>=1;i--) { sum=sum+log10(i); } sum1=int(sum)+1; cout<

10-12 2088

09-16 312

08-23 1340

04-16 650

02-14 44

08-22 171

07-23 810

01-18 2122

05-30 317

06-21 1974