Pagini recente » Cod sursa (job #2677169) | Cod sursa (job #554700) | Cod sursa (job #1225097) | Cod sursa (job #2973880) | Cod sursa (job #2475447)
#include <iostream>
#include <fstream>
using namespace std;
long verf(long n)
{
long rez=0;
while(n)
{
rez=rez+n/5;
n=n/5;
}
return rez;
}
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
long long n,m,st=1,dr=999999999,gasit=0,nr;
f>>n;
if(n==0)
g<<1;
else
{
while(st<=dr && gasit==0)
{
m=(st+dr)/2;
if(verf(m)==n)
{
gasit=1;
nr=m;
}
else
{
if(verf(m)<n)
st=m+1;
else
dr=m-1;
}
}
if(gasit==0)
g<<-1;
else
{
while(verf(nr)==n)
nr--;
nr++;
g<<nr;
}
}
return 0;
}