P2522 Problem b 莫比乌斯反演+数论分块+二维前缀和

做法同P3455的解法

#include <bits/stdc++.h>
#define rll register ll
#define ll long long
using namespace std;

const int N = 5e4+100;

int p[N], prime[N], mu[N], cnt;

void primes(int n){
	mu[1] = 1;
	for(int i = 2; i <= n; i++){
		if(!p[i]) p[i] = prime[++cnt] = i, mu[i] = -1;
		for(int j = 1; j <= cnt; j++){
			if(prime[j] > n/i) break;
			p[i*prime[j]] = prime[j];
			mu[i*prime[j]] = -mu[i];
			if(i%prime[j] == 0){
				mu[i*prime[j]] = 0;
				break;
			}
		}
	}
	for(int i = 2; i <= n; i++) mu[i] += mu[i-1];
}

ll solve(ll k, ll a, ll b){
	ll ans = 0;
	for(ll l = 1, r; l <= k; l = r+1){
		if(a/l==0 || b/l==0) break;
		ll r1 = min(k, a/(a/l));
		ll r2 = min(k, b/(b/l));
		r = min(r1, r2);
		ans += (mu[r]-mu[l-1])*(a/l)*(b/l);
	}
	return ans;
}
int a, b, c, d, k, m;
int main(){
	int t;
	primes(5e4);
	scanf("%d", &t);
	while(t--){
		scanf("%d%d%d%d%d",&a, &b, &c, &d, &k);
		printf("%lld\n", solve(min(b/k,d/k), b/k, d/k)+solve(min((a-1)/k,(c-1/k)), (a-1)/k, (c-1)/k)-solve(min((a-1)/k, d/k),(a-1)/k, d/k)-solve(min((c-1)/k, b/k),(c-1)/k, b/k));
	}
	return 0;
}