Pagini recente » Cod sursa (job #2363933) | Cod sursa (job #1882957) | Cod sursa (job #2444175) | Cod sursa (job #525421) | Cod sursa (job #1260807)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("fact.in");
ofstream g ("fact.out");
long long n,p,ls,ld;
int nz (int n)
{
int k=n,p=5;
while (p<=n)
{
k+=n/p;
p=p*5;
}
return k;
}
int main()
{
int h;
f>>p;
if (p!=0)
{
ls=1;
ld=1000000000;
int sw=0;
while (ls<=ld&&!sw)
{
h=nz((ls+ld)/2);
if (p>h) ls=(ls+ld)/2+1;
else if (p<h) ld=(ls+ld)/2-1;
else
{
g<<((ls+ld)/2)*5;
sw=1;
}
}
if (sw==0) g<<-1;
}
else g<<1;
return 0;
}