第十二周递归求爬楼梯的种数

#include<stdio.h>int main(){    unsigned long count(int n);    int n;    unsigned long m;    printf("请输入楼梯的阶数:");    scanf("%d",&n);    m=count(n);    printf("有%lu种爬楼梯的方法\n",m);    return 0;}unsigned long count (int n){    unsigned long f;    if(n==1)        f=1;    else if(n==2)        f=2;    else        f=count(n-1)+count(n-2);    return(f);}

总结：最后这步发f=count(n-1)+count(n-2);是核心