LightOJ 1245(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,其中n/i保留整数
f(n)=n/x 图形如下

图形的对称点是sqrt(n)，sum(sqrt(n))比后面的部分多图中的正方形部分

m=sqrt(n);
那么整个图形的面积=sum2-mm;

#include<cstdio>
#include<cmath>
int main()
{
    int t,c=1;
    scanf("%d",&t);
    while(t--)
    {
        long long n,sum=0;
        scanf("%lld",&n);
        int k=sqrt(n);
        for(int i=1;i<=k; i++)
            sum+=n/i;
        sum=sum*2-k*k;
        printf("Case %d: %lld\n",c++,sum);
    }
    return 0;
}