![]() |
||||||||||
|
||||||||||
Solid Dominoes TilingsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 394 Accepted Submission(s): 250 Problem Description Dominoes are rectangular tiles with nice 2 × 1 and 1 × 2 sizes. The tiling is called solid if it is not possible to split the tiled rectangle by a straight line, not crossing the interior of any tile. For example, on the picture below the tilings (a) and (b) are solid, while the tilings (c) and (d) are not. ![]() Now the managers of the company wonder, how many different solid tilings exist for an m × n rectangle. Help them to find that out. Input The input file contains $m$ and $n (1 \leq m, n \leq 16)$. Output Output one integer number mod 1e9+7 - the number of solid tilings of m×n rectangle with 2 × 1 and 1 × 2 pavement tiles. Sample Input
Sample Output
Hint All solid tilings for the 5×6 rectangle are provided on the picture below: ![]() Author HIT Source | ||||||||||
|