fzu 1050 Number lengths
来源:互联网 发布:鞍山北国知春房价 编辑:程序博客网 时间:2024/05/17 22:12
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!.
Sample Input
1
3
32000
Sample Output
1
1
130271
求n的阶乘的位数
将1000000个结果都先保存在result[1000000]数组中,根据log10(n*(n-1)(n-2)…*2*1)=log10(n)+log10(n-1)+…+log10(2)+log10(1)的公式,
#include <stdio.h>#include <iostream>#include <math.h>#include <algorithm>using namespace std;const int maxn=1000005;double a[maxn]= {0};int main(){ int n; while(~scanf("%d",&n)) { a[0]=1.0; for(int i=1; i<=10; i++) { a[i]=a[i-1]+log10(i*1.0); } printf("%d\n",(int)a[n]); } return 0;}
0 0
- fzu 1050 Number lengths
- fzu 1050 Number lengths
- FZU 1050 Number lengths (思维题)
- Number lengths FZU
- Number lengths FZU
- FZU Number lengths(数学)
- Number lengths
- Number lengths
- Number lengths
- Number lengths
- fjnu 1180 Number lengths
- foj1050 Number lengths
- foj-Number lengths
- Number lengths(数字长度)
- FZU1050 Number lengths(数论,规律,概念)
- Number lengths(数学,N!的位数)
- FZU 1853 Number Deletion
- FZU 2019 Mountain Number
- Android EditText回车不换行
- Java 数据强转 不一定低到高.
- 关于解决子元素继承父元素事件的问题
- LAMP环境准备gcc和gcc++
- ActiveMQ介绍(二)
- fzu 1050 Number lengths
- 简单学习自动化测试框架(selenium)
- Flume中的拦截器(Interceptor)介绍与使用(二)
- reportviewer使用方法
- 冷知识 —— 四大
- 自动化构建工具--gulp中gulpfile的基础配置
- 判断树是否结构对称
- Python的sys.path妙用
- ubuntu16.10安装Rstudio时依赖包的解决