Start

2019-11-26 20:00 AKST

Problem Set 1

End

2019-12-03 20:00 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -254 days 9:57:40

Time elapsed

168:00:00

Time remaining

0:00:00

Problem A
Tri Tiling

/problems/tritiling/file/statement/en/img-0001.jpg

In how many ways can you tile a $3\times n$ rectangle with $2\times 1$ dominoes?

Here is a sample tiling of a $3\times 12$ rectangle.

\includegraphics{tiling}

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

Sample Input 1 Sample Output 1
2
8
12
-1
3
153
2131