problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02756 | import sys
S = input()
Q = int(input())
key = 1
for i in sys.stdin:
if i[0] == '0':
break
if i[0] == '1':
key = -key
if key == 1:
if i[2] == '1':
S = i[4] + S
else:
S = S + i[4]
else:
if i[2] == '2':
S = i[4] + S
... | import sys
S = input()
Q = int(input())
key = 1
for i in sys.stdin:
if i[0] == '0':
break
if i[0] == '1':
key = -key
elif key == 1:
if i[2] == '1':
S = i[4] + S
else:
S = S + i[4]
else:
if i[2] == '2':
S = i[4] + S
... | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 541,663 | 541,664 | u607155447 | python |
p02756 | def main():
s = input()
q = int(input())
reverse = 0
head = ""
tail = ""
for i in range(q):
v = list(input().split())
if int(v[0]) == 1:
reverse += 1
elif reverse == 0:
if int(v[1]) == 1:
head += v[2]
else:
... | def main():
s = input()
q = int(input())
reverse = 0
head = ""
tail = ""
for i in range(q):
v = list(input().split())
if int(v[0]) == 1:
reverse += 1
elif reverse % 2 == 0:
if int(v[1]) == 1:
head += v[2]
else:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 541,667 | 541,668 | u476068053 | python |
p02756 | from collections import deque
def main():
s = input().split()
q = int(input())
query = []
que = deque(s)
f = False
for i in range(q):
query.append(input().split(" "))
for i in range(q):
if query[i][0] == '1':
f = not f
else:
if f:
... | from collections import deque
def main():
s = list(input())
q = int(input())
query = []
que = deque(s)
f = False
for i in range(q):
query.append(input().split(" "))
for i in range(q):
if query[i][0] == '1':
f = not f
else:
if f:
... | [
"call.add",
"call.remove"
] | 541,671 | 541,672 | u872271866 | python |
p02756 | S = input()
Q = int(input())
Query = list(input().split() for _ in range(Q))
count = 0
L, R = "", ""
for i in range(Q):
if Query[i][0] == "1": count += 1
else:
if Query[i][1] == "1":
if count % 2 == 0:
L = Query[i][2] + L
else:
R += Query[i][2]
else:
if count % 2 == 0:
... | S = input()
Q = int(input())
Query = list(input().split() for _ in range(Q))
count = 0
L, R = "", ""
for i in range(Q):
if Query[i][0] == "1": count += 1
else:
if Query[i][1] == "1":
if count % 2 == 0: L = Query[i][2] + L
else: R += Query[i][2]
else:
if count % 2 == 0: R += Query[i][2]
... | [] | 541,673 | 541,674 | u238504302 | python |
p02756 | from collections import deque
s = deque(input())
q = int(input())
flag = 0
for _ in range(q):
query = list(map(str, input().split()))
if query[0] == "1": flag = 1 - flag
else:
if query[1] == "1":
if flag == 0: s.appendleft(query[2])
else: s.append(query[2])
else:
if flag == 0: s.append(... | from collections import deque
s = deque(input())
q = int(input())
flag = 0
for _ in range(q):
query = list(map(str, input().split()))
if query[0] == "1": flag = 1 - flag
else:
if query[1] == "1":
if flag == 0: s.appendleft(query[2])
else: s.append(query[2])
else:
if flag == 0: s.append(... | [
"control_flow.branch.if.condition.change"
] | 541,675 | 541,676 | u188827677 | python |
p02756 | from collections import deque
s = input()
q = int(input())
s = deque(s)
t = 0
for _ in range(q):
query = list(map(str, input().split()))
if query[0] == "1": t = 1 - t
else:
if t == 0:
if query[1] == "1": s.appendleft(query[2])
elif query[1] == "2": s.append(query[2])
elif t == 1:
if que... | from collections import deque
s = input()
q = int(input())
s = deque(s)
t = 0
for _ in range(q):
query = list(map(str, input().split()))
if query[0] == "1": t = 1 - t
else:
if t == 0:
if query[1] == "1": s.appendleft(query[2])
elif query[1] == "2": s.append(query[2])
elif t == 1:
if que... | [
"control_flow.branch.if.condition.change"
] | 541,677 | 541,678 | u188827677 | python |
p02756 | s = input().split()
q=int(input())
front=[]
back=[]
hantei = True
for _ in range(q):
t = input().split()
if t[0] == '1':
hantei = not hantei
else:
if hantei:
if t[1] == '1':
front.append(t[2])
else:
back.append(t[2])
else:
... | s = input()
s = list(s)
q=int(input())
front=[]
back=[]
hantei = True
for _ in range(q):
t = input().split()
if t[0] == '1':
hantei = not hantei
else:
if hantei:
if t[1] == '1':
front.append(t[2])
else:
back.append(t[2])
else:... | [
"call.add",
"call.arguments.change"
] | 541,679 | 541,680 | u411203878 | python |
p02756 | import sys
import math
import itertools
import collections
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD2 = 998244353
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split(... | import sys
import math
import itertools
import collections
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD2 = 998244353
INF = float('inf')
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split(... | [
"assignment.value.change",
"call.arguments.change"
] | 541,681 | 541,682 | u760961723 | python |
p02756 | from collections import deque
S = deque(list(input().strip()))
Q = int(input())
P = 0
for _ in range(Q):
q = list(input().split())
if q[0]=="1":
P += 1
P = P%2
else:
c = q[2]
if q[1]=="1":
if P==0:
S.appendleft(c)
else:
... | from collections import deque
S = deque(list(input().strip()))
Q = int(input())
P = 0
for _ in range(Q):
q = list(input().split())
if q[0]=="1":
P += 1
P = P%2
else:
c = q[2]
if q[1]=="1":
if P==0:
S.appendleft(c)
else:
... | [
"assignment.add"
] | 541,690 | 541,691 | u644907318 | python |
p02756 | from collections import deque
S = deque(list(input().strip()))
Q = int(input())
cnt = 0
for i in range(Q):
q = list(input().split())
if len(q)==1:
cnt += 1
else:
F = int(q[1])
C = q[2]
if cnt%2==0:
if F==1:
S.appendleft(C)
else:
... | from collections import deque
S = deque(list(input().strip()))
Q = int(input())
cnt = 0
for i in range(Q):
q = list(input().split())
if len(q)==1:
cnt += 1
else:
F = int(q[1])
C = q[2]
if cnt%2==0:
if F==1:
S.appendleft(C)
else:
... | [
"call.add",
"call.arguments.change"
] | 541,692 | 541,693 | u644907318 | python |
p02756 | from collections import deque
Q=deque()
Q.append(input())
q=int(input())
cnt=0
for i in range(q):
x=input()
if x[0]=='1':
cnt+=1
cnt%=2
elif x[0]=='2':
if x[2]=='1':
if cnt%2==0:
Q.appendleft(x[4])
else:
Q.append(x[4])
else:
if cnt%2==0:
... | from collections import deque
Q=deque(list(input()))
q=int(input())
cnt=0
for i in range(q):
x=input()
if x[0]=='1':
cnt+=1
cnt%=2
elif x[0]=='2':
if x[2]=='1':
if cnt%2==0:
Q.appendleft(x[4])
else:
Q.append(x[4])
else:
if cnt%2==0:
... | [
"assignment.value.change",
"call.arguments.change"
] | 541,696 | 541,697 | u350093546 | python |
p02756 | S = list(input())
Q = int(input())
QL = []
for _ in range(Q):
QL.append(input())
inversed = False
invc = 0
prefix = []
suffix = []
for query in reversed(QL):
# print("qi:", query)
if query == '1':
#1
inversed = not inversed
invc += 1
else:
# print("2:inv:", inver... | S = list(input())
Q = int(input())
QL = []
for _ in range(Q):
QL.append(input())
inversed = False
invc = 0
prefix = []
suffix = []
for query in reversed(QL):
# print("qi:", query)
if query == '1':
#1
inversed = not inversed
invc += 1
else:
# print("2:inv:", inver... | [
"call.add",
"call.arguments.add"
] | 541,708 | 541,709 | u871841829 | python |
p02756 | s=input()
q=int(input())
s=[]
r=[]
for i in S:
s.append(i)
t=1
for i in range(q):
qv=list(input().split())
if qv[0]=='1':
t^=1
else:
if int(qv[1])^t==0 or int(qv[1])^t==2:
r.append(qv[2])
else:
s.append(qv[2])
if t==0:
ss=s.copy()
s=[]... | S=input()
q=int(input())
s=[]
r=[]
for i in S:
s.append(i)
t=1
for i in range(q):
qv=list(input().split())
if qv[0]=='1':
t^=1
else:
if int(qv[1])^t==0 or int(qv[1])^t==2:
r.append(qv[2])
else:
s.append(qv[2])
if t==0:
ss=s.copy()
s=[]... | [
"assignment.variable.change",
"identifier.change"
] | 541,714 | 541,715 | u919235786 | python |
p02756 | # ABC158 D
from collections import deque
s=input()
q=int(input())
l=[]
for i in range(q):
l.append(list(map(str,input().split())))
cnt=0
front_str=''
end_str=''
t_str=deque(s)
front_str=deque(front_str)
end_str=deque(end_str)
for ll in l:
if ll[0]=='1':
cnt+=1
elif ll[0]=='2':
if cnt%2==... | # ABC158 D
from collections import deque
s=input()
q=int(input())
l=[]
for i in range(q):
l.append(list(map(str,input().split())))
cnt=0
front_str=''
end_str=''
t_str=deque(s)
front_str=deque(front_str)
end_str=deque(end_str)
for ll in l:
if ll[0]=='1':
cnt+=1
elif ll[0]=='2':
if cnt%2==... | [
"identifier.change"
] | 541,726 | 541,727 | u970197315 | python |
p02756 | from collections import deque
S=input()
N=int(input())
q = deque()
A = [input().split()]
for n in range(N-1):
A.append(input().split())
for s in S:
q.append(s)
top = True
for n in range(N):
if A[n][0]=="1":
top = not top
elif A[n][1]=="1" and top or A[n][1]=="2" and not top:
q.appendleft(A[n][2])
else... | from collections import deque
S=input()
N=int(input())
q = deque()
A = [input().split()]
for n in range(N-1):
A.append(input().split())
for s in S:
q.append(s)
top = True
for n in range(N):
if A[n][0]=="1":
top = not top
elif A[n][1]=="1" and top or A[n][1]=="2" and not top:
q.appendleft(A[n][2])
else... | [
"identifier.change"
] | 541,742 | 541,743 | u465900169 | python |
p02756 | import sys
input = sys.stdin.readline
from collections import deque
S = input().rstrip()
S = deque(S)
Q = int(input())
Que = (input().rstrip() for _ in range(Q))
flag = 0 #0:そのまま 1:反転
for elem in Que:
if elem[0] == '1':
flag ^= 1
else:
s = int(elem[2])
if s == 1 and flag == 0:
S.appendleft(elem[... | import sys
input = sys.stdin.readline
from collections import deque
S = input().rstrip()
S = deque(S)
Q = int(input())
Que = (input().rstrip() for _ in range(Q))
flag = 0 #0:そのまま 1:反転
for elem in Que:
if elem[0] == '1':
flag ^= 1
else:
s = int(elem[2])
if s == 1 and flag == 0:
S.appendleft(elem[... | [
"call.arguments.change"
] | 541,746 | 541,747 | u993461026 | python |
p02756 | s = input()
q = int(input())
left = ""
right = ""
flag_swap = False
for i in range(q):
query = list(input().split())
if query[0] == "1":
flag_swap = not flag_swap
else:
if (query[1] == "1" and not flag_swap) or (query[1] == "2" and flag_swap):
left += query[2]
else:
right += query[2]
if f... | s = input()
q = int(input())
left = ""
right = ""
flag_swap = False
for i in range(q):
query = list(input().split())
if query[0] == "1":
flag_swap = not flag_swap
else:
if (query[1] == "1" and not flag_swap) or (query[1] == "2" and flag_swap):
left += query[2]
else:
right += query[2]
if f... | [] | 541,748 | 541,749 | u243714267 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
ANS = deque(S)
rev = 0
for _ in range(Q):
query = input().split(' ')
if len(query) == 1:
rev = rev ^ 1
else:
f, c = int(query[1]), query[2]
if f ^ rev:
ANS.appendleft(c)
else:
ANS.append(c)... | from collections import deque
S = input()
Q = int(input())
ANS = deque(S)
rev = 0
for _ in range(Q):
query = input().split(' ')
if len(query) == 1:
rev = rev ^ 1
else:
f, c = int(query[1]), query[2]
if (f - 1) ^ rev:
ANS.append(c)
else:
ANS.appendl... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.remove",
"call.add"
] | 541,750 | 541,751 | u067986021 | python |
p02756 | from collections import deque
s=input()
Q=int(input())
hanten = 0
mae = deque()
ushiro = deque()
for i in range(Q):
q=input()
if q=="1":
hanten ^= 1
else:
if q[2] == "1":
if hanten == 0:
mae.append(q[4])
else:
ushiro.append(q[4])
else:
if hanten == 0:
ushiro.appendleft(q[4])
else:
m... | from collections import deque
s=input()
Q=int(input())
hanten = 0
mae = deque()
ushiro = deque()
for i in range(Q):
q=input()
if q=="1":
hanten ^= 1
else:
if q[2] == "1":
if hanten == 0:
mae.appendleft(q[4])
else:
ushiro.append(q[4])
else:
if hanten == 0:
ushiro.append(q[4])
else:
m... | [
"identifier.change"
] | 541,760 | 541,761 | u723792785 | python |
p02756 | S = input()
Q = int(input())
TFC = [input().split() for _ in range(Q)]
is_reversed = False
head = ''
tail = ''
for tfc in TFC:
if tfc[0] == '1':
is_reversed = not is_reversed
else:
if tfc[1] == '1':
if is_reversed:
tail += tfc[2]
else:
head... | S = input()
Q = int(input())
TFC = [input().split() for _ in range(Q)]
is_reversed = False
head = ''
tail = ''
for tfc in TFC:
if tfc[0] == '1':
is_reversed = not is_reversed
else:
if tfc[1] == '1':
if is_reversed:
tail += tfc[2]
else:
head... | [] | 541,762 | 541,763 | u178079174 | python |
p02756 | from collections import deque
S = deque(input())
Q = int(input())
reverse = False
cnt = 0
for i in range(Q):
inp = input().split()
if inp[0] == "1":
cnt += 1
reverse = (cnt % 2 != 0)
#S = S[::-1]
else:
f, c = inp[1:]
if int(f) == 1:
if reverse:
... | from collections import deque
S = deque(input())
Q = int(input())
reverse = False
cnt = 0
for i in range(Q):
inp = input().split()
if inp[0] == "1":
cnt += 1
reverse = (cnt % 2 != 0)
#S = S[::-1]
else:
f, c = inp[1:]
if int(f) == 1:
if reverse:
... | [
"identifier.change"
] | 541,764 | 541,765 | u548545174 | python |
p02756 | from collections import deque
a = list(input())
Q = int(input())
d = deque(a)
ans = 0
for i in range(Q):
b = list(input().split())
if len(b) == 1:
ans += 1
elif b[1] == "1" and ans % 2 == 1:
d.appendleft(b[2])
elif b[1] == "1" and ans % 2 == 0:
d.append(b[2])
elif b[1] == "2" and ans % 2 == 1:
... | from collections import deque
a = list(input())
Q = int(input())
d = deque(a)
ans = 1
for i in range(Q):
b = list(input().split())
if len(b) == 1:
ans += 1
elif b[1] == "1" and ans % 2 == 1:
d.appendleft(b[2])
elif b[1] == "1" and ans % 2 == 0:
d.append(b[2])
elif b[1] == "2" and ans % 2 == 1:
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 541,773 | 541,774 | u514118270 | python |
p02756 | #D
from collections import deque
s = deque(input())
q = int(input())
#flg:反転してるときtrue,してないときFalse
flg = False
for _ in range(q):
t = tuple(map(str,input().split()))
if t[0] == '1':
if flg:
flg = False
else:
flg = True
else:
if t[1] == "1" and flg == False:
... | #D
#import sys
#input = sys.stdin.readline
from collections import deque
s = deque(input())
q = int(input())
#flg:反転してるときtrue,してないときFalse
flg = False
for _ in range(q):
t = tuple(map(str,input().split()))
if t[0] == '1':
if flg:
flg = False
else:
flg = True
else:
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 541,777 | 541,778 | u771007149 | python |
p02756 | #D
#import sys
#input = sys.stdin.readline
from collections import deque
s = deque(input())
q = int(input())
#flg:反転してるときtrue,してないときFalse
flg = False
for _ in range(q):
t = tuple(map(str,input().split()))
if t[0] == '1':
if flg:
flg = False
else:
flg = True
else:
... | #D
#import sys
#input = sys.stdin.readline
from collections import deque
s = deque(input())
q = int(input())
#flg:反転してるときtrue,してないときFalse
flg = False
for _ in range(q):
t = tuple(map(str,input().split()))
if t[0] == '1':
if flg:
flg = False
else:
flg = True
else:
... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 541,779 | 541,778 | u771007149 | python |
p02756 | s = input()
q = int(input())
t = 0
f = []
b = []
for _ in range(q):
a = input().split()
if len(a) == 1:
t += 1
else:
m, n = int(a[1]), a[2]
if t % 2 == 0:
if m == 1:
f.append(n)
else:
b.append(n)
else:
if m =... | s = input()
q = int(input())
t = 0
f = []
b = []
for _ in range(q):
a = input().split()
if len(a) == 1:
t += 1
else:
m, n = int(a[1]), a[2]
if t % 2 == 0:
if m == 1:
f.append(n)
else:
b.append(n)
else:
if m =... | [] | 541,782 | 541,783 | u430223993 | python |
p02756 | from collections import deque
s = input()
q = int(input())
que = deque([s])
flg=False
for _ in range(q):
a = list(input().split())
if a[0]=='1':
flg=not(flg)
# s=s[::-1]
else:
if flg ^ a[1]!='1':
que.append(a[2])
else:
que.appendleft(a[2])
ans = ''.joi... | from collections import deque
s = input()
q = int(input())
que = deque([s])
flg=False
for _ in range(q):
a = list(input().split())
if a[0]=='1':
flg=not(flg)
# s=s[::-1]
else:
if flg ^ (a[1]!='1'):
que.append(a[2])
else:
que.appendleft(a[2])
ans = ''.j... | [
"control_flow.branch.if.condition.change"
] | 541,784 | 541,785 | u687574784 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
R = deque(S)
rev = 0
for i in range(Q):
T = input().split()
if T[0] == '1':
rev += 1
else:
if T[1] == '1':
if rev % 2 == 0:
R.append(T[2])
else:
R.appendleft(T[2])
else... | from collections import deque
S = input()
Q = int(input())
R = deque(S)
rev = 0
for i in range(Q):
T = input().split()
if T[0] == '1':
rev += 1
else:
if T[1] == '1':
if rev % 2 == 0:
R.appendleft(T[2])
else:
R.append(T[2])
else... | [
"identifier.change",
"expression.operation.unary.add",
"call.arguments.change"
] | 541,809 | 541,810 | u966207392 | python |
p02756 | s=input()
q=int(input())
cnt=0
left=""
right=""
for i in range(q):
qq=[x for x in input().rstrip().split()]
if qq[0]=="2":
t=int(qq[0])
f=int(qq[1])
c=qq[2]
if cnt%2==1 and f==1:
right=c+right
elif cnt%2==1 and f==2:
# left=left+c
left=c+left
elif cnt%2==0 and... | s=input()
q=int(input())
cnt=0
left=""
right=""
for i in range(q):
qq=[x for x in input().rstrip().split()]
if qq[0]=="2":
t=int(qq[0])
f=int(qq[1])
c=qq[2]
if cnt%2==1 and f==1:
right=right+c
elif cnt%2==1 and f==2:
left=c+left
elif cnt%2==0 and f==2:
righ... | [
"expression.operation.binary.remove"
] | 541,813 | 541,814 | u347184682 | python |
p02756 | from collections import deque
if __name__ == '__main__':
s = input()
n = int(input())
rvflg = False
d_st = deque()
d_ed = deque()
for _ in range(n):
q = input()
if len(q) == 1:
if rvflg:
rvflg = False
else:
rvflg = True
... | from collections import deque
if __name__ == '__main__':
s = input()
n = int(input())
rvflg = False
d_st = deque()
d_ed = deque()
for _ in range(n):
q = input()
if len(q) == 1:
if rvflg:
rvflg = False
else:
rvflg = True
... | [
"call.function.change"
] | 541,817 | 541,818 | u517797706 | python |
p02756 | from collections import deque
S=input()
Q=int(input())
ct=0
reverse=[]
string=[deque(''), deque('')]
# 先頭に付け足す->string[0]にappendleft
# 最後尾に付け足す->strint[1]にappend
# ctの偶奇が変わる毎に付け足す方を変える
for i in range(Q):
l=list(input().split())
if l==['1']:
reverse.append(i)
ct+=1
elif (int(l[1])+ct)%2==1:... | from collections import deque
S=input()
Q=int(input())
ct=0
reverse=[]
string=[deque(''), deque('')]
# 先頭に付け足す->string[0]にappendleft
# 最後尾に付け足す->strint[1]にappend
# ctの偶奇が変わる毎に付け足す方を変える
for i in range(Q):
l=list(input().split())
if l==['1']:
reverse.append(i)
ct+=1
elif (int(l[1])+ct)%2==1:... | [
"call.remove"
] | 541,819 | 541,820 | u752774573 | python |
p02756 | s = input()
q = int(input())
f1 = 1
f2 = 2
cnt = 0
st = ""
se = ""
for _ in range(q):
q = input().split()
if int(q[0]) == 1:
cnt += 1
elif int(q[0]) == 2:
if cnt % 2 == 0:
if int(q[1]) == 1:
st = q[2] + st
elif int(q[1]) == 2:
se += q... | s = input()
q = int(input())
f1 = 1
f2 = 2
cnt = 0
st = ""
se = ""
for _ in range(q):
q = input().split()
if int(q[0]) == 1:
cnt += 1
elif int(q[0]) == 2:
if cnt % 2 == 0:
if int(q[1]) == 1:
st = q[2] + st
elif int(q[1]) == 2:
se += q... | [
"assignment.value.change",
"expression.operation.binary.remove"
] | 541,821 | 541,822 | u607563136 | python |
p02756 | from collections import deque
S=input()
d=deque()
for i in S:
d.append(i)
Q=int(input())
Flag=True
for i in range(Q):
L=input().split()
if L[0]=="1":
Flag=not Flag
else:
if L[1]=="1" and Flag or L[1]=="2" and not Flag:
d.append(L[2])
else:
d.appendleft(L[2... | from collections import deque
S=input()
d=deque()
for i in S:
d.append(i)
Q=int(input())
Flag=True
for i in range(Q):
L=input().split()
if L[0]=="1":
Flag=not Flag
else:
if L[1]=="1" and Flag or L[1]=="2" and not Flag:
d.appendleft(L[2])
else:
d.append(L[2... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 541,831 | 541,832 | u871934301 | python |
p02756 | from collections import deque
s = input()
r = False
d = deque()
d.append(s)
q = int(input())
for i in range(q):
t = input()
if t == "1":
r = not r
else:
t, f, c = list(t.split())
f = False if f=="1" else True
if r == f:
d.appendleft(c)
else:
... | from collections import deque
s = input()
r = False
d = deque()
d.extend(list(s))
q = int(input())
for i in range(q):
t = input()
if t == "1":
r = not r
else:
t, f, c = list(t.split())
f = False if f=="1" else True
if r == f:
d.appendleft(c)
else:
... | [
"identifier.change",
"call.arguments.add",
"call.arguments.change"
] | 541,833 | 541,834 | u697690147 | python |
p02756 | S = input()
Q = int(input())
d = 0
X = [[], []]
for i in range(Q):
q = input()
if q[0] == "1":
d = (d + 1) % 2
else:
a, f, c = q.split()
x = (int(f) + d) % 2
X[x].append(c)
if d == 0:
v = "".join(X[1])[::-1] + S + "".join(X[0])
else:
v = "".join(X[0])[::-1] + S + ""... | S = input()
Q = int(input())
d = 0
X = [[], []]
for i in range(Q):
q = input()
if q[0] == "1":
d = (d + 1) % 2
else:
a, f, c = q.split()
x = (int(f) + d) % 2
X[x].append(c)
if d == 0:
v = "".join(X[1])[::-1] + S + "".join(X[0])
else:
v = "".join(X[0])[::-1] + S[::-1... | [] | 541,835 | 541,836 | u942697937 | python |
p02756 | # ABC158
# D - String Formation
from collections import deque
def ChangeState(Is_normal):
if Is_normal==True:
return False
else:
return True
S=deque(input().split())
Q=int(input())
Is_normal=True
for _ in range(Q):
q = input()
if len(q)== 1 :
Is_normal = ChangeState(Is_normal... | # ABC158
# D - String Formation
from collections import deque
def ChangeState(Is_normal):
if Is_normal==True:
return False
else:
return True
S=deque(input().split())
Q=int(input())
Is_normal=True
for _ in range(Q):
q = input()
if len(q)== 1 :
Is_normal = ChangeState(Is_normal... | [
"identifier.change"
] | 541,859 | 541,860 | u674588203 | python |
p02756 | # -*= coding: utf-8 -*-
from collections import deque
S = input()
Q = int(input())
query = list()
for i in range(Q):
query.append(list(map(str, input().split())))
d = deque()
d.append(S) # 右からSを追加
is_reverse = False
for q in query:
if len(q) == 1:
# Tiが1の場合
is_reverse = not is_reverse
else:
... | # -*= coding: utf-8 -*-
from collections import deque
S = input()
Q = int(input())
query = list()
for i in range(Q):
query.append(list(map(str, input().split())))
d = deque()
for s in S:
d.append(s) # 右からsを追加
is_reverse = False
for q in query:
if len(q) == 1:
# Tiが1の場合
is_reverse = not is_reverse... | [
"misc.typo",
"identifier.change",
"call.arguments.change"
] | 541,863 | 541,864 | u531391334 | python |
p02756 | #!/usr/bin/env python3
from collections import deque
def main():
d = deque()
d.append(input())
Q = int(input())
reflag = False
for i in range(Q):
query = list(input().split())
if query[0] == '1':
reflag = not reflag
elif (query[1] == '1' and not reflag) or (qu... | #!/usr/bin/env python3
from collections import deque
def main():
d = deque()
d.extend(list(input()))
Q = int(input())
reflag = False
for i in range(Q):
query = list(input().split())
if query[0] == '1':
reflag = not reflag
elif (query[1] == '1' and not reflag) ... | [
"identifier.change",
"call.arguments.add",
"call.arguments.change"
] | 541,876 | 541,877 | u962718741 | python |
p02756 | #158_D
s = input()
q = int(input())
from collections import deque
s = deque(s)
rev = 1
for _ in range(q):
Q = list(input().split())
if Q[0] == "1":
rev *= -1
elif Q[0] == "2":
if (Q[1]=="1" and rev==1) or (Q[1]=="2" and rev==-1):
s.append(Q[2])
elif (Q[1]=="2" and rev=... | #158_D
s = input()
q = int(input())
from collections import deque
s = deque(s)
rev = 1
for _ in range(q):
Q = list(input().split())
if Q[0] == "1":
rev *= -1
elif Q[0] == "2":
if (Q[1]=="1" and rev==1) or (Q[1]=="2" and rev==-1):
s.appendleft(Q[2])
elif (Q[1]=="2" and ... | [
"identifier.change"
] | 541,882 | 541,883 | u160169132 | python |
p02756 | #158_D
s = input()
q = int(input())
from collections import deque
s = deque(s)
rev = 1
for _ in range(q):
Q = list(input().split())
if Q[0] == "1":
rev *= -1
elif Q[0] == "2":
if (Q[1]=="1" and rev==1) or (Q[1]=="2" and rev==-1):
s.append(Q[2])
elif (Q[1]=="2" and rev=... | #158_D
s = input()
q = int(input())
from collections import deque
s = deque(s)
rev = 1
for _ in range(q):
Q = list(input().split())
if Q[0] == "1":
rev *= -1
elif Q[0] == "2":
if (Q[1]=="1" and rev==1) or (Q[1]=="2" and rev==-1):
s.appendleft(Q[2])
elif (Q[1]=="2" and ... | [
"identifier.change",
"call.remove",
"call.arguments.change"
] | 541,884 | 541,883 | u160169132 | python |
p02756 | def main():
w = input()
s = collections.deque(w)
n = int(input())
reverse_count = 0
for i in range(n):
t = list(input_list_str())
if len(t) == 1:
reverse_count = 1 - reverse_count
continue
q, f, c = t
if int(f) == 1:
s.append(c)
else:
s.appendleft(c)
if reverse... | def main():
w = input()
s = collections.deque(w)
n = int(input())
reverse_count = 0
for i in range(n):
t = list(input_list_str())
if len(t) == 1:
reverse_count = 1 - reverse_count
continue
q, f, c = t
if int(f) + reverse_count == 2:
s.append(c)
else:
s.appendleft... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.integer.change"
] | 541,891 | 541,892 | u088552457 | python |
p02756 | from collections import deque
s = deque(list(input()))
q = int(input())
# -1がnotReverse, 1がReverser
isR = 1
for i in range(q):
line = list(input().split())
t = int(line[0])
if t == 1:
isR *= -1
else:
f = int(line[1])
if isR + f == 0 or isR + f == 3:
s.appendleft(line[... | from collections import deque
s = deque(list(input()))
q = int(input())
# -1がnotReverse, 1がReverser
isR = -1
for i in range(q):
line = list(input().split())
t = int(line[0])
if t == 1:
isR *= -1
else:
f = int(line[1])
if isR + f == 0 or isR + f == 3:
s.appendleft(line... | [
"expression.operation.unary.add",
"expression.operation.unary.arithmetic.remove",
"control_flow.branch.if.condition.change"
] | 541,895 | 541,896 | u658915215 | python |
p02756 | from collections import deque
s = deque(list(input()))
q = int(input())
# -1がnotReverse, 1がReverser
isR = 1
for i in range(q):
line = list(input().split())
t = int(line[0])
if t == 1:
isR *= -1
else:
f = int(line[1])
if isR + f == 0 or isR + f == 3:
s.appendleft(line[... | from collections import deque
s = deque(list(input()))
q = int(input())
# -1がnotReverse, 1がReverser
isR = -1
for i in range(q):
line = list(input().split())
t = int(line[0])
if t == 1:
isR *= -1
else:
f = int(line[1])
if isR + f == 0 or isR + f == 3:
s.appendleft(line... | [
"expression.operation.unary.add"
] | 541,897 | 541,896 | u658915215 | python |
p02756 | from collections import deque
S = deque([input(), ])
q = int(input())
r = False
for _ in range(q):
t = input().split()
if len(t) == 1:
r = not r
else:
t[1] = int(t[1]) - 1
if (not t[1] and not r) or (t[1] and r):
S.appendleft(t[2])
else:
S.append(t[2])... | from collections import deque
S = deque(list(input()))
q = int(input())
r = False
for _ in range(q):
t = input().split()
if len(t) == 1:
r = not r
else:
t[1] = int(t[1]) - 1
if (not t[1] and not r) or (t[1] and r):
S.appendleft(t[2])
else:
S.append(t[2... | [
"assignment.value.change",
"call.arguments.change"
] | 541,898 | 541,899 | u941047297 | python |
p02756 | from collections import deque
S = deque(list(input()))
q = int(input())
r = False
for _ in range(q):
t = input().split()
if len(t) == 1:
r = not r
else:
t[1] = int(t[1]) - 1
if (not t[1] and not r) or (t[1] and r):
S.appendleft(t[2])
else:
S.append(t[2... | from collections import deque
S = deque(list(input()))
q = int(input())
r = False
for _ in range(q):
t = input().split()
if len(t) == 1:
r = not r
else:
t[1] = int(t[1]) - 1
if (not t[1] and not r) or (t[1] and r):
S.appendleft(t[2])
else:
S.append(t[2... | [
"assignment.add"
] | 541,900 | 541,899 | u941047297 | python |
p02756 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def main():
s = deque(readline().rstrip().decode())
q = int(readline())
#dir=1のとき順方向
dir = 1
for _ in range(q):
txt = readline().rstrip().deco... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def main():
s = deque(readline().rstrip().decode())
q = int(readline())
dir = 1
for _ in range(q):
txt = readline().rstrip().decode()
if txt... | [
"control_flow.branch.if.condition.change"
] | 541,905 | 541,906 | u775681539 | python |
p02756 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def main():
s = deque(readline().rstrip().decode())
q = int(readline())
#dir=1のとき順方向
dir = 1
for _ in range(q):
txt = readline().rstrip().deco... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
def main():
s = deque(readline().rstrip().decode())
q = int(readline())
dir = 1
for _ in range(q):
txt = readline().rstrip().decode()
if txt... | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 541,907 | 541,906 | u775681539 | python |
p02756 | from collections import deque
s = deque(input().replace('\n', ''))
q = int(input())
flag = True
for i in range(q):
query = list(map(str, input().split()))
if query[0]=='1':
if flag: flag = False
else: flag = True
else:
if (not flag and query[1]=='1') or flag and query[1]=='2... | from collections import deque
s = deque(input().replace('\n', ''))
q = int(input())
flag = True
for i in range(q):
query = list(map(str, input().split()))
if query[0]=='1':
if flag: flag = False
else: flag = True
else:
if (not flag and query[1]=='1') or flag and query[1]=='2... | [
"assignment.add"
] | 541,910 | 541,911 | u641406334 | python |
p02756 | S = list(input())
N = int(input())
Q = [list(input().split()) for _ in range(N)]
count = 0
c = 0
ans_append = []
ans_insert = []
for q in Q:
if q[0] == "1":
count += 1
c = count % 2
else:
if (c == 0 and q[1] == "1") or (c == 1 and q[1] == "2"):
ans_insert.append(q[2])
... | S = list(input())
N = int(input())
Q = [list(input().split()) for _ in range(N)]
count = 0
c = 0
ans_append = []
ans_insert = []
for q in Q:
if q[0] == "1":
count += 1
c = count % 2
else:
if (c == 0 and q[1] == "1") or (c == 1 and q[1] == "2"):
ans_insert.append(q[2])
... | [] | 541,912 | 541,913 | u597622207 | python |
p02756 | txt = input()
n = (int)(input())
count = 0
sentou = ""
saigo = ""
for i in range(n):
temp = input()
if temp[0] == '1':
count += 1
else:
sec, moji = (int)(temp.split(" ")[1]), temp.split(" ")[2]
if (sec + count) % 2 == 1:
sentou = moji + sentou
else:
saigo += moji
if count % 2 == 1:
t... | txt = input()
n = (int)(input())
count = 0
sentou = ""
saigo = ""
for i in range(n):
temp = input()
if temp[0] == '1':
count += 1
else:
sec, moji = (int)(temp.split(" ")[1]), temp.split(" ")[2]
if (sec + count) % 2 == 1:
sentou = moji + sentou
else:
saigo += moji
if count % 2 == 1:
t... | [] | 541,914 | 541,915 | u112007848 | python |
p02756 | S = input()
Q = int(input())
Query = [list(map(str,input().split())) for _ in range(Q)]
from collections import deque
flag = True
f = ""
l = ""
#print(Query)
for i in Query:
if i[0]=="1":
if flag:
flag = False
else:
flag = True
else:
if (flag==True and i[1]=="1")... | S = input()
Q = int(input())
Query = [list(map(str,input().split())) for _ in range(Q)]
from collections import deque
flag = True
f = ""
l = ""
#print(Query)
for i in Query:
if i[0]=="1":
if flag:
flag = False
else:
flag = True
else:
if (flag==True and i[1]=="1")... | [
"literal.number.integer.change",
"variable_access.subscript.index.change"
] | 541,916 | 541,917 | u679520304 | python |
p02756 | S = input()
Q = int(input())
Query = [list(map(str,input().split())) for _ in range(Q)]
from collections import deque
flag = True
f = ""
l = ""
print(Query)
for i in Query:
if i[0]=="1":
if flag:
flag = False
else:
flag = True
else:
if (flag==True and i[1]=="1") ... | S = input()
Q = int(input())
Query = [list(map(str,input().split())) for _ in range(Q)]
from collections import deque
flag = True
f = ""
l = ""
#print(Query)
for i in Query:
if i[0]=="1":
if flag:
flag = False
else:
flag = True
else:
if (flag==True and i[1]=="1")... | [
"call.remove"
] | 541,918 | 541,917 | u679520304 | python |
p02756 | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read
s = input()
u = ""
t = ""
q = int(input())
num = 0
for _ in range(q):
a = readline.split()
if len(a)==1:
u,t = t,u
num ^= 1
else:
f = int(a[1])
c = a[2]
if f==1:
t... | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read
#h,w,k = [int(i) for i in read().split()]
s = input()
u = ""
t = ""
q = int(input())
num = 0
for _ in range(q):
a = readline().split()
if len(a)==1:
u,t = t,u
num ^= 1
else:
f = int(a[1])
... | [
"call.add"
] | 541,919 | 541,920 | u646412443 | python |
p02756 | from collections import deque
s = deque(list(input()))
q = int(input())
query = [[1, 0, ''] for i in range(q)]
for i in range(q):
tmp = input().split()
if tmp[0] == '2':
query[i][0] = int(tmp[0])
query[i][1] = int(tmp[1])
query[i][2] = tmp[2]
dire = 1
for i in range(q):
if query[i][... | from collections import deque
s = deque(list(input()))
q = int(input())
query = [[1, 0, ''] for i in range(q)]
for i in range(q):
tmp = input().split()
if tmp[0] == '2':
query[i][0] = int(tmp[0])
query[i][1] = int(tmp[1])
query[i][2] = tmp[2]
dire = 1
for i in range(q):
if query[i][... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.integer.change"
] | 541,927 | 541,928 | u464032595 | python |
p02756 | S = input()
Q = int(input())
direction = 1
head = []
tail = []
for i in range(Q):
T = input()
if T == '1':
direction = direction * -1
else:
T = T.split()
if T[1] == '1':
if direction == 1:
head.append(T[2])
else:
tail.append(T[... | S = input()
Q = int(input())
direction = 1
head = []
tail = []
for i in range(Q):
T = input()
if T == '1':
direction = direction * -1
else:
T = T.split()
if T[1] == '1':
if direction == 1:
head.append(T[2])
else:
tail.append(T[... | [
"expression.operation.binary.remove"
] | 541,934 | 541,935 | u842797390 | python |
p02756 | s=input()
q=int(input())
cnt = [0]*(q+5)
arr=[]
l=0
r=0
for i in range(q):
t=input().split()
if t[0]=='1':
r+=1
cnt[0]+=1
cnt[l]-=1
else:
arr.append([t[2],int(t[1])])
l+=1
if r%2==1:
s=s[::-1]
sm=0
for i in range(len(arr)):
sm+=cnt[i]
if sm%2==1:
... | s=input()
q=int(input())
cnt = [0]*(q+5)
arr=[]
l=0
r=0
for i in range(q):
t=input().split()
if t[0]=='1':
r+=1
cnt[0]+=1
cnt[l]-=1
else:
arr.append([t[2],int(t[1])])
l+=1
if r%2==1:
s=s[::-1]
sm=0
for i in range(len(arr)):
sm+=cnt[i]
if sm%2==1:
... | [] | 541,940 | 541,941 | u408148811 | python |
p02756 | S=(input())
Q=int(input())
cnt_re=0
s=''
for i in range(Q):
q=list(input().split())
if q[0]=='1':
cnt_re+=1
else:
if (int(q[1])+cnt_re)%2==1:
s=s+q[2]
else:
S=S+q[2]
print(S,s)
if cnt_re%2==1:
print(S[::-1]+s)
else:
print(s[::-1]+S) | S=(input())
Q=int(input())
cnt_re=0
s=''
for i in range(Q):
q=list(input().split())
if q[0]=='1':
cnt_re+=1
else:
if (int(q[1])+cnt_re)%2==1:
s=s+q[2]
else:
S=S+q[2]
if cnt_re%2==1:
print(S[::-1]+s)
else:
print(s[::-1]+S) | [
"call.remove"
] | 541,944 | 541,945 | u830592648 | python |
p02756 | from collections import deque
S = list(input())
d = deque()
for s in S:
d.append(s)
q = int(input())
o = 0
for _ in range(q):
qu = list(input().split())
if len(qu) == 1:
o = -1 if o == 0 else 0
if len(qu) == 3:
if qu[1] == '1':
d.append(qu[2]) if o == 0 else d.appendleft(qu... | from collections import deque
S = list(input())
d = deque()
for s in S:
d.append(s)
q = int(input())
o = 0
for _ in range(q):
qu = list(input().split())
if len(qu) == 1:
o = -1 if o == 0 else 0
if len(qu) == 3:
if qu[1] == '1':
d.appendleft(qu[2]) if o == 0 else d.append(qu... | [
"identifier.change"
] | 541,948 | 541,949 | u022871813 | python |
p02756 | S=input()
S_=list(S)
Q=int(input())
F1=[]
F2=[]
Q_=[]
for i in range(4):
Q_.append(list(input().split()))
count=0
for i in range(len(Q_)):
if Q_[i]==['1']:
count+=1
elif Q_[i][0:2]==['2','1']:
if count%2==0:
F1.append(Q_[i][2])
else:
F2.append(Q_[i][2])
else:
if count%2==0:
F... | S=input()
S_=list(S)
Q=int(input())
F1=[]
F2=[]
Q_=[]
for i in range(Q):
Q_.append(list(input().split()))
count=0
for i in range(len(Q_)):
if Q_[i]==['1']:
count+=1
elif Q_[i][0:2]==['2','1']:
if count%2==0:
F1.append(Q_[i][2])
else:
F2.append(Q_[i][2])
else:
if count%2==0:
F... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 541,957 | 541,958 | u428199834 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
n = S
# r = S
# for i in range(Q):
# op = input().split()
# if len(op) == 1:
# n, r = r, n
# elif op[1] == "1":
# n = op[2] + n
# r = r + op[2]
# else:
# n = n + op[2]
# r = op[2] + r
# print(n)
mode = 0... | from collections import deque
S = input()
Q = int(input())
n = S
mode = 0
operations = []
deq = deque(n)
for i in range(Q):
operations.append(input().split())
for op in operations:
if op[0] == "1":
mode += 1
mode %= 2
elif int(op[1]) + mode == 2:
deq.append(op[2])
else:
... | [
"call.arguments.change",
"call.remove"
] | 541,965 | 541,966 | u531603069 | python |
p02756 | from collections import deque
s=deque([input()])
q=int(input())
rev=0
for i in range(q):
t=list(input().split(" "))
if t[0]=="1":
rev=rev+1
else:
if t[1]=="1":
if rev%2==0:
s.appendleft(t[2])
else:
s.append(t[2])
else:
if rev%2==0:
s.append(t[2])
else:
... | from collections import deque
s=deque(list(input()))
q=int(input())
rev=0
for i in range(q):
t=list(input().split(" "))
if t[0]=="1":
rev=rev+1
else:
if t[1]=="1":
if rev%2==0:
s.appendleft(t[2])
else:
s.append(t[2])
else:
if rev%2==0:
s.append(t[2])
els... | [
"assignment.value.change",
"call.arguments.change"
] | 541,968 | 541,969 | u437351386 | python |
p02756 | S = input()
Q = int(input())
Switch = False
Query = []
import collections
dq = collections.deque(S)
for i in range(Q):
s = input()
if s[0] == '1':
if Switch:
Switch = False
else:
Switch = True
if s[0] == '2':
if s[2] == '1' and Switch==False:
dq.... | S = input()
Q = int(input())
Switch = False
Query = []
import collections
dq = collections.deque(S)
for i in range(Q):
s = input()
if s[0] == '1':
if Switch:
Switch = False
else:
Switch = True
if s[0] == '2':
if s[2] == '1' and Switch==False:
dq.... | [
"call.arguments.change",
"io.output.change"
] | 541,995 | 541,996 | u225627575 | python |
p02756 | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
#import queue
from copy import copy, deepcopy
from operator import itemgetter
import bisect#2分探索
#bisect_left(l,x), bisect(l,x)
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを... | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
#import queue
from copy import copy, deepcopy
from operator import itemgetter
import bisect#2分探索
#bisect_left(l,x), bisect(l,x)
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを... | [
"call.remove"
] | 542,002 | 542,003 | u424768586 | python |
p02756 | def main():
from collections import deque
s = list(input())
dq = deque()
for i in s:
dq.append(i)
q = int(input())
flag = True
for _ in range(q):
line = input().split(" ")
if line[0] == "1":
flag = not flag
else:
if line[1] == "1":
... | def main():
from collections import deque
s = list(input())
dq = deque()
for i in s:
dq.append(i)
q = int(input())
flag = True
for _ in range(q):
line = input().split(" ")
if line[0] == "1":
flag = not flag
else:
if line[1] == "1":
... | [
"identifier.change"
] | 542,006 | 542,007 | u474561976 | python |
p02756 | from collections import deque
S = str(input())
Q = int(input())
tmp = deque(S)
houkou = 1 #1:foward 2:reverse
for i in range(Q):
inp = input().split()
if inp[0] == '1':
if houkou == 1:
houkou = 2
else:
houkou = 1
else:
if houkou == 1 and inp[1] == '1':
... | from collections import deque
S = str(input())
Q = int(input())
tmp = deque(S)
houkou = 1 #1:foward 2:reverse
for i in range(Q):
inp = input().split()
if inp[0] == '1':
if houkou == 1:
houkou = 2
else:
houkou = 1
else:
if houkou == 1 and inp[1] == '1':
... | [
"call.remove"
] | 542,021 | 542,022 | u502508885 | python |
p02756 | from collections import deque
S = input()
s = list(S)
d = deque()
for i in range(len(s)):
d.append(s[i])
Q = int(input())
p = [[0 for i in range(3)]for j in range(Q)]
x = 1
for i in range(Q):
p[i] = list(map(str,input().split()))
def add(s,x,f,c):
if x ==1:
if f == 1:
s.appendleft(str(c)... | from collections import deque
S = input()
s = list(S)
d = deque()
for i in range(len(s)):
d.append(s[i])
Q = int(input())
p = [[0 for i in range(3)]for j in range(Q)]
x = 1
for i in range(Q):
p[i] = list(map(str,input().split()))
def add(s,x,f,c):
if x ==1:
if f == 1:
s.appendleft(str(c)... | [
"identifier.change"
] | 542,039 | 542,040 | u342563578 | python |
p02756 | s = input()
T = ""
n = int(input())
for i in range(n):
# print(s,T)
t = list(map(str,input().split()))
if t[0] == "1":
s,T = T,s
else:
if t[1] == "1":
s += t[2]
else:
T += t[2]
print(T+s[::-1]) | s = input()
T = ""
n = int(input())
for i in range(n):
# print(s,T)
t = list(map(str,input().split()))
if t[0] == "1":
s,T = T,s
else:
if t[1] == "1":
T += t[2]
else:
s += t[2]
print(T[::-1]+s) | [
"identifier.change",
"expression.operation.binary.remove"
] | 542,041 | 542,042 | u785578220 | python |
p02756 | from collections import deque
import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
moji=input()
d=deque(moji)
cycle=int(input())
flont_or_back=0
flont=""
back=""
for i in range(cycle):
line=input()
if line[0]=="1":
flont_or_back+=1
else:
... | from collections import deque
import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
moji=input()
d=deque(moji)
cycle=int(input())
flont_or_back=0
flont=""
back=""
for i in range(cycle):
line=input()
if line[0]=="1":
flont_or_back+=1
else:
... | [
"identifier.change"
] | 542,053 | 542,054 | u699296734 | python |
p02756 | import sys
input = sys.stdin.readline.rstrip()
def main():
moji=input()
cycle=int(input())
flont_or_back=0
flont=""
back=""
for i in range(cycle):
line=input()
if line[0]=="1":
flont_or_back+=1
else:
fi=line[2]
ci=line[4]
if... | import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
moji=input()
cycle=int(input())
flont_or_back=0
flont=""
back=""
for i in range(cycle):
line=input()
if line[0]=="1":
flont_or_back+=1
else:
fi=line[2]
ci=line[4]
... | [
"call.add"
] | 542,055 | 542,056 | u699296734 | python |
p02756 | #!/usr/bin/env python3
import sys
# import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.poplef... | #!/usr/bin/env python3
import sys
# import math
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.poplef... | [
"identifier.change"
] | 542,057 | 542,058 | u480300350 | python |
p02756 | from collections import deque
S = input()
q = int(input())
is_s0_head = True
tail = len(S)-1
queue = deque(S)
for _ in range(q):
# print(S)
Q = list(input().split())
if Q[0] == "1":
is_s0_head = not is_s0_head
else:
if Q[1] == "1":
if is_s0_head:
queue.app... | from collections import deque
S = input()
q = int(input())
is_s0_head = True
tail = len(S)-1
queue = deque(S)
for _ in range(q):
# print(queue)
Q = list(input().split())
if Q[0] == "1":
is_s0_head = not is_s0_head
else:
if Q[1] == "1":
if is_s0_head:
queue... | [
"identifier.change",
"call.arguments.change"
] | 542,062 | 542,063 | u357949405 | python |
p02756 |
#ライブラリインポート
from collections import defaultdict
con = 10 ** 9 + 7
#入力受け取り
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
S = input()
Q = int(input())
cnt = 0
s_start = ""
s_end = ""
for i in range(Q):
q = list(input().split())
if q[0] == "1":
cnt += 1
else:
if q[1] == "1":... |
#ライブラリインポート
from collections import defaultdict
con = 10 ** 9 + 7
#入力受け取り
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
S = input()
Q = int(input())
cnt = 0
s_start = ""
s_end = ""
for i in range(Q):
q = list(input().split())
if q[0] == "1":
cnt += 1
else:
if q[1] == "1":... | [] | 542,068 | 542,069 | u627417051 | python |
p02756 | s = input()
q = int(input())
cnt = 0
llst = []
rlst = []
for i in range(q):
line = input()
if line == '1':
cnt += 1
else:
elems = line.split()
if cnt % 2 == 0:
# 指示通り追加
if elems[1] == '1':
llst.append(elems[2])
else:
rlst.append(elems[2])
else:
# 指示の向きと逆に追加... | s = input()
q = int(input())
cnt = 0
llst = []
rlst = []
for i in range(q):
line = input()
if line == '1':
cnt += 1
else:
elems = line.split()
if cnt % 2 == 0:
# 指示通り追加
if elems[1] == '1':
llst.append(elems[2])
else:
rlst.append(elems[2])
else:
# 指示の向きと逆に追加... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 542,070 | 542,071 | u047197186 | python |
p02756 | S=input()
Q=int(input())
head=""
tail=""
rev=False
for _ in range(Q):
q = input().split()
if len(q)==1:
rev != rev
else:
if rev ^ (q[1]=="1"):
head+=q[2]
else:
tail+=q[2]
if rev:
print(tail[::-1]+S[::-1]+head)
else:
print(head[::-1]+S+tail)
| S=input()
Q=int(input())
head=""
tail=""
rev=False
for _ in range(Q):
q = input().split()
if len(q)==1:
rev = not rev
else:
if rev ^ (q[1]=="1"):
head+=q[2]
else:
tail+=q[2]
if rev:
print(tail[::-1]+S[::-1]+head)
else:
print(head[::-1]+S+tail)
| [] | 542,072 | 542,073 | u375616706 | python |
p02756 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
s = input()
q = int(input())
flag = True
p = ''
m = ''
for i in range(q):
qfc = input()
if qfc[0] == '1':
if flag:
flag = False
else:
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
s = input()
q = int(input())
flag = True
p = ''
m = ''
for i in range(q):
qfc = input()
if qfc[0] == '1':
if flag:
flag = False
else:
... | [] | 542,078 | 542,079 | u691018832 | python |
p02756 | s = input()
q = int(input())
head = []
tail = []
flip = 0
for i in range(q):
query = input().split()
if query[0] == '1':
flip ^= 1
else:
f = query[1]
c = query[2]
if (f ^ flip) == 0:
head.append(c)
else:
tail.append(c)
if flip:
head, tail = tail, head
s = s[::-1]
head = ''.join(head)
tail = ''.... | s = input()
q = int(input())
head = []
tail = []
flip = 0
for i in range(q):
query = input().split()
if query[0] == '1':
flip ^= 1
else:
f = int(query[1]) - 1
c = query[2]
if (f ^ flip) == 0:
head.append(c)
else:
tail.append(c)
if flip:
head, tail = tail, head
s = s[::-1]
head = ''.join(head)
t... | [
"call.add"
] | 542,080 | 542,081 | u627803856 | python |
p02756 | s = input()
q = int(input())
x = []
y = []
cnt = 0
for i in range(q):
a = list(input().split())
if a[0] == "1":
x, y = y, x
cnt += 1
else:
if a[1] == "1":
x.append(a[2])
else:
y.append(a[2])
if cnt % 2 == 1:
s = s[::-1]
print(''.join(x[::-1]) +... | s = input()
q = int(input())
x = []
y = []
cnt = 0
for i in range(q):
a = list(input().split())
if a[0] == "1":
x, y = y, x
cnt += 1
else:
if a[1] == "1":
x.append(a[2])
else:
y.append(a[2])
if cnt % 2 == 1:
s = s[::-1]
s = ''.join(x[::-1]) + s... | [
"call.arguments.change"
] | 542,091 | 542,092 | u706330549 | python |
p02756 | from collections import deque
s = deque(input())
q = int(input())
flag = True
for i in range(q):
x = input()
if x == '1':
flag = not flag
else :
if x[2] == '1' and flag :
s.appendleft(x[4])
elif x[2] == '2' and not flag :
s.appendleft(x[4])
else :
... | from collections import deque
s = deque(input())
q = int(input())
flag = True
for i in range(q):
x = input()
if x == '1':
flag = not flag
else :
if x[2] == '1' and flag :
s.appendleft(x[4])
elif x[2] == '2' and not flag :
s.appendleft(x[4])
else :
... | [
"call.remove"
] | 542,105 | 542,106 | u167205647 | python |
p02756 | from collections import deque
reverse = False
string = deque(input().rstrip())
operate_times = int(input().rstrip())
for i in range(operate_times):
row = input().rstrip()
if row[0]=='1':
if reverse:
reverse = False
else:
reverse = True
if row[0]=='2':
... | from collections import deque
reverse = False
string = deque(input().rstrip())
operate_times = int(input().rstrip())
for i in range(operate_times):
row = input().rstrip()
if row[0]=='1':
if reverse:
reverse = False
else:
reverse = True
if row[0]=='2':
... | [
"call.add",
"call.arguments.change"
] | 542,107 | 542,108 | u980641911 | python |
p02756 |
S = str(input())
Q = int(input())
query=[]
a=""
b=""
# for line in range(Q):
# query.append(list(input().split()))
t=True
for i in range(Q):
q=list(input().split())
if int(q[0])==1:
t= not t
else:
if int(q[1])==1:
if t:
a=q[2]+a
else:
b=b+q[2]
else:
if t:
b=b+q[2]
else:
a=q[2]+a... |
S = str(input())
Q = int(input())
query=[]
a=""
b=""
# for line in range(Q):
# query.append(list(input().split()))
t=True
for i in range(Q):
q=list(input().split())
if int(q[0])==1:
t= not t
else:
if int(q[1])==1:
if t:
a=q[2]+a
else:
b=b+q[2]
else:
if t:
b=b+q[2]
else:
a=q[2]+a... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 542,128 | 542,129 | u602773379 | python |
p02756 | s = list(input())
q = int(input())
rev = False
head = []
tail = []
for i in range(q):
query = input()
if query == "1":
rev = not rev
else:
_, f, c = query.split()
if (not rev and f == "1") or (rev and f == "2"):
head.append(c)
else:
tail.append(c)
i... | s = list(input())
q = int(input())
rev = False
head = []
tail = []
for i in range(q):
query = input()
if query == "1":
rev = not rev
else:
_, f, c = query.split()
if (not rev and f == "1") or (rev and f == "2"):
head.append(c)
else:
tail.append(c)
i... | [] | 542,136 | 542,137 | u844005364 | python |
p02756 | def main():
s = input()
n = int(input())
pre = ''
suf = ''
r = 1
for _ in range(n):
q = input().split()
if len(q) == 1:
r *= -1
continue
if r * int(q[1]) in (1, -2):
pre = q[2] + pre
else:
suf += q[2]
ans = pre +... | def main():
s = input()
n = int(input())
pre = ''
suf = ''
r = 1
for _ in range(n):
q = input().split()
if len(q) == 1:
r *= -1
continue
if r * int(q[1]) in (1, -2):
pre = q[2] + pre
else:
suf += q[2]
ans = pre +... | [
"assignment.value.change",
"identifier.change"
] | 542,145 | 542,146 | u984664611 | python |
p02756 | from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop
from math import floor,ceil
from collections import *
from functools import reduce,cmp_to_key
import sys
input = sys.stdin.readline
M = mod = 998244353
def factors(n):return sorted(set(reduce(list.__add__, ([i... | from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop
from math import floor,ceil
from collections import *
from functools import reduce,cmp_to_key
import sys
input = sys.stdin.readline
M = mod = 998244353
def factors(n):return sorted(set(reduce(list.__add__, ([i... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 542,147 | 542,148 | u712893765 | python |
p02756 | S=input()
QN=int(input())
front=''
rear=''
rev=False
for i in range(QN):
op=input()
if op[0]=='1':
rev=not(rev)
else:
if op[2]=='1':
if rev:
rear+=op[4]
else:
front+=op[4]
else:
if rev:
front+=op[4]
... | S=input()
QN=int(input())
front=''
rear=''
rev=False
for i in range(QN):
op=input()
if op[0]=='1':
rev=not(rev)
else:
if op[2]=='1':
if rev:
rear+=op[4]
else:
front+=op[4]
else:
if rev:
front+=op[4]
... | [] | 542,154 | 542,155 | u614875193 | python |
p02756 | S=input()
QN=int(input())
front=''
rear=''
rev=False
for i in range(QN):
op=input()
if op[0]=='1':
rev=not(rev)
else:
if op[2]=='1':
if rev:
rear+=[4]
else:
front+=op[4]
else:
if rev:
front+=op[4]
... | S=input()
QN=int(input())
front=''
rear=''
rev=False
for i in range(QN):
op=input()
if op[0]=='1':
rev=not(rev)
else:
if op[2]=='1':
if rev:
rear+=op[4]
else:
front+=op[4]
else:
if rev:
front+=op[4]
... | [] | 542,156 | 542,155 | u614875193 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
right, left = deque(), deque()
right_inv, left_inv, S_inv = False, False, False
for q in range(Q):
T = input().split(" ")
if len(T) == 1:
# reverse
S_inv = not S_inv
right_inv = not right_inv
left_inv = not left_inv
else:
# append
... | from collections import deque
S = input()
Q = int(input())
right, left = deque(), deque()
right_inv, left_inv, S_inv = False, False, False
for q in range(Q):
T = input().split(" ")
if len(T) == 1:
# reverse
S_inv = not S_inv
right_inv = not right_inv
left_inv = not left_inv
else:
# append
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 542,157 | 542,158 | u198062737 | python |
p02756 | a = input()
n = int(input())
rev = False
front = []
back = []
q = [input() for i in range(n)]
for i in q:
if i == "1":
rev = not rev
else:
i,f,c = i.split()
if rev == False:
if f == "1":
front.append(c)
else:
back.append(c)
... | a = input()
n = int(input())
rev = False
front = []
back = []
q = [input() for i in range(n)]
for i in q:
if i == "1":
rev = not rev
else:
i,f,c = i.split()
if rev == False:
if f == "1":
front.append(c)
else:
back.append(c)
... | [] | 542,161 | 542,162 | u857759499 | python |
p02756 | S = input()
quantity = int(input())
L = [input().split() for i in range(quantity)]
hanten = -1
atama = ""
shiri = ""
for row in range(quantity):
each = L[row]
if each[0] == "1":
hanten = hanten * -1
else:
if each[1] == "1":
if hanten == -1:
atama = atama + each[2]... | S = input()
quantity = int(input())
L = [input().split() for i in range(quantity)]
hanten = -1
atama = ""
shiri = ""
for row in range(quantity):
each = L[row]
if each[0] == "1":
hanten = hanten * -1
else:
if each[1] == "1":
if hanten == -1:
atama = atama + each[2]... | [
"call.remove"
] | 542,163 | 542,164 | u652892331 | python |
p02756 | S = input()
quantity = int(input())
L = [input().split() for i in range(quantity)]
hanten = -1
atama = ""
shiri = ""
for row in range(quantity):
each = L[row]
if each[0] == "1":
hanten = hanten * -1
else:
if each[1] == "1":
if hanten == -1:
atama = atama + each[2]... | S = input()
quantity = int(input())
L = [input().split() for i in range(quantity)]
hanten = -1
atama = ""
shiri = ""
for row in range(quantity):
each = L[row]
if each[0] == "1":
hanten = hanten * -1
else:
if each[1] == "1":
if hanten == -1:
atama = atama + each[2]... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 542,165 | 542,164 | u652892331 | python |
p02756 | import collections
class Formatter:
def __init__(self, s):
self._d = collections.deque(s)
self._reversed = False
def reverse(self):
self._reversed = not self._reversed
def append(self, s):
if self._reversed:
self._d.appendleft(s)
else:
self... | import collections
class Formatter:
def __init__(self, s):
self._d = collections.deque(s)
self._reversed = False
def reverse(self):
self._reversed = not self._reversed
def append(self, s):
if self._reversed:
self._d.appendleft(s)
else:
self... | [] | 542,178 | 542,179 | u471898432 | python |
p02756 | from collections import deque
s = input()
q = int(input())
query = [list(input().split()) for i in range(q)]
now = 0
a = deque([s])
for i in query:
if i[0] == "1":
now ^= 1
elif i[0] == "2":
f,c = int(i[1]),i[2]
if (f+now) % 2:
a.appendleft(c)
else:
a.append(c)
if now:
a.reverse()
ans... | from collections import deque
s = list(input())
q = int(input())
query = [list(input().split()) for i in range(q)]
now = 0
a = deque(s)
for i in query:
if i[0] == "1":
now ^= 1
elif i[0] == "2":
f,c = int(i[1]),i[2]
if (f+now) % 2:
a.appendleft(c)
else:
a.append(c)
if now:
a.reverse()... | [
"call.add",
"call.arguments.change"
] | 542,186 | 542,187 | u102960641 | python |
p02756 | import collections
S = input()
Q = int(input())
query_list = [input().split() for _ in range(Q)]
T_cnt_list = collections.deque([0])
left = ''
right = ''
for i, query in enumerate(query_list):
if query[0] == '1':
T_cnt_list.append(1+T_cnt_list[-1])
else:
T_cnt_list.append(T_cnt_list[-1])
... | import collections
S = input()
Q = int(input())
query_list = [input().split() for _ in range(Q)]
T_cnt_list = collections.deque([0])
left = ''
right = ''
for i, query in enumerate(query_list):
if query[0] == '1':
T_cnt_list.append(1+T_cnt_list[-1])
else:
T_cnt_list.append(T_cnt_list[-1])
... | [] | 542,190 | 542,191 | u591503175 | python |
p02756 | import copy
S=input()
Q=int(input())
Query=[]
temp=[]
revflag=0
sbef=[]
saft=[]
for i in range(Q):
temp=input().split()
if len(temp) ==1:
revflag += 1
else:
if (revflag + int(temp[1])-1 )%2 == 0:
sbef.append(temp[2])
else:
saft.append(temp[2])
ans=""
for ... | import copy
S=input()
Q=int(input())
Query=[]
temp=[]
revflag=0
sbef=[]
saft=[]
for i in range(Q):
temp=input().split()
if len(temp) ==1:
revflag += 1
else:
if (revflag + int(temp[1])-1 )%2 == 0:
sbef.append(temp[2])
else:
saft.append(temp[2])
ans=""
for ... | [
"call.remove"
] | 542,192 | 542,193 | u447679353 | python |
p02756 | S=input()
q=int(input())
RV=0
A="A"
for i in range(q):
IN=input()
if IN=="1":
RV+=1
else:
t,f,c=IN.split()
if RV%2==0:
if f=="1":
A=c+A
else:
A=A+c
else:
if f=="1":
A=A+c
... | S=input()
q=int(input())
RV=0
A="A"
for i in range(q):
IN=input()
if IN=="1":
RV+=1
else:
t,f,c=IN.split()
if RV%2==0:
if f=="1":
A=c+A
else:
A=A+c
else:
if f=="1":
A=A+c
... | [] | 542,194 | 542,195 | u573754721 | python |
p02756 | a = input()
flag = 0
first = []
last = []
for i in range(int(input())):
query = [j for j in input().split()]
t = int(query[0])
if t == 1:
flag = 1 - flag
else:
x = int(query[1])
if x == 1:
if flag == 0:
first.append(query[2])
else:
... | a = input()
flag = 0
first = []
last = []
for i in range(int(input())):
query = [j for j in input().split()]
t = int(query[0])
if t == 1:
flag = 1 - flag
else:
x = int(query[1])
if x == 1:
if flag == 0:
first.append(query[2])
else:
... | [] | 542,196 | 542,197 | u021667910 | python |
p02756 | S = input()
Q = int(input())
queries = []
for i in range(Q):
query = [x for x in input().split()]
query[0] = int(query[0])
if query[0] == 2:
query[1] = int(query[1])
queries.append(query)
former = []
latter = []
is_normal = True
for query in queries:
if query[0] == 1:
is_normal = no... | S = input()
Q = int(input())
queries = []
for i in range(Q):
query = [x for x in input().split()]
query[0] = int(query[0])
if query[0] == 2:
query[1] = int(query[1])
queries.append(query)
former = []
latter = []
is_normal = True
for query in queries:
if query[0] == 1:
is_normal = no... | [] | 542,198 | 542,199 | u608579392 | python |
p02756 | S = input()
Q = int(input())
before_chr = []
after_chr = []
reverse_status = 1
for i in range(Q):
query = list(input().split())
if query[0] == "1":
reverse_status *= -1
elif reverse_status * (1.5-int(query[1])) == 0.5:
before_chr += query[2]
else:
after_chr += query[2]
if revers... | S = input()
Q = int(input())
before_chr = []
after_chr = []
reverse_status = 1
for i in range(Q):
query = list(input().split())
if query[0] == "1":
reverse_status *= -1
elif reverse_status * (1.5-int(query[1])) == 0.5:
before_chr += query[2]
else:
after_chr += query[2]
if reverse... | [] | 542,200 | 542,201 | u150027030 | python |
p02756 | import sys
import math
s = input()
Q = int(input())
query = []
[query.append(input().split()) for _ in range(Q)]
inversion = -1
if len(s) >= 3:
head = s[0]
tail = s[-1]
body = s[1:-2]
for i in range(Q):
if query[i][0] == "1":
inversion *= -1
continue
c = str(q... | import sys
import math
s = input()
Q = int(input())
query = []
[query.append(input().split()) for _ in range(Q)]
inversion = -1
if len(s) >= 3:
head = s[0]
tail = s[-1]
body = s[1:-1]
for i in range(Q):
if query[i][0] == "1":
inversion *= -1
continue
c = str(q... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 542,202 | 542,203 | u192042624 | python |
p02756 | import collections
S = input()
Q = int(input())
Query = [input() for i in range(Q)]
deq = collections.deque([S])
flg = False
for q in Query:
query = q.split(' ')
if query[0]=='1':
flg = not flg
elif query[0] == '2':
if query[1] == '1':
if flg == True:
deq.app... | import collections
S = input()
Q = int(input())
Query = [input() for i in range(Q)]
deq = collections.deque(S)
flg = False
for q in Query:
query = q.split(' ')
if query[0]=='1':
flg = not flg
elif query[0] == '2':
if query[1] == '1':
if flg == True:
deq.appen... | [
"call.arguments.change"
] | 542,204 | 542,205 | u012955130 | python |
p02756 | s=input()
n=int(input())
isreverse=False
top=''
for i in range(n):
ss=input().split()
if len(ss)==1:
isreverse=not isreverse
else:
if ss[1]=="1":
if isreverse: s+=ss[2]
else: top+ss[2]
else:
if isreverse: top+=ss[2]
else: s+=ss[2]
if i... | s=input()
n=int(input())
isreverse=False
top=''
for i in range(n):
ss=input().split()
if len(ss)==1:
isreverse=not isreverse
else:
if ss[1]=="1":
if isreverse: s+=ss[2]
else: top+=ss[2]
else:
if isreverse: top+=ss[2]
else: s+=ss[2]
if ... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 542,208 | 542,209 | u449473917 | python |
p02756 | from collections import deque as dq
s = input()
nq = int(input())
s = dq(s)
jun = True
for i in range(nq):
query = input().split()
if query[0] == '1':
jun = not jun
continue
if jun:
if query[1] == '1':
s.appendleft(query[2])
else:
s.append(query[2])
else:
if query[1] == '1':
... | from collections import deque as dq
s = input()
nq = int(input())
s = dq(s)
jun = True
for i in range(nq):
query = input().split()
if query[0] == '1':
jun = not jun
continue
if jun:
if query[1] == '1':
s.appendleft(query[2])
else:
s.append(query[2])
else:
if query[1] == '1':
... | [
"call.add",
"call.arguments.change"
] | 542,214 | 542,215 | u727057618 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.