Big Number
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 28109 | Accepted: 8960 |
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!的位数:
res=(long)( (log10(sqrt(4.0*acos(0.0)*n)) + n*(log10(n)-log10(exp(1.0)))) + 1 )
在本题中使用到的是化简如下的形式:
num=log10(2 * pi*n) / 2.0 + n*(log10(n / e)) + 1
#include <iostream>
#include <cmath>
using namespace std;
double e = 2.71828182845904523, pi = 3.1415926535897932;
int main(int argc, const char * argv[]) {
int n,m;
cin>>n;
double num=0;
int i=0;
while(i<n)
{
cin>>m;
if(m==1)
num=1;
else
num=log10(2 * pi*m) / 2.0 + m*(log10(m / e)) + 1;
int answer=(int)num;//强制类型转化
i++;
cout<<answer<<endl;
}
return 0;
}