Submission #756847

#	Time	Username	Problem	Language	Result	Execution time	Memory
756847		Dan4Life	Asceticism (JOI18_asceticism)	C++17	49 / 100	36 ms	25044 KiB

asceticism

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = (ll)1e9+7;
ll n,k,d[3010][3010];

int main(){
    cin >> n >> k; d[1][1] = 1;
    for(int i = 2; i <= n; i++)
        for(int j = 1; j <= k; j++)
            d[i][j] = (d[i-1][j-1]*(i-j+1)+d[i-1][j]*j)%MOD;
    cout << d[n][k] << "\n";
}

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