Pagini recente » Cod sursa (job #2883186) | Cod sursa (job #2278589) | Cod sursa (job #2032867) | Cod sursa (job #1182777) | Cod sursa (job #583572)
Cod sursa(job #583572)
#include<stdio.h>
int main()
{
unsigned long a,z[16],p[16],i,j;
long n;
freopen ("fact.in","r",stdin);
freopen ("fact.out","w",stdout);
p[1]=5;
z[1]=1;
i=1;
scanf("%i",&a);
while (a>z[i])
{
i++;
p[i]=p[i-1]*5;
z[i]=z[i-1]*5+1;
}
n=0;
for (j=i;j>=1;j--)
if (a>=z[j])
{
n+=(a/z[j])*p[j];
a%=z[j];
}
j=1;
while (n>p[j])
{
j++;
if ((n%p[j])==0)
{
while (n>p[j])
j++;
if (n==p[j]) break;
else
{
n=-1;
break;
}
}
}
if (n==0) n++;
printf("%i",n);
return 0;
}