Pagini recente » Cod sursa (job #295886) | Cod sursa (job #387707) | Cod sursa (job #2675081) | Cod sursa (job #150454) | Cod sursa (job #2203462)
#include <fstream>
#define i64 long long
using namespace std;
char const in [] = "fact.in";
char const out [] = "fact.out";
ifstream f (in);
ofstream g (out);
int p;
int lastzero (int val)
{
int power = 5 , searched = 0;
while(val / power)
{
searched += val / power;
power *= 5;
}
return searched;
}
int main()
{
f >> p;
i64 from , to , number , found;
from = 1 , to = 1e17;
while(from <= to)
{
int mid = (from + to) / 2;
number = lastzero (mid);
if(number >= p)
found = mid , to = mid - 1;
else
from = mid + 1;
}
g << found << '\n';
return 0;
}