Cod sursa(job #1800720)
Utilizator | Data | 7 noiembrie 2016 23:26:15 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p,st,dr,mij;
int nrzero (int x)
{
int k=0,t=0;
for(int i=5;i<x;i=i*5)
{
k=k+x/i;
}
return k;
}
int main ()
{
f>>p;
st=1;
dr=5*p;
while(st<=dr)
{
mij=st+(dr-st)/2;
if(nrzero(mij)==p)
break;
else
if(nrzero(mij)>=p)
dr=mij-1;
else
st=mij+1;
}
g<<st;
}