///递归实现
int factorial(int a)
{
if (a == 1)
return 1;
else
return a*factorial(a-1);
}
int main()
{
int n,sum;
scanf_s("%",&n);
sum = factorial(n);
printf("%d",sum);
system("pause"); vs2013用scanf会出现警告,写代码还是直接用scanf
return 0;
}
///主函数实现
int main()
{
int n; int i = 1; int sum = 1;
scanf_s("%d", &n); //vs2013用scanf会出现警告,写代码还是直接用scanf
for (; i <= n; i++)
{
sum = sum*i;
}
printf("%d", sum);
system("pause");
return 0;
}
///函数调用
int factorial(int a)
{
int i=1;int res=1;
for (; i <= a; i++)
{
res*=i;
}
return res;
}
int main()
{
int x; int y;
scanf_s("%d", &x); vs2013用scanf会出现警告,写代码还是直接用scanf
y = factorial(x);
printf("%d", y);
system("pause");
return 0;
}
C语言实现n的阶乘(递归方法、非递归(主函数、函数调用))
最新推荐文章于 2021-12-09 23:05:34 发布