Submission #777266

#	Time	Username	Problem	Language	Result	Execution time	Memory
777266		yeyso	Asceticism (JOI18_asceticism)	C++14	0 / 100	1 ms	212 KiB

asceticism

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, k; cin >> n >> k;
    int mod = 1e9 + 7;
    vector<vector<int>> dp(n+1, vector<int>(k+1, 0));
    for(int i = 0; i < n+1; i ++){
        dp[i][0] = 1;
        if(i > 0) for(int j = 1; j < k+1; j ++) dp[i][j] = ((dp[i-1][j-1] * (i - j)) % mod + (dp[i-1][j] * (j + 1)) % mod) % mod;
    }
    cout << dp[n][k];
}

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