非递归求n阶乘

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int Factoria(int n)
{
int mul = 1;
if (n == 0)
{
return 1;
}
else{
for (int i = n; i > 0; i–)
{
mul *= i;
}
}
return mul;
}
int main()
{
int n = 0;
scanf("%d", &n);
printf("%d\n",Factoria(n));
system(“pause”);
return 0;
}