Pagini recente » Cod sursa (job #889358) | Cod sursa (job #1915689) | Cod sursa (job #2196641) | Cod sursa (job #214832) | Cod sursa (job #397677)
Cod sursa(job #397677)
#include<stdio.h>
#include<math.h>
long int functie(long int n)
{
long int s=0;
long int i=1;
while(pow(5,i)<=n)
{
s=s+n/pow(5,i);
i++;
}
return s;
}
int main()
{
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
long int nr,n,m,in=1,sf=1000000000,gasit=0,x;
scanf("%ld",&nr);
for(n=in;n<=sf;n++)
{
m=(in+sf)/2;
if(functie(m)==nr)
{
printf("%ld\n",m);
gasit=1;
break;
}
else
{
if(functie(m)<nr)
{
in=m+1;
}else
{
sf=m-1;
}
}
}
if(gasit==0)
{
printf("-1");
}
return 0;
}