Pagini recente » Cod sursa (job #2165220) | Cod sursa (job #1355031) | La capatul lumii | Cod sursa (job #2208372) | Cod sursa (job #1837625)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("fact.in");
ofstream out ("fact.out");
int zerouri(int a){
int p = 5 ,s = 0;
while(p <= a){
s+=(a/p);
p*=5;
}
return s;
}
int main()
{
int n ,i ,j ,st = 0 ,dr = 0,mid = 0 ,p;
in>>n;
if(n == 0){
out<<1;
return 0;
}
st = n * 4;
dr = n * 5;
mid = (st + dr)/2;
while(st<=dr){
p = zerouri(mid);
if(p == n){
out<<mid/5*5;
return 0;
}
if(p < n){
st = mid + 1;
} else{
dr = mid - 1;
}
mid = (st + dr)/2;
}
if(zerouri(mid)!=n)
out<<"-1";
else
out<<mid/5*5;
return 0;
}