E - 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

题意：计算1+1/2+1/3+……+1/n ;

思路：分段打表，将每1000的和存一下，需要计算时找出对应的1000的权值，再计算后面的部分相加即可

代码：

//Full of love and hope for life

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#include <vector>
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
//https://paste.ubuntu.com/
//https://www.cnblogs.com/zzrturist/    //博客园
//https://blog.csdn.net/qq_44134712     //csdn

using namespace std;
const int maxn=1e5+10;
typedef long long ll;

double a[maxn];

void init(){
    a[0]=0;
    int t=1;
    for(int i=1;i<=maxn;i++){
        a[i]=a[i-1];
        for(int j=t;j<=t+999;j++){
            a[i]+=1.0/j;
        }
        t+=1000;
    }
}

int main()
{
    init();
    int T;
    int n,k=0;
    cin >> T;
    while(T--){
        k++;
        cin >> n;
        double sum=0;
        int m=n/1000*1000;
        for(int i=m+1;i<=n;i++){
            sum+=1.0/i;
        }
        double ans=a[n/1000];
        printf("Case %d: %.10lf\n",k,ans+sum);
    }
    return 0;
}