第十二周 求数的阶乘（递归算法）

#include  <iostream>using namespace std;long  fac(int);int main(){    int n;    long x;    cout<<"输入需求的递归数值：";    cin>>n;    x=fac(n);    cout<<n<<"!="<<x<<endl;    return 0;}long fac(int n){    long m;    if(n==0)        m=0;    else if    (n<0)        cout<<"负数有错哦，给你个大嘴巴，啪！";    else if(n==1)        m=1;    else        m=fac(n-1)*n;    return m;

<img src="http://img.blog.csdn.net/20141116211326918?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvaHVhbmd5b25nMDAw/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />}