Submission #5714413

---

Source Code Expand

#include <iostream>

using namespace std;

const long MOD = 1000000007;

long dp[301][301][301];

int main(){
    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 <= j; k++){
                //cout << i << ' ' << j << ' ' <<  k << endl;
                if(j == k){
                    for(int l = 1; l <= j; l++){
                        dp[i][j][k] += dp[i-1][j][l]*l;
                        dp[i][j][k] %= MOD;
                    }
                }else{
                    dp[i][j][k] = (dp[i-1][j][k]*(j-k))%MOD;
                    dp[i][j][k] += (dp[i-1][j-1][k]*(N-j+1))%MOD;
                    dp[i][j][k] %= MOD;
                }
            }
        }
    }
    cout << dp[M][N][N] << endl;
}

Submission Info

Judge Result