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; double factorial(int m)//阶乘函数 { double result=1;//初始化为1 for(int j=m;j>0;j--) { result*=j; } return result; } int main() { cout<<"n"<<" "<<"e"<<endl; cout<<"-"<<" "<<"-----------"<<endl; int n; double e=0;//初始化为0 for(int i=0;i<=9;i++) { e+=1/(factorial(i)); if(i<3)//注意输出格式 { cout<<i<<" "<<e<<endl; } else cout<<i<<" "<<fixed<<setprecision(9)<<e<<endl; } return 0; }