# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1244826 | CrabCNH | Zapina (COCI20_zapina) | C++20 | 110 ms | 3272 KiB |
#include <bits/stdc++.h>
#define task "BriantheCrab"
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define szf sizeof
#define sz(s) (int)((s).size())
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
template <class T> void minimize (T &t, T f) {if (t > f) t = f;}
template <class T> void maximize (T &t, T f) {if (t < f) t = f;}
const int maxN = 350 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;
int n;
int dp[maxN][maxN], C[maxN][maxN];
int pw[maxN][maxN];
void solve () {
cin >> n;
for (int i = 0; i <= n; i ++) {
C[i][0] = 1;
if (i <= n) {
C[i][i] = 1;
}
}
for (int i = 0; i <= n; i ++) {
for (int j = 1; j <= min (i, n); j ++) {
if (i != j) {
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
}
}
}
for (int base = 0; base <= n; base ++) {
pw[base][0] = 1;
for (int exp = 1; exp <= n; exp ++) {
pw[base][exp] = (pw[base][exp - 1] * base) % mod;
}
}
for (int i = 1; i <= n; i ++) {
for (int k = 0; k <= n; k ++) {
if (k >= i) {
dp[i][k] = (dp[i][k] + C[k][i] * pw[i - 1][k - i] % mod) % mod;
}
for (int j = 0; j <= k; j ++) {
if (j == i) {
continue;
}
dp[i][k] = (dp[i][k] + C[k][j] * dp[i - 1][k - j]) % mod;
}
}
}
cout << dp[n][n];
return;
}
signed main () {
cin.tie (nullptr) -> sync_with_stdio (false);
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
int t = 1;
//cin >> t;
while (t --) {
solve ();
}
return 0;
}
// thfv
컴파일 시 표준 에러 (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... |