P3172 [CQOI2015]选数 莫比乌斯反演+杜教筛

原题链接：https://www.luogu.com.cn/problem/P3172

题意

$$\sum _{a_1=L}^R\sum _{a_2=L}^R..\sum _{a_n=L}^R[gcd(a1,a2..an)=K]$$

化简

$$=\sum _{a_1=L/K}^{R/K}\sum _{a_2=L/K}^{R/K}..\sum _{a_n=L/K}^{R/K}[gcd(a1,a2..an)=1]$$

$$=\sum _{a_1=L/K}^{R/K}\sum _{a_2=L/K}^{R/K}..\sum _{a_n=L/K}^{R/K}\sum _{t|a1,t|a2...}\mu (t)$$

$$=\sum _{t=1}^{R/K}\mu (t)\sum _{a_1=L/tK}^{R/tK}\sum _{a_2=L/tK}^{R/tK}..\sum _{a_n=L/tK}^{R/tK}1$$

$$=\sum _{t=1}^{R/K}\mu (t)(\frac{R}{tK}-\frac{L-1}{tK}{)}^n$$

$\mu (t)$用度教筛求一下前缀和，别的用一个整除分块就可以了

Code

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> PII;
const int N = 5e6 + 100, M = 5e5 + 5, INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
ll prime[N], mu[N];
ll phi[N];
bool is_prime[N];
inline void init(int n) {
    ll k = 0;
    memset(is_prime, true, sizeof is_prime);
    mu[1] = 1; phi[1] = 1;
    for (int i = 2; i < n; ++i) {
        if (is_prime[i]) prime[++k] = i, mu[i] = -1, phi[i] = i-1;
        for (int j = 1; j <= k && i * prime[j] < n; ++j) {
            is_prime[i * prime[j]] = false;
            if (i % prime[j] == 0) {
                phi[i * prime[j]] = phi[i] * prime[j];
                break;
            } else {
                mu[i * prime[j]] = -mu[i];
                phi[i * prime[j]] = phi[i] * (prime[j] - 1);
            }
        }
    }
    for (int i = 1; i < n; ++i) mu[i] = (mu[i] + mu[i-1]) % MOD;
}
unordered_map<ll, ll> sum_mu;
inline ll GetSum_mu(ll n) {
    if (n <= 5e6) return mu[n];
    if (sum_mu[n]) return sum_mu[n];
    ll ans = 1;
    for (ll l = 2, r; l <= n; l = r + 1) {
        r = min(n, n / (n / l));
        ans = (ans - (r - l + 1) * GetSum_mu(n / l) % MOD + MOD) % MOD;
    }
    return sum_mu[n] = ans % MOD;
}
ll ksm(ll a, ll b) {
    ll res = 1, base = a;
    while (b) {
        if (b & 1) res = res * base % MOD;
        base = base * base % MOD;
        b >>= 1;
    }
    return res;
}
ll n, L, H, K;

void solve() {
    cin >> n >> K >> L >> H;
    init(N);
    L = (L - 1) / K;
    H = H / K;
    ll ans = 0;
    for (ll l = 1, r; l <= H; l = r + 1) {
        if (L / l) r = min(L / (L / l), H / (H / l));
        else r = H / (H / l);
        ans = (ans + (GetSum_mu(r) - GetSum_mu(l-1) + MOD) % MOD * ksm(H / l - L / l, n) % MOD) % MOD;
    }
    cout << ans << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
}