Pagini recente » Cod sursa (job #2005487) | Cod sursa (job #2188082) | Cod sursa (job #40764) | Cod sursa (job #303338) | Cod sursa (job #2842874)
#include <iostream>
using namespace std;
int p,m=0,n=-1;
int f(int x)
{
int nr = 0, pwr = 5;
while(x>=pwr)
{
nr += x / pwr;
pwr *= 5;
}
return nr;
}
int main()
{
ifstream k("fact.in");
ofstream g("fact.out");
int p;
k >> p;
int st = 1;
int dr = 2000000;
int m = 0, n = -1;
while (st <= dr)
{
m = (st + dr) / 2;
if (f(m) == p) {
n = m;
dr = m - 1;
}else if (f(m) < p) {
st = m + 1;
}else dr = m - 1;
}
g << n;
}