Stack Container Adapter

Easy STL Containers

Solve in Playground →

Problem Statement

Write a C++ program using `std::stack` to reverse a sequence of integers using LIFO (Last-In, First-Out) behavior.

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print elements popped from stack separated by a space.

Constraints

1 <= N <= 1000

Sample Input

5
1 2 3 4 5

Sample Output

5 4 3 2 1

Explanation

Stacks operate on LIFO principles, reversing input order upon popping.

Starter Code

#include <iostream>
#include <stack>

int main() {
    int n;
    if (std::cin >> n) {
        std::stack<int> st;
        for (int i = 0; i < n; i++) {
            int val;
            std::cin >> val;
            st.push(val);
        }
        // Write your stack pop/reverse logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →