题解 | #走方格的方案数#
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
import sys def f(m,n): if m == 2: return n elif n == 2: return m elif m > 1 and n > 1: return f(m-1,n)+f(m,n-1) m,n=map(int,input().split()) print(f(m+1,n+1))