Harmonic Number

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

在VJ上做的：
问题连接

问题描述

给出n,求Hn

问题分析

打表。直接打表会超内存，但可以每一百个记录一个值，以后查表的时候，再把要找的值算出来就可以避免这个问题了，而且计算量也不是很大，算是打表的技巧吧。

代码如下

#include<iostream>
#include<cstdio>
using namespace std;

const int N=1e6+5;
const int size=100;

double hn[N];

void gethn(){
	int i,j,k;
	double temp;
	hn[0]=0;
	temp=0;
	k=1;
	for(i=1;i<=N;i++){
		for(j=1;j<=size;j++){
		temp+=(1.0)/k;	
		k++;
		}
		hn[i]=temp;
	}
}

double readhn(int x){
	double ans;
	int c=x%size;
	ans=hn[x/size];
	for(int i=x-c+1;i<=x;i++) ans+=1.0/i;
	return ans;
}

int main(){
	gethn();
	int i,t,n; 
	scanf("%d",&t);
	for(i=1;i<=t;i++){
		scanf("%d",&n);
		printf("Case %d: %.10lf\n",i,readhn(n));
	}
	return 0;
}