BZOJ 3601 一个人的数论 （莫比乌斯反演+伯努利数）

题目大意：

(来源)

解题思路：

${\sum }_{i=1}^n[gcd(i,n)==1]\ast i^d$

$={\sum }_{i=1}^n\epsilon (gcd(i,n))\ast i^d$

$={\sum }_{i=1}^n{i}^d{\sum }_{g|i,g|n}\mu (g)$

$={\sum }_{g|n}\mu (g){\sum }_{i=1}^{\frac{n}{k}}(ki{)}^d$

$={\sum }_{g|n}\mu (g)g^d{\sum }_{i=1}^{\frac{n}{k}}{i}^d$
由伯努利数
${\sum }_{i=1}^{\frac{n}{k}}{i}^d={\sum }_{i=1}^{d+1}{a}_i\ast (\frac{n}{p}{)}^i$

$a_i=\frac{1}{d+1}\ast B_{d+1-i}\ast C_{d+1}^{d+1-i}$

原式=${\sum }_{i=1}^{d+1}{a}_i{\sum }_{g|n}\mu (g)g^d\ast (\frac{n}{g}{)}^i$

又因为${\sum }_{g|n}\mu (g)g^d\ast (\frac{n}{g}{)}^i$为积性函数，所以把每个质因子先计算再相乘即可

又对于$n=p^c$时，${\sum }_{g|n}\mu (g)g^d\ast (\frac{n}{g}{)}^i=p^{ci}-p^{ci+d-i}$（当且仅当$\mu (1)$与$\mu (p)$有作用）

AC代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 2e3 + 10;
const ll mod = 1e9 + 7;
ll c[maxn][maxn];
ll b[maxn], inv[maxn];
void init() {
    for (ll i = 0; i < maxn; i++) {
        c[i][0] = c[i][i] = 1;
        for (ll k = 1; k < i; k++)
            c[i][k] = (c[i - 1][k] + c[i - 1][k - 1]) % mod;
    }
    inv[1] = 1;
    for (ll i = 2; i < maxn; i++)
        inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    b[0] = 1;
    for (ll i = 1; i < maxn; i++) {
        ll ans = 0;
        if (i == maxn - 1) break;
        for (ll k = 0; k < i; k++)
            ans = (ans + c[i + 1][k] * b[k]) % mod;
        ans = (ans * (-inv[i + 1]) % mod + mod) % mod;
        b[i] = ans;
    }
}
ll d, w;
ll a[maxn], p[maxn], alp[maxn];
void cal_a() {
    for (ll i = 1; i <= d + 1; i++)
        a[i] = inv[d + 1] * c[d + 1][d + 1 - i] % mod * b[d + 1 - i] % mod;
}
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;
}
int main() {
    init();
    cin >> d >> w;
    cal_a();
    for (ll i = 1; i <= w; i++)
        cin >> p[i] >> alp[i];
    ll ans = 0;
    for (ll i = 1; i <= d + 1; i++) {
        ll res = a[i] % mod;
        for (ll j = 1; j <= w; j++) {
            ll tmp = ((qpow(p[j], alp[j] * i) - qpow(p[j], d + (alp[j] - 1) * i)) % mod + mod) % mod;
            res = res * tmp % mod; 
        }
        ans = (ans + res) % mod;
    }
    cout << ans << endl;
}

参考博客