Cod sursa(job #1540113)
| Utilizator | Data | 2 decembrie 2015 10:09:45 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
using namespace std;
const int L=29;
int zero(int n)
{
int r=0;
while(n>=5)
{
r=r+n/5;
n=n/5;
}
return r;
}
int cautb(int p)
{
int i,pas;
pas=1<<L;
i=0;
while(pas!=0)
{
if(zero(i+pas)<p)
i=i+pas;
pas=pas/2;
}
return i+1;
}
int main()
{
int p,r;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
r = cautb(p);
if(zero(r) != p)
g<<-1;
else
g<<r;
return 0;
}
