Pagini recente » Cod sursa (job #2191619) | Cod sursa (job #2647462) | Cod sursa (job #1070184) | Cod sursa (job #2044836) | Cod sursa (job #492225)
Cod sursa(job #492225)
#include <stdio.h>
#include <string.h>
#include <math.h>
int p, t;
//--------------------------------
void read()
{
freopen("fact.in", "rt", stdin);
scanf("%d", &p);
}
//--------------------------------
int nbz(int n)
{
int s;
for(s=0; n > 1; n/=5)
s += n/5;
return s;
}
//--------------------------------
int search(int x, int y)
{
if(x == y)
return (nbz(x)==p? x: -1);
int m = (x+y)/2;
if(nbz((x+y)/2) < p)
return search(m+1, y);
return search(x, m);
}
//--------------------------------
void solve()
{
if(p > 0)
p = search(1, 1<<30);
else p = 1;
}
//--------------------------------
void print()
{
freopen("fact.out", "wt", stdout);
printf("%d", p);
}
//--------------------------------
int main(void)
{
read();
solve();
print();
return 0;
}