题目描述 楼梯有N阶,上楼可以一步上一阶,也可以一步上二阶. 编一个程序,计算共有多少种不同的走法. 输入格式 一个数字,楼梯数. 输出格式 走的方式几种. 输入输出样例 输入 #1 4 输出 #1 5 说明/提示 60% N<=50100% N<=5000) 废话不说,先上代码.(亲测无毒,放心食用) a = [] for i in range(10000): a.append(0) a[1]=1 a[2]=2 n = int(input()) for i in range(3,n+1):
Problem Description The "Harry Potter and the Goblet of Fire" will be on show in the next few days. As a crazy fan of Harry Potter, you will go to the cinema and have the first sight, won’t you? Suppose the cinema only has one ticket-office and