组合计数 ---- codeforces1312 D. Count the Arrays

为什么是组合数学呢？qwq一开始以为是dp。。。

每个数都是不同的（除了那个相同的以外）所以你只用考虑每个数的分配总数不用。因为一旦分好顺序就就定了，这就说明我们只要考虑一半就可以了。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
template <class T>
inline void read(T &ret) {
    char c;
    int sgn;
    if (c = getchar(), c == EOF) return ;
    while (c != '-' && (c < '0' || c > '9')) c = getchar();
    sgn = (c == '-') ? -1:1;
    ret = (c == '-') ? 0:(c - '0');
    while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
    ret *= sgn;
    return ;
}
inline void out(int x) {
    if (x > 9) out(x / 10);
    putchar(x % 10 + '0');
}
const int mod = 998244353;
const int maxn = 2e5 + 10;
ll fac[maxn];
ll quickpow(ll a, ll b) {
    ll ans = 1, base = a;
    while (b) {
        if (b & 1) ans = ans * base % mod;
        base = base * base % mod;
        b >>= 1;
    }
    return ans;
}
ll inv(ll x) {
    return quickpow(x, mod - 2);
}
ll C(int n, int m) {
    return fac[n] * inv(fac[m] * fac[n - m] % mod) % mod;
}
int main() {
    int n, m;
    read(n), read(m);
    if (n == 2) {
        out(0);
        return 0;
    }
    fac[1] = 1;
    for (int i = 2; i <= m; i++) {
        fac[i] = (fac[i - 1] * i) % mod;
    }
    ll x = C(m, n - 1);
    x = x * (n - 2) % mod;
    x = x * quickpow(2, n - 3) % mod;;
    out(x);
    return 0;
}