Pagini recente » Cod sursa (job #2126505) | Cod sursa (job #2126346) | Cod sursa (job #2690421) | Cod sursa (job #2683723) | Cod sursa (job #2183107)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int p,n=100000000;
int nr0(int n)
{
int x=0;
while(n)
{
x+=n/5;
n/=5;
}
return x;
}
int cauta(int p)
{
int s=1, d=n, m, N=-1;
while(s<=d)
{
m=(s+d)/2;
if(nr0(m)>=p)
{
N=m;
d=m-1;
}
else s=m+1;
}
return N;
}
int main()
{
fin>>p;
int n=cauta(p);
if(nr0(n)==p)
fout<<n;
else fout<<-1;
return 0;
}