Submission #993374

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

ll dp[301][301][301];

int main() {
	int N, M; cin >> N >> M;
	dp[1][0][0] = 1;
	rep(m, M)
		for (int i = 1; i <= N; i++)
			for (int j = 0; i + j <= N; j++) {
				ll x = dp[i][j][m];
				int k = N - i - j;
				dp[i + j][0][m + 1] = (dp[i + j][0][m + 1] + x * i) % MOD;
				dp[i][j + 1][m + 1] = (dp[i][j + 1][m + 1] + x * k) % MOD;
				dp[i][j][m + 1] = (dp[i][j][m + 1] + x * j) % MOD;
			}
	cout << dp[N][0][M] << endl;
}

Submission Info

Judge Result