题解 | #走方格的方案数#
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
def f(m,n): if m ==0 or n==0: return 1 else: return f(m-1,n)+f(m,n-1) print(f(*list(map(int,input().strip().split()))))
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
def f(m,n): if m ==0 or n==0: return 1 else: return f(m-1,n)+f(m,n-1) print(f(*list(map(int,input().strip().split()))))
相关推荐