杭电oj 1012
2015-12-03 22:59
330 查看
先看题目
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 38233 Accepted Submission(s): 17314
Problem Description
A simple mathematical formula for e is
where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.
Output
Output 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 Output
没什么好说的
u Calculate e
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38233 Accepted Submission(s): 17314
Problem Description
A simple mathematical formula for e is
where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.
Output
Output 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 Output
n e - ----------- 0 1 1 2 2 2.5 3 2.666666667 4 2.708333333
没什么好说的
#include <iostream> #include <iomanip> using namespace std; int main() { double answer[10]; double sum=1; int i; answer[0]=1; for(i=1;i<10;i++) { sum=sum*i; answer[i]=answer[i-1]+1/sum; } cout<<"n e"<<endl; cout<<"- -----------"<<endl; for(i=0;i<10;i++) { if(i>2) cout<<i<<" "<<setprecision(9)<<std::fixed<<answer[i]<<endl; else cout<<i<<" "<<answer[i]<<endl; } return 0; }
相关文章推荐
- LeetCode题解 #12 Integer to Roman
- 64位win2003/win2008系统IIS6.0/7.5配置PHP的方法
- C#_格式化输入日期时间
- 黑马程序员—javaSE—IO流
- 二叉搜索树、B树
- hive加载数据后查询为空
- iis7.5安装配置php环境详细清晰教程,三步实现【图文】
- Android 工程图片资源命名禁忌
- C#_字符串中的Compare和Equal方法
- poj2892 Tunnel Warface
- Linux内核与根文件系统的关系
- Android Studio 快捷键整理分享
- uImage、zImage、bzImage、vlinzx区别
- WCF 入门(29)
- 三角形 JAVA 代码
- Flex布局之box-flex
- Shell学习笔记 - 正则表达式
- 黑马程序员—javaSE—异常
- 我的思维方式和我的性格
- Android进程和线程 --消息队列模型--ThreadLocal (3)(2015-12-02 19:41)