Pagini recente » Cod sursa (job #3264) | Cod sursa (job #56297) | Cod sursa (job #3175013) | Cod sursa (job #26180) | Cod sursa (job #1002635)
#include <cstdio>
#include <iostream>
using namespace std;
inline void Solve()
{
int p,st,dr,mij,k,mult;
FILE *f = fopen("fact.in","r");
FILE *g = fopen("fact.out","w");
fscanf(f,"%d ",&p);
fclose(f);
if ( !p ) {
fprintf(g,"%d",1);
return ;
}
st=1;dr=500000000;
while( st<=dr )
{
mij = (st+dr)/2;
mult = 5;
k = 0;
while( mult <= mij )
{
k += mij/mult;
mult *=5;
}
if( k== p)break;
if( k >p )
dr = mij-1;
else
st = mij+1;
}
mij = mij - mij%5;
if(st<=dr)
fprintf(g,"%d ",mij);
else
fprintf(g,"%d ",-1);
fclose(g);
}
int main()
{
Solve();
return 0;
}