http://acm.hdu.edu.cn/showproblem.php?pid=1018

Big Number

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

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

题目大意：求阶乘位数，数据很大。

题目分析：斯特林公式   X的阶乘位数==llog10(1)+log10(2)+···+long10(n)取整后加1

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cmath>
 4 using namespace std;
 5 int main()
 6 {
 7     int t;
 8     scanf("%d",&t);
 9     while(t--)
10     {
11         int n;
12         double sum=1.0;
13         scanf("%d",&n);
14         for(double i = 1 ; i <= n ;i++)
15         {
16             sum+=log10(i);
17         }
18         cout << (long)sum << endl;
19     }
20     return 0;
21 }

原文地址：https://www.cnblogs.com/MekakuCityActor/p/9038282.html