Cod sursa(job #1803759)
Utilizator | Data | 11 noiembrie 2016 19:37:36 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
#include <cmath>
using namespace std;
long long e,p,n,i;
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{
f>>p;
n=p*5;
if (p==0) n++;
for(i=2;i<=p;i++)
{
if (n>pow(5,i)) n-=5;
if (n==pow(5,i) && n%5==p) g<<-1;
}
g<<n;
f.close();
g.close();
return 0;
}