2019 南昌邀请赛网络赛 G. tsy's number（莫比乌斯反演 + 线性筛）

---

（来补5个月前的题）
题目大意：$$让你求：\sum _{i=1}^n\sum _{j=1}^n\sum _{k=1}^n\frac{\varphi (i)\varphi (j^2)\varphi (k^3)}{\varphi (i)\varphi (j)\varphi (i)}\varphi (gcd(i,j,k))$$

通过欧拉函数的公式：$\varphi (x)=x\ast {\prod }_{p|x}(1-\frac{1}{p})$，由于 $x$ 和 $x^2$的素因子相同，因此$\varphi (x^2)=x\ast x\ast {\prod }_{p|x}(1-\frac{1}{p})=x\ast \varphi (x)$

进行式子化简：$$\sum _{i=1}^n\sum _{j=1}^n\sum _{k=1}^n\frac{\varphi (i)\varphi (j^2)\varphi (k^3)}{\varphi (i)\varphi (j)\varphi (i)}\varphi (gcd(i,j,k))$$$$=\sum _{i=1}^n\sum _{j=1}^n\sum _{k=1}^{n}j\ast k^2\ast \varphi (gcd(i,j,k))$$$$=\sum _{d=1}^n\sum _{i=1}^n\sum _{j=1}^n\sum _{k=1}^{n}j\ast k^2\ast \varphi (d)\ast [gcd(i,j,k)=d]$$$$=\sum _{d=1}^n\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{k=1}^{\lfloor \frac{n}{d}\rfloor }j\ast k^2\ast \varphi (d)\ast [gcd(i,j,k)=1]$$$$=\sum _{d=1}^n\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{k=1}^{\lfloor \frac{n}{d}\rfloor }j\ast k^2\ast \varphi (d)\sum _{p|gcd(i,j,k)}\mu (p)$$$$=\sum _{d=1}^n\sum _{p=1}^{\lfloor \frac{n}{d}\rfloor }\mu (p)\sum _{i=1}^{\lfloor \frac{n}{p\ast d}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{p\ast d}\rfloor }\sum _{k=1}^{\lfloor \frac{n}{p\ast d}\rfloor }j\ast k^2\ast \varphi (d)$$$$=\sum _{d=1}^n\sum _{p=1}^{\lfloor \frac{n}{d}\rfloor }\mu (p)\sum _{i=1}^{\lfloor \frac{n}{p\ast d}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{p\ast d}\rfloor }\sum _{k=1}^{\lfloor \frac{n}{p\ast d}\rfloor }j\ast k^2\ast \varphi (d)$$$$=\sum _{T=1}^n\lfloor \frac{n}{T}\rfloor \ast f(\lfloor \frac{n}{T}\rfloor )\ast F(\lfloor \frac{n}{T}\rfloor )\sum _{d|T}\varphi (d)\ast \mu (\frac{T}{d})$$$f(x)=\frac{x\ast (x+1)}{2},F(x)=\frac{x\ast (x+1)\ast (2\ast x+1)}{6}$

左边部分可以分块，右边是欧拉函数和莫比乌斯函数的卷积，两个都是积性函数，可以用线性筛预处理前缀和。
令$S(T)={\sum }_{d|T}\varphi (d)\ast \mu (\frac{T}{d})$

1.$S(p)=p-2$，p为质数
2.$S(p^2)=\varphi (p^2)-\varphi (p),S(p^3)=\varphi (p^3)-\varphi (p^2)$，因为莫比乌斯函数的性质，只有因子 1 和 p有贡献。由此可得 $S(p^k)=\varphi (p^k)-\varphi (p^{k-1})$
3.$S(i\ast p^k)=S(i)\ast S(p^k)$

根据这三点可以线性筛得出$S函数$
另外由于模数是 $2^{30}$，计算$F(x)$时，6 没有逆元，为了防止计算溢出，可以拆成$\frac{x\ast (x+1)}{2}\ast \frac{2\ast x+1}{3}=f(x)\ast \frac{2\ast x+1}{3}$，3的逆元可以用扩展欧几里得求出，分步取模。
复杂度$O(T\ast \sqrt{n})$

---

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e7 + 10;
const ll mod = 1ll << 30;
const ll inv = 715827883;
typedef long long ll;
bool ispri[maxn];
int pri[maxn];
int phi[maxn];
int tp[maxn];
ll f[maxn];
int t,n;
void sieve(int n) {
	ispri[0] = ispri[1] = true;
	pri[0] = 0;f[1] = 1;phi[1] = 1;
	for(int i = 2; i <= n; i++) {
		if(!ispri[i]) {
			phi[i] = i - 1;
			pri[++pri[0]] = i;
			tp[i] = i;
			f[i] = i - 2;
		}
		for(int j = 1; j <= pri[0] && i * pri[j] <= n; j++) {
			ispri[i * pri[j]] = true;
			if(i % pri[j] == 0) {
				phi[i * pri[j]] = phi[i] * pri[j];
				tp[i * pri[j]] = 1ll * tp[i] * pri[j];
				f[i * pri[j]] = 1ll * f[i / tp[i]] * (phi[tp[i * pri[j]]] - phi[tp[i]]);
				break;
			}
			tp[i * pri[j]] = pri[j];
			f[i * pri[j]] = f[i] * f[pri[j]];
			phi[i * pri[j]] = phi[i] * phi[pri[j]];
		}
	}
	for(int i = 1; i <= n; i++) {
		f[i] %= mod;
		f[i] = 1ll * i * i % mod * i % mod * f[i] % mod;
		f[i] = (f[i] + f[i - 1]) % mod;
	} 
}
ll cal(ll x) {
	return x * (x + 1) / 2 % mod;
}
ll cal2(ll x) {
	return cal(x) * (2 * x + 1) % mod * inv % mod;
}
int main() {
	sieve(10000000);
	scanf("%d",&t);
	while(t--) {
		scanf("%d",&n);
		ll l,r;
		ll ans = 0;
		for(l = 1; l <= n; l = r + 1) {
			r = n / (n / l);
			ll p = n / l;
			ans = (ans + p * cal(p) % mod * cal2(p) % mod * ((f[r] - f[l - 1] + mod) % mod) % mod) % mod;
		}
		printf("%lld\n",ans);
	}
	return 0;
}