Submission #1118246

#	Time	Username	Problem	Language	Result	Execution time	Memory
1118246		vjudge1	Kangaroo (CEOI16_kangaroo)	C++17	0 / 100	1 ms	336 KiB

kangaroo

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod =1000000007;


int dp[3000][3000];

signed main(){
    int n,st,fs;
    cin >> n >> st >> fs;
    dp[1][1] = 1;
    for(int i=2;i<=n;++i){
        if(i == st || i == fs){
            for(int j=1;j<=n;++j){
                dp[i][j] = ((dp[i-1][j-1] + dp[i-1][j]) % mod);
            }
            continue;
        }
        for(int j=1;j<=n;++j){
            //x _ x _ x 
            dp[i][j] = (dp[i-1][j+1] * j) % mod;
            dp[i][j] = (dp[i][j] + ((dp[i-1][j-1] * j) % mod)) % mod;
        }
    }
    cout << dp[n][1];
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 30
• Subtask 3: 0 / 15
• Subtask 4: 0 / 49