算法如功夫,套路练久了,才干应用自如!
学功夫不能死练,知其所以然,取长补短!
#include <iostream.h>
int main(int argc, char* argv[])
{
unsigned long fac(unsigned int n);
unsigned int n;
unsigned long y;
cout<<"输入一个正整数:";
cin>>n;
y=fac(n);
return 0;
}
unsigned long fac(const unsigned int n)
{
unsigned long f;
if(n==0)
f=1;
else
f=(n-1)*n; //递归调用
return(f);
}