#include<stdio.h>
//递归实现n的阶乘
long fact(long n){
if(n == 0) return 1;
return (n*fact(n-1));
}
int main(){
int n;
long m;
printf("input your n:\n");
scanf("%d",&n);
m=fact(n);
printf("the answer is :%ld\n",m);
return 0;
}
#include<stdio.h>
//递归实现n的阶乘
long fact(long n){
if(n == 0) return 1;
return (n*fact(n-1));
}
int main(){
int n;
long m;
printf("input your n:\n");
scanf("%d",&n);
m=fact(n);
printf("the answer is :%ld\n",m);
return 0;
}