Submission #2370000

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 1e9 + 7;

int64_t dp[334][334][334];

int main() {
  int n, m;
  cin >> n >> m;

  dp[0][n - 1][1] = 1;
  for (int i = 0; i < m; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int k = 1; k <= n; ++k) {
        (dp[i + 1][j][n - j] += k * dp[i][j][k] % mod) %= mod;
        (dp[i + 1][j - 1][k] += j * dp[i][j][k] % mod) %= mod;
        (dp[i + 1][j][k] += (n - j - k) * dp[i][j][k]) %= mod;
      }
    }
  }

  cout << dp[m][0][n] << endl;
}

Submission Info

Judge Result