1017. Staircases
来源:互联网 发布:怎么打扮知乎 编辑:程序博客网 时间:2024/04/30 03:20
1017. Staircases
Time Limit: 1.0 second
Memory Limit: 16 MB
Memory Limit: 16 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
212
995645335
dp,记录每i个方块,末尾有j个块的状态
(设置为double类型,可以不用贴大数相乘(但是__int64却不行
#include<cstdio>double f[501][501], sum[501];int main(){int i, j, k, n;scanf("%d", &n);for (i=0; i<501; i++)for (j=0; j<501; j++)f[i][j] = 0;for (i=0; i<501; i++)sum[i] = 0;for (i=1; i<n; i++)f[i][i] = 1;for (i=3; i<=n; i++)for (j=1; j<i; j++){for (k=1; k<j; k++)f[i][j] += f[i-j][k];sum[i] += f[i][j];}printf("%.0f\n", sum[n]);}
- 1017. Staircases
- Timus 1017. Staircases
- ural 1017. The Staircases
- Ural 1017. Staircases
- URAL 1017. Staircases
- ural 1017. Staircases
- ural 1017. Staircases DP
- Staircases
- Staircases
- ural 1017. Staircases(dp)
- URAL 1017. Staircases 解题报告
- URAL 1017. Staircases(递推)
- Timus 1017. The Staircases(转)
- UVa - 1017. Staircases 动态规划法 题解
- ural 1017. Staircases(dp数的划分)
- zoj1163The Staircases
- JOJ 1026 The staircases
- 1026: The Staircases
- flex中使用json格式
- 《A Simple IOCP Server/Client Class》整改
- 2012年C++专家进阶之五
- Function实现ALV Table 二:ALV的弹出窗口形式
- Ubuntu在3D桌面下窗口标题栏消失的解决
- 1017. Staircases
- Android-NDK开发之基础--Android JNI开发高级篇(JNI中的常用方法)
- 尝试玩玩Houdini的shop
- EXCEl 导出
- 用正则表达式分割字符串(C#扩展方法)
- C# DateTime技巧
- 开源虚拟打印机ImagePrinter
- 第十三周任务二
- Axure基本功能介绍——在原型中重新生成当前页面