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

 

题目已经给出了提示，在整数除以整数时的向下取整会造成结果误差，这一题就是给出一个n，n除以1,2,3,4..... n-1，n的商相加，当然这些商也是向下取整得到的。

注意：此题不支持64int型，会WA，用long long。

代码如下：

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