「TJOI / HEOI2016」求和-NTT+第二类斯特林数

最新推荐文章于 2021-09-07 18:27:43 发布

DSL_HN_2002

最新推荐文章于 2021-09-07 18:27:43 发布

阅读量337

点赞数

分类专栏：文章类型——题解多项式——FFT/NTT 组合数学——斯特林数

本文链接：https://blog.csdn.net/DSL_HN_2002/article/details/80916766

版权

文章类型——题解同时被 3 个专栏收录

57 篇文章 0 订阅

订阅专栏

多项式——FFT/NTT

11 篇文章 0 订阅

订阅专栏

组合数学——斯特林数

2 篇文章 0 订阅

订阅专栏

Description

给定 $n$ ,求

f (n) = \sum_{i = 0}^{n} \sum_{j = 0}^{i} S (i, j) \times 2^{j} \times j!

$f(n)=\sum_{i=0}^n\sum_{j=0}^iS(i,j)\times 2^j \times j!$

Solution

推式子

f (n) = \sum i = 0 n \sum j = 0 i S (i, j) \times 2 j \times j!

$f(n)=\sum_{i=0}^n\sum_{j=0}^iS(i,j)\times 2^j \times j!$

f (n) = \sum j = 0 n 2 j \times j! \sum i = 0 n S (i, j)

$f(n)=\sum_{j=0}^n 2^j \times j!\sum_{i=0}^nS(i,j)$

f (n) = \sum j = 0 n 2 j \times j! \sum i = 0 n \sum k = 0 n ( - 1 ) k ( j - k ) i k ! ( j - k ) !

$f(n)=\sum_{j=0}^n 2^j \times j!\sum_{i=0}^n\sum_{k=0}^n\frac{(-1)^k(j-k)^i}{k!(j-k)!}$

f (n) = \sum j = 0 n 2 j \times j! \sum k = 0 n ( - 1 ) k \sum n i = 0 ( j - k ) i k ! ( j - k ) !

$f(n)=\sum_{j=0}^n 2^j \times j!\sum_{k=0}^n\frac{(-1)^k\sum_{i=0}^n(j-k)^i}{k!(j-k)!}$

其中 $\sum_{i=0}^n(j-k)^i$ 是等比数列，用公式求，其他的 $NTT$ 即可。

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

typedef long long lint;
const int mod = 998244353;
const int G = 3, Phi = mod - 1;
const int maxn = 300005;

int n, fac[maxn], rat[maxn], ifac[maxn], ans;
int A[maxn], B[maxn], R[maxn], m, L;

int Pow(int x, int k)
{
    int res = 1;
    while (k) {
        if (k & 1) res = (lint)res * x % mod;
        x = (lint)x * x % mod; k >>= 1;
    }
    return res;
}

void NTT(int *a, int f)
{
    for (int i = 0; i < n; ++i)
        if (i < R[i]) swap(a[i], a[R[i]]);
    for (int i = 1; i < n; i <<= 1) {
        int wn = Pow(G, Phi / (i << 1)), t;
        if (f == -1) wn = Pow(wn, mod - 2);
        for (int j = 0; j < n; j += (i << 1)) {
            int w = 1;
            for (int k = 0; k < i; ++k, w = (lint)w * wn % mod) {
                t = (lint)a[j + i + k] * w % mod;
                a[j + i + k] = a[j + k] - t;
                if (a[j + i + k] < 0) a[j + i + k] += mod;
                a[j + k] = a[j + k] + t;
                if (a[j + k] >= mod) a[j + k] -= mod;
            }
        }
    }
}

void NTT()
{
    m = n << 1;
    for (n = 1; n <= m; n <<= 1) ++L;
    for (int i = 0; i < n; ++i) R[i] = (R[i >> 1] >> 1) | ((i & 1) << (L - 1));
    NTT(A, 1); NTT(B, 1);
    for (int i = 0; i < n; ++i) A[i] = (lint)A[i] * B[i] % mod;
    NTT(A, -1);
    for (int Inv = Pow(n, mod - 2), i = 0; i < n; ++i) A[i] = (lint)A[i] * Inv % mod;
    n = m >> 1;
}

int main()
{
    scanf("%d", &n);

    fac[0] = 1; rat[0] = 1;
    for (int i = 1; i <= n; ++i) {
        fac[i] = (lint)fac[i - 1] * i % mod;
        rat[i] = (lint)(Pow(i, n + 1) - 1) * Pow(i - 1, mod - 2) % mod;
        if (rat[i] < 0) rat[i] += mod;
    }
    rat[1] = n + 1;

    ifac[n] = Pow(fac[n], mod - 2);
    for (int i = n - 1; i >= 0; --i)
        ifac[i] = (lint)ifac[i + 1] * (i + 1) % mod;

    for (int i = 0; i <= n; ++i) {
        A[i] = ifac[i];
        if (i & 1) A[i] = mod - A[i];
        B[i] = (lint)rat[i] * ifac[i] % mod;
    }

    NTT();

    for (int i = 0, sum = 1; i <= n; ++i) {
        ans += (lint)sum * fac[i] % mod * A[i] % mod;
        if (ans >= mod) ans -= mod;
        sum = (lint)sum * 2 % mod;
    }

    printf("%d\n", ans);

    return 0;
}