Submission #865594

#	Time	Username	Problem	Language	Result	Execution time	Memory
865594		jk410	Asceticism (JOI18_asceticism)	C++17	49 / 100	78 ms	143184 KiB

asceticism

#include <iostream>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int N,K;
ll DP[3001][3001];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>N>>K;
    DP[0][0]=1;
    for (int i=1; i<=N; i++){
        for (int j=1; j<=i; j++)
            DP[i][j]=(DP[i-1][j]*j%MOD+DP[i-1][j-1]*(i-j+1)%MOD)%MOD;
    }
    cout<<DP[N][K];
    return 0;
}

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