# Number lengths

## Problem 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!.

13 32000

## Sample Output

1 1 130271

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n))
{
double a=1;
int i;
for(i=1;i<=n;i++)
{
a=a+log(i)/log(10);
}
int ans=a;
printf("%d\n",ans);
}
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120