题解 | 走方格的方案数
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
import sys
def road(n,m):
if n ==1 and m ==1:
return 2
elif n==1 and m>1:
return road(n,m-1)+1
elif n>1 and m==1:
return road(n-1,m)+1
else:
return road(n-1,m)+ road(n,m-1)
n,m = map(int,input().split())
print(road(n,m))
查看6道真题和解析
