[51Nod - 1594]Gcd and Phi（莫比乌斯反演）

题面

求${\sum }_{i=1}^n{\sum }_{j=1}^n\phi \left(gcd(\phi (i),\phi (j))\right)$
$n\le 2e6$

题解

先初步推一推柿子。
$$Ans=\sum _{d=1}^n\phi (d)\sum _{i=1}^n\sum _{j=1}^n[gcd(\phi (i),\phi (j))==d]$$用$s(k)$表示$n$以内$\phi (i)=k$的正整数$i$的个数。则
$$\begin{gathered} Ans=\sum _{d=1}^n\phi (d)\sum _{i=1}^n\sum _{j=1}^{n}s(i)\cdot s(j)\cdot [gcd(i,j)==d] \\ =\sum _{d=1}^n\phi (d)\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{d}\rfloor }s(id)\cdot s(jd)\cdot [gcd(i,j)==1] \end{gathered}$$令$g(d)={\sum }_{i=1}^{\lfloor \frac{n}{d}\rfloor }{\sum }_{j=1}^{\lfloor \frac{n}{d}\rfloor }s(id)\cdot s(jd)\cdot [gcd(i,j)==1]$，发现不好求。

再令$f(d)={\sum }_{i=1}^{\lfloor \frac{n}{d}\rfloor }{\sum }_{j=1}^{\lfloor \frac{n}{d}\rfloor }s(id)\cdot s(jd)$，有：
$$f(d)=\sum _{k=1}^{\lfloor \frac{n}{d}\rfloor }g(kd)$$反演后得：
$$\begin{gathered} g(d)=\sum _{k=1}^{\lfloor \frac{n}{d}\rfloor }\mu (k)f(kd) \\ \therefore Ans=\sum _{i=1}^n\phi (n)g(\lfloor \frac{n}{d}\rfloor )=\sum _{d=1}^n\phi (d)\sum _{i=1}\mu (i)f(id) \end{gathered}$$

那么预处理出来$f$，就能求$g$了。直接按照式子$O(n\log n)$求。就完事了。

$O(Tn\log n)$，有点慢还是能过。还有个小优化可以把$\phi$和$\mu$枚举顺序交换一下，那么对于$\mu =0$的时候就不用算（也优化不了多少）。

CODE

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2000005;
int n, cnt, p[N], phi[N], s[N], mu[N];
bool vis[N];
LL f[N];

void init(int N) {
	phi[1] = mu[1] = 1;
	for(int i = 2; i <= N; ++i) {
		if(!vis[i]) p[++cnt] = i, phi[i] = i-1, mu[i] = -1;
		for(int j = 1, k; j <= cnt && i * p[j] <= N; ++j) {
			vis[k = i * p[j]] = 1;
			if(i % p[j] == 0) {
				mu[k] = 0;
				phi[k] = phi[i] * p[j];
				break;
			}
			mu[k] = -mu[i];
			phi[k] = phi[i] * (p[j]-1);
		}
	}
}

int main () {
	init(2000000); int T, n;
	scanf("%d", &T);
	while(T--) {
		scanf("%d", &n);
		for(int i = 1; i <= n; ++i) ++s[phi[i]];
		for(int i = 1; i <= n; ++i) {
			f[i] = 0;
			for(int j = i; j <= n; j += i)
				f[i] += s[j];
			f[i] = f[i] * f[i];
		}
		LL ans = 0;
		for(int i = 1; i <= n; ++i) if(mu[i]) {
			LL sum = 0;
			for(int d = 1; i*d <= n; ++d)
				sum += phi[d] * f[i*d];
			ans += sum * mu[i];
		}
		printf("%lld\n", ans);
		for(int i = 1; i <= n; ++i) --s[phi[i]];
	}
}