Cod sursa(job #1856689)
| Utilizator | Data | 25 ianuarie 2017 12:17:26 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int p,first,last,st,dr;
int nrdezero(int nr){
int sum=0;
while(nr){
sum+=nr/5;
nr/=5;
}
return sum;
}
int cautare(int st,int dr){
st=0;dr=1<<30;
mij;
while(st<dr){
mij=(st+dr)/2;
if(nrdezero(mij)>=p)dr=mij;
else st=mij+1;
}
if(nrdezero(st)==p)return st;
return -1;
}
int main(){
first=0,last=1<<30;
fin>>p;
if(nrdezero(st)==p)
fout<<st;
else fout<<-1;
return 0;
}
