C语言经典算法之傻瓜递归 include, return, C语言, 经典

苹果也疯狂

#include <stdio.h>
main()
{ int m=1,n=1,s;
s=akm(m,n);
printf("%d",s);
}
akm(int m,int n)
{ if(m==0)
   return n+1;
else if(m!=0&&n==0)
  akm(m-1,1);
else if(m!=0&&n!=0)
  akm(m-1,akm(m,n-1));
}