long fac(int k)
{
long f=1;
for (int i=1;i<=k;i++)
f=f*i;
return f;
}
#include <stdio.h>#include <conio.h>long fac(int);void main()
{
int k; long result; clrscr(); scanf("%d",&k); result=fac(k); printf("%ld",result);
}long fac(int k){ long f=1; for (int i=1;i<=k;i++) f=f*i; return f;}**********************************************************************************************
用递归求n!
#include <stdio.h>#include <conio.h>long fac(int);void main(){ long y; int n; clrscr(); scanf("%d",&n); y=fac(n); printf("%d!=%ld",n,y);}long fac(int n){ long f; if (n==0) f=1; else
f=n*fac(n-1); /**//*递归调用,求(n-1)!*/ return f;}