LightOJ - 1245 Harmonic Number (II)(除法分块)

LightOJ - 1245 Harmonic Number (II) (除法分块)

传送门LightOJ - 1245

题意

就是把

long long H( int n ) {
    long long res = 0;
    for( int i = 1; i <= n; i++ )
        res = res + n / i;
    return res;
}

优化一下，使$n = 2^{31}$时也能跑

题解

一眼看到$\lfloor{n \over i} \rfloor$就想到了刚学过的除法分块
形如

$$\sum_{i = 1}^n \lfloor{n \over i} \rfloor$$
我们都可以拿除法分块搞一下
这个题就是除法分块的模板题了，就是求 $\sum_{i = 1}^n \lfloor{n \over i} \rfloor$
具体的除法分块详解可以看我 这篇博客中关于除法分块的部分

ac代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <cmath>
#include <ctime>
#include <map>
#include <set>
#include <iomanip>
//#include <unordered_map>

#pragma comment(linker, "/STACK:102400000,102400000")
#define fir first
#define sec second
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define clr(x) memset(x,0,sizeof(x))
#define cld(x) memset(x,-1,sizeof(x))
#define clx(x) memset(x,63,sizeof(x))
#define cln(x) memset(x,-64,sizeof(x))
#define rush() int T;scanf("%d",&T);for(int NUM = 1; NUM <= T ; ++NUM)
#define pi 3.1415926
#define VM 100047
#define EM 400047
#define rd(x) scanf("%d",&x);
#define seed() srand((unsigned)time(NULL))
#define random(a,b) rand() % (b - a + 1) + a
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair <ll, ll> pll;

const int inf = 0x3f3f3f3f;
const ll llf = 0x3f3f3f3f3f3f3f3f;
const int maxn = (int) 1e6 + 7;
const double eps = 1e-10;
const ll mod1 = (int) 1e9 + 7;
const ll mod2 = 998244353;
const ll has = 99959;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
ll n;
int main() {
    std::ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif

    rush(){
        scanf("%lld",&n);
        ll ans = 0;
        for(ll l = 1,r;l <= n;l = r + 1){
            r = n / (n / l);
            ans += (r - l + 1) * (n / l);
        }
        printf("Case %d: %lld\n",NUM,ans);
    }

    return 0;
}