【莫比乌斯反演】【杜教筛】简单的数学题

门

题目

$$\sum _{i=1}^n\sum _{j=1}^{n}ijgcd(i,j)$$

题解

$$\begin{gathered} \sum _{i=1}^n\sum _{j=1}^{n}ijgcd(i,j) \\ \sum _{d=1}^n{d}^3\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }i\sum _{j=1}^{\lfloor \frac{n}{d}\rfloor }j[gcd(i,j)==1] \\ \sum _{d=1}^n{d}^3\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }i\sum _{j=1}^{\lfloor \frac{n}{d}\rfloor }j\sum _{e|gcd(i,j)}\mu (e) \end{gathered}$$
$f(x)={\sum }_{i=1}^{x}i$
$$\begin{gathered} \sum _{d=1}^n{d}^3\sum _{e=1}^{\lfloor \frac{n}{d}\rfloor }\mu (e)e^2\sum _{i=1}^{\lfloor \frac{n}{de}\rfloor }i\sum _{j=1}^{\lfloor \frac{n}{de}\rfloor }j \\ \sum _{T=1}^n{T}^2\sum _{d|T}d\mu (\frac{T}{d})f^2(\lfloor \frac{n}{de}\rfloor ) \\ \sum _{T=1}^n{T}^2\varphi (T)f^2(\lfloor \frac{n}{T}\rfloor ) \end{gathered}$$
$$\begin{gathered} f(x)=x^2\varphi (x) \\ g(x)=x^2 \\ h(x)=(f\ast g)(x)=x^3 \end{gathered}$$
整除分块套杜教筛。。。

#include<bits/stdc++.h>
#include<tr1/unordered_map>
#define ll long long
using namespace std;
using namespace tr1;
const int N=5e6+10,M=5e6;
ll mod,inv2,inv6;
ll quick_mul(ll a,ll k)
{
	ll ans=1;
	while(k)
	{
		if(k&1)ans=ans*a%mod;
		a=a*a%mod;
		k>>=1;
	}return ans;
}
ll inv(ll a){return quick_mul(a,mod-2);}
ll phi[N];
int z[N],p;
bool vis[N];
void Sieve()
{
	phi[1]=1;
	for(int i=2;i<=M;i++)
	{
		if(!vis[i])z[++p]=i,phi[i]=(i-1)%mod;
		for(int j=1;j<=p&&i*z[j]<=M;j++)
		{
			vis[i*z[j]]=1;
			if(i%z[j]==0){phi[i*z[j]]=phi[i]*z[j]%mod;break;}
			phi[i*z[j]]=phi[i]*phi[z[j]]%mod;
		}
	}
	for(int i=1;i<=M;i++)phi[i]=(phi[i]*i%mod*i%mod+phi[i-1])%mod;
}
ll f(ll n){n%=mod;return n*(n+1)%mod*inv2%mod;}
ll f2(ll n){n%=mod;return n*(n+1)%mod*(2ll*n%mod+1)%mod*inv6%mod;}
unordered_map<ll,ll>Phi;
ll Sum(ll n)
{
	if(n<=M)return phi[n];
	if(Phi[n])return Phi[n];
	ll ans=f(n)*f(n)%mod;
	for(ll l=2,r;l<=n;l=r+1)
	{
		r=n/(n/l);
		ans=((ans-(f2(r)-f2(l-1)+mod)%mod*Sum(n/l)%mod)%mod+mod)%mod;
	}return Phi[n]=ans;
}
ll work(ll n)
{
	ll ans=0;
	for(ll l=1,r;l<=n;l=r+1)
	{
		r=n/(n/l);
		ans=(ans+f(n/l)*f(n/l)%mod*(Sum(r)-Sum(l-1)+mod)%mod)%mod;
	}return ans;
}
int main()
{
	ll n;
	scanf("%lld%lld",&mod,&n);
	Sieve();inv2=inv(2ll);inv6=inv(6ll);
	printf("%lld",work(n));
}