Problem Description
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^31).
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
2147483647Sample Output
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
题意:给出 t 组数,每组输入一个数 n,要求根据代码求 H(n)
思路:
首先,暴力肯定会超时,那么就需要进行推导了
根据代码可知,问题实质是要求:
对于式子中的每一项,都是一个反比例函数:,其与
的对称点刚好为
于是,对于每一项 ,可先求出红色的部分
,然后乘以 2,由于
部分存在重叠,因此最后还要再减去重叠部分
Source Program
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define PI acos(-1.0)
#define E 1e-9
#define INF 0x3f3f3f3f
#define LL long long
const int MOD=10007;
const int N=1000000+5;
const int dx[]= {-1,1,0,0};
const int dy[]= {0,0,-1,1};
using namespace std;
int main(){
int t;
scanf("%d",&t);
int Case=1;
while(t--){
LL n;
scanf("%lld",&n);
int m=sqrt(n);//关于√n对称
LL res=0;
for(int i=1;i<=m;i++)//累加每一项
res+=n/i;
res*=2;//总数乘以2
res-=m*m;//减去重叠部分
printf("Case %d: %lld\n",Case++,res);
}
return 0;
}