Submission #5414365

---

Source Code Expand

#include <iostream>

using namespace std;
typedef long long ll;
ll mod = 1000000007,dp[305][305][305] = {};
int main(){
	ll i,j,k,n,m;
	cin >> n >> m;
	dp[0][1][0] = 1;
	for(i=0;i<m;i++){
		for(j=1;j<=n;j++){
			for(k=0;k<=n - j;k++){
				(dp[i + 1][j + k][0] += j*dp[i][j][k]) %= mod;
				(dp[i + 1][j][k] += k*dp[i][j][k]) %= mod;
				(dp[i + 1][j][k + 1] += (n - j - k)*dp[i][j][k]) %= mod;
			}
		}
	}
	cout << dp[m][n][0] << endl;
}

Submission Info

Judge Result