P2257 YY的GCD 线性筛+莫比乌斯反演+数论分块

求的是$$\sum _{i=1}^n\sum _{j=1}^m[(i,j)\in prime]$$
$$=\sum _{p\in prime}\sum _{i=1}^n\sum _{j=1}^m[(i,j)=p]$$
$$=\sum _{p\in prime}\sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{p}\rfloor }[(i,j)=1]$$
$$=\sum _{p\in prime}\sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{p}\rfloor }\sum _{d|(i,j)}\mu (d)$$
$$=\sum _{p\in prime}\sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{p}\rfloor }\sum _{d=1}^{min(\lfloor \frac{n}{p}\rfloor ,\lfloor \frac{m}{p}\rfloor )}[d|i][d|j]\mu (d)$$
$$=\sum _{p\in prime}\sum _{d=1}^{min(\lfloor \frac{n}{p}\rfloor ,\lfloor \frac{m}{p}\rfloor )}\mu (d)\sum _{i=1}^{\lfloor \frac{n}{p}\rfloor }[d|i]\sum _{j=1}^{\lfloor \frac{m}{p}\rfloor }[d|j]$$$$=\sum _{p\in prime}\sum _{d=1}^{min(\lfloor \frac{n}{p}\rfloor ,\lfloor \frac{m}{p}\rfloor )}\mu (d)\lfloor \frac{n}{dp}\rfloor \lfloor \frac{m}{dp}\rfloor$$
一般到这里就可以，因为没有套外面的枚举素数，所以本题要继续推555
令$T=dp$，$n<m$
$$=\sum _{p\in prime}\sum _{T=1,p|T}^n\mu (\frac{T}{p})\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor$$
换一下枚举方式，
$$=\sum _{T=1}^n\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor \sum _{p\in prime,p|T}\mu (\frac{T}{p})$$
设$f(T)={\sum }_{p\in prime,p|T}\mu (\frac{T}{p})$，
$$=\sum _{T=1}^{n}f(T)\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor$$
$f$是可以用线性筛求的，

接下来求一下$f$的前缀和，数论分块求即可。

#include <cstdio>
#define min(a,b) ((a<b)?(a):(b))
#define ll long long
using namespace std;

const int N = 1e7+10, lnN = 15;
int p[N], prime[N/lnN], f[N];
int mu[N], cnt;
void primes(ll n){
	mu[1] = p[1] = 1;
	for(register int i = 2; i <= n; i++){
		if(!p[i]) p[i] = prime[++cnt] = (ll)i, f[i] = 1, mu[i] = -1;
		for(register int j = 1; j <= cnt && prime[j] <= n/i; j++){
			ll x = 1ll*i*prime[j];
			p[x] = prime[j];
			if(i%prime[j] == 0){
				f[x] = mu[i];mu[x] = 0;
				break;
			}
			mu[x] = -mu[i];f[x] = mu[i]-f[i];
		}
	}
	for(register int i = 2; i <= n; i++) f[i] += f[i-1];
}
ll solve(int k, int a, int b){
	ll ans = 0;
	for(register ll l = 1, r; l <= k && a/l && b/l; l = r+1){
		ll r1 = min(k, a/(a/l));
		ll r2 = min(k, b/(b/l));
		r = min(r1, r2);
		ans += 1ll*(f[r]-f[l-1])*(a/l)*(b/l);
	}
	return ans;
}
int main(){
	int t;
	primes(1e7);
	scanf("%d", &t);
	while(t--){
		int n, m;
		scanf("%d%d", &n, &m);
		if(n>m) n^=m^=n^=m;
		printf("%lld\n", solve(n, n, m));
	}
	return 0;
}