Light OJ 1245 - 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到它自己的值（取整）的和，然后这里直接写是超时的，就是例如100/26=3取整之后，然后从26到33被100除结果都是3那么就不用从26再遍历到33了，求出33之后直接加上（33-26+1）*3 即可，这里，33是用100除以3得到的，恩，大概就是这样。

#include <iostream>
#include<cstdio>
#include<cstring>
#define maxn
using namespace std;
long long H(long long n)
{
    long long res=0;
    long long i;
    for(i=1;i<=n/2+1;++i)
    {
        int tem=n/i;
        if(n%i)
        {
            int p=n/tem;
            res+=(p-i+1)*tem;
            i=p;
        }
        else
            res+=tem;
    }
    return res;
}
int main()
{
    int t;
    long long n;
    scanf("%d",&t);
    for(int i=1;i<=t;++i)
    {
        scanf("%lld",&n);
        long long s=H(n);
        printf("Case %d: %lld\n",i,s);
    }
    return 0;
}