递归方法求解n!

#include<iostream>
using namespace std;
int fac(int n)
{
  int f;
  if(n<0) cout<<"error"<<endl;
  else if (n == 0||n == 1) f = 1;
  else f = fac(n-1)*n;
  return f;
}
int main()
{

  int a ;
  cout<<"please input number:"<<endl;
  cin>>a;
  cout<<fac(a)<<endl;
  return 0;
}