cpp) 백준 10828: 스택

Problem

https://www.acmicpc.net/problem/10828

10828번: 스택

 

 

Solution

#include<iostream>
#include<string>
#include<cmath>

using namespace std;

int s=0; // stack의 size
int stack[10001];

void push(int k){
    stack[s] = k;
    s++;
}

int pop(){
    if(s==0)
        return -1;
    s--;
    return stack[s];
}

int size(){
    return s;
}

int empty(){
    if (s==0)
        return 1;
    else
        return 0;
}

int top(){
    if (s==0)
        return -1;
    return stack[s-1];
}

int main(){
    int n;
    cin >> n;
    while(n--){

        string str;
        cin >> str;

        if (str == "push"){
            int k;
            cin >> k;
            push(k);
        } 
        
        if (str == "pop"){
            cout << pop() << endl;
        }

        if (str == "size"){
            cout << size() << endl;
        }

        if (str == "empty"){
            cout << empty() << endl;
        }

        if (str == "top"){
            cout << top() << endl;
        }
    }
    return 0;
}