This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m; long long dp[n + 1][m + 1] = {};
for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++){
dp[i][j] += dp[i - 1][j];
dp[i][j] += (dp[i - 1][j - 1] + 1) * j * 4;
if (j > 1) dp[i][j] += (dp[i - 1][j - 2] + 1) * j * (j - 1) / 2;
if (i > 1) dp[i][j] += (dp[i - 2][j - 1] + 1) * j * (i - 1);
dp[i][j] %= (int)1e9 + 7;
}
cout<<dp[n][m]<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |