假设有三种颜色小球,每种颜色各n个,问:相邻颜色不同的情况下,有多少中排列方法?
(同色小球没有区别,输出取模998244353)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[301][301][301][3]; //三种颜色球剩余可用小球数,最后一维:当前选择颜色
int mod = 998244353;
int main()
{
int n, m, k;
while (cin >> n ) {
m = n,k =n; // 通过设置m,k的值,小球数可不同
memset(dp, 0, sizeof(dp));
dp[n-1][m][k][0] = 1;
dp[n][m-1][k][1] = 1;
dp[n][m][k-1][2] = 1;
for (int i = n; i >= 0; i--) {
for (int j = m; j >= 0; j--) {
for (int p = k; p >= 0; p--) {
if(i>0) dp[i-1][j][p][0] = (dp[i-1][j][p][0]+dp[i][j][p][1]+dp[i][j][p][2])%mod;
if(j>0) dp[i][j-1][p][1] = (dp[i][j-1][p][1]+dp[i][j][p][0]+dp[i][j][p][2])%mod;
if(p>0) dp[i][j][p-1][2] = (dp[i][j][p-1][2]+dp[i][j][p][0]+dp[i][j][p][1])%mod;
}
}
}
ll sum = 0;
for (int l = 0; l < 3; l++) {
sum = (sum+dp[0][0][0][l])%mod;
}
cout << sum << endl;
}
}