//递归法求n!
#include<stdio.h>
double fact(int n);
int main(void)
{
int n;
scanf("%d",&n);
printf("%f",fact(n));
return 0;
}
double fact (int n)
{
double result;
if(n1||n0)
result=1;
else
result=n*fact(n-1);
return result;
}
//递归法求n!
#include<stdio.h>
double fact(int n);
int main(void)
{
int n;
scanf("%d",&n);
printf("%f",fact(n));
return 0;
}
double fact (int n)
{
double result;
if(n1||n0)
result=1;
else
result=n*fact(n-1);
return result;
}