Pagini recente » Cod sursa (job #2760582) | Istoria paginii stelele-2009/9-10/clasament/runda-2 | Cod sursa (job #308315) | Cod sursa (job #3135719) | Cod sursa (job #2188394)
#include <iostream>
#include <fstream>
using namespace std;
int fact(int n)
{
int p=1;
for(int i=1;i<=n;++i)
p=p*i;
return p;
}
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
int p;
fin>>p;
int gasit=0, n=1;
while(gasit==0)
{
int k=0;
while(fact(n)%10==0)
++k;
if(k==p)
{
fout<<n;
gasit=1;
}
else if(k>p)
{
fout<<"-1";
gasit=1;
}
else
++n;
}
}