Cod sursa(job #2042225)
Utilizator | Data | 18 octombrie 2017 10:51:31 | |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int x,n,mij,p,s,fi;
int main()
{
f>>p;
if (p==0)
{
g<<1;
return 0;
}
s=1;
fi=800000000;
while(s<=fi && n!=p )
{
n=0;
mij=(s+fi)/2;
x=mij/5;
while (x)
{
n=n+x;
x/=5;
}
if(n>p)
{
fi=mij-1;
}
else
{
s=mij+1;
}
}
if(s<=fi)
g<<mij-mij%5;
else
g<<-1;
return 0;
}