Pagini recente » Cod sursa (job #812368) | Cod sursa (job #2479384) | Cod sursa (job #1649597) | Cod sursa (job #2556549) | Cod sursa (job #2671928)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p1;
int nr0(int n)
{
int nr = 0;
for(int i = 1;i <= n;i++)
{
int copie = i,nr5 = 0;
while(copie%5 == 0)
{
copie /= 5;
nr5++;
}
nr += nr5;
}
return nr;
}
int main()
{
f>>p1;
int ls = 0, ld = 400000015, n = (ls + ld) / 2;
while(nr0(n) != p1 && ld > ls)
{
int zero = nr0(n);
if(zero > p1)
ld = n;
else
ls = n;
n = (ls + ld)/2;
}
while(nr0(n - 1) == p1 && n > 1)
n--;
if(nr0(n) == p1)
g<<n;
else
g<<-1;
return 0;
}