题目及时给你一个调和级数让你求它的和,不过直接求是不可能的,肯定超时,所以这里就要用到欧拉常数了,当数据比较小的时候直接暴力,当数据超过一定范围的时候,就用这个公式f(n) = ln(n) + c + 1/(2*n);其中才就是欧拉常数。。。。。。。
当然还有其他方法,就是分段打表然后根据数据的大小先从表中选取数据,然后在循环暴力出结果
这里给出第一种方法的代码!
In mathematics, the nth harmonic number is the sum of the reciprocals of the first n natural numbers:
In this problem, you are given n, you have to find Hn.
Input starts with an integer T (≤ 10000), denoting the number of test cases.
Each case starts with a line containing an integer n (1 ≤ n ≤ 108).
For each case, print the case number and the nth harmonic number. Errors less than 10-8 will be ignored.
12
1
2
3
4
5
6
7
8
9
90000000
99999999
100000000
Case 1: 1
Case 2: 1.5
Case 3: 1.8333333333
Case 4: 2.0833333333
Case 5: 2.2833333333
Case 6: 2.450
Case 7: 2.5928571429
Case 8: 2.7178571429
Case 9: 2.8289682540
Case 10: 18.8925358988
Case 11: 18.9978964039
Case 12: 18.9978964139
#include<stdio.h>
#include<math.h>
const double c=0.57721566490153286060651209;
int main()
{
int t,n,p=1;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
double sum=0;
if(n<=10000)
{
for(int i=1;i<=n;i++)
sum+=1.0/i;
}
else
{
sum=log(n)+c+1.0/(2*n);
}
printf("Case %d: %.10lf\n",p++,sum);
}
return 0;
}