M3TILE - LATGACH3


In how many ways can you tile a 3xn rectangle with 2x1 dominoes?

Here is a sample tiling of a 3x12 rectangle.

Input consists of several test cases followed by a line containing -1.
Each test case is a line containing an integer 0 ≤ n ≤ 30. For each test
case, output one integer number giving the number of possible tilings. 

SAMPLE INPUT

2
8
12
-1

SAMPLE OUTPUT

3
153
2131

hide comments
: 2013-07-07 04:54:48

Last edit: 2014-02-27 07:43:17
Aradhya: 2013-05-27 18:27:29

well n=1 and n=0 are tricky cases.

(Tjandra Satria Gunawan)(曾毅昆): 2012-12-17 18:32:31

@genetic: for n=0, there are 1 formation: {"NULL"} (empty set) have 1 possibility... Hope you understand my explanation :-)

god_father: 2012-12-17 17:54:11

How output is 1 for n=0 I do not get it??

Vibhor Gaur: 2012-09-05 11:56:10

code running and giving correct output on dev for all test cases,giving wrong answer on spoj status....help

Francky: 2012-06-24 09:29:33

After that, you can try : http://www.spoj.pl/problems/M5TILE/

Nitin Sharma: 2012-06-06 17:52:08

very nice problem!!

Sandy Akbar Dewangga: 2012-03-21 12:19:37

input 0 is tricky one -_-

Ajey Golsangi: 2012-01-06 13:41:18

Had to think for this one !!


Added by:~!(*(@*!@^&
Date:2009-02-17
Time limit:0.600s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:ACM