Description
N! (N factorial) can be quite irritating and difficult to compute for large values of N. So instead of calculating N!, I want to know how many digits are in it. (Remember that N! = N * (N - 1) * (N - 2) * ... * 2 * 1)
Input
Each line of the input will have a single integer N on it 0 < N < 1000000 (1 million). Input is terminated by end of file.
Output
For each value of N, print out how many digits are in N!.
Sample Input
1 3 32000 1000000
Sample Output
1 1 130271 5565709
KEY:要求乘积的位数,用取对数的方法,比如:5!的位数 lg(5*4*3*2*1)+1=lg(5)+lg(4)+lg(3)+lg(2)+lg(1)+1;为了保证精确度,要用double
Source:
#include < iostream.h >
#include < math.h >
int N;
int count()
... {
double sum=0.0;
for(int i=1;i<=N;i++)
...{
sum+=log(i)/log(10.0);
}
return (int)sum;
}
int main()
... {
while(cin>>N)
...{
cout<<count()+1<<endl;
}
return 0;
}