ural 1017. Staircases
2014-03-30 19:52
387 查看
http://acm.timus.ru/problem.aspx?space=1&num=1017
View Code
#include <cstdio> #include <cstring> #include <algorithm> #define maxn 600 using namespace std; __int64 dp[maxn][maxn]; int main() { int n; scanf("%d",&n); memset(dp,0,sizeof(dp)); dp[1][1]=1; for(int i=2; i<=n; i++) { for(int j=1; j<=i; j++) dp[i][j]=dp[i-1][j-1]+dp[i-j][j-1]; } __int64 sum=0; for(int i=0; i!=n; i++) sum+=dp [i]; printf("%I64d\n",sum); return 0; }
View Code
相关文章推荐
- ural 1017. Staircases
- URAL 1017|Staircases|动态规划
- URAL:1017 Staircases
- ural 1017. Staircases(dp数的划分)
- Ural 1017. Staircases
- Ural 1017 Staircases(DP)
- URAL 1017 Staircases
- URAL 1017 Staircases
- URAL 1017. Staircases(递推)
- 递推DP URAL 1017 Staircases
- Ural 1017 Staircases
- ural 1017 Staircases
- ural 1017. Staircases(dp)
- Ural_1017. Staircases(DP)
- ural 1017. Staircases(dp)
- ural 1017 Staircases
- URAL 1017. Staircases
- ural 1017. Staircases
- Ural1017
- URAL1017——DP——Staircases