Number lengths

最新推荐文章于 2022-02-25 19:38:17 发布

springwinter1

最新推荐文章于 2022-02-25 19:38:17 发布

阅读量358

点赞数

分类专栏： ACM 文章标签： input output integer each c

本文链接：https://blog.csdn.net/springwinter1/article/details/4396271

版权

ACM 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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

Sample Output:

1 
1 
130271 
/*第一种：由于乘数太大会超过整数类型的范围，就把乘积定义为双精度类型，每次乘完除以十，算出位数

第二种：用所求位数log转换为logn!=log1+log2+log3......logn*/

#include<stdio.h>
int main()
{int c,i,n;
float sum;
 while (scanf("%d",&c)!=EOF) 
 {
 n=1;sum=1.0;
   {for(i=1;i<=c;i++)
          {sum=sum*i;
           while(sum>=10)
            {sum=sum/10;n++;}
          }
          printf("%d/n",n);
    }
 
 }return 0;
}