HyeonWooKim

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

int main()
{
	string a,b;
	int len;

HyeonWooKim

#include<iostream>
#include<vector>
 
using namespace std;
bool f[5555555];
int main()
{
    vector<long long> v;
    long long a,b,len,ans=0;
 

HyeonWooKim

#include<iostream>
#include<string>
using namespace std;

int main()
{
	string s, t, r;
	int l,n,m=0;
	cin >> s >> t;
	l=s.length(),n=t.length();

HyeonWooKim

#include<iostream>
using namespace std;

int main()
{
	int n;
	string s;

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

HyeonWooKim

#include<iostream>
#include<vector>
using namespace std;
 
int main()
{
    int n,m,d;
	vector<int> v;

	cin>>n>>m;

HyeonWooKim

#include <iostream>
#include <stack>
using namespace std;

int main()
{
	int k,n=1,c=0,t;
	char b[200001];
	stack<int>s;

HyeonWooKim

#include<iostream>
#include<stack>
#include<string>
using namespace std;

int main()
{
	string s;
	stack<char> lst,rst;
	int n;

HyeonWooKim

s=input()
lst=list(s);rst=[]
k = int(input())
for i in range(0,k):
    cmd = input()
    if cmd=='L' and len(lst):
        rst.append(lst.pop())
    elif cmd=='D' and len(rst):
        lst.append(rst.pop())
    elif cmd=='B' and len(lst):

HyeonWooKim

#include<iostream>
#include<string>
using namespace std;
 
int top;
 
int main(){
    string s;
     
    cin>>s;

HyeonWooKim

#include<iostream>
#include<string>
using namespace std;

int top;

int main(){
    int cases;
    
    cin>>cases;