【BZOJ4555】【TJOI2016&HEOI2016】求和（第二类斯特林数，NTT）

Description

给定$n$（$n\le 100000$），求：

$$f(n)=\sum_{i=0}^{n}\sum_{j=0}^i\begin{Bmatrix}i\\j\end{Bmatrix}2^j j!$$

Solution

现在看到这种模数已经不能直接判断要不要用NTT了，好多题目不要用NTT，偏偏要模$998244353$，人与人之间最基本的信任呢？？

直接颓柿子：

$$f(n) \\=\sum_{i=0}^{n}\sum_{j=0}^i\begin{Bmatrix}i\\j\end{Bmatrix}j! 2^j \\=\sum_{i=0}^{n}\sum_{j=0}^{n}\sum_{k=0}^{j}(-1)^k \binom{j}{k}(j-k)^i 2^j \\=\sum_{j=0}^{n}2^j\sum_{k=0}^{j}(-1)^k \binom{j}{k}\sum_{i=0}^{n}(j-k)^i \\=\sum_{j=0}^{n}2^j\sum_{k=0}^{j}(-1)^k \frac{j!}{k!(j-k)!}\sum_{i=0}^{n}(j-k)^i \\=\sum_{j=0}^{n}2^j j!\sum_{k=0}^{j} \frac{(-1)^k}{k!}\sum_{i=0}^{n}\frac{(j-k)^i}{(j-k)!}$$
然后发现其中 $\sum_{k=0}^{j} \frac{(-1)^k}{k!}\sum_{i=0}^{n}\frac{(j-k)^i}{(j-k)!}$其实就是个卷积！
直接NTT计算即可。

注意当$i=0$或$1$时的$\frac{(j-k)^i}{(j-k)!}$的值！！！

Source

/************************************************
 * Au: Hany01
 * Date: Mar 23rd, 2018
 * Prob: [BZOJ4555][TJOI2016&HEOI2016] 求和
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (998244353)
#define g (3)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline LL Pow(LL a, LL b) {
    LL Ans = 1;
    for ( ; b; b >>= 1, (a *= a) %= Mod) if (b & 1) (Ans *= a) %= Mod;
    return Ans;
}

const int maxn = 1 << 20;

int n, N, rev[maxn], cnt;
LL a[maxn], b[maxn], fac[maxn], ifac[maxn], powg[maxn], invg[maxn], Ans;

inline void NTT(LL* a, int type)
{
    rep(i, N) if (i < rev[i]) swap(a[i], a[rev[i]]);

    for (int i = 2; i <= N; i <<= 1)
    {
        LL wn = type == 1 ? powg[i] : invg[i];
        for (int j = 0; j < N; j += i) {
            LL w = 1;
            rep(k, i >> 1) {
                LL u = a[j + k], v = a[j + k + (i >> 1)] * w % Mod;
                a[j + k] = (u + v) % Mod, a[j + k + (i >> 1)] = (u - v) % Mod;
                (w *= wn) %= Mod;
            }
        }
    }
}

int main()
{
#ifdef hany01
    File("bzoj4555");
#endif

    n = read();

    fac[0] = 1;
    For(i, 1, n) fac[i] = fac[i - 1] * (LL)i % Mod;
    ifac[n] = Pow(fac[n], Mod - 2);
    Fordown(i, n, 1) ifac[i - 1] = ifac[i] * i % Mod;

    For(i, 0, n)
        a[i] = (((i & 1) ? -1 : 1) * ifac[i] + Mod) % Mod,
        b[i] = (Pow(i, n + 1) - 1) * Pow(i - 1, Mod - 2) % Mod * ifac[i] % Mod;
    b[0] = 1, b[1] = n + 1;

    for (N = 1; N <= n << 1; N <<= 1, ++ cnt) ;
    rep(i, N) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (cnt - 1));

    int invg0 = Pow(g, Mod - 2);
    for (int i = 1; i <= N; i <<= 1)
        powg[i] = Pow(3, (Mod - 1) / i), invg[i] = Pow(invg0, (Mod - 1) / i);

    NTT(a, 1), NTT(b, 1);
    rep(i, N) (a[i] *= b[i]) %= Mod;
    NTT(a, -1);
    LL invn = Pow(N, Mod - 2), pow2 = 1;
    rep(i, N) (a[i] *= invn) %= Mod;

    For(j, 0, n) {
        (Ans += fac[j] * pow2 % Mod * a[j] % Mod) %= Mod;
        (pow2 *= 2) %= Mod;
    }
    if (Ans < 0) Ans += Mod;
    printf("%lld\n", Ans);

    return 0;
}
//看蓬门秋草，年年破巷，疏窗细雨，夜夜孤灯。
//    -- 郑板桥《沁园春·恨》