#include <bits/stdc++.h>
using namespace std;
int n, l, x;
int dp[51][10001];
const int MOD = 1e9 + 7;
int ans (int pos, int cur) {
if (pos == n) return 1;
if (cur >= l) return 0;
if (dp[pos][cur] != -1) return dp[pos][cur];
return dp[pos][cur] = (ans(pos + 1, cur + x) + ans(pos, cur + 1)) % (MOD);
}
int main () {
cin >> n >> l >> x;
memset(dp, -1, sizeof(dp));
int fact = 1;
for (int i = 1; i <= n; i++) fact = (fact * 1ll * i) % MOD;
cout << (fact * 1ll * ans(0, 0)) % MOD << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
2648 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
2 ms |
2744 KB |
Output is correct |
4 |
Correct |
2 ms |
2652 KB |
Output is correct |
5 |
Correct |
2 ms |
2648 KB |
Output is correct |
6 |
Correct |
3 ms |
2640 KB |
Output is correct |
7 |
Correct |
1 ms |
2652 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
1 ms |
2392 KB |
Output is correct |
10 |
Correct |
1 ms |
2436 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2652 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
2648 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
2 ms |
2744 KB |
Output is correct |
4 |
Correct |
2 ms |
2652 KB |
Output is correct |
5 |
Correct |
2 ms |
2648 KB |
Output is correct |
6 |
Correct |
3 ms |
2640 KB |
Output is correct |
7 |
Correct |
1 ms |
2652 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
1 ms |
2392 KB |
Output is correct |
10 |
Correct |
1 ms |
2436 KB |
Output is correct |
11 |
Incorrect |
2 ms |
2652 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |