Pagini recente » Cod sursa (job #2292186) | Cod sursa (job #31329) | Cod sursa (job #873483) | Cod sursa (job #2181553) | Cod sursa (job #12384)
Cod sursa(job #12384)
#include<fstream.h>
#include<math.h>
ifstream f("fact.in");
ofstream g("fact.out");
int t(int x)
{unsigned long y=0;
for(long i=1;i<=x&&(pow(5,y)<=x*2);i++)
y++;
return y;
}
int main()
{unsigned long n=0,p,nr=0,i;
short int ok=1;
f>>p;
f.close();
if(p==0) g<<1<<"\n";
else
while(n<=405000000&&nr<p)
{if(p-nr<30)
{if(ok){nr=nr+pow(n,1/5);ok=0;}
for(n=5;n<=405000000&&nr<p;n=n+5)
{i=n;while(i%5==0) {nr++;i=i/5; }
if(nr==p) {g<<n<<"\n";n=405000001; }
if(nr>p){g<<-1<<"\n";n=405000001;}
}
}
else{nr=nr+6;n=n+25;}
if(nr>p){g<<-1<<"\n";n=405000001;}
}
g.close();
return 0;
}