# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
212108 | Kalam | Zapina (COCI20_zapina) | C++11 | 169 ms | 1656 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.
// KALAM
# include<bits/stdc++.h>
using namespace std;
const int N = 300 + 77 , Mod = 1000000007;
int n , A , dp[N][N] , C[N][N];
int main() {
for(int i = 0;i < N;++ i)
C[0][i] = C[i][i] = 1;
for(int i = 1;i < N;++ i)
for(int j = i + 1;j < N;++ j)
C[i][j] = (C[i - 1][j - 1] + C[i][j - 1]) % Mod;
scanf("%d" , & n);
dp[0][0] = 1;
for(int i = 1;i <= n;++ i)
for(int j = 0;j <= n;++ j)
for(int k = 0;k <= j;++ k)
if(k != i) {
dp[i][j] = (dp[i][j] + C[k][n - j + k] * 1ll * dp[i - 1][j - k]) % Mod;
}
A = 1;
for(int i = 1;i <= n;++ i)
A = A * 1ll * n % Mod;
A = (A + Mod - dp[n][n]) % Mod;
printf("%d\n" , A);
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... |