Pagini recente » Cod sursa (job #591619) | Cod sursa (job #591627) | Cod sursa (job #3320468) | Cod sursa (job #1171339) | Cod sursa (job #1452519)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n,p;
int fs(int n)
{
int rez=0,p5=5;
while(n>=p5)
{
rez=rez+n/p5;
p5=p5*5;
}
return rez;
}
int main()
{
int i;
f>>p;
int st=1,dr=500000000;
while(st<=dr)
{
int mij=(st+dr)/2;
if(fs(mij)<p)
st=mij+1;
else
dr=mij-1;
}
if(fs(st)==p)
g<<st;
else
g<<"-1";
return 0;
}