int facto(int num)
{
if(num==1)
return 1;
else
return(num*facto(num-1));
}
void main()
{
int num;
printf("Enter num\n");
scanf("%d",&num);
printf("Factorial is %d",facto(num));
getch();
}
long long int facto(long long int a){
int i,j;
if(a==0){
return 1;
}
else{
return a*facto(a-1);
}
}
int
facto(int n)
{
int x;
if (n == 1)
return 1;
x = n * facto(n-1);
return x;
}
static void build_cexp_series (AranLaurentSeriesd *als)
{
guint8 i;
for (i=0; i<=aran_laurent_seriesd_get_posdeg (als); i ++)
{
gcomplex128 *term = aran_laurent_seriesd_get_term (als, i);
*term = 1./facto (i);
}
}
int main(){
long long int a,i,j,k;
long long int s[12],temp,mini=0;
// printf("number of test cases\n");
scanf("%lld",&a);
while(a--){
// printf("number of batsmen to be selected\n");
for(i=0;i<11;i++){
// printf("enter runs\n");
scanf("%lld",&s[i]);
// printf("%d\t",s[i]);
}
scanf("%d",&k);
qsort(s, 11, sizeof(long long int), compare_ints);
long long int c=0,d=0;
long long int result=0;
for(i=0;i<=10;i++){
if (s[i]==s[11-k]) {
d++;
}
}
int arr[12];
for(j=0;j<k;j++){
arr[j]=s[10-j];
}
for(j=0;j<k;j++){
if(arr[j]==arr[k-1])
c++;
}
result=((facto(d))/((facto(c))*(facto(d-c))));
printf("%lld\n",result);
}
return 0;
}
int main()
{
string f = "1";
for (int i = 1; i <= 100; i++)
{
ostringstream convert;
convert << i;
facto(f, convert.str());
}
cout << "result: " << f << endl;
return 0;
}
int
main(void)
{
int *n;
long int ans;
puts ("enter a number..");
n = malloc (sizeof(int));
scanf("%d", n);
printf ("you entered.. %d\n", *n);
ans = facto(*n);
printf("factorial of %d is..%d\n", *n, ans);
return ans;
}
int main(){
int n;
scanf("%d",&n);
printf("%d\n",facto(n)-n+p(n));
return 0;
}
