Zju2994 tiling a grid with dominoes-Dynamic Planning Transformation Matrix

Description:

How many methods are there to build a 4 x W rectangle with a domino card of 1X2?

Analysis:

Classic question. It seems that I have done many series of such questions, and I finally got started ~

1. /*
2. Zju2994 tiling a grid with dominoes
3. */
5. # Include <stdio. h>
6. # Include <string. h>
8. # Define n 100
9. # Define l 20
10. # Define CLR (a) memset (A, 0, sizeof ())
12. Int MX [l] [l];
14. Void print (int A [], int N ){
15. Int I;
16. For (I = 0; I <n; I ++) printf ("% d", a [I]);
17. Puts ("");
18. }
20. Int a2i (int A []) {
21. Int I, x = 0;
22. For (I = 0; I <4; I ++)
23. X | = A [I] <I;
24. Return X;
25. }
27. Void i2a (int x, int A []) {
28. Int I;
29. For (I = 0; I <4; I ++)
30. A [I] = (x> I) & 1;
31. }
33. Void fillb (int I, int A [], int K, int B []) {
34. Int J, R;
35. If (k> = 4 ){
36. J = a2i (B );
37. MX [I] [J] = 1;
38. Return;
39. }
41. If (A [k] = 1 ){
42. B [k] = 0;
43. Fillb (I, A, K + 1, B );
44. }
45. Else {
46. If (k <3 & A [k + 1] = 0 ){
47. B [k] = B [k + 1] = 0;
48. Fillb (I, A, K + 2, B );
49. }
50. B [k] = 1;
51. Fillb (I, A, K + 1, B );
52. }
53. }
55. Void matrix (void ){
56. Int I, J, K;
57. Int A [L], B [l];
59. For (I = 0; I <16; I ++ ){
60. I2a (I, );
61. Fillb (I, A, 0, B );
62. }
63. }
66. Int main ()
67. {
68. Int I, J, K;
70. CLR (MX );
71. Matrix ();
74. // DP
75. Int f [N] [l];
76. Int n = 30;
78. CLR (f );
79. F [0] [0] = 1;
80. For (I = 1; I <= N; I ++ ){
81. For (j = 0; j <L-1; j ++ ){
82. F [I] [J] = 0;
83. For (k = 0; k <L-1; k ++ ){
84. If (MX [k] [J])
85. F [I] [J] + = f [I-1] [k];
86. }
87. }
88. }
90. Int T, TN;
91. Scanf ("% d", & Tn );
92. For (t = 1; t <= tn; t ++ ){
93. Scanf ("% d", & I );
94. Printf ("% d/N", T, F [I] [0]);
95. }
97. Return 0;
98. }