제출 #1293079

#제출 시각아이디문제언어결과실행 시간메모리
1293079simona1230Asceticism (JOI18_asceticism)C++20
0 / 100
0 ms332 KiB
#include<bits/stdc++.h> using namespace std; const long long mod=1e9+7; int n,k; long long ans; long long dp[4001][4001]; void solve() { dp[1][1]=1; for(int i=2;i<=n;i++) { for(int j=1;j<=k;j++) { dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*(i-1)%mod; dp[i][j]%=mod; if(n==i)ans=(ans+dp[i][j])%mod; } } cout<<ans<<endl; } int main() { cin>>n>>k; solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...