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