题解 | 走方格的方案数
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
def func(n, m):
if n < 0 or m < 0:
return 0
elif n == 0 or m == 0:
return 1
else:
return func(n-1, m) + func(n, m-1)
while True:
try:
a, b = [int(i) for i in input().split()]
res = func(a, b)
print(res)
except:
break
