N的阶乘

#include<iostream>
using namespace std;
long fac(int);
int main()
{
	int n;
	long result;
	cout << "Please  input  an integer : ";
	cin >> n;
	result = fac(n);
	if (result != -1)
		cout << n << "!=" << result << endl;
	return 0;
}
long fac(int n)
{
	long f;
	if (n < 0)
	{
		cout << "Data  error !" << endl;
		return -1;

	}
	if (n == 0 || n == 1)
		f = 1;
	else
		f = n*fac(n - 1);
	return f;
}