用户输出
2系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #116924 | #1471. [L2-1] 称名目题 | Wrong Answer | 36 | 12597 ms | 500 K | C++ / 890 B | 青春猪头蒟蒻会梦到 0d000721吗 | 2025-04-16 21:52:24 |
#include <bits/stdc++.h>
#define MOD 19491001
using namespace std;
int n, d, k, ans = 0;
int dp0[1010] = { 0 }, dp1[1010] = { 0 };
int main() {
dp0[0] = 1;
dp1[0] = 0;
cin >> n >> k >> d;
for (int l = 1; l <= n; l++) {
for (int i = n - 1; i >= 0; i--) {
dp0[i] = 0;
dp1[i] = 0;
for (int j = 1; j <= n; j++) {
if (i < j)
continue;
if (j != d) {
dp0[i] += dp0[i - j];
dp0[i] %= MOD;
}
dp1[i] += dp1[i - j];
dp1[i] %= MOD;
}
if (i >= d) {
dp1[i] += dp0[i - d];
dp1[i] %= MOD;
}
}
ans += dp1[n - 1];
ans %= MOD;
}
cout << ans;
}用户输出
235Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0用户输出
18275487Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0用户输出
12461673Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0用户输出
5651739Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0