Pagini recente » Profil Balescu_Ovidiu | Cod sursa (job #2433766) | Statistici Butnaru Vasile-Cristi (cristi00245) | Istoria paginii agora-finala/solutii | Cod sursa (job #602949)
Cod sursa(job #602949)
#include<iostream>
#include<fstream>
using namespace std;
int main(void)
{
long long p;
fstream f,g;
f.open("fact.in",ios::in);
g.open("fact.out",ios::out);
f>>p;
long long mij,dr,st;
dr=p*5+1;
st=p;
int gasit=0,min=132423465;
while (st<=dr && (gasit==3 || gasit==0))
{
mij=(st+dr)/2;
int k=5;
int zero=0;
while (mij/k!=0)
{
zero=mij/k+zero;
k=k*k;
}
if (zero==p)
{ g<<mij;
if (mij<min)
min=mij;
dr--;
gasit=3;
/*break;*/
}
else
if (zero<p)
st=mij;
else
dr=mij;
if (st==mij && dr==mij+1)
{break;}
}
if (gasit==3)
g<<min;
else
g<<-1;
}