//递归
//求阶乘
#include<iostream>
using namespace std;
int Factorial(int n){
if(0==n){
return 1;
}
return n*Factorial(n-1);
}
int main(){
cout<<Factorial(3)<<endl;
return 0;
}
//求阶乘
#include<iostream>
using namespace std;
int Factorial(int n){
if(0==n){
return 1;
}
return n*Factorial(n-1);
}
int main(){
cout<<Factorial(3)<<endl;
return 0;
}