【洛谷 P3768】简单的数学题（莫比乌斯反演+杜教筛）

最新推荐文章于 2021-04-16 02:24:27 发布

stargazer.

最新推荐文章于 2021-04-16 02:24:27 发布

阅读量257

点赞数

分类专栏：莫比乌斯反演杜教筛

本文链接：https://blog.csdn.net/qq_42555009/article/details/104069000

版权

莫比乌斯反演同时被 2 个专栏收录

20 篇文章 0 订阅

订阅专栏

杜教筛

5 篇文章 0 订阅

订阅专栏

传送门

首先简单莫比乌斯反演可以得到
$\sum_{i=1}^{n}\sum_{j=1}^nijgcd(ij)$
$=\sum_{d=1}^nd^3\sum_{k=1}^{\frac nd }\mu(k)k^2S(\frac n {kd})^2,S(n)=\sum_{i=1}^ni$
$=\sum_{T=1}^nS(\frac nT)^2T^2\sum_{d|T}d\mu(\frac T d)$
考虑后面是 $\mu*Id=\mu*I*\phi=\phi$
$=\sum_{T=1}^nS(\frac nT)^2T^2\phi(T)$
考虑杜教筛求 $Id^2\phi$ 的前缀和
卷上 $Id^2$ 得 $\sum_{d|n}d^2(\frac n d)^2\phi(d)=n^3$
$\sum_{i=1}^ni^3=(\frac {n*(n+1)}{2})^2$
这个可以构造 $\sum_n((n+1)^4-n^4)$ 得到关于 $n^3$ 的式子求得

然后差不多就做完了

#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
    static char ibuf[RLEN],*ib,*ob;
    (ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob)?EOF:*ib++;
}
inline int read(){
    char ch=gc();
    int res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
    return f?res:-res;
}
inline ll readl(){
    char ch=gc();
    ll res=0;bool f=1;
    while(!isdigit(ch))f^=ch=='-',ch=gc();
    while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
    return f?res:-res;
}
template<class tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<class tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
int mod;
inline int add(int a,int b){return (a+=b)>=mod?(a-mod):a;}
inline int dec(int a,int b){a-=b;return a+(a>>31&mod);}
inline int mul(int a,int b){static ll r;r=1ll*a*b;return (r>=mod)?(r%mod):r;}
inline void Add(int &a,int b){(a+=b)>=mod?(a-=mod):0;}
inline void Dec(int &a,int b){a-=b,a+=a>>31&mod;}
inline void Mul(int &a,int b){static ll r;r=1ll*a*b;a=(r>=mod)?(r%mod):r;}
inline int ksm(int a,int b,int res=1){for(;b;b>>=1,Mul(a,a))(b&1)&&(Mul(res,a),1);return res;}
inline int Inv(int x){return ksm(x,mod-2);}
cs int N=10000006;
int pr[N],tot,phi[N],f[N],iv3;
bitset<N>vis;
inline int P(int x){return mul(x,x);}
inline int S1(int x){return 1ll*x*(x+1)/2%mod;}
inline int S2(int x){return mul(mul(S1(x),2*x+1),iv3);}
inline int S3(int x){return P(1ll*x*(x+1)/2%mod);}
inline void init(cs int len=N-6){
	phi[1]=1;
	for(int i=2;i<=len;i++){
		if(!vis[i])pr[++tot]=i,phi[i]=i-1;
		for(int j=1,p;j<=tot&&i*pr[j]<=len;j++){
			p=i*pr[j],vis[p]=1;
			if(i%pr[j]==0){phi[p]=phi[i]*pr[j];break;}
			phi[p]=phi[i]*phi[pr[j]];
		}
	}
	
	for(int i=1;i<=len;i++)f[i]=add(f[i-1],mul(phi[i],P(i)));
}
ll n;
struct Map{
	static cs int mod=192733;
	int val[mod];ll key[mod];
	Map(){memset(key,-1,sizeof(key));}
	cs int &operator [](cs ll &k)cs{
		int p=k%mod;
		while((~key[p])&&(key[p]!=k))p=(p==mod-1)?0:(p+1);
		return val[p];
	}
	int &operator [](cs ll &k){
		int p=k%mod;
		while((~key[p])&&(key[p]!=k))p=(p==mod-1)?0:(p+1);
		if(key[p]!=k)key[p]=k;
		return val[p];		
	}
	inline bool count(ll k){
		int p=k%mod;
		while((~key[p])&&(key[p]!=k))p=(p==mod-1)?0:(p+1);
		return key[p]==k;
	}
};
Map mp;
inline int S(ll n){
	if(n<=N-6)return f[n];
	if(mp.count(n))return mp[n];
	int ret=S3(n%mod);
	for(ll i=2,j;i<=n;i=j+1){
		j=n/(n/i);
		Dec(ret,mul(dec(S2(j%mod),S2((i-1)%mod)),S(n/i)));
	}
	return mp[n]=ret;
}
signed main(){
	#ifdef Stargazer
	freopen("lx.in","r",stdin);
	#endif
	mod=read(),n=readl();
	init(),iv3=Inv(3);
	int ret=0;
	for(ll i=1,j;i<=n;i=j+1){
		j=n/(n/i);
		Add(ret,mul(P(S1(n/i%mod)),dec(S(j),S(i-1))));
	}
	cout<<ret<<'\n';return 0;
}