light oj 1245(时间复杂度问题）

最新推荐文章于 2022-10-21 14:40:28 发布

mrcoderrev

最新推荐文章于 2022-10-21 14:40:28 发布

阅读量269

点赞数

分类专栏：计算数学

本文链接：https://blog.csdn.net/yjf3151731373/article/details/52437224

版权

计算数学专栏收录该内容

45 篇文章 0 订阅

订阅专栏

Harmonic Number (II)

Time Limit: 3000MS

Memory Limit: 32768KB

64bit IO Format: %lld & %llu

Submit Status uDebug

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³¹).

Output

For each case, print the case number and H(n) calculated by the code.

Sample Input

2147483647

Sample 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

先求出前sqrt(n)项和：即n/1+n/2+...+n/sqrt(n)

再求出后面所以项之和.后面每一项的值小于sqrt(n),计算值为1到sqrt(n)的项的个数，乘以其项值即可快速得到答案

例如:10/1+10/2+10/3+...+10/10

sqrt(10) = 3

先求出其前三项的和为10/1+10/2+10/3

在求出值为1的项的个数为(10/1-10/2)个，分别是(10/10,10/9,10/8,10/7,10/6),值为2个项的个数（10/2-10/3）分别是（10/5,10/4）,在求出值为3即sqrt(10)的项的个数.

显然，值为sqrt(10)的项计算了2次,减去一次即可得到答案。当n/(int)sqrt(n) == (int)sqrt(n)时，值为sqrt(n)的值会被计算2次。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long LL;

int main()
{
int t, ncase=1;
scanf("%d", &t);
while(t--)
{
LL sum=0;
LL x, k;
scanf("%lld", &x);
k=sqrt(x);
for(int i=1; i<=k; i++)
{
LL m=((x/i)-x/(i+1))*i, n=x/i;
sum=sum+m+n;
}
if(k==x/k)
{
sum-=(x/k);
}
printf("Case %d: %lld\n",ncase++,sum);
}
return 0;
}