Cod sursa(job #1869563)
Utilizator | Data | 5 februarie 2017 22:43:44 | |
---|---|---|---|
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 d("fact.out");
int nzero(int x)
{
int ans=0,p5=5;
while(x>=p5)
{
ans+=x/p5;
p5=p5*5;
}
return ans;
}
int main()
{
int p,n=1;
f>>p;
int st=1,dr=5*p;
while(st<=dr)
{
int mij=(st+dr)/2;
if(nzero(mij)<p) st=mij+1;
else dr=mij-1;
}
if(nzero(st)==p) d <<st;
else d<<-1;
return 0;
}