// Created by Swapnil More /* This code which checks if input number is Shortable Prime. Print out not only True or False but specify what kind of Shortable Prime it is: Left, Right or Full. Input: 3797 Output: Full Shortable Prime Input: 13 Output: Left Shortable Prime Input: 19 Output: Not a Shortable Prime */ // Challenge thread is in the comments section #include #include #include char *primes; int sl[100],sr[100],p=0,q=0; int main() { int m,r,c=0,d=0; printf("Enter a number: "); scanf("%d",&m); printf("%d\n",m); r=prime1(m); if(m<10 && r==1){ printf("%d is not a shortable prime number",m); } else{ prime(m+1); if (left(m)){ c++; } if (right(m)){ d++; } if(c==1 && d==1){ printf("%d is full shortable prime number\n",m); psl(); psr(); } else if(c==1){ printf("%d is left shortable prime number\n",m); psl(); } else if(d==1){ printf("%d is right shortable prime number\n",m); psr(); } else{ printf("%d is not a prime number",m); } } return 0; } int prime1(int m){ int j=2; while(j!=m){ if(m%j==0 || m==1){ return 0; } j++; } if(j==m){ return 1; } } void prime(int m){ int j; primes=malloc(sizeof(char)*m); memset(primes,1,m); primes[0]=primes[1]=0; int i=2; while (i*i ",sl[i]); } } } void psr(){ int i; for(i=0;i ",sr[i]); } } } // Created by Swapnil More

Shortable Primes 1 [Challenge #182]