这是转载的老师发的答案哦,关注我,随时更新最新答案,侵权联系删
#include
#include
using namespace std;
int factorial(int);
int factorialRecursive(int);
int main(int argc, const char *argv[])
{
cout << “Factorials of 1 to 5n” << endl;
cout << “N” << std::setw(14) << “Factorial(N)” << endl;
for (int i = 1;i <= 5;i++)
{
cout << i << setw(14) << factorial(i) << endl;
}
return 0;
}
// n! = n * (n-1) * (n-2) * (n-3) * … * 1
int factorial(int n)
{
int f = 1;
for (int i = 1;i <= n;i++)
{
f = i;
}
return f;
}
/
- n! = n * (n-1) * (n-2) * (n-3) * … * 1
*/
int factorialRecursive(int n)
{
if (n >= 1)
{
return n * factorialRecursive(n - 1);
}
else
{
return 1;
}
}



