此题描述了一个孩子用N个小砖块搭建不同类型的阶梯的问题。这些阶梯必须由至少两个大小递减的台阶组成，并且不允许有相同大小的台阶。任务是编写一个程序来计算可以用N个砖块构建的不同阶梯的数量。
1017. Staircases
Time limit: 1.0 second
Memory limit: 64 MB
Memory limit: 64 MB
One curious child has a set of
N little bricks (5 ≤
N ≤ 500). From these bricks he builds different staircases. Staircase consists of steps of different sizes in a strictly descending order. It is not allowed for staircase to have steps equal sizes. Every staircase consists of at least two steps and each step contains at least one brick. Picture gives examples of staircase for
N=11 and
N=5:
Your task is to write a program that reads the number
N and writes the only number
Q — amount of different staircases that can be built from exactly
N bricks.
Input
Number
N
Output
Number
Q
Sample
| input | output |
|---|---|
212 | 995645335 |
Problem Source: Ural State University Internal Contest '99 #2
Tags:
dynamic programming
)
扫一扫
1334
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
