题解 | 递归#走方格的方案数#
走方格的方案数
http://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)
while True:
try:
m,n= list(map(int,input().split()))
print(f(m,n))
except:
break
