Big Number
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 27537 | Accepted: 8787 |
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 <= m <= 10^7 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的阶乘的位数即求log10(n!)=log10(1)+log10(2)+......log10(n)
《计算机程序设计艺术》中给出了另一个公式
n! = sqrt(2*π*n) * ((n/e)^n) * (1 + 1/(12*n) + 1/(288*n*n) + O(1/n^3)) π = acos(-1)
e = exp(1)
两边对10取对数
忽略log10(1 + 1/(12*n) + 1/(288*n*n) + O(1/n^3)) ≈ log10(1) = 0
得到公式
log10(n!) = log10(sqrt(2 * pi * n)) + n * log10(n / e)。
百度到的。。。原谅我数学不好~~~AC-code:#include<iostream> #include<cmath> using namespace std; double e=exp(1.0),PI=acos(-1.0); int main() { int T; long long n,ans; cin>>T; while(T--) { cin>>n; ans=int(log10(sqrt(2.0*PI*n))+n*log10(n/e))+1; cout<<ans<<endl; } return 0; }