Cod sursa(job #1460398)
| Utilizator | Data | 12 iulie 2015 15:58:13 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("factorial.in");
ofstream out("factorial.out");
int nr0(int n)
{
if(n==0)
return 1;
int nr=0;
while(n>0)
{
nr=nr+n/5;
n=n/5;
}
return nr;
}
int caut_bin(int p)
{
int st=0;
int dr=1000000;
int mij=(st+dr)/2;
while(st<=dr)
{
mij=(st+dr)/2;
if(nr0(mij)<p)
st=mij+1;
else if(nr0(mij)>p)
dr=mij;
else
break;
}
while(nr0(mij)==p)
mij--;
mij++;
return mij;
}
int main()
{
int p;
in>>p;
out<<caut_bin(p);
return 0;
}
