#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 410;
const int maxm = 1 << 11;
const int MOD = 1E9 + 7;
int dp[maxn][maxm], T, n, k;
bool check(int ks, int kn)
{
for (int i = 0, j = kn - 1; i < j; i++, j--)
if (((ks >> i) & 1) != ((ks >> j) & 1))
return 0;
return 1;
}
int main(int argc, char const *argv[])
{
scanf("%d", &T);
while (T--)
{
scanf("%d%d", &n, &k);
if (k == 1) {printf("0\n"); continue;}
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
int ans = 0;
for (int i = 1; i <= n; i++)
for (int j = 0; j < (1 << k + 1); j++)
if (dp[i - 1][j])
{
bool p0 = 1, p1 = 1;
if (i > k && check(j & ((1 << k - 1) - 1), k - 1))
(j & (1 << k - 1) ? p1 : p0) = 0;
if (i >= k && check(j & ((1 << k - 2) - 1), k - 2))
(j & (1 << k - 2) ? p1 : p0) = 0;
int now = (j & ((1 << k) - 1)) << 1;
if (p0) dp[i][now] = (dp[i][now] + dp[i - 1][j]) % MOD;
now = now + 1;
if (p1) dp[i][now] = (dp[i][now] + dp[i - 1][j]) % MOD;
}
for (int i = 0; i < (1 << k + 1); i++)
ans = (ans + dp[n][i]) % MOD;
printf("%d\n", ans);
}
return 0;
}
一个串中只要保证不含长度为k也不含长度为k+1的回文串,那么就不会出现大于k的回文串,所以我们构造的时候只要保证前面两个条件符合即可。状压记录后k的字符串,填新字符时保证不会构造出长度为k或k+1的回文串即可。