Submission #320391

#	Time	Username	Problem	Language	Result	Execution time	Memory
320391		NachoLibre	Asceticism (JOI18_asceticism)	C++14	49 / 100	50 ms	25080 KiB

asceticism

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

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

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

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