提交时间:2024-10-18 13:26:22

运行 ID: 33651

#include <bits/stdc++.h> #define int long long using namespace std; const int md = 998244353; int n,ans = 1; __int128 f[200005]; inline int pw (int x,__int128 k) { int r = 1; while (k) { x %= md; if (k & 1) { r *= x; r %= md; } k /= 2; x *= x; } return r; } signed main () { cin >> n; int x = n * (n + 1) / 2; memset(f,0,sizeof(f)); f[0] = 1; for (int i = 1;i <= n;i++) { for (int j = x;j >= i;--j) { f[j] += f[j - i]; f[j] %= (md - 1); } } for (int i = 1;i <= x;i++) { ans *= pw(i,f[i]); ans %= md; } cout << ans << endl; return 0; }