递归和递推求阶乘

来源:互联网 发布:阿里云dns解析怎么用 编辑:程序博客网 时间:2024/06/06 00:48

#include <stdio.h>int main(){int sum=1;int n,i;while(scanf("%d",&n)!=EOF){for(i=2;i<=n;i++){sum=sum*i; } printf("%d! = %d\n",n,sum); } return 0; } 



#include <stdio.h>int factorial(int x);int main(){int n;while(scanf("%d",&n)!=EOF){printf("%d! = %d\n",n,factorial(n)); } return 0; }int factorial(int x){if(x==0)return 1;elsereturn (x*factorial(x-1)); } 




0 0
原创粉丝点击