#include <stdio.h>
//递归策略
int count(size_t m,size_t n){
if(m==0 || n==0)
return 0;
if(m == 1 || n == 1){
return 1;
}
return count(m-1,n) + count(m,n-1);
}
#include <stdio.h>
//递归策略
int count(size_t m,size_t n){
if(m==0 || n==0)
return 0;
if(m == 1 || n == 1){
return 1;
}
return count(m-1,n) + count(m,n-1);
}