Cod sursa(job #1325199)
Utilizator | Data | 23 ianuarie 2015 15:06:02 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include<fstream>
using namespace std;
long long st,dr,p,nr;
long long f(long long n)
{
int s,x;
x=n;
s=0;
while(x!=0)
{
x=x/5;
s=s+x;
}
return s;
}
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
fin>>p;
st=1;
dr=100000000;
while(st<=dr)
{
nr=st+(dr-st)/2;
if(f(nr)<p)
{
st=nr+1;
}
else
{
dr=nr-1;
}
}
if(f(dr+1)==p)
{
fout<<"-1";
}
else
{
fout<<dr+1;
}
fin.close();
fout.close();
return 0;
}