- Category:
- Algorithm
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2013-06-09
- Downloads:
- 0 Times
- Uploaded by:
- 张曜勃
Description: Produce a table of the values of the series
(1)
for the 3001 values of x, x = 0.0, 0.1, 0.2, …, 300. All entries of the table must have an absolute error less than 10-10. This problem is based on a problem from Hamming (1962), when mainframes were very slow by today s microcomputer standards.
Format of function
void Series_Sum( double sum[] )
where double sum[] is an array of 3001 entries, each contains a value of y(x) for x = 0.0, 0.1, 0.2, …, 300.00.
Sample program of judge
#include <stdio.h>
void Series_Sum( double sum[] )
int main()
{
int i
double x, sum[3001]
Series_Sum( sum )
x = 0.0
for (i=0 i<3001 i++)
printf(" 6.2lf 16.12lf\n", x+ (double)i* 0.10, sum[i])
return 0
}
/* Your function will be put here*/
Sample output
0.00 1.644934066848
0.10 1.534607244904
...
1.00 1.000000000000
...
2.00 0.750000000000
...
300.00 0.020942
To Search:
File list (Check if you may need any files):
hamming (1962).txt
Download