Wednesday, 5 April 2017

Geeksforgeeks Solution For " Find Prime numbers in a range "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- We Have to Generate all Prime Number Between Given Range By User 

Submit Your Solution :- Click Here 

Solution :- 

#include<stdio.h>

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
    int num,i,count,min,max;
    scanf("%d%d",&min,&max);

    for(num = min;num<=max;num++)
    {
         count = 0;
         for(i=2;i<=num/2;i++)
         {
             if(num%i==0)
             {
                 count++;
                 break;
             }
        }
        
         if(count==0 && num!= 1)
             printf("%d ",num);
    }
    
             printf("\n");
    }
  
   return 0;
}

Output:-



Geeksforgeeks Solution For " Find Prime numbers in a range "

No comments:
Write comments

Recommended Posts × +