Pagini recente » Cod sursa (job #3136205) | oni10_2013 | %round_id% | Cod sursa (job #1301077) | Cod sursa (job #1273432)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p,st,dr,xi,m,nr;
int verif(int m)
{
int i=5,x=0;
while(i<=m)
{
x=x+m/i;
i=i*5;
}
return x;
}
int cautare(int st, int dr)
{
if(st>dr) return -1;
m=(st+dr)/2;
nr=verif(m);
if(nr<p) return cautare(m+1,dr);
if(nr>p) return cautare(st,m-1);
while(m%5!=0) m--;
return m;
}
int main()
{
f>>p;
if(p==0) g<<1;
else g<<cautare(1,900000000);
return 0;
}