제출 #1306914

#제출 시각아이디문제언어결과실행 시간메모리
1306914Double_SlashAsceticism (JOI18_asceticism)C++20
49 / 100
171 ms327680 KiB
#pragma GCC optimize("O3,unroll-loops,inline")
#include <bits/stdc++.h>
#pragma GCC target("avx2")

using namespace std;
using ll = long long;

const int M = 1e9 + 7;

int main() {
    int N, K;
    cin >> N >> K;
    ll dp[N + 1][N]{};
    for (int n = 1; n <= N; ++n) {
        dp[n][0] = 1;
        for (int k = n; --k;) {
            dp[n][k] = dp[n - 1][k] * (k + 1) % M + dp[n - 1][k - 1] * (n - k) % M;
        }
    }
    cout << dp[N][K - 1] % M;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...