# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1228410 | _rain_ | Asceticism (JOI18_asceticism) | C++20 | 31 ms | 28232 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=(int)3000;
const int MOD=(int)1e9+7;
int add(int a,int b){
return a+b>=MOD?a+b-MOD:a+b;
}
int sub(int a,int b){
return a-b<0?a-b+MOD:a-b;
}
int mul(int a,int b){
return (LL)a*b%MOD;
}
int dp[N+2][N+2];
int n,k;
int main(){
ios::sync_with_stdio(false);
cin.tie(0) ; cout.tie(0);
#define task "main"
if (fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin>>n>>k;
dp[1][1]=1;
for(int i=2;i<=n;++i){
for(int j=1;j<=i;++j){
dp[i][j]=add(dp[i][j],mul(j,dp[i-1][j]));
dp[i][j+1]=add(mul(i-j,dp[i-1][j]),dp[i][j+1]);
}
}
cout<<dp[n][k];
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |