[BOJ] 10828 스택 / C++

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

10828번: 스택

 

#include <iostream>
#include <string>
#define MAX_CAPACITY	10000
#define EMPTY	0
#define FULL	MAX_CAPACITY

using namespace std;

int N; // 명령의 수 (1<= <=10000)
int stack[MAX_CAPACITY] = { 0, }; // stack
int sp = EMPTY; // stack pointer

string cmd;
int num;

void push(int n) {
	if (sp != FULL) {
		stack[++sp] = n; // sp 먼저 증가 후, n 대입
	}
}

int pop() {
	if (sp == EMPTY) return -1;
	int top_num = stack[sp--];
	return top_num;
}

int size() {
	return sp;
}

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

int top() {
	if (sp == EMPTY) return -1;
	return stack[sp];
}

int main(void)
{
	cin >> N;
	for(int i=0; i<N; i++) {
		cin >> cmd;
		if (cmd == "push") {
			cin >> num;
			push(num);
		}
		else if (cmd == "pop") {
			int top_num = pop();
			cout << top_num << "\n";
		}
		else if (cmd == "size") {
			int stack_size = size();
			cout << stack_size << "\n";
		}
		else if (cmd == "empty") {
			int is_empty = empty();
			cout << is_empty << "\n";
		}
		else if (cmd == "top") {
			int top_num = top();
			cout << top_num << "\n";
		}
	}
	return 0;
}