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
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).
Output
For each case, print the case number and the nth harmonic number. Errors less than 10-8 will be ignored.
Sample Input
12
1
2
3
4
5
6
7
8
9
90000000
99999999
100000000
Sample Output
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
题解:
还有一种方法就是利用公式的方法, 参考博客:Harmonic Number(调和级数+欧拉常数)
公式:f(n)=ln(n)+C+1/(2*n), 公式中C≈0.57721566490153286060651209;但是使用的时候n不能过小, 10000以上的数就可以用这个公式,剩下的就是打表,10000以内的数打表应该非常容易。
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5;
const double C = 0.57721566490153286060651209;
double sum[maxn];
void init()
{
sum[1]=1;
for(int i=2;i<=maxn;i++)
{
sum[i]=sum[i-1]+double(1.0/i);
}
}
int main()
{
int t;
init();
scanf("%d",&t);
int f=0;
while(t--)
{
f++;
int n;
scanf("%d",&n);
if(n<=maxn)
{
printf("Case %d: %.10lf\n",f,sum[n]);
}
else
{
printf("Case %d: %.10lf\n",f,log(n)+C+double(1.0/(2*n)));
}
}
return 0;
}