Pagini recente » Cod sursa (job #2982363) | Istoria paginii runda/oni2014_ziua1 | Cod sursa (job #2463296) | Cod sursa (job #429665) | Cod sursa (job #2183093)
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
long long zero(int n)
{
long long i=5,S=0;
while(i<=n)
{
S+=n/i;
i*=5;
}
return S;
}
long long cautare(int st,long long dr,int p)
{
if(p==0)
return 1;
long long ok=0,m,val_m,i;
while(st<=dr && !ok)
{
m=(st+dr)/2;
val_m=zero(m);
if(p<val_m)
dr=m-1;
else if(p>val_m)
st=m+1;
else ok=1;
}
if(ok==1)
{
for(i=m;i%5!=0;i--);
return i;
}
return -1;
}
int main()
{
int p;
fin>>p;
fout<<cautare(1,5000000000,p);
return 0;
}