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
719
知道整数m的位数等于lg(m)+1
运用Stirling公式 lg(n!)=0.5*log10(2*pi*n)+n*log10(n/e)+1
#include <iostream> #include <math.h> using namespace std; const double e=2.7182818284590452,pi=3.1415926535897932; //确保精度要高 int main() { int T; scanf("%d",&T); while(T--) { int n; double x; scanf("%d",&n); x=0.5*log10(2*pi*n)+n*log10(n/e); //Stirling公式 printf("%d\n",(int)x+1); } return 0; }