#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 400, LOG=20;
ll n, m, k, u, v, x, y, t, a, b, ans;
ll dp[MAXN][MAXN];
ll C[MAXN][MAXN];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
for (int i=0; i<MAXN; i++){
C[i][0]=C[i][i]=1;
for (int j=1; j<i; j++) C[i][j]=(C[i-1][j] + C[i-1][j-1])%mod;
}
cin>>n;
dp[0][0]=1;
for (int i=1; i<=n; i++) for (int j=0; j<=n; j++){
for (int t=0; t<=j; t++) if (t!=i) dp[i][j]=(dp[i][j] + C[j][t]*dp[i-1][j-t])%mod;
}
ans=1;
for (int i=0; i<n; i++) ans=ans*n%mod;
ans=(ans-dp[n][n]+mod)%mod;
cout<<ans<<'\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
1528 KB |
Output is correct |
2 |
Correct |
5 ms |
1656 KB |
Output is correct |
3 |
Correct |
5 ms |
1656 KB |
Output is correct |
4 |
Correct |
5 ms |
1656 KB |
Output is correct |
5 |
Correct |
5 ms |
1656 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
1528 KB |
Output is correct |
2 |
Correct |
5 ms |
1656 KB |
Output is correct |
3 |
Correct |
5 ms |
1656 KB |
Output is correct |
4 |
Correct |
5 ms |
1656 KB |
Output is correct |
5 |
Correct |
5 ms |
1656 KB |
Output is correct |
6 |
Correct |
5 ms |
1656 KB |
Output is correct |
7 |
Correct |
5 ms |
1656 KB |
Output is correct |
8 |
Correct |
5 ms |
1656 KB |
Output is correct |
9 |
Correct |
5 ms |
1656 KB |
Output is correct |
10 |
Correct |
5 ms |
1656 KB |
Output is correct |
11 |
Correct |
6 ms |
1656 KB |
Output is correct |
12 |
Correct |
7 ms |
1656 KB |
Output is correct |
13 |
Correct |
6 ms |
1656 KB |
Output is correct |
14 |
Correct |
6 ms |
1656 KB |
Output is correct |
15 |
Correct |
6 ms |
1656 KB |
Output is correct |
16 |
Correct |
6 ms |
1656 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
1528 KB |
Output is correct |
2 |
Correct |
5 ms |
1656 KB |
Output is correct |
3 |
Correct |
5 ms |
1656 KB |
Output is correct |
4 |
Correct |
5 ms |
1656 KB |
Output is correct |
5 |
Correct |
5 ms |
1656 KB |
Output is correct |
6 |
Correct |
5 ms |
1656 KB |
Output is correct |
7 |
Correct |
5 ms |
1656 KB |
Output is correct |
8 |
Correct |
5 ms |
1656 KB |
Output is correct |
9 |
Correct |
5 ms |
1656 KB |
Output is correct |
10 |
Correct |
5 ms |
1656 KB |
Output is correct |
11 |
Correct |
6 ms |
1656 KB |
Output is correct |
12 |
Correct |
7 ms |
1656 KB |
Output is correct |
13 |
Correct |
6 ms |
1656 KB |
Output is correct |
14 |
Correct |
6 ms |
1656 KB |
Output is correct |
15 |
Correct |
6 ms |
1656 KB |
Output is correct |
16 |
Correct |
6 ms |
1656 KB |
Output is correct |
17 |
Correct |
81 ms |
2424 KB |
Output is correct |
18 |
Correct |
6 ms |
1784 KB |
Output is correct |
19 |
Correct |
22 ms |
2040 KB |
Output is correct |
20 |
Correct |
7 ms |
1656 KB |
Output is correct |
21 |
Correct |
109 ms |
2680 KB |
Output is correct |
22 |
Correct |
16 ms |
2040 KB |
Output is correct |
23 |
Correct |
6 ms |
1784 KB |
Output is correct |
24 |
Correct |
27 ms |
2168 KB |
Output is correct |
25 |
Correct |
20 ms |
2040 KB |
Output is correct |
26 |
Correct |
34 ms |
2168 KB |
Output is correct |
27 |
Correct |
152 ms |
2808 KB |
Output is correct |
28 |
Correct |
152 ms |
2680 KB |
Output is correct |
29 |
Correct |
154 ms |
2680 KB |
Output is correct |
30 |
Correct |
154 ms |
2680 KB |
Output is correct |
31 |
Correct |
157 ms |
2808 KB |
Output is correct |
32 |
Correct |
158 ms |
2680 KB |
Output is correct |
33 |
Correct |
158 ms |
2680 KB |
Output is correct |
34 |
Correct |
160 ms |
2684 KB |
Output is correct |
35 |
Correct |
161 ms |
2684 KB |
Output is correct |
36 |
Correct |
162 ms |
2680 KB |
Output is correct |
37 |
Correct |
163 ms |
2680 KB |
Output is correct |