fork download
copy 
  1. #include <iostream>
  2. #include <math.h>
  3. #include <deque>
  4. #include <sstream>
  5.  
  6. bool is_prime(const int &number)
  7. {
  8.     if (number < 2)
  9.         return false;
  10.  
  11.     int j = sqrt(number);
  12.     for (int i = 2; i < j; i++)
  13.         if (number%i == 0)
  14.             return false;
  15.  
  16.     return true;
  17. }
  18.  
  19. int main()
  20. {
  21.     std::deque<int> outputLimits;
  22.     int testsDone = 0;
  23.  
  24.     int numTests;
  25.     std::cin >> numTests;
  26.  
  27.     while (testsDone <= numTests)
  28.     {
  29.        // std::string test;
  30.         int first, second;
  31.  
  32.         //getline(std::cin, test);
  33.         //std::stringstream ss(test);
  34.         std::cin >> first >> second;
  35.  
  36.         outputLimits.push_back(first);
  37.         outputLimits.push_back(second);
  38.  
  39.         ++testsDone;
  40.     }
  41.  
  42.     while (!outputLimits.empty())
  43.     {
  44.         int start = outputLimits[0];
  45.         int finish = outputLimits[1];
  46.         while (start <= finish)
  47.         {
  48.             if (is_prime(start))
  49.                 std::cout << start << std::endl;
  50.             ++start;
  51.         }
  52.         outputLimits.pop_front();
  53.         outputLimits.pop_front();
  54.         std::cout << std::endl;
  55.     }
  56.     return 0;
  57. }
Success #stdin #stdout 0s 3036KB
comments (?)
stdin
copy 
2
1 10
3 5
stdout
copy 
2
3
4
5
6
7
8
9

3
4
5

3
4
5
https://ideone.com/NUUcjb
language:
C++14 (gcc 8.3)
created:
11 years ago
visibility:
public

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!