혜랑's STORY

- 풀이 #define _CRT_SECURE_NO_WARNINGS #include #include using namespace std; int main() { queue Q; int card; cin >> card; for (int i = 1; i

- 문제 - 풀이 #include #include #define MAX 10000 int rear = -1; int stack[MAX]; int pop(){ if(rear == -1) return -1; else return stack[rear--]; } void push(int value){ stack[++rear] = value; } void size(){ printf("%d\n", rear+1); } void empty(){ if(rear == -1) printf("1\n"); else printf("0\n"); } void top(){ if(rear == -1) printf("-1\n"); else printf("%d\n", stack[rear]); } int main(){ char str[6];..