ural 1017. Staircases
来源:互联网 发布:转基因大豆 知乎 编辑:程序博客网 时间:2024/05/16 20:38
点击打开链接
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个砖块搭建楼梯,要求楼梯数的砖块数是递增的,求一共有多少种方案。
dp[i][j]表示当前楼梯共用了i块砖,且最后一格共j个砖的方案数,则:
dp[0][0]=1
dp[i][j]=sum{ dp[i-j][k],0<=k<j }
dp[0][0]=1
dp[i][j]=sum{ dp[i-j][k],0<=k<j }
//0.0622 190 KB#include<stdio.h>#define ll long longll dp[507][507];int main(){ dp[0][0]=1; for(int i=1;i<=500;i++) for(int j=1;j<=i;j++) for(int k=0;k<j;k++) dp[i][j]+=dp[i-j][k]; int n; while(scanf("%d",&n)!=EOF) { ll ans=0; for(int i=1;i<n;i++) ans+=dp[n][i]; printf("%lld\n",ans); } return 0;}
0 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练习
- iOS中UITableView使用指南
- 吸费电话代理 加值电话吸费 无学历要求
- 回溯算法
- 天声人語 20150118
- 好插件(移动骨架)mobilebone.js
- ural 1017. Staircases
- 加盟吸费电话 代理声讯电话 电话群呼器
- 日经春秋 20150118
- 日经社説 20150118 「大阪都」の具体像をもっと
- 哪有电话群呼器 响声电话吸费 电话转接器
- 第二周
- 日经社説 20150118 柔軟に働くホワイトカラーをより多く
- java取得当前工作目录
- 吸费手机代理 加值电话合作 声讯电话