Cod sursa(job #545934)
| Utilizator | Data | 4 martie 2011 09:42:08 | |
|---|---|---|---|
| Problema | Factorial | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<iostream.h>
#include<fstream.h>
int main()
{
ifstream f;
f.open("fact.in");
ofstream g;
g.open("fact.out");
long long int p;
f>>p;
int ok=0;
long long i;
int k=0, l=0;
long long int j=0;
int v[30000];
while (!ok)
{
// l=0;
for(i=1;i<=k;i++)
if (v[i]%5==0)
while (v[i]%5==0) {l++;v[i]/=5;}
if (l==p) ok=1;
else {j+=5; v[++k]=j;}
}
if (ok) g<<j;
else g<<"-1";
return 0;
}