Cod sursa(job #2620703)
| Utilizator | Data | 29 mai 2020 15:26:56 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.77 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int x;
int nz(int n)
{
int s=0,p=5,x=n;
while(x>=5)
{
s=s+n/p;
p=p*5;
x=x/5;
}
return s;
}
int i,p,st,dr,mij;
int main()
{
f>>p;
if(p==0)
{
g<<"1";
return 0;
}
int OK=0;
st=1;
dr=1000000000;
while(st<=dr)
{
mij=(st+dr)/2;
if(nz(mij)==p)
{
if(nz(mij-1)==p)
while(nz(mij-1)==p)
mij--;
g<<mij;
return 0;
}
else if(nz(mij)>p)
dr=mij-1;
else st=mij+1;
}
g<<"-1";
return 0;
}
