Harmonic Number (II)

I was trying to solve problem '1234 - Harmonic Number', I wrote the following code

long long H( int n ) {
    long long res = 0;
    for( int i = 1; i <= n; i++ )
        res = res + n / i;
    return res;
}

Yes, my error was that I was using the integer divisions only. However, you are given n, you have to find H(n) as in my code.

Input

Input starts with an integer T (≤ 1000), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n < 231).

Output

For each case, print the case number and H(n) calculated by the code.

Sample Input

11

1

2

3

4

5

6

7

8

9

10

2147483647

Sample Output

Case 1: 1

Case 2: 3

Case 3: 5

Case 4: 8

Case 5: 10

Case 6: 14

Case 7: 16

Case 8: 20

Case 9: 23

Case 10: 27

Case 11: 46475828386

题意和他说的那个公式一样求f(n)=n/1+n/2.....n/n，但是呢超时是个问题，于是我们开始找规律，发现当j小于sqrt（n）的时候，按照暴力就可以，剩下的按照(n/j - n/(j+1)) * j这个累加就可以。

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    int t;
    scanf("%d",&t);
    for(int i = 1 ; i <= t; i ++)
    {
        long long ans = 0,n;
        scanf("%lld",&n);
        int m = sqrt(n);
        for(int j = 1; j <= m; j ++)
            ans += n / j;
        for(int j = 1; j <=m; j ++)
            ans += (n/j - n/(j+1)) * j;
        if( n / m == m)
            ans -= m;
        printf("Case %d: %lld\n",i,ans);
    }
    return 0;
}