LightOJ - 1245

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

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

这道题我不知道要怎么打标签…………

有个规律的，比如n=100的话，i=4时n/i等于25，i=5时n/i等于20，于是在大于20到小于等于25内的5个数字j都有n/j等于4，然后ans+=4*5

所以我们可以在小于等于根号n的范围内枚举i，ans+=n/i，然后ans+=(n/(i)-n/(i+1))*i，这样分段加起来

大概就是这样了…………

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN=1e7+9;
#define fi first
#define se second

int n;

int main()
{
    int cas=0,T;
    scanf("%d",&T);
    while(T--)
    {
        cas++;
        scanf("%d",&n);
        int z=sqrt(n);
        LL ans=0;
        LL last=1,lastpos=n;
        ans+=n;
        for(int i=2;i<=z;i++)
        {
            ans+=n/i;
            ans+=(lastpos-n/i)*last;
            last=i;
            lastpos=n/i;
        }
        ans+=(lastpos-z)*last;
        printf("Case %d: %lld\n",cas,ans);
    }
    return 0;
}