Pagini recente » Cod sursa (job #3206662) | Cod sursa (job #535793) | Istoria paginii runda/oji_go_11_12_2 | Cod sursa (job #2312309) | Cod sursa (job #2427656)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("fact.in");
ofstream out ("fact.out");
const int L = 28;
int n, k, p;
int nr_zero (int n)
{
int nr=0;
while (n>0)
{
nr += (n/=5);
}
return nr;
}
int main()
{
in >> p;
int r=0, pas=1<<L;
while (pas!=0)
{
if (nr_zero(r+pas)<p)
{
r+=pas;
}
pas/=2;
}
r++;
if (nr_zero(r) != p)
{
r = -1;
}
out << r;
return 0;
}