I - Harmonic Number LightOJ - 1234

链接点击打开链接

In mathematics, the n^th 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 H_n.

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 ≤ 10⁸).

Output

For each case, print the case number and the n^th 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

思路：分段打表，100个数一个表。

Code：

#include<bits/stdc++.h>
using namespace std;
double b[1000005];
const int maxn=100000000;
void init ()
{
    int i;
    double temp=0;
    for(i = 1;i<=maxn;i++)
    {
        temp+=1/(i*1.0);
        if(i%100==0)
            b[i/100]=temp;
    }
}
int main()
{
    int T,n,x,i;
    init();
    scanf("%d",&T);
     for(int c=1;c<=T;c++)
     {
         scanf("%d",&n);
         x=n;
         x/=100;
         double res=b[x];

         for(i=x*100+1;i<=n;i++)
         {
             res+=1/(i*1.0);
         }
         printf("Case %d: %.10lf\n",c,res);
     }
}