fork download
copy 
  1. #include<iostream>
  2. using namespace std;
  3. #define MAX 100000
  4. #define MAX1 100000
  5. bool arr[MAX];
  6. int prime[MAX1];
  7. long long int j;
  8. void markmult(long long int k)
  9. {
  10.     long long int i=2*k;
  11.     while(i<MAX)
  12.     {
  13.         arr[i]=true;
  14.         i+=k;
  15.     }
  16. }
  17. void sieve()
  18. {
  19.    long long  int i;
  20.     markmult(2);
  21.     prime[j++]=2;
  22.     i=3;
  23.     while(i<MAX)
  24.     {
  25.         if(arr[i]==false)
  26.         {
  27.             prime[j++]=i;
  28.             markmult(i);
  29.         }
  30.         i+=2;
  31.     }
  32.  
  33. }
  34. int main()
  35. {
  36.    long long int t,n,m,i;
  37.     cin>>t;
  38.     sieve();
  39.     while(t--)
  40.     {
  41.         cin>>m>>n;
  42.         for(i=0;i<j && prime[i]<=n;i++)
  43.         {
  44.         	if(prime[i]>=m)
  45.         		  cout<<prime[i]<<"\n";
  46.         }
  47.         cout<<"\n";
  48.     }
  49.     return 0;
  50. }
Success #stdin #stdout 0s 3632KB
comments (?)
stdin
copy 
2
1 10
3 115
stdout
copy 
2
3
5
7

3
5
7
11
13
17
19
23
29
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97
101
103
107
109
113
https://ideone.com/bSAVBv
language:
C++ (gcc 8.3)
created:
9 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!