I - Harmonic Number LightOJ - 1234-----------------------------数论(调和级数+欧拉常数)

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

Sponsor

解析:

欧拉常数:e = 0.57721566490153286060651209
调和级数公式:log(n)+e+1.0/(2.0*n)

对于1e6 我们打表就可以了，后面利用调和级数公式求

#include<stdio.h>
#include<math.h>
const double e = 0.57721566490153286060651209;
const int N=1e6+100;
double a[N];
int k, n,t;
void init()
{
	for(int i=1;i<=N;i++)
	{
		a[i]=a[i-1]+1.0/(1.0*i);
	}
}
int main(){
	init();
	scanf("%d",&t);
	k=0;
	while(t--)
	{
		double ans=0;
		scanf("%d",&n);
		if(n<N) ans=a[n];
		else ans=log(n)+e+1.0/(2.0*n);
		printf("Case %d: %.10lf\n",++k,ans);
	}
    return 0;
}