结题报告:POJ_1517
2011-01-06 14:49
351 查看
一、原题:
链接:http://poj.org/problem?id=1517u Calculate e
Time Limit: 1000MS | Memory Limit: 10000K | |||
Total Submissions: 12583 | Accepted: 7674 | Special Judge |
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.
二、Source Code
Source CodeProblem: 1517 | User: mervyn_diane | |
Memory: 208K | Time: 0MS | |
Language: C++ | Result: Accepted |
#include<iostream> #include<iomanip> using namespace std; double formula( int ); int main() { cout << "n e" << endl; cout << "- -----------" << endl; double result = 0.0; for( int i = 0; i < 10; ++i ) { result += formula( i ); cout << setprecision(10) << i << " " << result << endl; } return 0; } double formula( int n ) { if( n == 0 ) return 1; else { int under = 1; for( int i = 1; i <= n; ++i ) under *= i; return 1.0 / under; } }
三、总结:
1、依次迭代,就好;
2、格式控制。
相关文章推荐
- POJ 1517 解题报告
- poj2002 Squares 解题报告
- POJ3650解题报告
- POJ 2744 子串 解题报告
- POJ1247解题报告
- POJ 2812 恼人的青蛙 解题报告
- POJ 1741 树的点分治 解题报告
- poj1061青蛙的约会解题报告
- POJ 2713 肿瘤面积 解题报告
- poj解题报告——1067
- POJ 1611 The Suspects 解题报告
- POJ 1166 The Clocks 解题报告(高斯消元法 & 逆矩阵)
- POJ 1001 解题报告 高精度大整数乘法模版
- POJ-3325-ICPC Score Totalizer Software-解题报告
- POJ 1363 解题报告
- POJ1260 Pearls 解题报告
- POJ 1035 解题报告
- POJ 3356 AGTC 解题报告(Edit Distance,DP)
- POJ 3414 解题报告!
- poj 2976-Dropping tests解题报告