Submission #246923

#	Time	Username	Problem	Language	Result	Execution time	Memory
246923		Osama_Alkhodairy	Asceticism (JOI18_asceticism)	C++17	49 / 100	1085 ms	21160 KiB

asceticism

#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 3001;

int n, k, dp[N][N], mod = 1e9 + 7;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> k;
    dp[1][0] = 1;
    for(int i = 2 ; i <= n ; i++){
        for(int j = 0 ; j < n ; j++){
            dp[i][j] = (1LL * (j + 1) * dp[i - 1][j] + 1LL * (i - j) * dp[i - 1][j - 1]) % mod;
        }
    }
    cout << dp[n][n - k] << endl;
}

• Subtask 1: 4 / 4
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 0 / 51