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

有种高中题的感觉，这个是用的打表的技巧，因为当n超过一定范围之后，1/n就变的很小很小，于是就每一百个数存一个，然后当他需要的时候0.10格式输出就行了。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 1123456
#define M 100000005
double a[N];
void cn()
{
    double sum=0;
    int z=1;
    a[0]=0;
    for(int i=1;i<M;i++)
    {
        sum+=(1.0/i);
        if(i%100==0)
            a[z++]=sum;
    }
}
int main()
{
    int n,m;
    cn();
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&m);
        int x=m/100;
        double ans=a[x];
        for(int i=x*100+1;i<=m;i++)
            ans+=(1.0/i);
        printf("Case %d: %.10lf\n",i,ans);
    }
    return 0;
}