迭代法求N的阶乘

#include

int fact(int n){
if(n==0||n==1)
return 1;
while(n>1)
return n*fact(n-1);

}
main(){
int n;
scanf("%d",&n);
printf("%d",fact(n));
getch();

}

#include


/* run this program using the console pauser or add your own getch, system("pause") or input loop */


    long fact (long n){
long fac,i;
   for (fac=1,i=1;i<=n;i++)
  fac*=i;
   return fac;
  }
   int main(int argc, char *argv[]) {
    int n;
    scanf("%d",&n);
    printf("%d",fact(n));
return 0;
   }