Cod sursa(job #687401)
| Utilizator | Data | 22 februarie 2012 13:09:35 | |
|---|---|---|---|
| Problema | Factorial | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
#include<values.h>
using namespace std;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
long long p,pr,k,ok=0,i,x,m,j;
f>>p;
if(p==0)g<<1;
else{
i=0;
j=LONG_MAX;
ok=0;
while(i<=j&&ok==0){
m=(i+j)/2;
pr=5;k=0;
while(pr<m){
k=k+m/pr;
pr*=5;}
if(k==p){
x=m-m%5;
ok=1;
}
else if(k<p)i=m+1;
else j=m-1;
}
if(ok==1)g<<x;
else g<<"-1";
}
f.close();
g.close();
return 0;
}
