2021-01-19

Factorial!You Must be Kidding!!!

#include <stdio.h>
const long long Fact1=10000,Fact2=6227020800;
const int N=13;
long long F[N+1];
int main(){
int n,i;
while(~scanf("%d",&n)){
for(i=1;i<=n;i++){
F[0]=1;
F[i]=i*F[i-1];
}
if(n>N || (n<0 && (-n)%2 == 1))
printf(“Overflow!\n”);
if(n<8 || (n<0&&(-n)%2 == 0))
printf(“Underflow!\n”);
else if(n>=8&&n<=13)printf("%ld",F[n]);
}
return 0;
}