| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 1024 MB | 215 | 146 | 131 | 68.586% |
You have a given integer $n$. Find the number of ways to fill all 3ドル \times n$ tiles with the shape described in the picture below. Upon filling, no empty spaces are allowed. Shapes cannot overlap.
This picture describes when $n = 4$. The left one is the shape and the right one is 3ドル \times n$ tiles.
The only line contains one integer $n$ (1ドル \le n \le 60$) --- the length.
Print the number of ways to fill.
4
4
1
0
In the first example, there are 4ドル$ possible cases of filling.
In the second example, you cannot fill the shapes in 3ドル \times 1$ tiles.
Contest > Codeforces > Codeforces Round 566 (Div. 2) A번