Submission #49646

#	Time	Username	Problem	Language	Result	Execution time	Memory
49646		longcqt	Asceticism (JOI18_asceticism)	C++11	49 / 100	58 ms	25364 KiB

asceticism

#include <bits/stdc++.h>

using namespace std;

const int N = 3e3 + 1;

typedef long long ll;

int n, k;
ll d[N][N], base = 1e9 + 7;

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

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