# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
552809 | Ai7081 | Kangaroo (CEOI16_kangaroo) | C++17 | 15 ms | 22996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define long long long
const long N = 2005;
const long mod = 1e9+7;
int n, s, f;
long dp[N][N];
int main() {
scanf(" %d %d %d", &n, &s, &f);
dp[1][1] = 1;
for (int i=2; i<=n; i++) {
for (int j=1; j<=i; j++) {
if (i==s || i==f) dp[i][j] = (dp[i-1][j] + dp[i-1][j-1]) % mod;
else dp[i][j] = (j*dp[i-1][j+1] + dp[i-1][j-1]*(j-(i>s)-(i>f))) % mod;
}
}
printf("%lld", dp[n][1]%mod);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |