【GDSOI 2016】第一题 互补约数

【GDSOI 2016】第一题 互补约数

Description

求$F(n)={\sum }_{i=1}^n{\sum }_{d|i}\gcd (d,\frac{i}{d})$

Solution

欧拉反演:$$n=\sum _{d|n}\phi (d)$$
对$F(n)$中的$gcd(d,\frac{i}{d})$应用上式,得
$$F(n)=\sum _{i=1}^n\sum _{d|i}\sum _{j|\gcd (d,\frac{i}{d})}\phi (j)$$
拆一下$\gcd (d,\frac{i}{d})$,得
$$F(n)=\sum _{i=1}^n\sum _{d|i}\sum _{j|d且j|\frac{i}{d}}\phi (j)$$
改为枚举j,得
$$F(n)=\sum _{j=1}^{\sqrt{n}}\phi (j)\sum _{d=1}^{\lfloor \frac{n}{j^2}\rfloor }\lfloor \frac{\lfloor \frac{n}{j^2}\rfloor }{d}\rfloor$$
数论分块可以做了。复杂度$O(n^{\frac{3}{4}})$
记得开龙龙

Code

#include <cstdio>
#include <iostream>
#define int long long
using namespace std;
int n, ans, phi[10000010], cnt, sum;
int vis[10000010], p[1000010];
int read() {
	int res = 0, flag = 1;
	char ch = getchar();
	for(; ch < '0' || ch > '9'; ch = getchar())
		if(ch == '-') flag = -1;
	for(; ch >= '0' && ch <= '9'; res = res * 10 + ch - '0', ch = getchar());
	return res * flag;
}
signed main() {
	n = read();
	phi[1] = 1;
	for(int i = 2; i * i <= n; ++i) {
		if(!vis[i]) {
			p[++cnt] = i;
			phi[i] = i - 1;
		}
		for(int j = 1; j <= cnt && (p[j] * i) * (p[j] * i) <= n; ++j) {
			vis[i * p[j]] = 1;
			if(i % p[j] == 0) {
				phi[i * p[j]] = phi[i] * p[j];
				break;
			}
			phi[i * p[j]] = phi[i] * phi[p[j]];
		}
	}
	for(int i = 1; i * i <= n; ++i) {
		sum = 0;
		int m = n / (i * i);
		for(int l = 1, r; l <= m; l = r + 1) {
			r = m / (m / l);
			sum += (r - l + 1) * (m / l);
		}
		ans += phi[i] * sum;
	}
	printf("%lld\n",ans);
	return 0;
}