Cod sursa(job #1179966)
Utilizator | Data | 29 aprilie 2014 17:15:59 | |
---|---|---|---|
Problema | Factorial | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p,aux=1,i,j,sum;
int a[100000000];
int main()
{
f>>p;
for(i=1;i<=10;i++)
{
aux*=5;
for(j=aux;j<=p;j+=aux)
a[j]++;
}
for(i=1;i<=p;i++)
{
sum=sum+a[i]+1;
if (sum>=p)
break;
}
if (p==0) g<<1;
else if (sum==p) g<<i*5;
else g<<-1;
return 0;
}