Pagini recente » Cod sursa (job #2129479) | Cod sursa (job #2701667) | Cod sursa (job #641342) | Cod sursa (job #1278364) | Cod sursa (job #316019)
Cod sursa(job #316019)
#include<cstdio>
using namespace std;
long long p,n,i,j,step;
int v(int a)
{
int k=0;
while(a) k+=a/5,a/=5;
return k;
}
int main()
{
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%lld",&p);
n=p*40;
for(step=1;step<=n;step<<=1);
for(i=0;step;step>>=1)
if(i+step<=n&&v(i+step)>p)
i+=step;
while(i%5) --i;
if(v(i)==p) printf("%lld\n",i);
else printf("-1\n");
fclose(stdin);
fclose(stdout);
return 0;
}