Pagini recente » Cod sursa (job #669422) | Borderou de evaluare (job #1444897) | Borderou de evaluare (job #194807) | Cod sursa (job #742239) | Cod sursa (job #1750903)
#include <cstdio>
using namespace std;
int n;
int legen(int x){
int sol=0;
while(x){sol+=x;x=x/5;}
return sol;
}
int main()
{
freopen("fact.in", "r", stdin);
freopen("fact.out", "w", stdout);
scanf("%d", &n);
if(n==0) {printf("1");return 0;}
int st=1,dr=100000000/5;
while(st+1<dr){
int mij=(st+dr)/2;
if(legen(mij)>=n)dr=mij;
else st=mij;
}
if(legen(st)==n){printf("%d", st*5);return 0;}
if(legen(dr)==n) {printf("%d", dr*5);return 0;}
printf("-1");
return 0;
}