-
Notifications
You must be signed in to change notification settings - Fork 1
/
PRIME1.cpp
55 lines (44 loc) · 1.06 KB
/
PRIME1.cpp
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
#include <stdio.h>
#define SWAP(a,b) {int t = a; a = b; b = t;}
bool ver[32000]={false};
int primes[4000]={0};
int gen() {
int i, j, k=0;
for (i=2 ; i<=32000 ; i++) {
if (ver[i]==false) {
primes[k++]=i;
/*printf("%d\n",i);
getchar();*/
for (j=2 ; j>0 && i*j<=32000 ; j++) {
ver[i*j]=true;
}
}
}
primes[0]=2;
/*for (i=0 ; i<10 ; i++)
printf("%d\n",primes[i]);*/
return k;
}
int main() {
int p = gen(),t,i,j,low,high;
bool print;
scanf("%d",&t);
while (t--) {
scanf("%d %d",&low,&high);
if (high<low)
SWAP(high,low);
if (low == 1) low++;
if (low == 0) low+=2;
for (i=low ; i<=high ; i++) {
for (j=0, print=true ; primes[j]*primes[j]<=i ; j++) {
if (i%primes[j]==0) {
print = false;
break;
}
}
if (print) printf("%d\n",i);
}
printf("\n");
}
return 0;
}