1012
来源:互联网 发布:淘宝关键词分析工具 编辑:程序博客网 时间:2024/05/07 07:36
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.
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 11 22 2.53 2.6666666674 2.708333333#include <iostream>#include <iomanip>using namespace std;int main(){ cout<<"n"<<" "<<"e"<<endl; cout<<"- -----------"<<endl; cout<<"0 1"<<endl; cout<<"1 2"<<endl; cout<<"2 2.5"<<endl; double a=2,b=2.5; for(int i=3;i<=4;i++) { cout<<i<<" "; a*=i; cout<<setiosflags(ios::fixed)<<setprecision(9)<<(b+=1/a)<<endl; } return 0;}#include <iostream>using namespace std;int main(){ cout<<"n"<<" "<<"e"<<endl; cout<<"- -----------"<<endl; cout<<"0 1"<<endl; cout<<"1 2"<<endl; cout<<"2 2.5"<<endl; cout<<"3 2.666666667"<<endl; cout<<"4 2.708333333"<<endl; cout<<"5 2.716666667"<<endl; cout<<"6 2.718055556"<<endl; cout<<"7 2.718253968"<<endl; cout<<"8 2.718278770"<<endl; cout<<"9 2.718281526"<<endl; return 0;}
0 0
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- 1012
- selenium 用法总结
- hiho 1486物品价值(状压DP->异或技巧)
- 字符串匹配问题——求给定字符串的next数组以及KMP算法实现
- HDU1240(BFS)Asteroids!
- Zookeeper 集群为什么是高可用的?
- 1012
- 计算出生的天数和星座
- 将3DMax编辑的动画,导入给已经绑定蒙皮好的模型给Unity使用
- Idea中解决Git内容冲突
- Redis自学手册
- 【机房重构】——助手SqlHelper类
- 芯片测试
- 蓝桥杯01字串
- 计算机图形学——OpenGL学习系列之Graphics3D