Cod sursa(job #1219513)
| Utilizator | Data | 14 august 2014 14:13:34 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f ("fact.in");
ofstream g ("fact.out");
int n;
int numar(int n)
{ int x=1,nr=0;
while(x*5<=n)
{ x*=5;
nr+=n/x;
}
return nr;
}
int bin(int i,int j,int x)
{ if(i==j)
{ if(numar(j)==x)
return j;
else
return -1;
}
int mij=(i+j)/2;
if(numar(mij) >= x){
return bin(i,mij,x);
} else {
return bin(mij+1,j,x);
}
}
int main()
{ f>>n;
g<<bin(1,2000000000,n)<<'\n';
return 0;
}
