Cod sursa(job #1384842)
| Utilizator | Data | 11 martie 2015 14:39:14 | |
|---|---|---|---|
| Problema | Factorial | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
int p;
int zero(int n)
{
int nr=0;
while(n>=5)
{
nr+=n/5;
n/=5;
}
return nr;
}
int cautarebinara()
{
int i=0;
long long pas=1<<15;
while(pas!=0)
{
if(zero(i+pas)<p)
i+=pas;
pas/=2;
}
if(zero(i+1)==p)
out<<i+1;
else
out<<-1;
}
int main()
{
in>>p;
cautarebinara();
return 0;
}
