Pagini recente » Cod sursa (job #2670849) | Cod sursa (job #476934) | Cod sursa (job #1206170) | Cod sursa (job #678825) | Cod sursa (job #2169671)
#include <iostream>
#include <fstream>
using namespace std;
const int L=28;
int n,p,i;
int nrzero(int n)
{
int nr0=0;
while (n>=5)
{
nr0+=n/5;
n/=5;
}
return nr0;
}
int caut2(int p)
{
int r=0,pas=1<<L;
while (pas!=0)
{
if (nrzero(r+pas)<p)
{
r+=pas;
}
pas/=2;
}
r++;
if (nrzero(r)!=p)
return -1;
return r;
}
int main()
{
ifstream in ("fact.in");
ofstream out ("fact.out");
in>>n;
//for (int i=0;i<=n;i++)
// f>>v[i];
// for (int i = 1;i <= n;i++)
out<<caut2(n);
return 0;
}