Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 11 Accepted Submission(s) : 6
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.
Output
Sample Output
n e - ----------- 0 1 1 2 2 2.5 3 2.666666667 4 2.708333333
代碼:
#include <stdio.#include <stdio.h>
int main()
{
int i;
double k=1.0,m=1.0;
printf("n e\n");
printf("- -----------\n");
printf("0 1\n");
printf("1 2\n");
printf("2 2.5\n");
for(i=1;i<=9;i++)
{
if(i<3) continue;
m=1.0/i*m;
k+=m;
printf("%d %.9lf\n",i,k);
}
}<pre class="csharp" name="code">