Pagini recente » Autentificare | Cod sursa (job #1189069) | emag_cex_oji_liceu_avansati_2022 | Cool research papers | Cod sursa (job #1179940)
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long n,cinci,zerouri,numar,puteri[16],i,j;
int main()
{
f>>n;
puteri[0]=1;
for(i=1;i<=15;i++)
puteri[i]=puteri[i-1]*5;
for(i=5;i<=n*5;i+=5)
{
for(j=7;j>=1;j--)
if (i%puteri[j]==0)
{
zerouri+=j;
break;
}
if (zerouri>=n) break;
}
if (n==0) g<<1;
else if (zerouri==n) g<<i;
else g<<-1;
return 0;
}