You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you cli... ...
分类：
其他好文 时间：
2017-01-14 12:19:42
阅读次数：
164
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl ...
分类：
其他好文 时间：
2016-12-30 20:38:47
阅读次数：
176
#70. Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many dis ...
分类：
其他好文 时间：
2016-11-20 19:08:27
阅读次数：
198
Problem: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways c ...
分类：
其他好文 时间：
2016-11-05 09:17:16
阅读次数：
292
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl ...
分类：
编程语言 时间：
2016-10-13 02:01:40
阅读次数：
127
难度：普及- 题目类型：递推 提交次数：1 涉及知识：递推 题目描述 有N级的台阶，你一开始在底部，每次可以向上迈最多K级台阶（最少1级），问到达第N级台阶有多少种不同方式。 输入输出格式 输入格式： 输入文件的仅包含两个正整数N，K。 输出格式： 输入文件stair.out仅包括1个正整数，为不同 ...
分类：
其他好文 时间：
2016-10-06 19:29:37
阅读次数：
166
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl ...
分类：
其他好文 时间：
2016-09-16 22:53:34
阅读次数：
136
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl ...
分类：
其他好文 时间：
2016-09-15 13:48:26
阅读次数：
116
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl ...
分类：
其他好文 时间：
2016-09-15 13:37:24
阅读次数：
116
70. Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many dist ...
分类：
其他好文 时间：
2016-09-09 23:43:00
阅读次数：
163
