Pagini recente » Cod sursa (job #2899563) | Cod sursa (job #1778532) | Cod sursa (job #931812) | Cod sursa (job #2571277) | Cod sursa (job #1653167)
#include <fstream>
using namespace std;
long long int p,st,dr,rezultat,step,index,start;
long long int fact(long long int x)
{
long long int sol=0,put5=5;
while(put5<=x)
{
sol=sol+x/put5;
put5=put5*5;
}
return sol;
}
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
if(p==0)
g<<1;
else
{
st=1;
step=1;
dr=1000000000;
for(;dr>=step;step<<=1);
for(;step;step>>=1)
{
index=st+step;
if(index>dr)
continue;
else if(fact(index)<p)
{
st=index;
}
}
if(fact(st+1)==p)
g<<st+1;
else g<<-1;
}
}