hdu 1012 u Calculate e

u Calculate e

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24821    Accepted Submission(s): 11035

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 <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int jiecheng(int n)
 { int sum=1;
     for(int i=2;i<=n;i++)
        sum*=i;
   return sum;
 }

int main()
{
  double f[20];
  int i,j,k;
 memset(f,0,sizeof(f));
  f[0]=1;
  f[1]=2;
 for(i=2;i<10;i++)
    f[i]+=f[i-1]+(double)1.0/(jiecheng(i)*1.0);
 printf("n e\n");
 printf("- -----------\n");
 printf("0 1\n");
 printf("1 2\n");
 printf("2 2.5\n");
 for(i=3;i<10;i++)
    printf("%d %.9lf\n",i,f[i]);


    return 0;
}