C++每日一练（1递归函数）9.30

#include <iostream>

using namespace std;

// 本程序用递归算法求n的阶乘
int counter=1;

int fac(int n)
{
    cout<<"第"<<counter<<"次调用："<<n<<" * "<<"fac("<<n-1<<")"<<endl;
    if (n==1) {
        return 1;
    }
    else
    { 
        counter++;
        return n * fac(n-1); // 断点1
    }
}

int main()
{ 
    int n;
    cout<<"请输入求n的阶乘的n值：";
    cin>>n;
    cout<<"结果：fac("<<n<<")="<<fac(n)<<endl;
}