iframe-proxy | Sunbelt Computer Software

History

64 lines (64 loc) · 1.02 KB

Raw

// stack 2개를 이용하면 풀 수 있다.

#include <cstdio>

#include <cstring>

#include <stack>

using namespace std;

char a[600000];

int main()

{

scanf("%s", a); // scanf로 일단 입력을 받는다.

stack<char> left, right;

int n = strlen(a);

for (int i = 0; i < n; i++)

{

left.push(a[i]);

}

int m;

scanf("%d", &m);

while (m--)

{

char what;

scanf(" %c", &what);

if (what == 'L')

{

if (!left.empty())

{

right.push(left.top());

left.pop();

}

else if (what == 'D')

{

if (!right.empty())

{

left.push(right.top());

right.pop();

}

else if (what == 'B')

{

if (!left.empty())

{

left.pop();

}

else if (what == 'P')

{

char c;

scanf(" %c", &c);

left.push(c);

}

while (!left.empty())

{

right.push(left.top());

left.pop();

}

while (!right.empty())

{

printf("%c", right.top());

right.pop();

}

printf("\n");

return 0;

}

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Sunbelt Computer Software

PL/B Language Development and Support

FilesExpand file tree

stack 1406.cpp

Latest commit

History

stack 1406.cpp

File metadata and controls