Type: Default 1000ms 256MiB

铺砖

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×2、1×3、1x5的地砖铺满方格,请问有多少种铺法?

输入格式

一个整数n(n<=50)

输出格式

地砖的铺法

样例

输入样例#1:

5

输出样例#1:

3

线性DP 与 最大子段和模型

Not Claimed
Status
Done
Problem
10
Open Since
2025-5-19 0:00
Deadline
2025-6-7 23:59
Extension
24 hour(s)