LightOJ 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

 

---

PROBLEM SETTER: JANE ALAM JAN

/*
题目不错，时间卡的挺严的，加油！！！。
Time:2015-03-16 17:25
*/
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
int main(){
    int T,n;
    int nCase=1;
    scanf("%d",&T);
    while(T--){
        LL ans=0;
        scanf("%d",&n);
        int i;
        for(i=1;i<=(int)sqrt(n);i++){
            //有点郁闷的是此处不能用i*i==n,会超时。。。
            //没想到平方竟然比开根号耗时
            ans+=n/i;
            if(n/i>n/(i+1))
             ans+=(LL)((n/i-n/(i+1))*i);

        }
        i--;
        if(n/i==i)ans-=i;//此处不是整除。。。。

        printf("Case %d: %lld\n",nCase++,ans);
    }
return 0;
}