Pagini recente » Cod sursa (job #1689027) | Cod sursa (job #883891) | Cod sursa (job #3040332) | Cod sursa (job #510951) | Cod sursa (job #283404)
Cod sursa(job #283404)
#include<stdio.h>
#include<math.h>
int main()
{
long a[10],n,i,s=0,x=1;
for(i=1; i<=10; i++) a[i]=(pow(5,i)-1)/4;
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%ld",&n);
if(n==0) printf("1"); else {
for(i=1; s<n; i++)
{
s=a[i];
x=pow(5,i);
}
s=a[i-2];
x=pow(5,i-2);
if(s==n) printf("%ld",x);
else printf("%ld",x+5*(n-s));
}
return 0;
}