bzoj3601: 一个人的数论 莫比乌斯反演 高斯消元

bzoj3601: 一个人的数论

题目

分析

数论神仙题，话不多说开始推导
$$ans=\sum _x^n[gcd(x,n)==1]x^d$$
$$=\sum _x^n\sum _{c|n,c|x}\mu (c)x^d$$
$$=\sum _{c|n}^n\mu (c)\sum _x^{\frac{n}{c}}(cx{)}^d$$
$$=\sum _{c|n}^n\mu (c)c^d\sum _x^{\frac{n}{c}}{x}^d$$

结论：等幂和

${\sum }_i^n{i}^d={\sum }_i^d{a}_i{n}^i$

也就是$d$次等幂和是关于$n$的$d+1$次多项式，可以采用高斯消元搞出这个玩意儿。（推导？插值啊！！）
$$ans=\sum _{c|n}^n\mu (c)c^d\sum _i^{d+1}{a}_i(\frac{n}{c}{)}^i$$
$$=\sum _i^{d+1}{a}_i\sum _{c|n}^n\mu (c)c^d(\frac{n}{c}{)}^i$$
令$g_i(n)={\sum }_{c|n}^n\mu (c)c^d(\frac{n}{c}{)}^i$
显然这玩意儿是个积性函数，因为他本身是两个积性函数的狄利克雷卷积。
所以我们只需要研究$g_i(p^q)$，然后乘起来。
$g_i(p^q)={\sum }_{j=0}^q\mu (p^j)p^{jd}(\frac{p^q}{p^j}{)}^i$
当且仅当$j=0,1$时$\mu (p^j)̸=0$
所以有
$g_i(p^q)=p^{qi}-c^{qi+d-i}$
呼呼，解决了！！

代码

#include<cstdio>
#include<algorithm>
const int P = 1e9 + 7, N = 1e3 + 10;
int ri() {
    char c = getchar(); int x = 0; for(;c < '0' || c > '9'; c = getchar()) ;
    for(;c >= '0' && c <= '9';  c = getchar()) x = (x << 1) + (x << 3) - '0' + c; return x;
}
int a[N][N], p[N], q[N], d, w;
int Pow(int x, int k) {
    k < 0 ? k += P - 1 : 0; int r = 1;
    for(;k; x = 1LL * x * x % P, k >>= 1) if(k & 1) r = 1LL * r * x % P;
    return r;
}
void Gas() {
    for(int i = 0;i <= d + 1; ++i) {
        a[i][0] = 1;
        for(int j = 1;j <= d + 1; ++j) a[i][j] = 1LL * a[i][j - 1] * (i + 1) % P;
        if(i) a[i][d + 2] = a[i - 1][d + 2];
        a[i][d + 2] = (a[i][d + 2] + a[i][d]) % P;
    }
    for(int i = 0, j; i <= d + 1; ++i) {
        for(j = i; j <= d + 1; ++j) if(a[j][i]) break;
        if(i != j) std::swap(a[i], a[j]);
        for(j = i + 1; j <= d + 1; ++j) {
            int t = 1LL * a[j][i] * Pow(a[i][i], P - 2) % P;
            for(int k = i; k <= d + 2; ++k)
                a[j][k] = (a[j][k] + P - 1LL * a[i][k] * t % P) % P;
        }
    }
    for(int i = d + 1; ~i; --i) {
        for(int j = i + 1; j <= d + 1; ++j)
            a[i][d + 2] = (a[i][d + 2] + P - 1LL * a[i][j] * a[j][d + 2] % P) % P;
        a[i][d + 2] = 1LL * a[i][d + 2] * Pow(a[i][i], P - 2) % P;
    }
}
int main() {
    d = ri(); w = ri(); Gas(); int ans = 0;
    for(int i = 1;i <= w; ++i) p[i] = ri(), q[i] = ri();
    for(int i = 0, r = 1; i <= d + 1; ans = (ans + 1LL * a[i++][d + 2] * r) % P, r = 1)
        for(int j = 1;j <= w; ++j)
            r = 1LL * r * Pow(p[j], 1LL * q[j] * i % (P - 1)) % P * (1 + P - Pow(p[j], d - i)) % P;
    printf("%d\n", ans);
    return 0;
}