2020杭电多校第六场 A Very Easy Math Problem 莫比乌斯反演 (HDU 6833)

最新推荐文章于 2020-11-19 18:05:23 发布

linbinwu123

最新推荐文章于 2020-11-19 18:05:23 发布

阅读量1.3k

点赞数 1

分类专栏： # 莫比乌斯反演

本文链接：https://blog.csdn.net/weixin_44282912/article/details/107844614

版权

莫比乌斯反演专栏收录该内容

3 篇文章 0 订阅

订阅专栏

A Very Easy Math Problem

题解

$\begin{aligned} & \displaystyle\sum_{a_1=1}^{n} \displaystyle\sum_{a_2=1}^{n}···\displaystyle\sum_{a_x=1}^{n} \left(\prod_{j = 1} ^ {x} a_j ^ k \right) f \left( gcd(a_1, a_2, ...,a_n) \right) gcd(a_1, a_2, ...,a_n) \\ & =\displaystyle\sum_{d = 1} ^ {n} d f(d) \displaystyle\sum_{a_1=1}^{n} \displaystyle\sum_{a_2=1}^{n}···\displaystyle\sum_{a_x=1}^{n} \left(\prod_{j = 1} ^ {x} a_j ^ k \right) \left[gcd(a_1, a_2, ...,a_n) = d \right] \\ & = \displaystyle\sum_{d = 1} ^ {n} d ^ {kx+1} f(d) \displaystyle\sum_{a_1=1}^{\lfloor n/d \rfloor} \displaystyle\sum_{a_2=1}^{\lfloor n/d \rfloor}···\displaystyle\sum_{a_x=1}^{\lfloor n/d \rfloor} \left(\prod_{j = 1} ^ {x} a_j ^ k \right) \displaystyle\sum_{t|a_1,t|a_2,...,t|a_n} \mu(t) \\ & = \displaystyle\sum_{d = 1} ^ {n} d ^ {kx+1} f(d) \displaystyle\sum_{a_1=1}^{\lfloor n/d \rfloor} a_1^k \displaystyle\sum_{a_2=1}^{\lfloor n/d \rfloor} a_2^k ···\displaystyle\sum_{a_x=1}^{\lfloor n/d \rfloor} a_x^k \displaystyle\sum_{t|a_1,t|a_2,...,t|a_n} \mu(t) \\ & = \displaystyle\sum_{d = 1} ^ {n} d ^ {kx+1} f(d) \left( \displaystyle\sum_{i=1}^{\lfloor n/d \rfloor} i^k \right) ^ x \displaystyle\sum_{t|a_1,t|a_2,...,t|a_n} \mu(t) \\ & = \displaystyle\sum_{d = 1} ^ {n} d ^ {kx+1} f(d) \displaystyle\sum_{t = 1} ^ {\lfloor n/d \rfloor} \mu(t) \left( \displaystyle\sum_{i=1}^{\lfloor n/dt \rfloor} (it)^k \right) ^ x \\ & = \displaystyle\sum_{d = 1} ^ {n} d ^ {kx+1} f(d) \displaystyle\sum_{t = 1} ^ {\lfloor n/d \rfloor} \mu(t)t^{kx} \left( \displaystyle\sum_{i=1}^{\lfloor n/dt \rfloor} i^k \right) ^ x \\ T = dt \to & = \displaystyle\sum_{T = 1} ^ {n} \left( \displaystyle\sum_{i=1}^{\lfloor n/T \rfloor} i^k \right) ^ x T ^ {kx}\displaystyle\sum_{d|T} f(d) \mu(\frac{T}{d})d \\ 令g(T) = \displaystyle\sum_{d|T} f(d) \mu(\frac{T}{d})d \to & = \displaystyle\sum_{T = 1} ^ {n} \left( \displaystyle\sum_{i=1}^{\lfloor n/T \rfloor} i^k \right) ^ x T ^ {kx}g(T) \end{aligned}$
这里 $f$ 函数可以 $O (n l o g n)$ 筛，筛完后 $O (n l o g n)$ 筛 $g$ 函数，再对 $g$ 函数做一个前缀和
$\displaystyle\sum_{i=1}^{\lfloor n/T \rfloor} i^k$ 可以预处理前缀和
最后计算的时候分块计算，总体复杂度 $O(nlogn+T\sqrt n)$ ，T为询问次数

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
const ll mod = 1e9 + 7;

ll qpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}


ll T, k, x, n;
int vis[N], prime[N], num, mu[N];
ll g[N], f[N], sumG[N], sum[N];
void init(int siz) {
    f[1] = mu[1] = 1, num = 0;
    for (int i = 2; i <= siz; i++) {
        f[i] = 1;
        if (!vis[i]) prime[++num] = i, mu[i] = -1;
        for (int j = 1; j <= num && i * prime[j] <= siz; j++) {
            vis[i * prime[j]] = 1;
            if (i % prime[j] == 0) {
                mu[i * prime[j]] = 0;
                break;
            }
            else mu[i * prime[j]] = mu[i] * mu[prime[j]];
        }
    }
    for (int d = 2; d * d <= siz; d++) for (int i = d * d; i <= siz; i += d * d) f[i] = 0;//f函数
    for (int d = 1; d <= siz; d++)
        for (int i = d; i <= siz; i += d)
            g[i] = (g[i] + 1ll * d * f[d] % mod * mu[i / d] % mod + mod) % mod;//g函数
    for (int i = 1; i <= siz; i++) {
        ll t = qpow(i, k);
        sum[i] = (sum[i - 1] + t) % mod;//i^k前缀和
        sumG[i] = (sumG[i - 1] + qpow(t, x) * g[i] % mod) % mod;//g函数前缀和
    }
}


int main() {

    scanf("%lld%lld%lld", &T, &k, &x);
    init(2e5);
    while (T--) {
        scanf("%lld", &n);
        ll ans = 0;
        for (int l = 1, r; l <= n; l = r + 1) {
            r = n / (n / l);
            ans = (ans + 1ll * (sumG[r] - sumG[l - 1] + mod) % mod * qpow(sum[n / l], x) % mod) % mod;
        }
        printf("%lld\n", (ans + mod) % mod);
    }



    return 0;
}