Pagini recente » Borderou de evaluare (job #800639) | Cod sursa (job #2277845) | Cod sursa (job #982753)
Cod sursa(job #982753)
//#include <iostream>
#include <fstream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <utility>
#define ll long long int
#include <cstdio>
#define first f
#define second s
#define fi(n) for(i=0;i<n;++i)
#define fj(n) for(j=0;j<n;++j)
#define fk(n) for(k=0;k<n;++k)
using namespace std;
ifstream cin("fact.in");
ofstream cout("fact.out");
ll i,j,k,n,P,rasp,aux;
int cinci[] = {1,5,25,125,625,3125,15625,78125,390625,1953125,9765625,48828125,244140625,1220703125};
int main ()
{
ios_base::sync_with_stdio(false);
cin>>P;
for (i=5;rasp<P;i+=5)
{
aux=i;
while(aux%5==0)
{
aux/=5;
++rasp;
}
}
i-=5;
if (rasp==P)
cout<<i<<'\n';
else cout<<-1<<'\n';
return 0;
}