|
||||||||||
Tri TilingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6734 Accepted Submission(s): 3887 Problem Description In how many ways can you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a 3x12 rectangle. Input Input consists of several test cases followed by a line containing -1. Each test case is a line containing an integer 0 ¡Ü n ¡Ü 30. Output For each test case, output one integer number giving the number of possible tilings. Sample Input
Sample Output
Source | ||||||||||
|