-
Notifications
You must be signed in to change notification settings - Fork 0
/
C code
64 lines (60 loc) · 1.48 KB
/
C code
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
53
54
55
56
57
58
59
60
61
62
63
64
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int N=100001;
bool sieve[100001];
void createSieve(){
for(int i=2;i<=N;i++) {
sieve[i]=true;
}
for(int i=2;i*i<=N;i++) {
if(sieve[i]) {
for(int j=i*i;j<=N;j+=i) {
sieve[j]=false;
}
}
}
}
vector<int> generatePrime(int n) {
vector<int> ds;
for(int i=2;i<=n;i++) {
if(sieve[i]) {
ds.push_back(i);
}
}
return ds;
}
int main() {
createSieve();
int t;
cin>>t;
while(t-->0) {
ll l,r;
cin>>l>>r;
// step 1 = Generate All prime till sqrt(r);
vector<int> primes=generatePrime((int)sqrt(r));
// Step 2 = Crate dummy array of size (r-l+1) and make everyone as 1
int dummy[(int)(r-l+1)] ;
for(int i=0;i<(int)(r-l+1);i++) {
dummy[i]=1;
}
for(auto pr : primes) {
ll firstMultiple=(l/pr)*pr;
if(firstMultiple<l) firstMultiple+=pr;
for(ll i=max(firstMultiple,(ll)(pr*pr)) ; i<=r ; i+=pr) {
dummy[(int)(i-l)]=0;
}
}
if(l==1) {
dummy[0]=0;
}
for(ll i=l;i<=r;i++) {
if(dummy[(int)(i-l)]==1) {
cout<<i<<" ";
}
}
cout<<endl;
// cout<<l<<"\t"<<r<<"\n";
}
return 0;
}