# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609401 | SlavicG | Kangaroo (CEOI16_kangaroo) | C++17 | 1 ms | 468 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 <iostream>
int64_t n,s,t,m=1e9+7,d[5000][5000],i,j;
main() {std::cin>>n>>s>>t;d[0][0]=1;for(i=1;i<=n;++i){for(int j=1;j<=i;++j){if(i==s||i==t)d[i][j]=d[i-1][j-1]+d[i-1][j]%m;else d[i][j]=d[i-1][j+1]*j+d[i-1][j-1]*(j-(i>s)-(i>t))%m;}}std::cout<<d[n][1];}
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... |