light oj 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 < 2³¹).

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

Sample Input	Output for Sample Input
11
1	Case 1: 1
2	Case 2: 3
3	Case 3: 5
4	Case 4: 8
5	Case 5: 10
6	Case 6: 14
7	Case 7: 16
8	Case 8: 20
9	Case 9: 23
10	Case 10: 27
2147483647	Case 11: 46475828386

---

题目说给出一个n，求出n/1+n/2+…+n/n的值，每个值都是向下取整的

网上能搜到的大部分做法都是先进行找规律，不过，我们其实可以换个思路来想
如果，我们把每个值对应的数据，画在一张平面直角坐标系上，能得到如下图
这里以n=10为例

似乎看起来有点像反比例函数的图像，但又不太一样对不对？

---

我们把点，变成面

每个矩形的面积，便是每个x值对应的n/x的值

同时，我们可以观察到，它沿着这条红线对称

所以，我们只要求出一半的面积，再乘以二，就是最后的答案了 OVO

不过，似乎这个面积求起来有些麻烦……

我们换个思路
对称的直线所经过的点，刚好是 $\sqrt{n}$向下取整，为3
所以，我们可以先求出绿色部分

乘以二，再减去红色的正方形，就能求出这个图形的面积，也是最后的值

代码

#include <iostream>
#include <string>
#include <cmath>
#include <cstdio>

using namespace std;
typedef long long ll;

int main() {
    //ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    ll n, sum;
    for (int cas = 1; cas <= t; cas++) {
        scanf("%lld", &n);
        int j = sqrt(n);
        sum = 0;
        for (int i = 1; i <= j; i++)sum += n / i;
        sum = sum * 2 - j * j;
        printf("Case %d: %lld\n", cas, sum);
    }
    return 0;
}