如题所述
#include <stdio.h>
#include <stdlib.h>
#typedefine Type (long long )
Type fun(Type num)
{
if(num < 0)
return -1;
if(num == 0 || num == 1)
return num;
else
return fun(num - 1) * num;
}
int main()
{
Type n = 0;
printf("Please input the number\n");
scanf("%ld", n);
printf("%ld\n", fun(n)); // -1 means error
return 0;
}
#include <stdlib.h>
#typedefine Type (long long )
Type fun(Type num)
{
if(num < 0)
return -1;
if(num == 0 || num == 1)
return num;
else
return fun(num - 1) * num;
}
int main()
{
Type n = 0;
printf("Please input the number\n");
scanf("%ld", n);
printf("%ld\n", fun(n)); // -1 means error
return 0;
}
温馨提示：答案为网友推荐，仅供参考
第1个回答 2010-12-28
n不能太大，太大会溢出
#include <stdio.h>
#include <stdlib.h>
main()
{int n;
long f(int x);
scanf("%d",&n);
printf("%ld",f(n));
system("PAUSE");
}
long f(int x)
{ if(x==1)return(1);
else return(f(x-1)*x);
}本回答被网友采纳
#include <stdio.h>
#include <stdlib.h>
main()
{int n;
long f(int x);
scanf("%d",&n);
printf("%ld",f(n));
system("PAUSE");
}
long f(int x)
{ if(x==1)return(1);
else return(f(x-1)*x);
}本回答被网友采纳
第2个回答 2010-12-28
#include "math.h"
int f( int );
main()
{ int x;
printf("Enter a integer number:");
scanf("%d",&x);
int y=f(x);
printf("%d is prime\n",y);
}
f(int n)
{
int a=n;
while(a>1){
n=n*(a-1);
a--;
}
return n;
}
试试行不行吧。。
int f( int );
main()
{ int x;
printf("Enter a integer number:");
scanf("%d",&x);
int y=f(x);
printf("%d is prime\n",y);
}
f(int n)
{
int a=n;
while(a>1){
n=n*(a-1);
a--;
}
return n;
}
试试行不行吧。。
