알고리즘/스텍4 9935 문자열 폭발 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869#include #include #include #include using namespace std; char arr[1000005] = { 0 };char bomb[40] = { 0 };stack stk; int main() { scanf("%s %s", &arr, &bomb); int len_arr = strlen(arr); int len_bomb = strlen(bomb); int idx = 0; for (int i = 0; i 2020. 3. 12. 10845 큐 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364#include #include #include #include using namespace std; queue q; int main() { int t; scanf("%d", &t); while (t--) { string str; cin >> str; getchar(); if (str == "push") { int n; scanf("%d", &n); q.push(n); } else if (str == "pop") { if (q.size() == 0) { printf("-1\n"); continu.. 2019. 8. 27. 2605 줄 세우기 12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include #include #include using namespace std; int arr[105] = { 0 };int rst[105] = { 0 };deque dq;stack tmp; int main() { int n, num; scanf("%d", &n); getchar(); for (int i = 1; i 2019. 8. 27. trail 더블릿 123456789101112131415161718192021222324252627282930313233343536#include #include using namespace std; int arr[1005] = { 0 }; int main() { int n; scanf("%d", &n); while (1) { stack stk; for (int i = 0; i 2019. 3. 14. 이전 1 다음