Submission #249632

#TimeUsernameProblemLanguageResultExecution timeMemory
249632egekabasAsceticism (JOI18_asceticism)C++14
49 / 100
52 ms25176 KiB
#include <bits/stdc++.h> #define ff first #define ss second #define pb push_back #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> pll; typedef pair<ull, ull> pull; typedef pair<int, int> pii; typedef pair<ld, ld> pld; const ll mod = 1e9+7; ll n, k; ll dp[3009][3009]; int main() { //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); cin >> n >> k; for(ll i = 1; i <= n; ++i){ dp[i][1] = 1; for(ll j = 1; j <= k; ++j){ dp[i+1][j] += dp[i][j]*j; dp[i+1][j] %= mod; dp[i+1][j+1] += dp[i][j]*(i-j+1); dp[i+1][j+1] %= mod; } } cout << dp[n][k] << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...