hdu-1012 u Calculate e
来源:互联网 发布:软件构架实践 课程 编辑:程序博客网 时间:2024/06/06 00:43
题目来源:hdu-1012
u Calculate eTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36307 Accepted Submission(s): 16399Problem DescriptionA simple mathematical formula for e ise=Σ1/i!(i=0~n);where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.OutputOutput the approximations of e generated by the above formula for the values of n from 0 to 9. The beginning of your output should appear similar to that shown below.Sample Outputn e- -----------0 11 22 2.53 2.6666666674 2.708333333SourceGreater New York 2000
题目大意:
给出一个e的表达式,即是求前n项的阶乘的导数之和。表达式为:e=1+1/1!+1/2!+1/3!+1/4!+……+1/9!;输出参考输出样例,依次输出n从0至9的结果。
解题思路:
首先按照输出及简单运算可知n等于0、1、2的时候对应结果为1、2、2.5;将此直接输出结果,此后结果含有多项小数,保留小数点后9位;对此可先求出i的阶乘,然后代入表达式,将运算结果输出即可。
AC代码:
#include<stdio.h>double factorial(int n) //求阶乘函数 { double num=1; for(int i=1;i<=n;i++) num*=i; return num;}int main(){ double sum; //对前面可直接计算出结果的单独输出 printf("n e\n- -----------\n0 1\n1 2\n2 2.5\n"); sum=2.5; for(int i=3;i<=9;i++) //将运算结果逐个计算并输出 printf("%d %.9lf\n",i,sum+=1/factorial(i)); return 0;}
0 0
- HDU 1012 u Calculate e
- HDU 1012 u Calculate e
- HDU 1012 u Calculate e
- HDU--1012--u Calculate e
- hdu 1012 u Calculate e
- HDU 1012 u Calculate e
- hdu 1012 u Calculate e
- u Calculate e hdu 1012
- hdu 1012 u Calculate e
- hdu-1012-u Calculate e
- hdu 1012 u Calculate e
- hdu 1012 u Calculate e
- HDU 1012u Calculate e
- hdu 1012 u Calculate e
- hdu 1012 u Calculate e
- HDU 1012 u Calculate e
- hdu 1012 u Calculate e
- HDU 1012 u Calculate e
- 数据挖掘(3):关联规则评价
- Leetcode 3 Longest Substring Without Repeating Characters
- 《剑指offer》第一个只出现一次的字符位置
- 配置Tomcat使用https协议(配置SSL协议)
- 【hdu5304】生成树计数—基尔霍夫矩阵 DP
- hdu-1012 u Calculate e
- [Leetcode]Closest Binary Search Tree Value II
- Android中AsyncTask的使用
- Delphi XE4,C++ Builder XE4,RAD Studio XE4 v18.0.4905.60485(With Update 1) 官方下载激活
- 数据挖掘(4):使用weka做关联规则挖掘
- Codeforces Gym 100548F Color (组合数+容斥)
- 数据挖掘(5):使用mahout做海量数据关联规则挖掘
- 【白书之路】 10340All in All 判断子串
- C/C++常用头文件及函数汇总