Pagini recente » Cod sursa (job #1321824) | Cod sursa (job #3192685) | Cod sursa (job #1768162) | Cod sursa (job #2699044) | Cod sursa (job #2000274)
#include <iostream>
#include <fstream>
using namespace std;
int p,l,r,m;
int vczalf(int n)
{
int k=0;
while(n>0){k+=n/5; n/=5;}
return k;
}
int main()
{
ifstream fin ("fact.in");
ofstream fout ("fact.out");
fin>>p;
l=1;
r=500000000;
int best=-1;
while(l<r)
{
m=(l+r)/2;
if(vczalf(m)>=p){best=m;r=m-1;}
else l=m+1;
}
if(vczalf(best)==p)fout<<best;
else fout<<"-1";
return 0;
}