[HDU6833]A Very Easy Math Problem

题意

求
$$\sum _{a_1=1}^n\sum _{a_2=1}^n\cdots \sum _{a_x=1}^n\left(\prod _{j=1}^x{a}_j^k\right)f(\gcd (a_1,a_2,...,a_x))\cdot \gcd (a_1,a_2,...,a_x)\mathrm{m}\mathrm{o}\mathrm{d}10^9+7$$

若存在$k>1$，且$k^2\mid x$，则$f(x)=0$；否则$f(x)=1$。

$1\le n\le 2\times 10^5,1\le k,x\le 10^9$

---

题解

首先$f(x)=|\mu (x)|$；其次根据乘法分配律，有
$$\begin{array}{rl}g(n)\stackrel{\text{令}}{=}& \sum _{a_1=1}^n\sum _{a_2=1}^n\cdots \sum _{a_x=1}^n\left(\prod _{j=1}^x{a}_j^k\right)\\ =& \sum _{a_1=1}^n{a}_1^k\sum _{a_2=1}^n{a}_2^k\cdots \sum _{a_x=1}^n{a}_x^k\\ =& (\sum _{i=1}^n{i}^k{)}^x\end{array}$$
枚举$\gcd$化简原式
$$\begin{array}{rlr}& \sum _{a_1=1}^n\sum _{a_2=1}^n\cdots \sum _{a_x=1}^n\left(\prod _{j=1}^x{a}_j^k\right)f(\gcd (a_1,a_2,...,a_x))\cdot \gcd (a_1,a_2,...,a_x)& \\ =& \sum _{d=1}^n|\mu (d)|d\sum _{a_1=1}^n\sum _{a_2=1}^n\cdots \sum _{a_x=1}^n\left(\prod _{j=1}^x{a}_j^k\right)[\gcd (a_1,a_2,...,a_x)=d]& \\ =& \sum _{d=1}^n|\mu (d)|d^{kx+1}\sum _{b_1=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{b_2=1}^{\lfloor \frac{n}{d}\rfloor }\cdots \sum _{b_x=1}^{\lfloor \frac{n}{d}\rfloor }\left(\prod _{j=1}^x{b}_j^k\right)[\gcd (b_1,b_2,...,b_x)=1]& b_i=\lfloor \frac{a_i}{d}\rfloor \\ =& \sum _{d=1}^n|\mu (d)|d^{kx+1}\sum _{b_1=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{b_2=1}^{\lfloor \frac{n}{d}\rfloor }\cdots \sum _{b_x=1}^{\lfloor \frac{n}{d}\rfloor }\left(\prod _{j=1}^x{b}_j^k\right)\sum _{p\mid \gcd }\mu (p)& \\ =& \sum _{d=1}^n|\mu (d)|d^{kx+1}\sum _{p=1}^{\lfloor \frac{n}{d}\rfloor }\mu (p)p^{kx}\sum _{c_1=1}^{\lfloor \frac{n}{pd}\rfloor }\sum _{c_2=1}^{\lfloor \frac{n}{pd}\rfloor }\cdots \sum _{c_x=1}^{\lfloor \frac{n}{pd}\rfloor }\left(\prod _{j=1}^x{c}_j^k\right)& c_i=\lfloor \frac{b_i}{p}\rfloor \\ =& \sum _{d=1}^n|\mu (d)|d^{kx+1}\sum _{p=1}^{\lfloor \frac{n}{d}\rfloor }\mu (p)p^{kx}g(\lfloor \frac{n}{pd}\rfloor )& \\ =& \sum _{T=1}^{n}g(\lfloor \frac{n}{T}\rfloor )\sum _{d|T}|\mu (d)|d^{kx+1}\mu (\frac{T}{d})(\frac{T}{d}{)}^{kx}& T=pd\\ =& \sum _{T=1}^{n}g(\lfloor \frac{n}{T}\rfloor )T^{kx}\sum _{d|T}|\mu (d)|\mu (\frac{T}{d})d& \end{array}$$

令$h(T)=T^{kx}\sum _{d|T}|\mu (d)|\mu (\frac{T}{d})d$，用枚举倍数的方法、降幂公式和快速幂就可以在$O(n\log n+n\log P)$的时间内求出所有的$h(T)$。

令$S(n)=\sum _{T=1}^{n}g(\lfloor \frac{n}{T}\rfloor )h(T)$，到这里已经可以利用数论分块在$O(n\log nP+T\sqrt{n})$的时间内解决这道题了，但是还可以优化。

考虑如何快速求出所有的$S(n)$。

注意到对于$ij\le n<(i+1)j$的所有$n$，都含有$g(i)h(j)$这一项，所以可以枚举$i,j$，转化为对$S(n)$进行区间加法，差分后求前缀和即可，时间复杂度$O(\sum _{i=1}^n\sum _{j=1}^{\lfloor \frac{n}{i}\rfloor }1)=O(n\log n)$。

总时间复杂度$O(n\log n+n\log P+T)$

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, P = 1e9 + 7;
typedef long long ll;
int n = 2e5, k, x;
int is[N], pr[N], mu[N], g[N], h[N], S[N];
inline int FastExp(int a, int b) {
    int x = 1;
    for (; b; b >>= 1, a = (ll)a * a % P)
        if (b & 1)
            x = (ll)x * a % P;
    return x;
}
int main() {
    scanf("%*d%d%d", &k, &x);
    mu[1] = 1;
    for (int i = 2; i <= n; ++i) {
        if (!is[i])
            pr[++pr[0]] = i, mu[i] = -1;
        for (int j = 1, x; j <= pr[0] && (x = i * pr[j]) <= n; ++j) {
            is[x] = 1, mu[x] = -mu[i];
            if (!(i % pr[j])) {
                mu[x] = 0;
                break;
            }
        }
    }
    for (int i = 1; i <= n; ++i)
        g[i] = (g[i - 1] + FastExp(i, k)) % P;
    for (int i = 1; i <= n; ++i)
        g[i] = FastExp(g[i], x);
    for (int i = 1; i <= n; ++i)
        for (int j = i; j <= n; j += i)
            mu[i] ? h[j] = (h[j] + mu[j / i] * i + P) % P : 0;
    for (int i = 1; i <= n; ++i)
        h[i] = (ll)h[i] * FastExp(i, (ll)k * x % (P - 1)) % P;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; i * j <= n; ++j) {
            int m = i * j;
            S[m] = (S[m] + (ll)g[i] * h[j] % P) % P;
            if (m + j <= n)
                S[m + j] = (S[m + j] - (ll)g[i] * h[j] % P + P) % P;
        }
    for (int i = 1; i <= n; ++i)
        S[i] = (S[i] + S[i - 1]) % P;
    while (~scanf("%d", &n))
        printf("%d\n", S[n]);
    return 0;
}