| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370742 | chikien2009 | Asceticism (JOI18_asceticism) | C++20 | 5 ms | 12612 KiB |
#include <bits/stdc++.h>
using namespace std;
void setup()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const long long mod = 1e9 + 7;
int n, k;
long long f[3001][3001];
int main()
{
setup();
cin >> n >> k;
f[0][1] = 1;
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= k; ++j)
{
f[i][j] = (f[i - 1][j] * j + f[i - 1][j - 1] * (i + 1 - j)) % mod;
}
}
cout << f[n][k];
return 0;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
