제출 #699787

#제출 시각아이디문제언어결과실행 시간메모리
699787aggrovectorAsceticism (JOI18_asceticism)C++17
49 / 100
97 ms94412 KiB
#include <bits/stdc++.h> using namespace std; long long i,j,k,dp[3005][3005],n; const long long mod=1e9+7; int main() { cin >> n >> k; dp[1][1]=1; for (i=2;i<=n;i++) { for (j=1;j<=i;j++) { dp[i][j]=dp[i-1][j-1]*(i-(j-1))+dp[i-1][j]*j; dp[i][j]%=mod; } } cout << dp[n][k] << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...