[斯特林数] Codeforces 932E. Team Work

最新推荐文章于 2021-11-12 14:07:12 发布

Vectorxj

最新推荐文章于 2021-11-12 14:07:12 发布

阅读量435

点赞数

分类专栏：斯特林数

本文链接：https://blog.csdn.net/Vectorxj/article/details/79453004

版权

斯特林数专栏收录该内容

4 篇文章 0 订阅

订阅专栏

$Solution$

可能也算是裸题了咯。
求

\sum i = 1 n (n i) i k

$\sum_{i=1}^n{n\choose i}i^k$ 用斯特林数把

ik i k $i^k$ 展开。

\sum d = 0 k d! S (k, d) (n d) 2 n - d

$\sum_{d=0}^kd!S(k,d){n\choose d}2^{n-d}$

O(k2) O ( k 2 ) $\mathcal{O}(k^2)$ 直接做了啦~

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 5050;
const int MOD = 1000000007;

int n, k;
int S[N][N];
int fac[N], ifac[N], inv[N];

inline int pwr(int a, int b) {
    int c = 1;
    while (b) {
        if (b & 1) c = (ll)c * a % MOD;
        b >>= 1; a = (ll)a * a % MOD;
    }
    return c;
}
inline void pre(int n) {
    inv[1] = 1;
    for (int i = 2; i <= n; i++)
        inv[i] = (ll)(MOD - MOD / i) * inv[MOD % i] % MOD;
    fac[0] = ifac[0] = 1;
    for (int i = 1; i <= n; i++) {
        fac[i] = (ll)fac[i - 1] * i % MOD;
        ifac[i] = (ll)ifac[i - 1] * inv[i] % MOD;
    }
}
inline int C(int n, int m) {
    int res = 1;
    for (int i = 0; i < m; i++) {
        res = (ll)res * (n - i) % MOD;
        res = (ll)res * inv[i + 1] % MOD;
    }
    return res;
}

int main(void) {
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    cin >> n >> k;
    pre(k);
    S[0][0] = 1;
    for (int i = 1; i <= k; i++) {
        S[i][0] = 0;
        for (int j = 1; j <= i; j++)
            S[i][j] = ((ll)j * S[i - 1][j] + S[i - 1][j - 1]) % MOD;
    }
    int ans = 0;
    for (int d = 0; d <= k && d <= n; d++) {
        ans = (ans + (ll)fac[d] * S[k][d] % MOD * C(n, d) % MOD * pwr(2, n - d) % MOD) % MOD;
        // cerr << d << endl;
    }
    cout << ans << endl;
    return 0;
}