Pagini recente » Cod sursa (job #723018) | Cod sursa (job #1936579) | Cod sursa (job #284578) | Cod sursa (job #572725) | Cod sursa (job #2344485)
#include <bits/stdc++.h>
using namespace std;
int put[]={1,5,25,125,625,3125,15625,78125,390625,1953125,9765625,48828125};
int p;
int verif (int n)
{
int sum=0;
for(int i=1;i<=11;++i)
{
sum+=(n/put[i]);
}
if(sum>p)
return 1;
if(sum<p)
return -1;
if(sum==p)
return 0;
}
int main()
{
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
int ans=-1;
scanf("%d",&p);
int st=1;
int dr=500000000;
if(p==0)
{
printf("1");
return 0;
}
while(st<=dr)
{
int mid=st+dr;mid/=2;
if(verif(mid)==1)
{
dr=mid-1;
}
else
if(verif(mid)==-1)
st=mid+1;
else
if(verif(mid)==0)
{
ans=mid;
dr=mid-1;
//break;
}
}
printf("%d",ans);
return 0;
}