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