Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <conio.h>
- #include <math.h>
- #include <stdlib.h>
- void main()
- {
- int i, j, up, down, num, count, flag;
- //flag = 0 non-prime, flag = 1 prime
- system("cls");
- printf("This is a simple program to print Prime Number.\n\n");
- printf("Enter The upper range : ");
- scanf("%d",&up);
- printf("Enter The lower range : ");
- scanf("%d", &down);
- system("cls");
- printf("Prime-Numbers in ascending order.\n\n");
- count = 0;
- for (i = down; i <= up; i++)
- {
- num = i;
- flag = 1;
- if(num <= 1)
- {
- flag = 0;
- }
- for(j = 2; j <= num / 2; j++)
- {
- if(num % j == 0)
- {
- flag = 0;
- break;
- }
- }
- if(flag == 1)
- {
- printf("%d - is a Prime Number.\n", num);
- count++;
- }
- }
- if (count == 0)
- {
- system("cls");
- printf("There is no Prime-Number in this range.");
- }
- else
- {
- printf("\nThere is total '%d' Prime-Number in this range.", count);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
