Submission #361564

#	Time	Username	Problem	Language	Result	Execution time	Memory
361564		dolphingarlic	Asceticism (JOI18_asceticism)	C++14	49 / 100	126 ms	94888 KiB

asceticism

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const ll MOD = 1e9 + 7;

ll dp[3001][3001];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, k;
    cin >> n >> k;
    dp[1][1] = 1;
    for (int i = 2; i <= n; i++) for (int j = 1; j <= i; j++)
        dp[i][j] = (dp[i - 1][j] * j + dp[i - 1][j - 1] * (i - j + 1)) % MOD;
    cout << dp[n][k];
    return 0;
}

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