Pagini recente » Cod sursa (job #1998575) | Cod sursa (job #1681240) | Cod sursa (job #2468032) | Cod sursa (job #93041) | Cod sursa (job #2154090)
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p, n=1220703125;
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()
{
f>>p;
int n=cauta(p);
if(nr0(n)==p)
g<<n;
else g<<-1;
return 0;
}