Submission #2853399

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
#define MOD 1000000007ll
#define INF 1000000000ll
#define EPS 1e-10
#define FOR(i,n,m) for(ll i=n;i<(ll)m;i++)
#define REP(i,n) FOR(i,0,n)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else cout<<endl;}
#define ALL(v) v.begin(),v.end()
#define UNIQUE(v) sort(ALL(v));v.erase(unique(ALL(v)),v.end());
#define pb push_back

ll dp[334][334][334];
ll n, m;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> n >> m;
	dp[0][1][1] = 1;
	REP(i,m + 1) REP(j,n + 1) REP(k,n + 1) {
		dp[i][j][k] %= MOD;
		if(i < m) {
			dp[i + 1][j][j] += k * dp[i][j][k];
			dp[i + 1][j][k] += (j - k) * dp[i][j][k];
			if(j < n) dp[i + 1][j + 1][k] += (n - j) * dp[i][j][k];
		}
	}
	cout << dp[m][n][n] << endl;
	return 0;
}

Submission Info

Judge Result