Cod sursa(job #2077859)
Utilizator | Data | 28 noiembrie 2017 18:03:30 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("fact.in");
ofstream g ("fact.out");
int putere (long long n)
{
int co=0;
while (n%5==0)
{
n=n/5;
co++;
n++;
}return co;
}
int main()
{int i=5,n=5,p,contor=0,ci;
f >>p;
while (contor <p)
{
contor=contor+putere(i);
i+=5;
n++;
}if (contor==p)
g<<i-5;
else
g<<"-1";
return 0;
}