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
11
1
2
3
4
5
6
7
8
9
10
2147483647
题意:
让我们求f(n)=n/1+n/2+n/3+......+n/n;同时注意n/i取整;
思路:
首先我们先看数据的范围,n (1 ≤ n < 2 31),数据范围太大,如果我们按照题目中的代码直接暴力肯定超时,那么,我们就要优化代码;
f=n/x这个函数关于y = x 对称对称点刚好是sqrt(n),于是就简单了直接求sum+n/i (i*i<n && i >=1),然后乘以2,再减去i*i即可。
当n==10时,m=sqrt(10)==13,f(10)==(10+5+3)*2-3*3=27;
关于m对称,左右相差m*m,左边10+5+3=18,右边2+2+1+1+1+1+1=9,和左边相差3*3=9,
故,这道题我们就可以简化了;
公式:
m=sqrt(n);
f(n)=(n/1+n/2+n/3+......+n/k)*2-m*m;(n/k<=m);
代码如下:
//Full of love and hope for life
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#define inf 0x3f3f3f3f
//https://paste.ubuntu.com/
//https://www.cnblogs.com/zzrturist/ //博客园
//https://blog.csdn.net/qq_44134712 //csdn
using namespace std;
typedef long long ll;
const ll maxn=1e7+10;
int main(){
ll a,b,k=0,sum,i;
cin >> a;
while(a--){
sum=0;
k++;
cin >> b;
ll t=sqrt(b);
for(i=1;i<=t;i++){
sum+=b/i;
if(i==t){
break;
}
}
cout << "Case " << k << ": ";
cout << (sum*2)-i*i << endl;
}
return 0;
}