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项和；

由于题目开到了1e8，所以我们不能将每一个计算的和存在数组里面；所以我们采用分组存的方式就节约了存储次数；就能用数组存前N项和了；把不满足分组的部分，暴力求就可以了；

代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
double a[2900000];
int main()
{
    double s=0;
    for(int i=1; i<100000001; i++)
    {
        s+=1.0/i;
        if(i%40==0)
            a[i/40]=s;
    }
    long long n,cas=0;
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n;
           long long f=n/40;
        double sum=a[f];
        for(long long i=f*40+1; i<=n; i++ )///不满足一组的暴力加上就好了
            sum+=1.0/i;
        printf("Case %lld: %.10lf\n",++cas,sum);
    }
}