Cod sursa(job #663741)
| Utilizator | Data | 18 ianuarie 2012 21:39:18 | |
|---|---|---|---|
| Problema | Factorial | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p,i,cif,X;
int main()
{
f>>p;
for(i=25;cif<p;i+=25)
{
X=i;
cif+=4;
while (X%5==0) X/=5,cif++;
}
if (p==0) g<<1;
else
cif==p?g<<i-5:g<<-1;
f.close();
g.close();
return 0;
}
