| 比赛 |
五一大礼包 |
评测结果 |
WWWWWWWWWW |
| 题目名称 |
孤独摇滚! |
最终得分 |
0 |
| 用户昵称 |
LikableP |
运行时间 |
0.215 s |
| 代码语言 |
C++ |
内存使用 |
23.75 MiB |
| 提交时间 |
2026-05-04 11:52:49 |
显示代码纯文本
#include <cstdio>
typedef long long ll;
const ll MOD = 998244353;
ll n, a, b, c, d;
ll C[2010][2010];
int main() {
freopen("Bocchi.in", "r", stdin);
freopen("Bocchi.out", "w", stdout);
scanf("%lld %lld %lld %lld %lld", &n, &a, &b, &c, &d);
C[0][0] = 1;
for (int i = 1; i <= 2000; ++i) {
for (int j = 0; j <= i; ++j) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
}
ll tot = C[a + b + c + d][n];
if (a == 0 || b == 0 || c == 0 || d == 0) {
printf("%lld\n", tot);
} else {
printf("%lld\n", ((tot - (n - 3) * C[a + b + c + d - 4][n - 4] % MOD) + MOD) % MOD);
}
return 0;
}