Dev - C++ - Factorial recursivo usando un procedimiento

int factorial (int n)

{

	if(n==0)

	return 1;

	else

	return n * factorial (n-1);

}

void factorial (int n, int &f)

{	int x;

	if(n==0)

	f=1;

	else

	f=n*factorial(n-1,f);

}

int FactorialRecursivo( int n ) {

    if (n <= 1)

        return 1;

     else

        return n * FactorialRecursivo( n-1 );

}

#include <iostream>

#include <cstdlib>

using namespace std;

void factorial(int,  long int &);

int main() {

  long int f = 1;

  factorial(5, f);

  cout<<f<<endl;

  return EXIT_SUCCESS;

}

void factorial(int n, long int &fact) {

 if(n > 1) {

   fact *= n;

   factorial(n-1, fact);

 }

}