Submission #1293090

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293090		simona1230	Asceticism (JOI18_asceticism)	C++20	49 / 100	8 ms	16704 KiB

asceticism

#include<bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
int n,k;

long long ans;
long long dp[4001][4001];
void solve()
{
    dp[1][1]=1;
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<=k;j++)
        {
            dp[i][j]=dp[i-1][j]*(j)%mod+dp[i-1][j-1]*(i-j+1)%mod;
            dp[i][j]%=mod;
            //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
        }
    }

    cout<<dp[n][k]<<endl;
}

int main()
{
    cin>>n>>k;
    solve();
    return 0;
}

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