Pagini recente » Cod sursa (job #1938276) | Cod sursa (job #1440873) | Cod sursa (job #3120607) | Cod sursa (job #2932464) | Cod sursa (job #2276241)
#include <cstdio>
using namespace std;
int f(int p)
{
int k = p/5,x=1,rez;
while(k >= 5*x)
x++;
rez = k + x - 1;
return rez;
}
long long bs(int p)
{
long long st=1,dr=10e8;
while(st <= dr)
{
long long m = (st + dr)/2;
if(f(m) < p)
st = m + 1;
else
{
if(f(m) > p)
dr = m - 1;
else
return m/5*5;
}
}
return -1;
}
int main()
{
long long p;
FILE *F = fopen("fact.in","r");
FILE *g = fopen("fact.out","w");
fscanf(F,"%lld",&p);
if(p != 0)
fprintf(g,"%lld",bs(p));
else
fprintf(g,"1");
return 0;
}