Cod sursa(job #2274994)
| Utilizator | Data | 2 noiembrie 2018 18:49:53 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream ci ("fact.in");
ofstream co ("fact.out");
int nrzero (int n)
{
int nr0 = 0;
while (n >= 5)
{
nr0 += n/5;
n /= 5;
}
return nr0;
}
int lecaute (int p)
{
int a=0,pas=1<<28;
while (pas!=0)
{
if (nrzero(a+pas)<p)
{
a+=pas;
}
pas/=2;
}
return 1+a;
}
int main()
{
int p,n;
ci >> p;
n = lecaute(p);
if (nrzero(n) == p)
{
co << n;
}
else
{
co << -1;
}
return 0;
}
