Stack Using Array

Problem Statement

Input Format

Number of operations Q, followed by queries ('P x' for push x, 'O' for pop).

Output Format

Print popped elements, or 'Stack Empty' if popping from empty stack.

Constraints

1 <= Q <= 100

Sample Input

5
P 10
P 20
O
P 30
O

Sample Output

20
30

Explanation

Pushes 10 and 20, pops 20 (LIFO), pushes 30, pops 30.

Starter Code

#include <stdio.h>

int main() {
    int q;
    if (scanf("%d", &q) == 1) {
        // Write your code here
    }
    return 0;
}

Limits

• Time Limit: 1s
• Memory Limit: 256MB