HD ACM C++ 1018 大数位数计算

Big Number

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

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
  
  

 

Source

Asia 2002, Dhaka (Bengal)

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:   1071  1019  1021  1020  1061 

 

从题中可以看到阶乘会使原来的数值变得非常巨大，导致后面数据溢出，故传统的思路先计算阶乘后的结果，再对其用10求模的方法不开行。由于是十进制的数，故可以对其进行取十的对数，即为阶乘结果数的位数（阶乘结果的对数就是分别每个相乘的数的对数的和），代码如下：

#include<iostream> using namespace std; int main() { int t; int i, j; int n; double result; while (cin >> t) { for (i = 1; i <= t; i++) { result = 0; cin >> n; for (j = 1; j <= n; j++) result += (log10(j)); cout <<(int)result+1 << endl; } return 1; } return 0; } </iostream>