Pagini recente » Cod sursa (job #2467719) | Cod sursa (job #2612448) | Cod sursa (job #957357) | Cod sursa (job #1790991) | Cod sursa (job #377933)
Cod sursa(job #377933)
#include <iostream.h>
#include <math.h>
#include <fstream.h>
int factorial(unsigned long int n)
{
int i=0;
unsigned long int nr=0;
while(pow(5,i)<=n)
i++;
for(int k=1;k<=i;k++)
nr+=n/pow(5,k);
return nr;
}
void binar(unsigned long int k,unsigned long int j,unsigned long int nr)
{
fstream g("fact.out",ios::out);
int ok=0;
unsigned long int cautat=0;
while(k<j&&ok==0)
{
cautat=(j+k)/2;
if(factorial(cautat)==nr)
{
ok=1;
g<<cautat;
}
else
if(factorial(cautat)>nr)
{
k=cautat+1;
cautat=(k+j)/2;
}
else
{
j=cautat-1;
cautat=(k+j)/2;
}
}
if(ok==0)
g<<0;
}
int main()
{
unsigned long int nr,k,j;
fstream f("fact.in",ios::in);
fstream g("fact.out",ios::out);
f>>nr;
k=nr*4;
j=nr*5;
if(nr/5==(nr%5)-1)
g<<0;
else
binar(k,j,nr);
return 0;
}