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

思路：题意很明显了，就不说了，主要是打表了，pu't普通打表很明显会超，我们可以以50为一个单位进行打表，ran'然后循环求解。

代码:

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

double a[2500050];

void init()
{
    double sum=0.0;
    for(int i=1; i<100000001; i++)
    {
        sum+=1.0/i;
        if(i%50==0) a[i/50]=sum;  //每隔49个记录一次。
    }
}

int main()
{
    init();
    int t,flag=1;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        int f=n/50;
        double ans=a[f];
        for(int i=50*f+1; i<=n; i++)  //很明显循环在50以内
            ans+=1.0/i;
        printf("Case %d: %.10lf\n",flag++,ans);
    }
    return 0;
}