Pagini recente » Cod sursa (job #729308) | Cod sursa (job #2862494) | Cod sursa (job #101712) | Borderou de evaluare (job #2771567) | Cod sursa (job #2493311)
#include <iostream>
#include <fstream>
using namespace std;
int zero (int x)
{
if(x==0) return -1;
else
{
int nr, p;
nr=0;
p=5;
while(x/p!=0)
{
nr=nr+x/p;
p=p*5;
}
return nr;
}
}
int main()
{
ifstream fin ("fact.in");
ofstream fout ("fact.out");
int n, p, u, mij, aux, aux2;
bool ok;
fin>>n;
p=1;
u=10000000;
ok=0;
while(p<=u && ok==0)
{
mij=(p+u)/2;
aux=zero(mij);
aux2=zero(mij-1);
if(aux==n && aux2<n) ok=1;
else if(aux<n) p=mij+1;
else if(aux>n || aux2>=n) u=mij-1;
}
if(ok==1) fout<<mij;
else fout<<-1;
}