C Exercises: Find circular prime numbers upto a specific limit
C Numbers: Exercise-28 with Solution
Write a program in C to find circular prime numbers upto a specific limit.
Test DataEnter the upper Limit: 1000
Sample Solution:
C 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 b,c,d,e,i,j,k,s,z,v,x[8],y[8],m;
b=a;
i=0;
while(b>0)
{
y[i]=b % 10;
b=b/10;
i++;
}
c=0;
for(j=i-1;j>=0;j--)
{
x[c]=y[j];
c++;
}
m=i;
while(m>0)
{
c=m-1;
d=i-1;
e=0;
s=0;
while(e<i)
{
z=pow(10,d);
v=z*x[c%i];
c++;
d--;
e++;
s=s+v;
}
m--;
chkPrime(s);
}
}
int main()
{
long int i=2,ctr;
printf("\n\n Find Circular Prime Numbers upto a specific limit: \n");
printf(" ---------------------------------------------------\n");
printf(" Enter the upper Limit: ");
scanf("%li",&ctr);
printf("\n The Circular Prime Numbers less than %li are: \n",ctr);
while(i<=ctr)
{
flg=0;
AllCombination(i);
if(flg==0)
{
printf("%li ",i);
}
i++;
}
printf("\n");
}
Sample Output:
Enter the upper Limit: 1000 The Circular Prime Numbers less than 1000 are: 2 3 5 7 11 13 17 31 37 71 73 79 97 113 131 197 199 311 337 373 719 733 919 971 991
Pictorial Presentation:
Flowchart:
C Code Editor:
Contribute your code and comments through Disqus.
Previous: Write a program in C to check if a given number is circular prime or not.
Next: Write a program in C to check whether a given number is a perfect cube or not.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
C Programming: Tips of the Day
Static variable inside of a function in C
The scope of variable is where the variable name can be seen. Here, x is visible only inside function foo().
The lifetime of a variable is the period over which it exists. If x were defined without the keyword static, the lifetime would be from the entry into foo() to the return from foo(); so it would be re-initialized to 5 on every call.
The keyword static acts to extend the lifetime of a variable to the lifetime of the programme; e.g. initialization occurs once and once only and then the variable retains its value - whatever it has come to be - over all future calls to foo().
Ref : https://bit.ly/3fOq7XP
- New Content published on w3resource:
- HTML-CSS Practical: Exercises, Practice, Solution
- Java Regular Expression: Exercises, Practice, Solution
- Scala Programming Exercises, Practice, Solution
- Python Itertools exercises
- Python Numpy exercises
- Python GeoPy Package exercises
- Python Pandas exercises
- Python nltk exercises
- Python BeautifulSoup exercises
- Form Template
- Composer - PHP Package Manager
- PHPUnit - PHP Testing
- Laravel - PHP Framework
- Angular - JavaScript Framework
- Vue - JavaScript Framework
- Jest - JavaScript Testing Framework