Module: QUEUE PRACTICE


Problem

1/5

Start of queue

Theory Click to read/hide

Queue — abstract data type with access to  elements on a first-come — first came out» (FIFO, First In — First Out).

For ease of remembering, you can remember the usual queue in the store.

queue<int> a; – creating an empty queue with no elements 

a.push(5); – add the value 5 to the end of the queue
 
a.pop(); – remove the first element in the queue
 
int b = a.front();  – return the first element in the queue to the variable  (without deletion)
 
a.empty() – return true if the queue is empty,  and false otherwise.

Problem

Given a sequence of natural numbers with the number N (1<=N<= 100).
Enter data into the queue and output only even numbers.

Example
Input:
5
1 2 3 4 5

Output:
24

 

time 1000 ms
memory 32 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include <iostream>
#include <queue>        // подключаем заголовочный файл очереди
using namespace std;
 
int main()
{
    queue<int> myQueue;     // создаем пустую очередь типа int
    int N, a;
    cin >> N;
    for(int i = 0; i < N; i++)
       { cin >> a;
         myQueue.push(a);
        }   
return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!