Cod sursa(job #3141300)
Utilizator | Data | 13 iulie 2023 14:44:04 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
long long n,p,v[2000],i;
int main()
{
fin>>p;
v[0]=1;
if(p==0)
fout << 1;
else
{
for(i=1; v[i-1]<=p; i++)
{
int nr=1,ci=i;
while(ci%5==0)
{
nr++;
ci/=5;
}
v[i]=v[i-1]+nr;
}
if(v[i-1]<p&&p<v[i])
fout<< -1;
else
fout<<5*(i-1);
}
return 0;
}