Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 43067 Accepted Submission(s): 21048
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 ≤ 107 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
Source
Recommend
JGShining | We have carefully selected several similar problems for you: 1013 1071 1021 1020 1061
Statistic | Submit | Discuss | Note
心得:题目在忽悠我,以为是大数,但大数会超时。
有公式:n!的阶乘的位数=log10(n)+……log10(1);
(log10(1)也可以省略。)
#include<bits/stdc++.h>
using namespace std;
double f(int n)
{
double re=0;
for(int i=2;i<=n;i++)
{
re+=log10(i*1.0);
}
return re;
}
int main(void)
{
int n,t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
int re=f(n);
printf("%d\n",(int)re+1);
}
return 0;
}