[HihoCoder]#1048 : 状态压缩·二

#include <stdio.h>
#include <string.h>

#define MaxN 1005
#define Mod 1000000007

int state[MaxN][1 << 5];

bool Check(int s1, int s2, int m)
{
if ((s1&s2) > 0)
{
return false;
}
int s = s1 | s2;
int countNull = 0;
for (int i = 0; i < m; i++)
{
if (((1 << i) & s) == 0)
{
countNull++;
}
else
{
if (countNull & 1)
return false;
countNull = 0;
}
}
if (countNull & 1)
return false;
return true;
}

int main()
{
int N, M;
scanf("%d %d", &N, &M);
memset(state, 0, sizeof(state));
state[0][0] = 1;
for (int i = 1; i <= N; i++)
{
for (int j = 0; j < (1 << M); j++)
{
for (int k = 0; k < (1 << M); k++)
{
if (Check(k, j, M))
{
state[i][j] += state[i - 1][k];
state[i][j] = state[i][j] % Mod;
}
}
}
}
printf("%d\n", state
[0]);
return 0;
}