Pagini recente » Cod sursa (job #2800834) | Cod sursa (job #3320035) | Cod sursa (job #440655) | Cod sursa (job #2299083) | Cod sursa (job #3311575)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int main()
{
long long P;
fin >> P;
if (P==0)
{
fout << "1" << endl;
}
else {
long long left = 1, right = 5 * P;
long long answer = -1;
while (left <= right)
{
long long mid = (left + right) / 2;
long long count = 0;
long long divisor = 5;
while (mid / divisor > 0)
{
count += mid / divisor;
divisor *= 5;
}
if (count == P)
{
answer = mid;
right = mid - 1;
}
else
if (count < P)
left = mid + 1;
else
right = mid - 1;
}
fout << answer << endl;}
}