C++求n的阶乘
递归思想
源代码:
#include<iostream>
using namespace std;
int Factorial(int n){
if(n==1)
return 1;
else
return n*Factorial(n-1);
}
int main(){
int n,result;
cout<<"Please input a number:";
cin>>n;
result=Factorial(n);
cout<<n<<"! = "<<result<<endl;
return 0;
}
结果图: