| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1150684 | haizentberg | Zapina (COCI20_zapina) | C++20 | 0 ms | 332 KiB |
#include <iostream>
#include <math.h>
using namespace std;
const int MOD = 1e9 + 7;
int n, k;
long long res = 1, C[351][351];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i <= n; i++) {
C[i][0] = 1;
for (int k = 1; k <= i; k++) C[i][k] = C[i - 1][k - 1] + C[i - 1][k];
}
for (int i = 1; i < n; i++) {
long long p = pow(n - i, n - i);
res = res % MOD + ((p % MOD) * (C[n][i] % MOD)) % MOD;
}
cout << res % MOD;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
