DP, dp[i][j]表示第i次转换,有j个位置和初始串不一样,然后DP p从0到m,表示把j中p个不同位置反转, 把n-j中m-p个位置反转,这样操作后不相同位的个数就变成了j+m-2*p,这样就有状态转移方程了
#include<cstdio>
#include<cstring>
using namespace std;
namespace
{
long long C[101][101];
const int MOD = 1000000009;
void init()
{
memset(C, 0, sizeof(C));
C[0][0] = 1;
for (int i = 1; i <= 100; i++)
{
C[i][0] = 1;
for (int j = 1; j <= i; j++)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
}
}
int main()
{
init();
int n, k, m;
char s[101], t[101];
long long dp[101][101];
while (scanf("%d %d %d", &n, &k, &m) != EOF)
{
int diff = 0;
scanf("%s %s", s, t);
for (int i = 0; s[i] != '\0'; i++)
if (s[i] != t[i])
diff++;
memset(dp, 0, sizeof(dp));
dp[0][diff] = 1;
for (int i = 1; i <= k; i++)
for (int j = 0; j <= n; j++)
for (int p = 0; p <= m; p++)
if (j >= p && n - j >= m - p)
{
dp[i][j + m - 2 * p] += C[j][p] * C[n - j][m - p] % MOD
* dp[i - 1][j] % MOD;
dp[i][j + m - 2 * p] %= MOD;
}
printf("%lld\n", dp[k][0]);
}
return 0;
}