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 < 231).
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 |
#include<cstdio>
int main()
{
long long t;
scanf("%lld",&t);
long long k=1;
while(t--)
{
long long n;
scanf("%lld",&n);
long long ans=0;
long long j;
for(long long i=1;i<=n;i=j+1)
{
j=n/(n/i);//计算下一个位置,划重点~
ans=ans+(n/i)*(j-i+1);//j-i+1代表当前多少个n/i
}
printf("Case %lld: %lld\n",k++,ans);
}
return 0;
}