题解 | #走方格的方案数#
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
#include <stdio.h>
int f(int m,int n){
if(m==0 ||n==0) return 1;
else return f(m-1,n)+f(m,n-1);
}
int main(){
int m,n,x;
scanf("%d %d", &m, &n);
x=f(m,n);
printf("%d",x);
}
