Pagini recente » algoritmiada-2019/runda-preoji/solutii/panza | Cod sursa (job #2612086) | Cod sursa (job #1389966) | Cod sursa (job #2331646) | Cod sursa (job #805364)
Cod sursa(job #805364)
#include<stdio.h>
int div25(int a){
int r=0;
while(a%5==0){
r++;
a/=5;
}
return r;
}
int main(){
long p,pp,s,i;
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%ld",&p);
pp=0;
s=0;
if(p==0)printf("1");
for(i=5;i<=100000000;i+=5){
s+=div25(i);
if(s==p){
printf("%ld",i);
i=1000000000;
}
}
return 0;
}