(1)方法1:迭代循环
int main()
{
int n = 0;
scanf("%d", &n);
int i = 0;
int ret = 1;
for (i = 1; 1 <= n; i++)
{
ret = ret * i;
}
printf("%d\n", ret);
return 0;
}
(2)方法2:递归
int Fac(int n)
{
if (n <= 1)
return 1;
else
return n * Fac(n - 1);
}
int main()
{
int n = 0;
scanf("%d", &n);
int ret = Fac(n);
printf("%d\n", ret);
return 0;
}