Pagini recente » Cod sursa (job #3241986) | Cod sursa (job #3223442) | Cod sursa (job #3272020) | Cod sursa (job #2319659) | Cod sursa (job #811303)
Cod sursa(job #811303)
#include<stdio.h>
int zero(int n)
{
int s=0,p=5;
while(n>=p)
{
s+=n/p;
n/=p;
}
return s;
}
long long caut(int p)
{
long long i,pas=1<<30;
for(i=0;pas!=0;pas/=2) // pas>>=1;
if(zero(i+pas)<p)
i+=pas;
return i+1;
}
int main()
{
int p;
long long n;
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%d",&p);
n=caut(p);
if(zero(n)==p)
printf("%d",n);
else printf("-1");
return 0;
}