Pagini recente » Cod sursa (job #2000722) | Cod sursa (job #825068) | Cod sursa (job #1646134) | Cod sursa (job #672950) | Cod sursa (job #736460)
Cod sursa(job #736460)
#include<fstream>
#include<math.h>
using namespace std;
int nr0(long long n)
{
long long o=0;
float i=1;
while(pow(5,i)<=n)
{
o+=n/pow(5,i);
i++;
}
return o;
}
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
long long p,inc,sf,j;
f>>p;
if(p==0)
g<<1;
else
{
inc=4*p;
sf=5*p;
while(inc<sf)
{
j=(inc+sf)/2;
if(nr0(j)>=p)
sf=j;
else inc=j+1;
}
j=(inc+sf)/2;
if(nr0(j)==p) g<<j;
else g<<-1;
}
}