2.1设计求n!(n为正整数)的递归算法

# include <iostream>  
using  namespace std; 
int f(int n){
  if(n == 1)
    return 1;
  else
    return n * f(n-1); 
} 
int main(){
  int n;
  cout << "请输入一个整数：N" << endl;
  cin>>n;
  cout << f(n) << endl; 
  return 0; 
}