G - Harmonic Number (II)

1245 - Harmonic Number (II)

PDF (English)

Statistics

Forum

Time Limit: 3 second(s)

Memory Limit: 32 MB

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 2 3 4 5 6 7 8 9 10 2147483647	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

           我们把1 - sqrt(n) 项先加起来；然后我们令temp = n/i;

            则temp = 1有(n/1 - n/2)项

               temp = 2有(n/2 - n/3)项

               temp = j有(n/j - n/(j + 1))项（1 < n/j < 2求得）

            代码：

            

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e6+7;

ll H(ll n) {
    ll sum = 0;
    for(int i = 1; i <= sqrt(n); i++)
        sum += n/i;
    for(int i = 1; i <= sqrt(n); i++)
        sum += (ll)(n/i - n/(i+1))*i;
    if((int)sqrt(n) == n/(int)sqrt(n)) sum  -= (int)sqrt(n);
    return sum;
}


int main()
{
    int t, cas = 0;
    ll n;

    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld", &n);
        printf("Case %d: %lld\n", ++cas, H(n));
    }
    return 0;
}

       还可以这样子做：

        

        这样就是求图中区域内有多少整数点。。。。