Cod sursa(job #1273479)
| Utilizator | Data | 22 noiembrie 2014 15:17:04 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int kkt(long n){
int k=5,s=0;
while(k<=n){s+=n/k;k*=5;}
return s;
}
int main()
{
int st=1,dr=2000000000,p,nr=-1,a,mij;
f>>p;
if(p==0) g<<1;
else
{
while(st<=dr)
{
mij=(st+dr)/2;
a=kkt(mij);
if(a==p){nr=mij-mij%5;break;}
else{
if(a<p) st=mij+1;
else dr=mij-1;}
}
g<<nr;
}
return 0;
}
