Pagini recente » Cod sursa (job #2583406) | Cod sursa (job #1819) | Cod sursa (job #3190268) | Cod sursa (job #863371) | Cod sursa (job #2660084)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("fact.in");
ofstream g ("fact.out");
int n;
int p;
void citire ()
{
f>>n;
}
int factorial(long long x)
{
long long p=5;
int cont=0;
while(p<=x)
{
cont+=x/p;
p*=5;
}
return cont;
}
void rezolvare()
{
if(n==0)
{
g<<1;
return ;
}
long long st=1;
long long dr=1000000000;
long long mij=(st+dr)/2;
while(st<=dr)
{
if(factorial(mij)==n && factorial(mij-1)<n)
{
g<<mij;
return ;
}
if(factorial(mij)<n)
st=mij+1;
else
dr=mij-1;
mij=(st+dr)/2;
}
g<<-1;
}
int main()
{
citire();
rezolvare();
return 0;
}