Pagini recente » Cod sursa (job #1610013) | Profil morcovelpufu | Cod sursa (job #149563) | Cod sursa (job #1000766) | Cod sursa (job #2218330)
#include <bits/stdc++.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long P, dr, step, i;
long long zero(long long n) {
int sum = 0;
for(int put = 5; put <= n; put *= 5)
sum += n / put;
return sum;
}
int main()
{
f >> P;
dr = 5 * P;
for(step = 1; step < dr; step <<= 1);
for(i = 1; step; step >>= 1) {
if(i + step <= dr && zero(i + step) <= P) {
i += step;
}
}
while(zero(i) == P && i >= 1) i--;
i++;
g << i << "\n";
return 0;
}