제출 #968501

#제출 시각아이디문제언어결과실행 시간메모리
968501Tuanlinh123Asceticism (JOI18_asceticism)C++17
49 / 100
21 ms16984 KiB
#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];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...