Cod sursa(job #639649)
| Utilizator | Data | 23 noiembrie 2011 18:34:40 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| 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 r=0;
while(n>=5)
{
r+=n/5;
n/=5;
}
return r;
}
int cauta(int p)
{
int i,pas=1<<30;
for(i=0;pas!=0;pas/=2)
if(zero(i+pas)<p)
i+=pas;
return i+1;
}
int main()
{
int z;
in>>p;
z=cauta(p);
if(zero(z)!=p)
out<<-1;
else
out<<z;
return 0;
}
