数论分块儿入门

我这个蒟蒻才开始学数学了呢

题意:

• 给定n, k
• 求 ${\sum }_{i=1}^{n}k\%i$

经典中的经典

有预见性的化简 (练习latex):
$$\begin{array}{rl}\sum _{i=1}^{n}k\%i& =\sum _{i=1}^{n}k-\lfloor \frac{k}{i}\rfloor \times i\\ & =n\times k-\sum _{i=1}^n\lfloor \frac{k}{i}\rfloor \times i\end{array}$$

然后可以用分块处理后面的柿子每块儿内的数都是相同的(k/l), 然后再乘上块内的一个等差公式的求和就成了, 时刻注意n, k的范围

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << "s" << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
signed main()
{
	ll n = nxt(), k = nxt();
	ll ans = 0;
	for (ll l = 1, r; l <= n; l = r + 1)
	{
		if (k / l != 0)
			r = min(n, k / (k / l));
		else
			r = n;
		ans += (k / l) * (r + l) * (r - l + 1) / 2; //数*(首项+末项)*项数/2;
	}
	cout << k * n - ans << endl;
}

upd:

long long cowModCount(long long num) {
        // write code here
        long long res = 0, l, r;

        for (l = 1; l <= num; l = r + 1) {
            ll val = num / l;
            // 防止r超过n
            r = val ? min(num / val, num) : num;
            // val * (n - val * i) = val *n
            res = (res + num * val % mod * (r - l + 1) % mod) % mod;
            res = (res - val * val % mod * ((l + r) * (r - l + 1) / 2) % mod + mod) % mod;
        }
        return res;
    }

upd: 向上取整：

long long Sum(int n) {
    // write code here
    ll res = 0, l, r;
    for (r = n; r >= 1; r = l - 1) {
        ll val = ceil(n*1.0 / r);
        l = (val == n ? 1ll : max(1ll, (ll)ceil(n*1.0 / val)));
        res += (r - l + 1) * val;
    }
    return res;
}