Cod sursa(job #942923)
| Utilizator | Data | 23 aprilie 2013 20:37:09 | |
|---|---|---|---|
| Problema | Factorial | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
using namespace std;
long long n,p,rez,cop;
int v;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
if(p==0)
g<<'1';
else
for(n=1;v==0;n++)
{
cop=n;
rez++;
while(cop%5==0)
{
rez++;
cop=cop/5;
}
if(rez==p)
{
g<<n*5;
v=1;
}
else
if(rez>p)
{
g<<"-1";
v=1;
}
}
g<<'\n';
f.close();
g.close();
return 0;
}
