#A. 【入门】骨牌铺方格

    Type: Default 1000ms 16MiB

【入门】骨牌铺方格

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

说明

1×n(n<=50)的一个长方形,用一个1×11×21×3的骨牌铺满方格,请问有多少种铺法?

例如当n=3时为1×3的方格。此时用1×11×21×3的骨牌铺满方格,共有四种铺法。如下图:


输入格式

一个整数n(n<=50)

输出格式

骨牌的铺法

样例

3
4

⭐每日一题⭐

Not Claimed
Status
Done
Problem
1
Open Since
2022-3-1 8:00
Deadline
2022-3-1 23:45
Extension
0 hour(s)