BZOJ2671: Calc 莫比乌斯反演

Description
给出$N$，统计满足下面条件的数对$(a,b)$的个数：
$1.1<=a<b<=N$
$2.a+b整除a\ast b$

---

Sample Input
15

---

Sample Output
4

---

式子什么的先化一下：
设$d=gcd(a,b)$，$xd=a,yd=b$，则
$$d(x+y)|d^{2}xy$$
$$(x+y)|dxy$$
又因为$gcd(x+y,xy)=1$，则
$$(x+y)|d$$
然后就是统计对于一个三元组$(x,y,d)$满足$gcd(x,y)=1$且$xd<=n,yd<=n$
设$y>x$，则可知对于一对二元组$(x,y)$，贡献为$\lfloor \frac{n}{y(x+y)}\rfloor$。
式子就是：
$$ans=\sum _{x=1}^{\sqrt{n}}\sum _{y=x+1}^{\sqrt{n}}\lfloor \frac{n}{y(x+y)}\rfloor [gcd(x,y)==1]$$
莫反一下：
$$ans=\sum _{x=1}^{\sqrt{n}}\sum _{y=x+1}^{\sqrt{n}}\lfloor \frac{n}{y(x+y)}\rfloor \sum _{d|x,d|y}\mu (d)$$
$=>$
$$ans=\sum _{d=1}^{\sqrt{n}}\mu (d)\sum _{x=1}^{\frac{\sqrt{n}}{d}}\sum _{y=x+1}^{\frac{\sqrt{n}}{d}}\lfloor \frac{n}{y(x+y)}\rfloor$$
$=>$
$$ans=\sum _{d=1}^{\sqrt{n}}\mu (d)\sum _{y=1}^{\frac{\sqrt{n}}{d}}\sum _{x=1}^{y-1}\lfloor \frac{n}{y(x+y)}\rfloor$$
然后你对前面这个$d$暴力枚举，后面的这个$y$也暴力枚举，然后后面这个$x$权值分块就好了。
时间复杂度好像是$O(log(sqrtn)\ast n^{\frac{3}{4}})$

---

#include <cmath>
#include <cstdio>
#include <cstring>

using namespace std;
typedef long long LL;
LL _min(LL x, LL y) {return x < y ? x : y;}
const int N = 50001;
int read() {
	int s = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
	return s * f;
}
void put(LL x) {
	if(x >= 10) put(x / 10);
	putchar(x % 10 + '0');
}

LL ans;
int n, plen, p[N], mu[N];
bool v[N];

void get_p() {
	mu[1] = 1;
	for(int i = 2; i < N; i++) {
		if(!v[i]) p[++plen] = i, mu[i] = -1;
		for(int j = 1; j <= plen && (LL)i * p[j] < N; j++) {
			v[i * p[j]] = 1;
			if(i % p[j] == 0) {mu[i * p[j]] = 0; break;}
			else mu[i * p[j]] = -mu[i];
		}
	}
}

LL query(int x, int m) {
	LL sum = 0;
	LL cc = n / x / x;
	for(int i = 1; i <= m / x; i++) {
		LL g = cc / i;
		for(int l = 1, r; l < i; l = r + 1) {
			if(l + i > g) break;
			r = _min(i - 1, g / (g / (l + i)) - i);
			sum += (LL)g / (l + i) * (r - l + 1);
		}
	} return sum;
}

int main() {
	n = read();
	get_p(); int m = sqrt(n);
	for(int i = 1; i <= m; i++) if(mu[i]){
		ans += query(i, m) * mu[i];
	} put(ans);
	return 0;
}