1 #include<stdio.h>
 2 #include<iostream>
 3 #include<vector>
 4 #include<string.h>
 5 #include<algorithm>
 6 using namespace std;
 7 long long dp[1<<12][13];
 8 vector<int> ok[1<<12];
 9 int h, w;
10 bool judge(int up, int down)
11 {
12     int u[13], d[13];
13     int now = w;
14     while (now)
15     {
16         u[now] = up % 2;
17         d[now--] = down % 2;
18         up /= 2;
19         down /= 2;
20     }
21     for (int i = 1; i <= w;)
22     {
23         if (!d[i])//该行该位为0
24         {
25             if (!u[i]) return 0;//上一行若也为0，则不合法
26             i++;
27         }
28         else if (!u[i])//该行该位为1，且上一行该位为0
29             i++;
30         else//该行该位为1，且上一行该位也为1
31         {
32             if (i + 1 > w || !d[i+1] || !u[i+1]) return 0;
33             i += 2;
34         }
35     }
36     return 1;
37 }
38 long long getdp()
39 {
40     memset(dp, 0, sizeof(dp));
41     for (int i = 0; i < (1<<w); i++)
42     {
43         ok[i].clear();
44         for (int j = 0; j < (1<<w); j++) if (judge(j, i))
45             ok[i].push_back(j);
46     }
47     for (int i = 0; i < (1 << w); i++)
48         for (int j = 0; j < ok[i].size(); j++) if (ok[i][j] == (1<<w) - 1)
49         dp[i][1] = 1;
50     for (int i = 2; i <= h; i++)
51         for (int j = 0; j < (1 << w); j++)
52             for (int k = 0; k < ok[j].size(); k++)
53                 dp[j][i] += dp[ ok[j][k] ][i-1];
54     return dp[(1<<w)-1][h];
55 }
56 int main()
57 {
58     while (~scanf("%d%d", &h, &w) && h && w)
59     {
60         if ((h * w) % 2)
61         {
62             printf("0\n");
63             continue;
64         }
65         if (h < w) swap(h, w);
66         printf("%lld\n", getdp());
67     }
68     return 0;
69 }

 1 #include<stdio.h>
 2 #include<algorithm>
 3 #include<string.h>
 4 using namespace std;
 5 long long dp[1<<12][13], tem, h, w;
 6 void dfs(int row,int state,int pos)
 7 {
 8     if (pos == w)
 9     {
10         dp[state][row] += tem;
11         return;
12     }
13     dfs(row, state, pos + 1);
14     if (pos <= w - 2 && !(state & (1<<pos)) && !(state & (1<<(pos + 1))))
15         dfs(row, state | 1<<pos | 1<<(pos+1), pos + 2);
16 }
17 int main()
18 {
19     while (~scanf("%d%d", &h, &w) && h && w)
20     {
21         if (h * w % 2)
22         {
23             printf("0\n");
24             continue;
25         }
26         if (h < w) swap(h, w);
27         memset(dp, 0, sizeof(dp));
28         tem = 1;
29         dfs(1, 0, 0);
30         for (int i = 2; i <= h; i++)
31             for (int j = 0; j < (1<<w); j++) if (dp[j][i-1])
32             {
33                 tem = dp[j][i-1];
34                 dfs(i, ~j & ((1<<w) - 1), 0);
35             }
36         printf("%lld\n", dp[(1<<w)-1][h]);
37     }
38     return 0;
39 }