Pagini recente » Cod sursa (job #2713187) | Istoria paginii runda/pre_oji_2011/clasament | Cod sursa (job #2627972) | Cod sursa (job #834422) | Cod sursa (job #1167149)
#include <iostream>
#include <stdio.h>
using namespace std;
int check (int n)
{
int p=5;
int rez=0,r=1;
while (r)
{
r=n / p;
p=p*5;
rez+=r;
}
return rez;
}
int main()
{
int n;
FILE *f = fopen("fact.in","r");
FILE *g = fopen("fact.out","w");
fscanf(f, "%d", &n );
int l=1;
int r =100000000;
int rez=-1;
while (l<r)
{
int m = (l+r)/2;
if (check(m)>=n)
r = m;
else if (check(m)<n)
l = m+1;
}
if (check(r)==n) rez=l;
fprintf(g,"%d\n",rez);
return 0;
}