C++ 解法, 执行用时: 423ms, 内存消耗: 432K, 提交时间: 2023-08-12 11:19:22

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

const int RES[10] = {1, 808258749, 117153405, 761699708, 573994984, 62402409, 511621808, 242726978, 887890124, 875880304};
const int MOD = 998244353, BASE = 1e8;
int n;
signed main() {
    scanf("%lld", &n);
    if(n >= MOD) return puts("0"), 0;
    int ans = RES[n / BASE];
    for(int i = n - n % BASE + 1; i <= n; i++)
        ans = ans * i % MOD;
    printf("%lld\n", ans);
    return 0;
}