BZOJ 4916 神犇和蒟蒻

题目大意

给定 $n$，模 $10^9+7$ 意义下，求 $\begin{array}{r}{\text{Sum}}_{{\mu }^{\prime }}(n)=\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}\mu (i^2)\end{array}$ 和 $\begin{array}{r}{\text{Sum}}_{{\phi }^{\prime }}(n)=\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}\phi (i^2)\end{array}$。
数据范围　$1⩽n⩽10^9$

题解

求 ${\mu }^{\prime }$ 是很容易的。
$$\begin{array}{rl}{\text{Sum}}_{{\mu }^{\prime }}(n)& =\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}\mu (i^2)\\ & =\mu (1)+\sum _{i=2}^n\mu (i^2)\\ & =1+0\\ & =0\end{array}$$

然后是 ${\phi }^{\prime }$，考虑将其唯一分解。
$$\begin{array}{rl}{\text{Sum}}_{{\phi }^{\prime }}(n)& =\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}\phi (i^2)\\ & =\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}\phi \left({\left(\prod _{t=1}^k{p}_t^{a_{{}_t}}\right)}^2\right)\\ & =\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}\phi \left(\prod _{t=1}^k{p}_t^{2a_{{}_t}}\right)\\ & =\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}\prod _{t=1}^k\phi \left(p_t^{2a_{{}_t}}\right)\\ & =\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}\prod _{t=1}^k{p}_t^{2a_{{}_t}}(1-\frac{1}{p_t})\\ & =\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}i\prod _{t=1}^k{p}_t^{a_{{}_t}}(1-\frac{1}{p_t})\\ & =\sum _{i=1}^{{}^{{}^{{}^{}}}{n}^{{}^{{}^{}}}}i\times \phi (i)\end{array}$$

因此，我们只需要杜教筛出 $\phi \cdot id$ 即可。
当 $f=\phi \cdot id$ 时，取 $g=id$ 则 $f\ast g=i{d}^2$
则有：
$$\begin{array}{rl}{\text{Sum}}_{\phi \cdot id}& =\frac{n(n+1)(2n+1)}{6}-\sum _{k=2}^{n}k\times {\text{Sum}}_{\phi \cdot id}(\lfloor \frac{n}{k}\rfloor )\end{array}$$

杜教筛即可。时间复杂度为 $T(n)=\Theta (n^{\frac{2}{3}})$

#include<bits/stdc++.h>
using namespace std;
#define maxn 2000010
const long long mod=1e9+7;
long long inv_6;
long long p[maxn],phi[maxn],vis[maxn];
map<long long,long long> Phi;
void reset(long long n=maxn){
	memset(vis,0,sizeof vis);
	long long tot=0;phi[1]=1;
	for(long long i=2;i<=n;i++){
		if(!vis[i]) p[++tot]=i,phi[i]=(i-1)%mod;
		for(long long j=1;j<=tot&&i*p[j]<=n;j++){
			vis[i*p[j]]=true;
			phi[i*p[j]]=phi[i]*(p[j]-1)%mod;
			if(i%p[j]==0){
				phi[i*p[j]]=phi[i]*p[j]%mod;
				break;
			}
		}
	} for(long long i=1;i<=n;i++)
		phi[i]=(phi[i-1]+(phi[i]*i)%mod)%mod;
}
#define calc(a) ((((a)+1)*(a))>>1)
long long Phi_id(long long n){
	if(n<maxn) return phi[n];
	{	map<long long,long long>::iterator it=Phi.find(n);
		if(it!=Phi.end()) return it->second;	}
	long long ans=n*(n+1)%mod*(2*n+1)%mod*inv_6%mod;
	for(long long l=2,r;l<=n;l=r+1){
		r=min(n/(n/l),n);
		ans=(ans-(calc(r)-calc(l-1))*Phi_id(n/l)%mod+mod)%mod;
	} return Phi[n]=ans;
}
long long pow_t(long long a,long long b){
	if(b==0) return 1;
	if(b==1) return a%mod;
	long long t=pow_t(a,b/2);
	if(b%2==0) return (t*t)%mod;
	return (t*t%mod)*a%mod;
}
signed main(void){
	inv_6=pow_t(6,mod-2);
	reset();
	int n;scanf("%d",&n);
	printf("1\n%lld",Phi_id(n));
	return 0;
}