Pagini recente » Cod sursa (job #2535943) | Cod sursa (job #1497236) | Cod sursa (job #1017660) | Cod sursa (job #1917093) | Cod sursa (job #2419048)
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long st, dr, mid, sol, i, n;
int zero(int x){
int number_of_zeros = 0;
while(x / 5 != 0){
x = x / 5;
number_of_zeros += x;
}
if(number_of_zeros > n)
return 1;
else if(number_of_zeros == n)
return -1;
return 0;
}
int main()
{ f >> n;
st = 1; dr = 5 * n; sol = 1;
while(st <= dr){
mid = (st + dr) / 2;
int answer = zero(mid);
if(answer != 0){
sol = mid;
dr = mid - 1;
}
else
st = mid + 1;
}
if(zero(sol) == -1)
g << sol;
else
g << -1;
return 0;
}