#include <iostream>
/*
5! = 5x4*3*2*1
4! = 4x3x2x1
3! = 3*2*1
2! = 3*2*1
1! = 1*1
0! = 1
n! = n x (n-1)!
*/
long factorial(int n)
{
if(n==0)
return 1;
else
return n*factorial(n-1);
}
int main()
{
for(int i=0;i<10;i++)
{
std::cout << i <<"! = "<<factorial(i)<<std::endl;
}
return 0;
}
递归阶乘
最新推荐文章于 2022-08-14 14:21:30 发布