Submission #699787

#	Time	Username	Problem	Language	Result	Execution time	Memory
699787		aggrovector	Asceticism (JOI18_asceticism)	C++17	49 / 100	97 ms	94412 KiB

asceticism

#include <bits/stdc++.h>
using namespace std;
long long i,j,k,dp[3005][3005],n;
const long long mod=1e9+7;

int main() {
	cin >> n >> k;
	dp[1][1]=1;
	for (i=2;i<=n;i++) {
		for (j=1;j<=i;j++) {
			dp[i][j]=dp[i-1][j-1]*(i-(j-1))+dp[i-1][j]*j;
			dp[i][j]%=mod;
		}
	}
	cout << dp[n][k] << endl;
}

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