C Program to Check Number is Circular Prime or Not

by

Write a program to check whether a given number is circular prime or not

Note: A number is said to be a circular prime if all its possible rotations are also prime numbers.
Example: 113 is a circular prime since 311 and 131 are also prime

Input Format
The input contains an integer

Output Format
Print CIRCULAR PRIME or NOT CIRCULAR PRIME

Sample Input 1

3119

Sample Output 1

CIRCULAR PRIME

Code:

# include <stdio.h>
# include <stdlib.h>
# include <stdbool.h>
# include <math.h>


int flg;
void chkPrime(long int n)
{
    long int i;
    i=n-1;
    while(i>=2)
    {
        if(n%i==0)
        {
            flg=1;
        }
        i--;
    }
}
void AllCombination(long int a)
{
  long int b1,c1,d1,e1,i,j,k,s1,z1,v1,x[8],y[8],m;
  b1=a;
  i=0;
  while(b1>0)
  {
      y[i]=b1 % 10;
      b1=b1/10;
      i++;
  }
  c1=0;
  for(j=i-1;j>=0;j--)
  {
    x[c1]=y[j];
    c1++;
  }
  m=i;
  while(m>0)
  {
     c1=m-1;
     d1=i-1;
     e1=0;
     s1=0;
     while(e1<i)
     {
       z1=pow(10,d1);
       v1=z1*x[c1%i];
       c1++;
       d1--;
       e1++;
       s1=s1+v1;
     }
     m--;
     chkPrime(s1);
  }
}
int main()
{
    long int num1;
    scanf("%li",&num1);
      flg=0;
      AllCombination(num1);
      if(flg==0)
      {
        printf("CIRCULAR PRIME");
      }
    else
    {
        printf("NOT CIRCULAR PRIME");
    }
    return 0;	
	printf("\n");
}
Code language: C/AL (cal)

Leave a Comment