Cod sursa(job #2773164)
| Utilizator | Data | 5 septembrie 2021 12:16:33 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <fstream>
using namespace std;
const int nmax=10000005;
int cfact(int n){
int a=0,po;
for(po=5;po<=n;po=po*5){
a=a+n/po;
}
return a;
}
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
int st=1,dr,mij,last=-1,p,z;
fin>>p;
dr=p*10;
if(p==0){
fout<<"1";
} else {
while(st<=dr){
mij=(st+dr)/2;
z=cfact(mij);
if(z==p){
last=mij;
dr=mij-1;
} else if(z<p){
st=mij+1;
} else {
dr=mij-1;
}
}
fout<<last;
}
return 0;
}
