编写递归函数用于计算n! 程序流程图: 代码: #include<stdio.h> long mul(int n) { long mu; if(n==0 || n==1) mu=1; else mu=mul(n-1)*n; return mu; } void main() { int n; long m; printf("please enter n:\n"); scanf("%d",&n); if(n<=0) printf("sory!you enter a rong numbue!\n"); else { m=mul(n); printf("%d!=%ld:\n",n,m); } 结果: