Pagini recente » Cod sursa (job #1538000) | Cod sursa (job #2503298) | Cod sursa (job #478190) | Cod sursa (job #1313001) | Cod sursa (job #1450915)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long zero(long long n)
{
int nr=0;
while(n>=5)
{
nr+=n/5;
n/=5;
}
return nr;
}
int main()
{
long long p;
f>>p;
if( p == 0)
{ g<<1;
return 0;
}
long long mij;
long long dr = 1<<30; // 2^30
long long st = 0;
int ok = 0;
while(st<=dr)
{
mij =(st+dr)/2;
if( zero(mij) == p)
{
ok = 1;
break;
}
if( zero(mij) > p )
dr = mij - 1;
if( zero(mij) < p )
st = mij + 1;
}
if(ok == 0)
g<<-1;
else
g<< mij - mij%5;
g.close();
return 0;
}