BZOJ 1801: [Ahoi2009]chess 中国象棋

F[i][j][k]表示前i行有j列是一个炮，k列是两个炮的方案数

转移即可

#include<cstdio>
using namespace std;
const int mod=9999973;
int F[105][105][105];
int C(int n){
	if (n<=0) return 0;
	return 1ll*n*(n-1)/2%mod;
}
int main(){
	int n,m;
	scanf("%d%d",&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<=m; k++){
				F[i][j][k]=F[i-1][j][k];
				if (j-1>=0) (F[i][j][k]+=1ll*F[i-1][j-1][k]*(m-(j-1)-k)%mod)%=mod;
				if (j+1<=m && k-1>=0) (F[i][j][k]+=1ll*F[i-1][j+1][k-1]*(j+1)%mod)%=mod;
				if (j-2>=0) (F[i][j][k]+=1ll*F[i-1][j-2][k]*C(m-(j-2)-k)%mod)%=mod;
				if (k-1>=0) (F[i][j][k]+=1ll*F[i-1][j][k-1]*j%mod*(m-j-(k-1))%mod)%=mod;
				if (j+2<=m && k-2>=0) (F[i][j][k]+=1ll*F[i-1][j+2][k-2]*C(j+2)%mod)%=mod;
			}
	int ans=0;
	for (int i=0; i<=m; i++)
		for (int j=0; j<=m; j++)
			(ans+=F[n][i][j])%=mod;
	printf("%d\n",ans);
	return 0;
}

　　

转载于:https://www.cnblogs.com/silenty/p/9903120.html