Submission #205157

#TimeUsernameProblemLanguageResultExecution timeMemory
205157Atill83Asceticism (JOI18_asceticism)C++14
49 / 100
50 ms25080 KiB
#include <bits/stdc++.h> #define ff first #define ss second #define endl '\n' using namespace std; const long long INF = (long long) 1e18; const int mod = (int) 1e9+7; const int MAXN = (int) 3e3+5; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll n, k; ll dp[MAXN][MAXN]; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); #ifdef Local freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin); freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout); #endif cin>>n>>k; dp[1][0] = 1; for(int i = 2; i <= n; i++){ dp[i][0] = 1; for(int j = 1; j < k; j++){ dp[i][j] = ((i - j)*dp[i - 1][j - 1] + dp[i - 1][j]*(j + 1))%mod; } } cout<<dp[n][k - 1]<<endl; #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "; #endif }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...