Pagini recente » Cod sursa (job #1962087) | Cod sursa (job #1489132) | Cod sursa (job #2150206) | Istoria paginii runda/fdgf.g | Cod sursa (job #914948)
Cod sursa(job #914948)
#include <iostream>
#include <fstream>
using namespace std;
int v1[80000006],v3[80000006];
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
int p,i,k,nr,st,dr,mij,a,n1;
f>>nr;
n1=5*nr;
k=5;
p=0;
v3[0]=0;
for(i=1;i<n1;i++)
{
v1[i]=k;
a=v1[i];
k=k+5;
st=1;
dr=n1;
while(v1[i]%5==0)
{
p=p+1;
v1[i]=v1[i]/5;
}
v3[i]=v3[i-1]+p;
p=0;
v1[i]=a;
}
// g<<v1[3125]<<' ';
while(dr-st>2)
{
mij=(dr+st)/2;
if(nr<=v3[mij])
{
dr=mij;
}
else
{
st=mij;
}
}
if(nr==v3[st] || nr==v3[dr])g<<v1[dr]<<'\n';
else g<<"-1"<<'\n';
//g<<v3[80000005]<<'\n';
return 0;
}