Harmonic Number（LightOJ - 1234）

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分之一的累加值。

思路：打表+优化(开到它的大小的1000分之一，然后加上每个1000的数然后加上剩下的)。

代码：

#include <bits/stdc++.h>
using namespace std;
const int maxn=1e6+10000;
const int ma=1e8+1;
double a[maxn];
void table()
{
    a[0]=0;
    double ans=1.0;
    for(int i=2;i<=ma;i++)
    {
        ans+=1.0/(i*1.0);
        if(i%1000==0)
         a[i/1000]=ans;

    }
}
int main()
{
    table();
    int T;
    scanf("%d",&T);
    int cas=1;
    while(T--)
    {
        long long n;
        scanf("%lld",&n);
        int t=n/1000;
        double ans=a[t];
        for(int i=t*1000+1;i<=n;i++)
            ans+=1.0/(i*1.0);
        printf("Case %d: %.10f\n",cas++,ans);
    }
    return 0;
}