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