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;typedef long long p;p m=1e9+7;p d[2001][2001];int main(){int n,a,b;cin>>n>>a>>b;d[0][0]=1;for(p i=1;i<=n;i++){for(p j=1;j<=i;j++){if(i==a||i==b)d[i][j]=(d[i-1][j-1]+d[i-1][j])%m;else d[i][j]=(d[i-1][j+1]*j%m+d[i-1][j-1]*(j-(i>a)-(i>b))%m)%m;}}cout<<d[n][1];return 0;}
# | 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... |