HDOJ 1012 u Calculate e

u Calculate e

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

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
  
  
  
  

   
   用c好像后面的0不能自动忽略 没办法 看了别人的改用c++就AC了
  
  
  
  

   
   #include <iomanip>
#include <stdio.h>
#include <iostream>
using namespace std;
long  jiecheng(int n)
{  long ret=1;
int i;
    for (i=n;i>0;i--)
       ret*=i;
       return ret;
}
int main()
{   double e=0.0;
int i;
cout<<'n'<<" "<<'e'<<endl;
cout<<'-'<<" "<<"-----------"<<endl;
    for(i=0;i<=9;i++)
    {  cout<<i<<" ";
        e+=1.0/jiecheng(i);
       if (i<3)
        cout<<e<<endl;
       else
      cout<<fixed<<setprecision(9)<<e<<endl;
    }
    return 0;
}

  
  
  
  

   
   后来大神告诉我这个题目可以这样 可是这样也仅仅限于这个题目而已
  
  
  
  

   
   #include<stdio.h>
int main()
{
    int i;
    printf("n e\n- -----------\n");
    printf("0 1\n1 2\n2 2.5\n");
    double sum=2.5;
    int n=2;
    for(i=3;i<=9;i++)
    {
        n*=i;
        sum+=(1.0/n);
        printf("%d %.9lf\n",i,sum);
    }
    return 0;
}