HDU1012
来源:互联网 发布:自适应网址导航源码 编辑:程序博客网 时间:2024/05/22 06:08
u Calculate e
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 46913 Accepted Submission(s): 21522
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
Source
Greater New York 2000
Recommend
JGShining | We have carefully selected several similar problems for you: 1013 1002 1021 1017 1020
练习格式输出的题
#include<cstdio>int main(){ double n=1; int temp = 1; printf("n e\n"); printf("- -----------\n"); printf("0 1\n"); for (int i = 1; i < 10; i++) { temp *= i; n += 1.0 / temp; if (i == 1)printf("%d %.0f\n",i,n); else if (i == 2)printf("%d %.1f\n",i,n); else printf("%d %.9f\n", i, n); } return 0;}
- hdu1012
- hdu1012
- HDU1012
- HDU1012
- HDU1012
- HDU1012
- HDU1012
- HDU1012
- HDU1012
- hdu1012 变态的输出
- HDU1012 Calculate e
- hdu1012-u Calculate e
- HDU1012 计算e~
- hdu1012-u Calculate e
- hdu1012 u Calculate e
- hdu1012 Calculate e
- HDU1012 u Calculate e
- hdu1012 u Calculate e
- PHP 即点即改
- Unity_Transform组件_006
- 程序员面试金典:平分的直线、穿点最多的直线
- jquery源码解析(第2章之插入)
- 关于java配置文件的使用
- HDU1012
- Oracle-26-内连接(等值、不等值连接、自然连接)&外连接(左外、右外、全连接)&using子句
- 【二分图】poj 2239 Selecting Courses
- 秦九昭算法
- [模板]线性基
- Caused by: org.hibernate.PropertyNotFoundException:
- 实现一个栈Stack,要求实现Push(入栈)、Pop(出栈)、Min(返回最小值的操作)的时间复杂度为O(1)
- hdu3357Stock Chase (暴搜)
- 同济大学Openwrt路由器 ipv6教程(新手导向)