HDU：1018 Big Number

Big Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36819    Accepted Submission(s): 17679

题目链接

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

  
  

   
   2
10
20
  
  

 

Sample Output

  
  

   
   7
19
  
  
  
  


  
  
  
  

   
   题目思路：
  
  
  
  

   
   题目让求n的阶乘是几位数。
  
  
  
  

   
   举一个例子：
  
  
  
  

   
   10！=10*9*8*7*6*5*4*3*2*1=3628800=3.6288*10^6
  
  
  
  


  
  
  
  

   
   其次要了解对数运算的公式； loga(b*c)=logab+logac
  
  
  
  


  
  
  
  

   
   则log10(3628800)=log10(3.6288*10^6)=log10(3.6288)+log10(10^6)
  
  
  
  

   
   为什么用10为底呢，因为将一个数用科学计数法表示，首先后面乘上了10的多少次方，则10的多少次方是后面的位数，在加上个位，就是一个数是几位数。接着上面的。log10(1)=0,log10(10)=1,因此log10(3.6288)大于0小于1，
  
  
  
  

   
   log10(3628800)=log10(3.6288*10^6)=log10(3.6288)+log10(10^6) 约等于，6点多，向上取整就是3628800这个数的位数。

  
  
  
  

   
   log10(3628800)=log10(10*9*8*7*6*5*4*3*2*1)=log10(1)+log10(2)+log10(3)+...+log10(8)+log10(9)+log10(10)和上式相等也是得6.多，因此求N的阶乘的位数，可以用下列方法
  
  
  
  

   
   int digit(int N)
  
  
  
  

   
   {
  
  
  
  

   
   	double sum = 0;
  
  
  
  

   
   	for(int i = 1; i <= N; i++)
  
  
  
  

   
   		sum += log10(i);
  
  
  
  

   
   	return int(sum);
  
  
  
  

   
   }