洛谷P2522：[HAOI2011]Problem b（莫比乌斯反演 + 容斥原理）

---

${\sum }_{x=a}^b{\sum }_{y=c}^d[gcd(x,y]=k]$，下界不是从1开始好像有点麻烦？可以容斥一下：设solve(a,b)函数解决的是：${\sum }_{x=1}^a{\sum }_{y=1}^b[gcd(x,y]=k]$，答案就是 $solve(b,d)-solve(a-1,d)-solve(b,c-1)+solve(a-1,c-1)$

考虑$solve(a,b)$怎么求：$$solve(a,b)=\sum _{x=1}^a\sum _{y=1}^b[gcd(x,y]=k]=\sum _{x=1}^{\lfloor \frac{a}{k}\rfloor }\sum _{y=1}^{\lfloor \frac{b}{k}\rfloor }[gcd(x,y]=1]=\sum _{x=1}^{\lfloor \frac{a}{k}\rfloor }\sum _{y=1}^{\lfloor \frac{b}{k}\rfloor }\sum _{d|gcd(x,y)}\mu (d)$$
改变一下枚举项，把d提前：$$\sum _{d=1}^{\lfloor \frac{a}{k}\rfloor }\mu (d)\sum _{x=1}^{\lfloor \frac{a}{k\ast d}\rfloor }\sum _{y=1}^{\lfloor \frac{b}{k\ast d}\rfloor }=\sum _{d=1}^{\lfloor \frac{a}{k}\rfloor }\mu (d)\ast \lfloor \frac{a}{k\ast d}\rfloor \ast \lfloor \frac{b}{k\ast d}\rfloor$$
预处理$\mu (x)$的前缀和就可以直接分块，在$O(\sqrt{n})$时间内完成$solve(a,b)$的运算，总时间复杂度为$O(n\ast \sqrt{n})$

---

代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
typedef long long ll;
int t,a,b,c,d,k;
bool ispri[maxn];
int pri[maxn],mu[maxn];
void sieve(int n) {
	ispri[0] = ispri[1] = true;
	pri[0] = 0;
	mu[1] = 1;
	for(int i = 2; i <= n; i++) {
		if(!ispri[i]) pri[++pri[0]] = i,mu[i] = -1;
		for(int j = 1; j <= pri[0] && i * pri[j] <= n; j++) {
			ispri[i * pri[j]] = true;
			if(i % pri[j] == 0) break;
			mu[i * pri[j]] = -mu[i];
		}
	}
	for(int i = 1; i <= n; i++) 
		mu[i] += mu[i - 1]; 
}
ll solve(int n,int m) {
	if(n > m) swap(n,m);
	n /= k;m /= k;
	ll ans = 0;
	int i,j;
	for(i = 1; i <= n; i = j + 1) {
		j = min(n / (n / i),m / (m / i));
		ans += 1ll * (n / i) * (m / i) * (mu[j] - mu[i - 1]);
	}
	return ans;
}
int main() {
	sieve(50000);
	scanf("%d",&t);
	while(t--) {
		ll res = 0;
		scanf("%d%d%d%d%d",&a,&b,&c,&d,&k);
		res = solve(b,d) - solve(a - 1,d) - solve(b,c - 1) + solve(a - 1,c - 1);
		printf("%lld\n",res);
	}
}