POJ 1517 u Calculate e

u Calculate e
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 16133 Accepted: 9685 Special Judge

Description

A simple mathematical formula for e is
e=Σ0<=i<=n1/i!

where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.

Input

No input

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 Input

no input

Sample Output

n e
- -----------
0 1
1 2
2 2.5
3 2.666666667
4 2.708333333
...

Source

解题思路:加上#include<iomanip>,用setprecision()函数控制输出位数为10即可。
#include<iostream>
#include<iomanip>
using namespace std;
int f[10]={1};
long double r[10]={0.00};
void mul()
{
	int i;
	for(i=1;i<10;i++)
		f[i]=f[i-1]*i;
}
void add()
{
	int i;
	r[0]=1.0;
	for(i=1;i<10;i++)
		r[i]=r[i-1]+(1.0/f[i]);
}
int main()
{
	int i;
	mul();
	add();
	cout<<"n e"<<endl;
    cout<<"- -----------"<<endl;
	for(i=0;i<10;i++)
		cout<<i<<" "<<setprecision(10)<<r[i]<<endl;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值