思路:
动态规划。设dp[i][j][k]表示计算到第i行,已经放两个的列有j个,已经放了一个的列有k个,每行可以放0个,1个或2个。分情况讨论:一个都不放,j这一维加一个,
代码:
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, m, ans;
ll f[110][110][110];
const ll p = 9999973;
ll calc(ll k){
return ((k*k-k)/2)%p;
}
int main(){
cin >> n >> m;
f[0][0][0] = 1;
for(int i = 1; i <= n; i ++){
for(int j = 0; j <= m; j ++){
for(int k = 0; k+j <= m; k ++){
f[i][j][k] = f[i-1][j][k];
if(j-1>=0) f[i][j][k] = ((f[i-1][j-1][k+1]*(k+1))%p + f[i][j][k])%p;
if(j-2>=0) f[i][j][k] = ((f[i-1][j-2][k+2]*calc(k+2)%p) + f[i][j][k])%p;
if(k-1>=0) f[i][j][k] = ((f[i-1][j][k-1]*(m-k-j+1))%p + f[i][j][k])%p;
if(k-2>=0) f[i][j][k] = ((f[i-1][j][k-2]*calc(m-k-j+2))%p + f[i][j][k])%p;
if(j-1>=0) f[i][j][k] = ((f[i-1][j-1][k]*((k)*(m-k-j+1))%p)%p + f[i][j][k])%p;
}
}
}
for(int i = 0; i <= m; i ++){
for(int j = 0; i+j <= m; j ++){
ans = (ans + f[n][i][j]) % p;
}
}
cout << ans;
return 0;
}