{"trustable":true,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eFind the number of ways to tile an m*n rectangle with long dominoes -- 3*1 rectangles.\u003c/p\u003e\n\n\u003cp\u003eEach domino must be completely within the rectangle, dominoes must not overlap (of course, they may\ntouch each other), each point of the rectangle must be covered.\u003c/p\u003e\n\n\u003cbr\u003e\n\u003cb\u003e\u003cp\u003eInput\u003c/p\u003e\u003c/b\u003e\n\u003cp\u003eThe input contains several cases. Each case stands two integers m and n (1 \u0026lt;\u003d m \u0026lt;\u003d 9, 1 \u0026lt;\u003d n \u0026lt;\u003d 30) in\na single line. The input ends up with a case of m \u003d n \u003d 0.\u003c/p\u003e\n\n\u003cbr\u003e\n\u003cb\u003e\u003cp\u003eOutput\u003c/p\u003e\u003c/b\u003e\n\u003cp\u003eOutput the number of ways to tile an m*n rectangle with long dominoes.\u003c/p\u003e\n\n\u003cbr\u003e\n\u003cb\u003e\u003cp\u003eSample Input\u003c/p\u003e\u003c/b\u003e\n\u003cpre\u003e3 3\n3 10\n0 0\n\u003c/pre\u003e\n\n\u003cbr\u003e\n\u003cb\u003e\u003cp\u003eSample Output\u003c/p\u003e\u003c/b\u003e\n\u003cpre\u003e2\n28\n\u003c/pre\u003e\n\n\u003cbr\u003e\n"}}]}