Cod sursa(job #2470714)
Utilizator | Nicolae Antonio Cristian hax_m8 | Data | 9 octombrie 2019 18:08:02 |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <cstdio>
#include <cstdlib>
FILE *f = fopen("fact.in", "r");
FILE *g = fopen("fact.out", "w");
int nr0f(int n)
{
int p5 = 5, s = 0;
while(n >= p5)
{
s += n / p5;
p5 *= 5;
}
return s;
}
int main()
{
int p, n0;
fscanf(f,"%d", &p);
int li, lf;
li = 1, lf = 2147483647;
while(li <= lf)
{
int m = (li + lf) / 2;
n0 = nr0f(m);
if(n0 >= p)
lf = m - 1;
else
li = m + 1;
}
if(nr0f(li) == p)
{
fprintf(g, "%d", li);
}
else
{
fprintf(g, "-1");
}
return 0;
}