Cod sursa(job #2120160)
| Utilizator | Data | 1 februarie 2018 23:25:36 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n;
int fz(int nr)
{
int sol=0,p=5;
while(p<nr)
{
sol=sol+nr/p;
p*=5;
}
if(!sol)
return 1;
return sol;
}
int cb(long long n)
{long long mij=0;
long long st=0;
long long dr=1000000000;
while(st<dr)
{
mij=(st+dr)/2;
if(fz(mij)>n)
dr=mij;
else
st=mij+1;
}
return st;
}
int main()
{
f >> n;
if(n==0)
g <<"1";
else
if(fz(cb(n)-5)!=n)
g<<-1;
else
g<<cb(n)-5;
return 0;
}
