Submission #968501

#	Time	Username	Problem	Language	Result	Execution time	Memory
968501		Tuanlinh123	Asceticism (JOI18_asceticism)	C++17	49 / 100	21 ms	16984 KiB

asceticism

#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;

const ll maxn=2005, Mod=1e9+7;
ll dp[maxn][maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, k; cin >> n >> k;
    dp[0][0]=1;
    for (ll i=1; i<=n; i++)
        for (ll j=0; j<=k; j++)
        {
            dp[i][j]+=dp[i-1][j]*(j+1);
            if (j) dp[i][j]+=dp[i-1][j-1]*(i-j);
            dp[i][j]%=Mod;
        }
    cout << dp[n][k-1];
}

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