Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31403 Accepted Submission(s): 14600
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
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
阶乘有多少位,斯特林公式秒过。
附代码:
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
long n,t;
int main()
{
scanf("%ld",&t);
while(t--)
{
scanf("%ld",&n);
double PI = 3.1415926;
double ans = (n*log(n)-n+0.5*log(2*PI*n))/log(10);//斯特林公式
int answer = (int)ans + 1;
printf("%d\n",answer);
}
}
在附一个非斯特林的:
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
int a,t,i,sum;
scanf("%d",&t);
while(t--)
{
scanf("%d",&a);
double sum=0;
for(i=1;i<=a;i++)
sum+=log10((double)i);
printf("%d\n",(int)sum+1);
}
}