标签：scan include turn can class div main 算法 return
//未名湖边的烦恼
//递归
#include<stdio.h>
int fun(int m,int n){
if(m<n) //还鞋数小于租鞋数
return 0;
if(n==0)
return 1;
return (fun(m-1,n) + fun(m,n-1));
}
int main(){
int m,n;
scanf("%d%d",&m,&n);
int num = fun(m,n);
printf("%d",num);
return 0;
}
标签：scan include turn can class div main 算法 return
原文地址：https://www.cnblogs.com/Hqx-curiosity/p/12243151.html
