【BZOJ2671】Calc（莫比乌斯反演）（数论分块）

传送门

---

题解：

十分扯淡的莫反题。

我们要求的是这个东西：

$$Ans=\sum _{i=1}^n\sum _{j=1}^{i-1}[(i+j)\mid ij]$$

直接骚推就行了。

$$\begin{array}{rl}Ans=& \sum _{d=1}^n\sum _{i=1}^n\sum _{j=1}^{i-1}[gcd(i,j)=d][(i+j)\mid ij]\\ =& \sum _{d=1}^n\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{i-1}[gcd(i,j)=1][(i+j)d\mid ij{d}^2]\\ =& \sum _{d=1}^n\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{i-1}[gcd(i,j)=1][(i+j)\mid d]\\ =& \sum _{i=1}^n\sum _{j=1}^{i-1}[gcd(i,j)=1]\sum _{d=1}^{\lfloor \frac{n}{i}\rfloor }[(i+j)\mid d]\\ =& \sum _{i=1}^{\sqrt{n}}\sum _{j=1}^{i-1}[gcd(i,j)=1]\lfloor \frac{n}{i(i+j)}\rfloor \\ =& \sum _{t=1}^{\sqrt{n}}\mu (t)\sum _{i=1}^{\lfloor \frac{\sqrt{n}}{t}\rfloor }\sum _{j=i+1}^{2i-1}\lfloor \frac{n}{ij}\rfloor \end{array}$$

枚举$t$，枚举$i$，$j$整除分块即可。

复杂度由积分可知为$O(n^{\frac{3}{4}})$

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const

cs int N=1e5+7;
int p[N],pc;
bool mark[N];
int mu[N];

inline void linear_sieves(int lim){
	mu[1]=1;
	for(int re i=2;i<=lim;++i){
		if(!mark[i])p[++pc]=i,mu[i]=-1;
		for(int re j=1;i*p[j]<=lim;++j){
			mark[i*p[j]]=true;
			if(i%p[j])mu[i*p[j]]=-mu[i];
			else break;
		}
	}
} 

ll n,sqn;ll ans;

inline ll solve(int m,int n){
	ll ans=0;
	for(int re i=1;i<=m;++i){
		ll t=n/i;
		for(int re l=i+1,r;l<(i<<1)&&l<=t;l=r+1){
			r=std::min<int>((i<<1)-1,t/(t/l));
			ans+=(ll)(r-l+1)*(t/l);
		}
	}
	return ans;
}

signed main(){
#ifdef zxyoi
	freopen("calc.in","r",stdin);
#endif
	scanf("%lld",&n);sqn=sqrt(n);linear_sieves(sqn);
	for(int re t=1;t<=sqn;++t)if(mu[t])ans+=mu[t]*solve(sqn/t,n/t/t);
	std::cout<<ans<<"\n";
	return 0;
}