题目
分析
转换成求四块的答案,然后和 YY的GCD 一样。
代码
#include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 50000;
int Mu[MAXN + 5];
bool Vis[MAXN + 5];
std::vector<int> Primes;
void Init(int n) {
Mu[1] = 1;
for (int i = 2; i <= n; i++) {
if (!Vis[i])
Mu[i] = -1, Primes.push_back(i);
for (int j = 0; j < (int)Primes.size() && i * Primes[j] < n; j++) {
Vis[i * Primes[j]] = true;
if (i % Primes[j] == 0) {
Mu[i * Primes[j]] = 0;
break;
}
Mu[i * Primes[j]] = -Mu[i];
}
}
for (int i = 1; i <= n; i++)
Mu[i] += Mu[i - 1];
}
LL Cal(int N, int M) {
if (N < M) std::swap(N, M); LL Ans = 0;
for (register int lft = 1, rgt = 1; lft <= M; lft = rgt + 1) {
rgt = std::min(M / (M / lft), N / (N / lft));
Ans += (LL)(N / lft) * (M / lft) * (Mu[rgt] - Mu[lft - 1]);
}
return Ans;
}
int main() {
Init(MAXN);
int T; scanf("%d", &T);
while (T--) {
int A, B, C, D, K; scanf("%d%d%d%d%d", &A, &B, &C, &D, &K);
printf("%lld\n", Cal(B / K, D / K) - Cal((A - 1) / K, D / K) - Cal(B / K, (C - 1) / K) + Cal((A - 1) / K, (C - 1) / K));
}
return 0;
}