|
@@ -0,0 +1,32 @@
|
|
|
|
|
+#include <cstdio>
|
|
|
|
|
+#include <cstring>
|
|
|
|
|
+
|
|
|
|
|
+using namespace std;
|
|
|
|
|
+
|
|
|
|
|
+const int H = 11, W = 11;
|
|
|
|
|
+const int N = 1 << W;
|
|
|
|
|
+
|
|
|
|
|
+long long dp[2][N];
|
|
|
|
|
+
|
|
|
|
|
+int h, w;
|
|
|
|
|
+
|
|
|
|
|
+bool is_match(int i, int j) {
|
|
|
|
|
+
|
|
|
|
|
+}
|
|
|
|
|
+
|
|
|
|
|
+int main() {
|
|
|
|
|
+ while (scanf("%d %d", &h, &w) != EOF) {
|
|
|
|
|
+ if (h == 0 && w == 0) break;
|
|
|
|
|
+ memset(dp, 0, sizeof(dp));
|
|
|
|
|
+ dp[0][(1 << w) - 1] = 1;
|
|
|
|
|
+ int cur = 1;
|
|
|
|
|
+ for (int i = 0; i < h; i++) {
|
|
|
|
|
+ for (int j = 0; j < N; j++) {
|
|
|
|
|
+ for (int k = 0; k < N; k++) {
|
|
|
|
|
+
|
|
|
|
|
+ }
|
|
|
|
|
+ }
|
|
|
|
|
+ }
|
|
|
|
|
+ }
|
|
|
|
|
+ return 0;
|
|
|
|
|
+}
|
