Submission #1004233

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>

using namespace std;
#define mod 1000000007
int main(){
	long long  dp[301][301][301]={};
	int n,m;
	cin >> n >> m;
	dp[0][1][1]=1;
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			for(int k=1;k<=n;k++){
				if(j==k){
					for(int l=1;l<=k;l++){
						dp[i][j][k] = (dp[i][j][k]+l*dp[i-1][j][l])%mod;
					}
				}else{
					dp[i][j][k] = (dp[i][j][k]+(n-j+1)*dp[i-1][j-1][k]+(j-k)*dp[i-1][j][k])%mod;
				}
			}
		}
	}
	cout << dp[m][n][n] << endl;
	return 0;
}

Submission Info

Judge Result