M3TILE  LATGACH3
English  Vietnamese 
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
:
20130707 04:54:48
Last edit: 20140227 07:43:17 

Aradhya:
20130527 18:27:29
well n=1 and n=0 are tricky cases. 

(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20121217 18:32:31
@genetic: for n=0, there are 1 formation: {"NULL"} (empty set) have 1 possibility... Hope you understand my explanation :) 

god_father:
20121217 17:54:11
How output is 1 for n=0 I do not get it?? 

Vibhor Gaur:
20120905 11:56:10
code running and giving correct output on dev for all test cases,giving wrong answer on spoj status....help 

Francky:
20120624 09:29:33
After that, you can try : http://www.spoj.pl/problems/M5TILE/ 

Nitin Sharma:
20120606 17:52:08
very nice problem!! 

Sandy Akbar Dewangga:
20120321 12:19:37
input 0 is tricky one _ 

Ajey Golsangi:
20120106 13:41:18
Had to think for this one !! 
Added by:  ~!(*(@*!@^& 
Date:  20090217 
Time limit:  0.600s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ACM 