Pagini recente » Cod sursa (job #124473) | Cod sursa (job #2141063) | Cod sursa (job #851628) | Cod sursa (job #1873245) | Cod sursa (job #2168733)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long n, p;
int ZeroSf(int x)
{
int nr = 0;
while(x)
{
nr += x/5;
x/=5;
}
return nr;
}
int cauta(int st, int dr)
{
int mid, sol = -1;
for(int i = st;i <=dr;i++)
if(ZeroSf(i)==n)
return i;
return sol;
}
int main()
{
f>>n;
if(n!=0)
g<<cauta(0, n*5 + 5);
else g<<1;
}