Competitive_coding/PRIME1new.cpp at master · shashank3395/Competitive_coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include<bits/stdc++.h>
#include<cmath>
using namespace std;

int main()
{
    int t;
    cin>>t;
    int n,m,i;
    int prime[100000]={0};
    prime[0]=1;
    prime[1]=1;
    for(i=2;i<1000;i++)
    {
        if(prime[i]==0)
            for(int j=i;j*i<100000;j++)
            prime[i*j]=1;
    }
int count1=0;
    vector<int> v1;
    vector<int>:: iterator it;
    for(i=0;i<100000;i++)
    {  if(prime[i]==0)
        {
         //cout<<" "<<i;
         v1.push_back(i);
         //count1++;
        }
    }
    //cout<<" -- "<<count1;
    while(t--)
    {
        cin>>n>>m;

        for(i=n;i<=m;i++)
        {   int flag=0;
            for(it=v1.begin();*it<=sqrt(i);it++)
            {
                if(i%*it==0)
                {
                    flag=1;
                    break;
                }
            }
            if(flag==0&&i!=1)
                cout<<i<<"\n";

        }
        cout<<"\n";

    }
}