2020杭电多校六 A Very Easy Math Problem 莫比乌斯反演

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=6833

题意

$$\sum _{a_1=1}^n\sum _{a_2=1}^n...\sum _{a_x=1}^n(\prod _{j=1}^n{a}_j^k)f(gcd(a_1,a_2...a_x))gcd(a_1,a_2..a_x)$$

化简

令gcd(a1, a2…ax) = d

$$\sum _{a_1=1}^n\sum _{a_2=1}^n...\sum _{a_x=1}^n(\prod _{j=1}^n{a}_j^k)f(d)d$$

枚举d
$$\sum _{d=1}^{n}f(d)\sum _{a_1=1}^n\sum _{a_2=1}^n...\sum _{a_x=1}^n(\prod _{j=1}^n{a}_j^k)[gcd(a_1,a_2...a_x)=d]$$
将gcd化为1
$$\sum _{d=1}^{n}f(d)d^{kx+1}\sum _{a_1=1}^{n/d}\sum _{a_2=1}^{n/d}...\sum _{a_x=1}^{n/d}(\prod _{j=1}^n{a}_j^k)[gcd(a_1,a_2...a_x)=1]$$
对gcd反演
$$\sum _{d=1}^{n}f(d)d^{kx+1}\sum _{a_1=1}^{n/d}\sum _{a_2=1}^{n/d}...\sum _{a_x=1}^{n/d}(\prod _{j=1}^n{a}_j^k)\sum _{t|a_1,t|a_2..}\mu (t)$$
枚举t
$$\sum _{d=1}^{n}f(d)d^{kx+1}\sum _{t=1}^{n/d}\mu (t)t^{kx}\sum _{a_1=1}^{n/td}\sum _{a_2=1}^{n/td}...\sum _{a_x=1}^{n/td}(\prod _{j=1}^n{a}_j^k)$$

$$=\sum _{d=1}^{n}f(d)d^{kx+1}\sum _{t=1}^{n/d}\mu (t)t^{kx}(\sum _{j=1}^{n/td}{j}^k{)}^x$$
令T = td，并枚举T

$$\sum _{T=1}^n{T}^{kx}(\sum _{j=1}^{n/T}{j}^k{)}^x\sum _{d|T}f(d)d\mu (T/d)$$
我们令$$h(T)=\sum _{d|T}f(d)d\mu (T/d)$$
得到
$$\sum _{T=1}^n{T}^{kx}h(T)(\sum _{j=1}^{n/T}{j}^k{)}^x$$
然后我们预处理出$$\sum _{T=1}^n{T}^{kx}h(T)的前缀和和\sum _{j=1}^{n/T}{j}^k的值$$
最终可以用一个整除分块解决

Code

#include <bits/stdc++.h>
using namespace std;
//#define ACM_LOCAL
#define re register
#define fi first
#define se second
const int N = 2e5 + 10;
const int M = 1e6 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-4;
const int MOD = 1e9 + 7;
typedef long long ll;
typedef pair<int, int> PII;
ll prime[N], mu[N], k;
ll phi[N], f[N], h[N], sum1[N], sum2[N];
bool is_prime[N];
ll t, K, x;
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 % MOD;
}
inline void init(int n) {
    memset(is_prime, true, sizeof is_prime);
    mu[1] = 1; phi[1] = 1; f[1] = 1;
    for (re int i = 2; i < n; ++i) {
        f[i] = 1;
        if (is_prime[i]) prime[++k] = i, mu[i] = -1, phi[i] = i - 1;
        for (re 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 (ll kk = 2; kk * kk < n; kk++) {
        for (ll j = kk * kk; j < n; j += kk * kk) {
            f[j] = 0;
        }
    }
    for (ll d = 1; d < n; d++) {
        for (ll T = d; T < n; T += d) {
            h[T] = (h[T] + f[d] * d % MOD * mu[T/d] % MOD + MOD) % MOD;
        }
    }
    for (ll T = 1; T < n; T++) {
        ll tmp1 = ksm(T, K);
        sum1[T] = (sum1[T-1] + tmp1) % MOD;
        sum2[T] = (sum2[T-1] + ksm(tmp1, x) * h[T] % MOD) % MOD;
    }
}

ll calc(ll n) {
    ll ans = 0;
    for (ll l = 1, r; l <= n; l = r + 1) {
        r = min(n, n / (n / l));
        ans = (ans + (sum2[r] - sum2[l-1] + MOD) % MOD * ksm(sum1[n / l], x) % MOD) % MOD;
    }
    return ans;
}
void solve() {
    cin >> t >> K >> x;
    init(N);
    while (t--) {
        ll n; cin >> n;
        printf("%lld\n", calc(n));
    }
}

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