Cod sursa(job #2077850)
Utilizator | Bogdan Sever-Cristian severut | Data | 28 noiembrie 2017 17:55:55 |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("fact.in");
ofstream fout ("fact.out");
int putere(long long n)
{
int co=0;
while (n%5==0)
{
n/=5;
co++;
}
return co;
}
int main()
{
int P,contor,i,k;
fin>>P;
contor=0;
i=5;
while (contor<P)
{
if (k%5==0)
if (k%putere(k)==0)
contor=contor+putere(k)-1;
contor++;
k++;
i+=5;
}
if (contor==P)
fout<<i-5;
else
fout<<-1;
return 0;
}