19.1. Write a recursive function that gets any positive integer and returns factorial.

#include<stdio.h> 

#include<conio.h>
long Fact (int n)

{
if (n==0)

return 1;
return (long)n*Fact(n-1);

}
void main()

{
int n;
clrscr ():
printf("Enter any positive integer: ");
scanf ("%d", &n);
printf("%d!= %ld",n,Fact(n));

getch ();

}