fork download
copy 
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4. #include <algorithm>
  5. using namespace std;
  6. using ll = long long;
  7.  
  8. int main() {
  9.  
  10.     ios_base::sync_with_stdio(false);
  11.  
  12.     int t = 0;
  13.     cin >> t;
  14.     vector<ll> tCases;
  15.     while (t--) {
  16.         ll first = 0, n = 0;
  17.         cin >> first >> n;
  18.         cin.get();
  19.         tCases.emplace_back(n);
  20.         tCases.emplace_back(first);
  21.     }
  22.  
  23.     ll n = *max_element(tCases.begin(), tCases.end());
  24.     vector<bool> primes(n+1, 0);
  25.     primes[0] = 1;
  26.     primes[1] = 1;
  27.  
  28.     for (ll i = 4; i <= n; i += 2) {
  29.         primes[i] = 1;
  30.     }
  31.  
  32.     ll sqrt_n = sqrt(n);
  33.     for (ll i = 2; i <= sqrt_n; ++i) {
  34.         if (primes[i] == 0) {
  35.             for (ll j = i*i, dj = i+i; j <= n; j += dj) {
  36.                 primes[j] = 1;
  37.             }
  38.         }
  39.     }
  40.  
  41.  
  42.     ll size = primes.size();
  43.     for (ll i = 0, j = 1; j < size; i += 2, j += 2) {
  44.         for (ll k = primes[i], l = primes[j]; k <= l; ++k) {
  45.             if (primes[k] == 0) {
  46.                 cout << k << '\n';
  47.             }
  48.         }
  49.     }
  50.  
  51.  
  52.     return 0;
  53. }
  54.  
Success #stdin #stdout 0s 3460KB
comments (?)
stdin
copy 
2
1 100
50 200
stdout
copy 
Standard output is empty
https://ideone.com/QeXKfe
language:
C++14 (gcc 8.3)
created:
8 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!