Pagini recente » Cod sursa (job #51951) | Cod sursa (job #2755716) | Cod sursa (job #2875301) | Cod sursa (job #1270700) | Cod sursa (job #3232646)
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int p;
long long countZeros(long long n)
{
long long put=5;
long long cnt=0;
while(n>=put){
cnt+=n/put;
put*=5;
}
return cnt;
}
long long cautareBinara()
{
long long x=0;
int l=0;
long long r=p*5;
while(l<=r){
x=(l+r)/2+1;
if(x==r&&countZeros(x)!=p){
return 0;
}
if(countZeros(x)<p){
l=x;
}
else if(countZeros(x)>p){
r=x;
}
else{
return x;
}
}
}
int main()
{
fin >> p;
int a = cautareBinara();
if(a==0){
fout << -1;
}
else if(a<5){
fout << 1;
}
else{
fout << a/5 * 5;
}
return 0;
}