Dividing（除法分块总结）

传送门

题意：横纵坐标均有个范围[1,N] [1,K],求在这个范围里满足要求点的数量，要求如下

画图推点易得，每一列的点数

利用O根号n除法分块就可以算出答案，最后还要注意第一列多算了n要减掉

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
const int mod = 1e9 + 7;


inline ll solve(ll n, ll k)//除法分块
{
    ll ans = 0, r;
    for (ll l = 1, r; l <= k; l = r + 1)
    {
        r = n / (n / l);
        ans += (min(r,k) - l + 1) * (n / l);
       // cout << "1" << endl;
        //cout << l << ' ' << r << ' ' << ans << endl;
    }
    /*for (register ll i = 1; i <= k; i = j + 1) {
        j = n / (n / i);
        ans += (min(j, k) - i + 1) * (n / i);
    }*/
   // cout << "*" << endl;
    return ans;
}
int main()
{
    
    ll n, k;
    scanf("%lld%lld", &n, &k);
    
    /*ll ans = (solve(n, min(n, k)) % mod + solve(n - 1, min(n - 1, k)) % mod + k % mod) % mod - n;*/
        ll ans = (solve(n - 1,min(n-1, k)) % mod + solve(n, min(n,k)) % mod + k % mod) % mod-n;

        
        if (ans < 0)ans = mod - abs(ans) % mod;
        
        cout << ans << endl;
    
}

除法分块总结