Pagini recente » algoritmiada-2019/runda-maraton/solutii/niciomare | Cod sursa (job #1077025) | Cod sursa (job #3236469) | Cod sursa (job #911031) | Cod sursa (job #1244045)
#include <iostream>
#include <cstdio>
using namespace std;
long long p;
long long nr (long long x)
{
long long s=0;
for ( int i = 5 ; i <= x ; ++i )
s=s+x/i;
return s;
}
int main()
{
freopen ("fact.in" , "r" , stdin );
freopen ("fact.out" , "w" , stdout );
scanf ("%d" , &p );
long long st=1,sol=-1;
long long dr=10000007;
while (st<=dr)
{
long long mij=(st+dr)/2;
long long k=nr(mij);
if (k>p)
dr=mij-1;
else if (k<p)st=mij+1;
else if (k==p){
sol=mij;
break;
}
}
while (sol>=0 and sol%5!=0)
sol--;
if (sol==0)
sol=1;
printf ("%d" , sol );
return 0 ;
}