阶乘。

// Deamo11_2 an example of recursion via factorial

#define WIN32_LEAN_AND_MEAN

#include <iostream>
using namespace std;

int Factorial(int n);

int Factorial(int n)
{
	if(n==0||n==1)
		return 1;
	if(n<0)
		return -1;
	return (n*Factorial(n-1));
}

void main(void)
{
	while(1)
	{
		int num;
		cout<<"Enter number to compute factorial of:"<<endl;
		cin>>num;
		cout<<"The result is->"<<Factorial(num)<<endl;
	}
}

　　

转载于:https://www.cnblogs.com/mengjiangtao/archive/2013/06/09/3129203.html