ZOJ - 1163 整数不重合拆分，dp板子求解（极其卑微的背板子）

最新推荐文章于 2023-07-14 16:23:11 发布

阿言在学习

最新推荐文章于 2023-07-14 16:23:11 发布

阅读量169

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM Problem 文章标签： ACM

本文链接：https://blog.youkuaiyun.com/ACM_Cmy/article/details/97777824

ACM Problem 专栏收录该内容

4 篇文章

订阅专栏

本文探讨了一个关于使用不同数量的砖块搭建楼梯的问题。楼梯由大小递减的台阶构成，不允许有相同大小的台阶。任务是编写一个程序，读取输入的砖块数量N，并输出可以构建的不同楼梯的数量Q。示例输入包括3和5，对应的输出为1和2。文章提供了一段用于解决此问题的动态规划代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

One curious child has a set of N little bricks. 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 from input numbers N and writes to output numbers Q - amount of different staircases that can be built from exactly N bricks.

Input

Numbers N, one on each line. You can assume N is between 3 and 500, both inclusive. A number 0 indicates the end of input.

Output

Numbers Q, one on each line.

Sample Input

3
5
0

Sample Output

1
2

    for(int i = 1; i <= 500; i++)//dp拆分整数的板子（此处高能）
    
    for(int j = 500; j >= i; j--)

        dp[j] += dp[j-i];
        
        此处打表求所有解

板子太简单，背过就好

ZOJ - 1163 整数不重合拆分，dp板子求解 （极其卑微的背板子）

ZOJ - 1163 整数不重合拆分，dp板子求解（极其卑微的背板子）