Ural 1017. Staircases
来源:互联网 发布:网络销售最好的是什么 编辑:程序博客网 时间:2024/05/17 06:31
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 andN=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
212
995645335
Problem Source: Ural State University Internal Contest '99 #2
一个好奇的小孩子有N个小砖块(5<=N<=500).用这些砖块,他搭建了一些不同的楼梯。楼梯由严格递减的梯子序列组成,楼梯不允许有相同的两梯。每个楼梯至少有2格,每格至少有一个砖块。读入N,输出唯一的数Q--能用N块砖搭建的不同梯子的总数。
类似背包思想,其实是递推
#include <iostream>using namespace std;long long arr[505];int main(){ int n,i,j; arr[0]=1; cin>>n; for(i=1; i<=n; i++) for(j=n; j>=i; j--) arr[j]=arr[j]+arr[j-i]; cout<<arr[n]-1<<endl; return 0;}
- ural 1017. The Staircases
- Ural 1017. Staircases
- URAL 1017. Staircases
- ural 1017. Staircases
- ural 1017. Staircases DP
- ural 1017. Staircases(dp)
- URAL 1017. Staircases 解题报告
- URAL 1017. Staircases(递推)
- Ural 1017 The Staircases
- ural 1017 Staircases
- ural 1017 Staircases
- URAL:1017 Staircases
- Ural 1017 Staircases
- URAL 1017 Staircases
- URAL 1017 Staircases 楼梯
- ural 1017. Staircases(dp数的划分)
- Ural 1017 Staircases(DP)
- URAL 1017Staircases dp练习
- 关于PHP的chmod()函数
- 对 Linux 专家非常有用的 20 个命令
- Switching From Windows to Nix or a Newbie to Linux – 20 Useful Commands for Linux Newbies
- 蓝牙4.0 For IOS
- android 横竖屏切换
- Ural 1017. Staircases
- POJ 3020 Antenna Placement
- 简述某次拿下外国大学网站(Mailman private.py 目录跳转漏洞)
- 在JS中循环调用AJAX方法
- python文件处理:读取文件
- 关于VS2010连接TFS(xxx.visualstudio.com)需要代理验证的解决方法
- Mac os 和 Xcode的 快捷键操作大全
- Hibernate继承映射
- php glob() 函数