lightoj1245 - 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

 

解题思路：枚举到sqrtn(n)即可，其实思路就是n/i结果为1的有n/2个，那么结果为2的数字有n/2-n/3个，结果为3的数字有n/3-n/4个...然后我们计算结果为x的时候也顺便可以计算一下i为x的情况，那么只需要进行到sqrt(n)就可以了。

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