# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
756851 | Dan4Life | Asceticism (JOI18_asceticism) | C++17 | 38 ms | 25016 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
long long n,k,d[3010][3010],M=1e9+7;
main(){
scanf("%lld%lld",&n,&k); d[1][1] = 1;
for(int i=2;i<=n;i++)
for(int j=1;j<=k;j++)
d[i][j]=(d[i-1][j-1]*(i-j+1)+d[i-1][j]*j)%M;
printf("%lld",d[n][k]);
}
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... |