Pagini recente » Cod sursa (job #1867098) | Cod sursa (job #2619074)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n;
const int maxa=1e8;
int numarare_zerouri(int n)
{
int p=5,s=0;
while(n/p)
{
s+=n/p;
p*=5;
}
return s;
}
void cautare_binara()
{
int st=1,dr=n*10,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(numarare_zerouri(mij)==n)
{
while(numarare_zerouri(mij-1)==n)
mij--;
g<<mij;
exit(0);
}
if(numarare_zerouri(mij)>n) dr=mij-1;
else st=mij+1;
}
g<<"-1";
}
int main()
{
f>>n;
if(!n)
{
g<<1;
return 0;
}
cautare_binara();
return 0;
}