Reverse Iterators (rbegin, rend)

Easy STL Iterators

Solve in Playground →

Problem Statement

Write a C++ program using reverse iterators (`rbegin`, `rend`) to traverse and print a `std::vector` in reverse order.

Input Format

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

Output Format

Print elements in reverse order separated by a space.

Constraints

1 <= N <= 1000

Sample Input

5
10 20 30 40 50

Sample Output

50 40 30 20 10

Explanation

Reverse iterators traverse containers backwards from `rbegin()` to `rend()`.

Starter Code

#include <iostream>
#include <vector>

int main() {
    int n;
    if (std::cin >> n) {
        std::vector<int> vec(n);
        for (int i = 0; i < n; i++) std::cin >> vec[i];
        
        // Write your reverse iterator traversal logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →