Submission #60881

#	Time	Username	Problem	Language	Result	Execution time	Memory
60881		XmtosX	Asceticism (JOI18_asceticism)	C++17	49 / 100	221 ms	93652 KiB

asceticism

#include <bits/stdc++.h>
using namespace std;
const int N=3003,mod=1e9+7;
int n,k;
long long dp[N][N];
int main()
{
    for (int i=1;i<N;i++)
        dp[i][1]=1;
    for (int j=2;j<N;j++)
    {
        for (int i=j;i<N;i++)
        {
                dp[i][j]=(dp[i-1][j-1]*(i-j+1))%mod;
                dp[i][j]+= j*dp[i-1][j];
                dp[i][j]%=mod;
        }
    }
    cin >>n>>k;
    cout <<dp[n][k];
    return 0;
}

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