Submission #807113

#	Time	Username	Problem	Language	Result	Execution time	Memory
807113		LucaIlie	Asceticism (JOI18_asceticism)	C++17	49 / 100	836 ms	340 KiB

asceticism

#include <bits/stdc++.h>

using namespace std;

const int MAX_K = 1e5;
const int MOD = 1e9 + 7;
int dp[MAX_K + 1];

int main() {
    int n, k;

    cin >> n >> k;

    dp[1] = 1;
    for ( int i = 2; i <= n; i++ ) {
        for ( int j = k; j >= 1; j-- )
            dp[j] = ((long long)dp[j] * j + (long long)dp[j - 1] * (i - j + 1)) % MOD;
    }

    cout << dp[k];

    return 0;
}

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