{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n h1 { font-size: 1.2em; }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\nĐếm số cách có thể lấp đầy bảng kích thước $n \\times m$ bằng các viên gạch kích thước $1 \\times 2$ và $2 \\times 1$.\u003cbr\u003e\n\u003cbr\u003e\n\u003cb id\u003d\"input\"\u003eInput\u003c/b\u003e\u003cbr\u003e\n\u003cbr\u003e\nDòng thứ nhất ghi hai số nguyên n, m.\u003cbr\u003e\n\u003cbr\u003e\n\u003cb id\u003d\"output\"\u003eOutput\u003c/b\u003e\u003cbr\u003e\n\u003cbr\u003e\nMột số nguyên duy nhất là số cách chia dư cho 1000000007.\u003cbr\u003e\n\u003cbr\u003e\n\u003cb id\u003d\"constraints\"\u003eHạn chế\u003c/b\u003e\u003cbr\u003e\n\u003cul\u003e\n\u003cli\u003e$1 \\le n \\le 10$\u003cbr\u003e\n\u003c/li\u003e\u003cli\u003e$1 \\le m \\le 1000$\u003cbr\u003e\n\u003c/li\u003e\u003c/ul\u003e\n "}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e6 3\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e41\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}