Home
Problem Set
Training
Contest
Homework
Discussion
Record
Ranking
Login
Language
English
한국어
简体中文
正體中文
#642. 走楼梯(stairs) [1*+]
ID: 642
Type: Default
1000ms
128MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
admin
Tags>
基础算法-递推
一本通
一本通2018-第三章-递推算法
走楼梯(stairs) [1*+]
说明
走楼梯(stairs)
【问题】有一楼梯共n级如规定每次只能跨上一级或两级要登上第n级共有多少种不同走法?
【输入】n 【输出】走法总
提示
n<=36
Source
基础算法-递推 一本通 一本通2018-第三章-递推算法
Login to Submit
Discussions (0)
Solutions (1)
Files
Statistics
CLOSE
SIGN IN
Using your 小彩虹 universal account
Username
Password
Remember me
Forgot password or username?