51nod1220 约数之和 杜教筛

因为$d(ij)={\sum }_{p|i}{\sum }_{q|i}[(p,q)==1]\frac{pj}{q}$
那么
$$\sum _{i=1}^n\sum _{j=1}^{n}d(i\ast j)$$
$$=\sum _{i=1}^n\sum _{j=1}^n\sum _{p|i}\sum _{q|i}[(p,q)==1]\frac{pj}{q}$$
对式子大力莫反，有
$$=\sum _{d=1}^n\mu [d]\sum _{i=1}^n\sum _{j=1}^n\sum _{p|i}\sum _{q|i}[d|(p,q)]\frac{pj}{q}$$
再化简一下，就是
$$=\sum _{d=1}^n\mu [d]\sum _{d|p}p\sum _{d|q}\frac{1}{q}\sum _{p|i}\sum _{q|j}j$$
也就是
$$\sum _{d=1}^n\mu [d]\ast d(\sum _{p=1}^{[\frac{n}{d}]}p\ast [\frac{[\frac{n}{d}]}{p}])(\frac{1}{2}\sum _{q=1}^{[\frac{n}{d}]}[\frac{[\frac{n}{d}]}{p}]([\frac{[\frac{n}{d}]}{p}]+1))$$

观察一下两个括号里面的东西
会发现实际上就是
$$\sum _{i=1}^{n}i\ast [\frac{n}{i}]$$和$$\sum _{i=1}^n\frac{[\frac{n}{i}]([\frac{n}{i}]+1)}{2}$$
前面那个肯定有$$\sum _{i=1}^{n}i\ast [\frac{n}{i}]=\sum _{i=1}^{n}d(i)$$
后面那个我们换一下形式，会发现是
$$\sum _{i=1}^n\frac{[\frac{n}{i}]([\frac{n}{i}]+1)}{2}=\sum _{i=1}^n\sum _{j=1}^{[\frac{n}{i}]}j$$
也就是
$$=\sum _{j=1}^{n}j\sum _{i=1}^{[\frac{n}{j}]}1=\sum _{j=1}^{n}j[\frac{n}{j}]$$
所以整个式子就是
$$\sum _{d=1}^{n}d\ast \mu [d](\sum _{i=1}^{[\frac{n}{d}]}d(i){)}^2$$
那么前面的东西我们卷上$id$然后杜教筛，后面的东西我们可以先处理一下前$n^{2/3}$个$d(i)$，对于后面的那些我们可以直接利用${\sum }_{i=1}^{n}i\ast [\frac{n}{i}]$大力数论分块，这样总复杂度还是$O(n^{2/3})$

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <unordered_map>

using namespace std;

using ll = long long;

int const M = 1000000;
int const N = M + 5;
int const mod = 1e9 + 7;

ll KSM(ll a, ll k) {
	ll ret = 1;
	for (; k; k >>= 1, a = a * a % mod) 
		if (k & 1)
			ret = ret * a % mod;
	return ret;
}

int f[N], c[N], su[N], low[N];
ll g[N];
int pri[N], tot;
bool isp[N];
ll inv2, inv3;

void SAI() {
	isp[1] = 1;
	low[1] = f[1] = su[1] = 1;
	g[1] = 1;
	for (int i = 2; i <= M; ++i) {
		if (isp[i] == 0) {
			pri[++tot] = i;
			f[i] = -1;
			g[i] = su[i] = i + 1;
			low[i] = i;
		}
		for (int j = 1; j <= tot && i * pri[j] <= M; ++j) {
			isp[i * pri[j]] = 1;
			if (i % pri[j]) {
				f[i * pri[j]] = -f[i];
				low[i * pri[j]] = pri[j];
				su[i * pri[j]] = pri[j] + 1;
				g[i * pri[j]] = g[i] * g[pri[j]];
			} else {
				f[i * pri[j]] = 0;
				low[i * pri[j]] = low[i] * pri[j];
				su[i * pri[j]] = su[i] + low[i * pri[j]];
				g[i * pri[j]] = g[i] / su[i] * su[i * pri[j]];
				break;
			}
		}
	}
	for (int i = 1; i <= M; ++i) {
		f[i] = (1ll * i * f[i] % mod + f[i - 1]) % mod;
		g[i] = (g[i] + g[i - 1]) % mod;
	}
}

unordered_map<int, int> mp;

int sum_(int x) {
	if (x <= M)
		return f[x];
	if (mp.count(x) > 0)
		return mp[x];
	int ret = 1;
	for (int l = 2, r; l <= x; l = r + 1) {
		r = x / (x / l);
		ret = (ret - 1ll * (r - l + 1) * (l + r) % mod * inv2 % mod * sum_(x / l) % mod) % mod;
	}
	ret = (ret + mod) % mod;
	mp[x] = ret;
	return ret;
}

int sig_(int x) {
	if (x <= M)
		return g[x] % mod;
	int ret = 0;
	for (int l = 1, r; l <= x; l = r + 1) {
		r = x / (x / l);
		ret += 1ll * (x / l) * (l + r) % mod * (r - l + 1) % mod * inv2 % mod;
		if (ret >= mod)
			ret -= mod;
	}
	return ret;
}

int main() {
	SAI();
	int T = 1;
	inv2 = KSM(2, mod - 2);
	inv3 = KSM(3, mod - 2);
	while (T--) {
		int n;
		scanf("%d", &n);
		int ans = 0;
		for (int l = 1, r; l <= n; l = r + 1) {
			r = n / (n / l);
			int nd = n / l, t = sig_(nd);
			ans = (ans + 1ll * t * t % mod * (sum_(r) - sum_(l - 1))) % mod;
		}
		ans = (ans + mod) % mod;
		printf("%d\n", ans);
	}
}