Pagini recente » Diferente pentru problema/dep intre reviziile 2 si 1 | Cod sursa (job #2411656) | Cod sursa (job #1010851) | Cod sursa (job #2234088) | Cod sursa (job #1312772)
#include <stdio.h>
long int zero(int n)
{
long int p=0;
while(n>=5)
{
p+=n/5;
n/=5;
}
return p;
}
int main()
{
long p,k=0,n=1,u=1;
FILE *in = fopen("factorial.in","r");
FILE *out = fopen("factorial.out","w");
fscanf(in,"%ld",&p);
//printf("%ld\n",zero(p));
while(1)
{
if(zero(n)==p)
break;
n++;
}
fprintf(out,"%ld\n",n);
return 0;
}