Submission #379746

#	Time	Username	Problem	Language	Result	Execution time	Memory
379746		nafis_shifat	Asceticism (JOI18_asceticism)	C++14	49 / 100	158 ms	262148 KiB

asceticism

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=1e5+5;
const int inf=1e9;
const ll mod = 1e9 + 7;
int main() {
	int n,k;

	cin >> n >> k;

	ll dp[n + 1][k + 1] = {};

	dp[1][0] = 1;

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

	cout<<dp[n][k - 1]<<endl;


	
}

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