Pagini recente » Borderou de evaluare (job #2266695) | Borderou de evaluare (job #2420383) | Borderou de evaluare (job #2879021) | Borderou de evaluare (job #1021873) | Cod sursa (job #1026089)
#include <stdio.h>
#include <stdlib.h>
/*
int factorial(int x)
{
int x_fact = 1;
int i;
for (i=1 ; i<=x ; i++)
x_fact = x_fact * i;
return x_fact;
}
*/
int divizori (int num, int div)
{
int stop = 0, nr_div =0;
do
{
if ((num % div) == 0)
{
num = num / div;
nr_div += 1;
//printf ("%d",num);
}
else
stop = 1;
}
while (stop != 1);
return nr_div;
}
int factorial (int x)
{
int i,contor=0;
for (i=1 ; i<10000 ; i++)
{
contor += divizori(i,5);
if (contor == x)
break;
}
return i;
}
FILE *fin, *fout;
int main()
{
int x;
fin = fopen("fact.in","r");
fout = fopen("fact.out","w");
fscanf(fin, "%d",&x);
// printf("%d",factorial (x));
fprintf(fout,"%d",factorial (x));
fclose(fin);
fclose(fout);
return 0;
}