Climbing the Hill
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1218 Accepted Submission(s): 548
Problem Description
Alice and Bob...
分类：
其他好文 时间：
2016-08-06 16:07:21
阅读次数：
378
Question：
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 climb to the top?
爬楼梯，一次只...
分类：
其他好文 时间：
2016-08-04 13:34:01
阅读次数：
130
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-08-02 13:40:23
阅读次数：
139
解题思路： 1. 两种情况，0x1:井深度小于一次跳的高度.0x2:井深度大于一次跳的高度 2.如果 属于 0x1 则一次跳出 3.否则 本次解题中直接枚举跳的次数 一直循环，直到 【每次跳的真实高度（一次高度减去滑下的高度）】*【次数（循环）】+【最后一次（一次的高度）】大于等于井深度 得到次数 ...
分类：
其他好文 时间：
2016-07-29 18:52:50
阅读次数：
135
Climbing Worm Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17029 Accepted Submission(s): 11638 ...
分类：
其他好文 时间：
2016-07-23 16:31:55
阅读次数：
118
Climbing the Hill Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u Submit Status Description Alice and Bob are playing a game c ...
分类：
其他好文 时间：
2016-06-28 22:04:40
阅读次数：
254
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-06-24 23:38:41
阅读次数：
197
Climbing Stairs 本题收获： 1.斐波那契函数f(n) = f(n-1) + f(n -2) 题目： You are climbing a stair case. It takes n steps to reach to the top. Each time you can eithe ...
分类：
其他好文 时间：
2016-06-21 15:39:48
阅读次数：
125
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-06-15 15:53:25
阅读次数：
105
题目： 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 yo ...
分类：
其他好文 时间：
2016-06-14 11:54:17
阅读次数：
162
