ACM-简单题之u Calculate e——hdu1012
2014-03-03 21:05
525 查看
u Calculate e
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 2 Accepted Submission(s) : 2
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
这道题就是求e了,e的算法图中也给明了,假如i=4,e=1+1/1!+1/2!+1/3!+1/4!
就是注意一下格式,我是用printf,好控制一些
#include <stdio.h>
#include <math.h>
double arr[10];
void cal(void)
{
int i;
double ft,s;
ft=arr[0]=s=1.0;
for(i=1;i<10;++i)
{
s*=i;
arr[i]=1.0/double(s)+ft;
ft=arr[i];
}
}
int main()
{
int i;
printf("n e\n");
printf("- -----------\n");
cal();
printf("0 1\n");
printf("1 2\n");
printf("2 2.5\n");
for(i=3;i<10;++i)
printf("%d %.9f\n",i,arr[i]);
return 0;
}
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 2 Accepted Submission(s) : 2
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
这道题就是求e了,e的算法图中也给明了,假如i=4,e=1+1/1!+1/2!+1/3!+1/4!
就是注意一下格式,我是用printf,好控制一些
#include <stdio.h>
#include <math.h>
double arr[10];
void cal(void)
{
int i;
double ft,s;
ft=arr[0]=s=1.0;
for(i=1;i<10;++i)
{
s*=i;
arr[i]=1.0/double(s)+ft;
ft=arr[i];
}
}
int main()
{
int i;
printf("n e\n");
printf("- -----------\n");
cal();
printf("0 1\n");
printf("1 2\n");
printf("2 2.5\n");
for(i=3;i<10;++i)
printf("%d %.9f\n",i,arr[i]);
return 0;
}
相关文章推荐
- 杭电acm 1259ZJUTACM(简单题)
- ACM-简单题之Wolf and Rabbit——hdu1222
- JOJ1202。重新操刀ACM,一天一练!做个简单的题目温习。
- HDU 4432 Sum of divisors 第37届ACM/ICPC天津现场赛B题 (简单题)
- ACM/ICPC 动态规划的简单讲解
- [ACM] HDU 5074 Hatsune Miku (简单DP)
- 【2012年腾讯俱乐部ACM赛新手组1001】简单大数取余-99 division
- 杭电ACM课件学习 简单数学题
- 16进制的简单运算http://acm.nyist.net/JudgeOnline/problem.php?pid=244
- 几道简单ACM题的解答----2
- ACM-简单题之Factorial——poj1401
- ACM典型试题--简单的加密算法(一)
- 杭电ACM 1239 简单的搜索类 Callin…
- 杭电ACM 1012 u Calculate e java
- ACM-简单的主题Factorial——poj1401
- 问题七十一:简单密码破解(acm)
- YT02-简单数学课后题-1004 The Last Practice -(5.31日-烟台大学ACM预备队解题报告)
- 杭电acm 3132GCC(简单数论)
- ACM: Calculate a + b
- ACM-简单题之18岁生日——hdu1201