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 | 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.qppend(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':
... | [
"identifier.change",
"call.add",
"call.arguments.change"
] | 542,216 | 542,215 | u727057618 | python |
p02756 | #import time
S = input()
Q = int(input())
f = True
head = []
tail = []
for i in range(Q):
query = input().split(' ')
if len(query) == 1:
f = not f
else:
if (query[1] == '1' and f) or (query[1] == '0' and not f):
head.append(query[2])
else:
tail.append(query[2]... | #import time
S = input()
Q = int(input())
f = True
head = []
tail = []
for i in range(Q):
query = input().split(' ')
if len(query) == 1:
f = not f
else:
if (query[1] == '1' and f) or (query[1] == '2' and not f):
head.append(query[2])
else:
tail.append(query[2]... | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 542,224 | 542,225 | u360061665 | python |
p02756 | s = input()
q = int(input())
mode = True
l = ''
r = ''
for _ in range(q):
tfc = input().split()
if int(tfc[0]) == 1:
mode = not mode
else:
if mode:
if int(tfc[1]) == 1:
l += tfc[2]
else:
r += tfc[2]
else:
if int(tfc[... | s = input()
q = int(input())
mode = True
l = ''
r = ''
for _ in range(q):
tfc = input().split()
if int(tfc[0]) == 1:
mode = not mode
else:
if mode:
if int(tfc[1]) == 1:
l += tfc[2]
else:
r += tfc[2]
else:
if int(tfc[... | [] | 542,257 | 542,258 | u143322814 | python |
p02756 | from collections import deque
S = deque([input()])
N = int(input())
is_inversed = False
for i in range(N):
Q = input()
if Q[0] == '1':
is_inversed = not (is_inversed)
else:
if (Q[2] == '1' and is_inversed) or (Q[2] == '2' and not (is_inversed)):
S.append(Q[4])
else:
... | from collections import deque
S = deque(input())
N = int(input())
is_inversed = False
for i in range(N):
Q = input()
if Q[0] == '1':
is_inversed = not (is_inversed)
else:
if (Q[2] == '1' and is_inversed) or (Q[2] == '2' and not (is_inversed)):
S.append(Q[4])
else:
... | [
"call.arguments.change"
] | 542,263 | 542,264 | u309039873 | python |
p02756 | from collections import deque
S = list(input())
S = deque(S)
Q = int(input())
c = 0
for _ in range(Q):
q = list(input().split())
if int(q[0]) == 1:
if c == 0:
c = 1
else:
c = 0
else:
if c == 0:
if int(q[1]) == 1:
S.appendleft(q[2])
... | from collections import deque
S = list(input())
S = deque(S)
Q = int(input())
c = 0
for _ in range(Q):
q = list(input().split())
if int(q[0]) == 1:
if c == 0:
c = 1
else:
c = 0
else:
if c == 0:
if int(q[1]) == 1:
S.appendleft(q[2])
... | [] | 542,284 | 542,285 | u201387466 | python |
p02756 | from collections import deque
S = deque(input())
Q = int(input())
flip = False # True: left side is head
for i in range(Q):
Query_i = list(map(str, input().split()))
if Query_i[0]=='1':
flip = not flip
elif Query_i[1] == '1' and not flip:
S.appendleft(Query_i[2])
elif Query_i[1] == '1' and flip:
S.... | from collections import deque
S = deque(input())
Q = int(input())
flip = False # False: left side is the head
for i in range(Q):
Query_i = list(map(str, input().split()))
if Query_i[0]=='1':
flip = not flip
elif Query_i[1] == '1' and not flip:
S.appendleft(Query_i[2])
elif Query_i[1] == '1' and flip:
... | [
"assignment.remove"
] | 542,298 | 542,299 | u814885356 | python |
p02756 | S = input()
Q = int(input())
reverse = False
front = ""
end = ""
for i in range(Q):
inp = input()
if inp[0] == "1":
reverse = ~reverse
else:
_, F, C = inp.split()
if (F == "1") ^ reverse:
front = front+C
else:
end = end+C
if reverse:
print(end[... | S = input()
Q = int(input())
reverse = False
front = ""
end = ""
for i in range(Q):
inp = input()
if inp[0] == "1":
reverse = not reverse
else:
_, F, C = inp.split()
if (F == "1") ^ reverse:
front = front+C
else:
end = end+C
if reverse:
print(e... | [
"assignment.value.change"
] | 542,305 | 542,306 | u266113953 | python |
p02756 | S = input()
Q = int(input())
reverse = False
front = ""
end = ""
for i in range(Q):
inp = input()
if inp[0] == "1":
reverse = ~reverse
else:
_, F, C = inp.split()
if (F == "1") ^ reverse:
front =front+C
else:
end =end+C
if reverse:
print(end[::-1... | S = input()
Q = int(input())
reverse = False
front = ""
end = ""
for i in range(Q):
inp = input()
if inp[0] == "1":
reverse = not reverse
else:
_, F, C = inp.split()
if (F == "1") ^ reverse:
front = front+C
else:
end = end+C
if reverse:
print(e... | [
"assignment.value.change"
] | 542,307 | 542,306 | u266113953 | python |
p02756 | S = input()
Q = int(input())
reverse = False
front = ""
end = ""
for i in range(Q):
inp = input()
if inp[0] == "1":
reverse = ~reverse
else:
_, F, C = inp.split()
if (F == "1") ^ reverse:
front = front+C
else:
end = end+C
if reverse:
print(end[::... | S = input()
Q = int(input())
reverse = False
front = ""
end = ""
for i in range(Q):
inp = input()
if inp[0] == "1":
reverse = not reverse
else:
_, F, C = inp.split()
if (F == "1") ^ reverse:
front = front+C
else:
end = end+C
if reverse:
print(e... | [
"assignment.value.change"
] | 542,308 | 542,306 | u266113953 | python |
p02756 | S = input()
Q = int(input())
reverse = False
front = ""
end = ""
for i in range(Q):
inp = input().split()
if inp[0] == "1":
reverse = ~reverse
else:
if (inp[1] == "1") ^ reverse:
front = front+inp[2]
else:
end = end+inp[2]
if reverse:
print(end[::-1]+S... | S = input()
Q = int(input())
reverse = False
front = ""
end = ""
for i in range(Q):
inp = input().split()
if inp[0] == "1":
reverse = not reverse
else:
if (inp[1] == "1") ^ reverse:
front = front+inp[2]
else:
end = end+inp[2]
if reverse:
print(end[::-1... | [
"assignment.value.change"
] | 542,309 | 542,310 | u266113953 | python |
p02756 | S = input()
Q = int(input())
A = ""
B = ""
count = 0
Que = []
ope = []
def rev(s):
re = ""
for i in range(len(s)):
re = re + s[len(s) - 1 - i]
return s
for i in range(Q):
k = input()
if k == "1":
count += 1
Que.append("1")
ope.append("0")
else:
Que.a... | S = input()
Q = int(input())
A = ""
B = ""
count = 0
Que = []
ope = []
def rev(s):
re = ""
for i in range(len(s)):
re = re + s[len(s) - 1 - i]
return re
for i in range(Q):
k = input()
if k == "1":
count += 1
Que.append("1")
ope.append("0")
else:
Que.... | [
"identifier.change",
"function.return_value.change"
] | 542,311 | 542,312 | u283929013 | python |
p02756 | S = input()
Q = int(input())
A = ""
B = ""
count = 0
Que = []
ope = []
def rev(s):
re = ""
for i in range(len(s)):
re = re + s[len(s) - 1 - i]
return s
for i in range(Q):
k = input()
if k == "1":
count += 1
Que.append("1")
ope.append("0")
else:
Que.app... | S = input()
Q = int(input())
A = ""
B = ""
count = 0
Que = []
ope = []
def rev(s):
re = ""
for i in range(len(s)):
re = re + s[len(s) - 1 - i]
return re
for i in range(Q):
k = input()
if k == "1":
count += 1
Que.append("1")
ope.append("0")
else:
Que.... | [
"identifier.change",
"function.return_value.change"
] | 542,313 | 542,312 | u283929013 | python |
p02756 | from collections import deque
s=input()
q=int(input())
flug=0
ans=deque(list(s))
for i in range(q):
t=list(input().split())
if t[0]=="1":
flug+=1
else:
if (flug%2==0 and t[1]==2) or (flug%2==1 and t[1]==1):
ans.append(t[2])
else:
ans.appendleft(t[2])
a... | from collections import deque
s=input()
q=int(input())
flug=0
ans=deque(list(s))
for i in range(q):
t=list(input().split())
if t[0]=="1":
flug+=1
else:
if (flug%2==0 and t[1]=="2") or (flug%2==1 and t[1]=="1"):
ans.append(t[2])
else:
ans.appendleft(t[2])
a... | [
"control_flow.branch.if.condition.change"
] | 542,318 | 542,319 | u959225525 | python |
p02756 | # standard input
S = input()
Q = int(input())
Query = []
num_reverse = 0
L = []
R = []
rev = False
for _ in range(Q):
q = tuple(map(str, input().split()))
if q[0] == '1':
rev = (not rev)
else:
if (rev and q[1] == '1') or (not rev and q[1] == '2'):
R.append(q[2])
els... | # standard input
S = input()
Q = int(input())
Query = []
num_reverse = 0
L = []
R = []
rev = False
for _ in range(Q):
q = tuple(map(str, input().split()))
if q[0] == '1':
rev = (not rev)
else:
if (rev and q[1] == '1') or (not rev and q[1] == '2'):
R.append(q[2])
els... | [] | 542,320 | 542,321 | u577170763 | python |
p02756 | s=[input()]
q=int(input())
turn=True
l=""
for i in range(q):
qq=input().split()
if qq[0]=='1':
turn=not turn
else:
if turn and int(qq[1])-2:
l+=qq[2]
else:
s.append(qq[2])
text=l[::-1]+"".join(s)
print(text if turn else text[::-1]) | s=[input()]
q=int(input())
turn=True
l=""
for i in range(q):
qq=input().split()
if qq[0]=='1':
turn=not turn
else:
if turn==bool(int(qq[1])-2):
l+=qq[2]
else:
s.append(qq[2])
text=l[::-1]+"".join(s)
print(text if turn else text[::-1]) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 542,335 | 542,336 | u705007443 | python |
p02756 | #import sys
#input = sys.stdin.readline
def main():
s = input()
q = int(input())
is_rev = False
l = ''
r = ''
for _ in range(0, q):
query = input()
if len(query) == 1:
is_rev = not is_rev
else:
query = query.split(' ')
query = [int(que... | #import sys
#input = sys.stdin.readline
def main():
s = input()
q = int(input())
is_rev = False
l = ''
r = ''
for _ in range(0, q):
query = input()
if len(query) == 1:
is_rev = not is_rev
else:
query = query.split(' ')
query = [int(que... | [] | 542,339 | 542,340 | u678594774 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
query = [input().split() for _ in range(Q)]
ans = deque(list(S))
flag = 1
for q in range(Q):
if len(query[q]) == 1:
flag = 1 - flag
else:
if query[q][1] == '1':
if flag:
ans.append(query[q][2])
... | from collections import deque
S = input()
Q = int(input())
query = [input().split() for _ in range(Q)]
ans = deque(list(S))
flag = 0
for q in range(Q):
if len(query[q]) == 1:
flag = 1 - flag
else:
if query[q][1] == '1':
if flag:
ans.append(query[q][2])
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 542,354 | 542,355 | u993622994 | python |
p02756 | from collections import deque
S = deque(input())
queryNum = input()
flip = False
for i in range(int(queryNum)):
order = input()
if order == '1':
if flip:
flip = False
else:
flip = True
else:
if order[2] == '1':
if not flip:
S.appendleft(order[4])
elif flip:
S.appendright(order[4])
else:
... | from collections import deque
S = deque(input())
queryNum = input()
flip = False
for i in range(int(queryNum)):
order = input()
if order == '1':
if flip:
flip = False
else:
flip = True
else:
if order[2] == '1':
if not flip:
S.appendleft(order[4])
elif flip:
S.append(order[4])
else:
if... | [
"identifier.change"
] | 542,367 | 542,368 | u660899380 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
q = deque(S)
fg = False
for i in range(Q):
que = list(map(str , input().split()))
if que[0] == "1":
fg = True
elif (que[1] == "1" and fg == False) or (que[1] == "2" and fg == True) :
q.appendleft(que[2])
else:
q.append(q... | from collections import deque
S = input()
Q = int(input())
q = deque(S)
fg = False
for i in range(Q):
que = list(map(str , input().split()))
if que[0] == "1":
fg = not fg
elif (que[1] == "1" and fg == False) or (que[1] == "2" and fg == True) :
q.appendleft(que[2])
else:
q.append... | [
"assignment.value.change"
] | 542,370 | 542,371 | u228636605 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
d = deque(S)
fg = False
for i in range(Q):
que = list(map(str , input().split()))
if que[0] == "1":
fg = True
elif (que[1] == "1" and fg == False) or (que[1] == "2" and fg == True) :
q.appendleft(que[2])
else:
q.append(q... | from collections import deque
S = input()
Q = int(input())
q = deque(S)
fg = False
for i in range(Q):
que = list(map(str , input().split()))
if que[0] == "1":
fg = not fg
elif (que[1] == "1" and fg == False) or (que[1] == "2" and fg == True) :
q.appendleft(que[2])
else:
q.append... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 542,372 | 542,371 | u228636605 | python |
p02756 | #!/usr/bin/env python3 ## -*- python -*-
from collections import deque
def main():
s = deque()
s.append(input())
q = int(input())
head = "l"
for i in range(q):
d = input()
if d[0] == "1":
if head == "l":
head = "r"
else:
head =... | #!/usr/bin/env python3 ## -*- python -*-
from collections import deque
def main():
s = deque()
s.extend(input())
q = int(input())
head = "l"
for i in range(q):
d = input()
if d[0] == "1":
if head == "l":
head = "r"
else:
head =... | [
"identifier.change"
] | 542,375 | 542,376 | u745802292 | python |
p02756 | s = input()
q = int(input())
rev = 0
front = ""
back = ""
all_rev = 0
for i in range(q):
t = input().split()
# T_1 = 1の時
if len(t) == 1:
rev += 1
all_rev += 1
# T_1 = 2の時
else:
if rev%2 == 1:
if t[1] == '1':
back = back + t[2]
else:... | s = input()
q = int(input())
rev = 0
front = ""
back = ""
all_rev = 0
for i in range(q):
t = input().split()
# T_1 = 1の時
if len(t) == 1:
rev += 1
all_rev += 1
# T_1 = 2の時
else:
if rev%2 == 1:
if t[1] == '1':
back = back + t[2]
else:... | [
"assignment.remove"
] | 542,386 | 542,387 | u900848911 | python |
p02756 | def main(sample_file = ''):
""" convenient functions
# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# Higher-order function: reduce(operator.mul, xyz_count, 1)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc... | def main(sample_file = ''):
""" convenient functions
# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# Higher-order function: reduce(operator.mul, xyz_count, 1)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc... | [] | 542,390 | 542,391 | u988402778 | python |
p02756 | left = input()
q = int(input())
right = ""
flag = 1
for i in range(q) :
t = input()
if t == "1" :
flag ^= 1
continue
t, f, c = t.split(" ")
f = int(f)
left += c*flag*(2-f)
right += c*flag*(f-1)
left += c*(1-flag)*(f-1)
right += c*(1-flag)*(2-f)
if flag == 1 :
print(le... | right = input()
q = int(input())
left = ""
flag = 1
for i in range(q) :
t = input()
if t == "1" :
flag ^= 1
continue
t, f, c = t.split(" ")
f = int(f)
left += c*flag*(2-f)
right += c*flag*(f-1)
left += c*(1-flag)*(f-1)
right += c*(1-flag)*(2-f)
if flag == 1 :
print(le... | [
"assignment.variable.change",
"identifier.change"
] | 542,397 | 542,398 | u052221988 | python |
p02756 | s=input()
q=int(input())
rev=1
sf=s
sb=""
for _ in range(0,q):
n=input().split()
if n[0]=="1":
rev*=-1
else:
if (n[1]=="1" and rev==1) or (n[1]=="2" and rev==-1):
sf+=n[2]
else:
sb+=n[2]
s=sf[::-1]+sb
if rev==1:
print(s)
else:
print(s[::-1])
| s=input()
q=int(input())
rev=1
sf=""
sb=s
for _ in range(0,q):
n=input().split()
if n[0]=="1":
rev*=-1
else:
if (n[1]=="1" and rev==1) or (n[1]=="2" and rev==-1):
sf+=n[2]
else:
sb+=n[2]
s=sf[::-1]+sb
if rev==1:
print(s)
else:
print(s[::-1])
| [
"assignment.remove",
"assignment.add"
] | 542,408 | 542,409 | u866374539 | python |
p02756 | B = input()
order = True
F = ""
for q in range(int(input())):
T = input().rstrip().split()
if T[0] == "1":
order ^= True
else:
f,c = T[1],T[2]
if not((f == "1") ^ order):
F += c
else:
B += c
print(F,B)
F = F[::-1]+B
if not order:
F = F[::-1]
pr... | B = input()
order = True
F = ""
for q in range(int(input())):
T = input().rstrip().split()
if T[0] == "1":
order ^= True
else:
f,c = T[1],T[2]
if not((f == "1") ^ order):
F += c
else:
B += c
#print(F,B)
F = F[::-1]+B
if not order:
F = F[::-1]
p... | [
"call.remove"
] | 542,411 | 542,412 | u164029270 | python |
p02756 | from collections import deque
d = deque()
length = 0
for x in input():
d.append(x)
length += 1
Q = int(input())
f = 0
for _ in range(Q):
l = list(input().split())
if l[0] == '1':
f ^= 1
else:
length += 1
if f == '0':
if l[1] == '0': d.append(l[2])
els... | from collections import deque
d = deque()
length = 0
for x in input():
d.append(x)
length += 1
Q = int(input())
f = 0
for _ in range(Q):
l = list(input().split())
if l[0] == '1':
f ^= 1
else:
length += 1
if f == 0:
if l[1] == '2': d.append(l[2])
else:... | [
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 542,415 | 542,416 | u020604402 | python |
p02756 | S = list(map(str, input()))
q = int(input())
Q =[list(map(str, input().split())) for k in range(q)]
rev = False
f1 = []
f2 = []
def pls(n):
global rev
if n[0] == "1":
rev = not rev
else:
if n[1] == "1":
if rev:
f2.append(n[2])
else:
f1.... | S = list(map(str, input()))
q = int(input())
Q =[list(map(str, input().split())) for k in range(q)]
rev = False
f1 = []
f2 = []
def pls(n):
global rev
if n[0] == "1":
rev = not rev
else:
if n[1] == "1":
if rev:
f2.append(n[2])
else:
f1.... | [
"identifier.change",
"call.remove"
] | 542,417 | 542,418 | u203382704 | python |
p02756 | s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
in_line = input().split()
if in_line[0] == "1":
flag *= -1
else:
if in_line[1] == "1":
if flag == 1:
list1.append(in_line[2])
else:
list2.append(in_line[2])
... | s = input()
q = int(input())
list1 = []
list2 = []
flag = 1
for i in range(q):
in_line = input().split()
if in_line[0] == "1":
flag *= -1
else:
if in_line[1] == "1":
if flag == 1:
list1.append(in_line[2])
else:
list2.append(in_line[2])
... | [] | 542,419 | 542,420 | u271752821 | python |
p02756 | S = input()
Q = int(input())
flg = 0
senntou = ''
ushiro = ''
for i in range(Q):
A = list(input().split())
if int(A[0]) == 1 and flg == 0:
flg = 1
continue
elif int(A[0]) == 1 and flg == 1:
flg = 0
continue
if (int(A[1]) == 1 and flg == 0) or (int(A[1]) == 2 and flg == 1)... | S = input()
Q = int(input())
flg = 0
senntou = ''
ushiro = ''
for i in range(Q):
A = list(input().split())
if int(A[0]) == 1 and flg == 0:
flg = 1
continue
elif int(A[0]) == 1 and flg == 1:
flg = 0
continue
if (int(A[1]) == 1 and flg == 0) or (int(A[1]) == 2 and flg == 1)... | [] | 542,429 | 542,430 | u140191608 | python |
p02756 | from collections import deque
ss=deque()
s=list(input())
l=len(s)
for i in range(l):
ss.append(s[i])
q=int(input())
info=[]
rev=[] #i回までに何回反転があるか
num=0
for i in range(q):
info.append(list(input().split()))
moji=0 #文字の追加数
for i in range(q):
if info[i][0]=="1":
num+=1
else:
if info[i][1]==... | from collections import deque
ss=deque()
s=list(input())
l=len(s)
for i in range(l):
ss.append(s[i])
q=int(input())
info=[]
rev=[] #i回までに何回反転があるか
num=0
for i in range(q):
info.append(list(input().split()))
moji=0 #文字の追加数
for i in range(q):
if info[i][0]=="1":
num+=1
else:
if info[i][1]==... | [
"identifier.change",
"expression.operation.binary.remove"
] | 542,431 | 542,432 | u548303713 | python |
p02756 | s,_,*q=open(0)
a=['',s[:-1]]
p=1
for q in q:
if q>'1':
f=1if q<'2 2'else 0
a[f^p]+=q[-2]
else:p^=1
print(a[p^1][::-1]+a[p]) | s,_,*q=open(0)
a=['',s[:-1]]
p=1
for q in q:
if q>'2':
f=1if q<'2 2'else 0
a[f^p]+=q[-2]
else:p^=1
print(a[p^1][::-1]+a[p]) | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 542,437 | 542,438 | u729133443 | python |
p02756 | from collections import deque
s = input()
q = int(input())
flip = 0
d = deque([s])
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 == 1:
d.append(c)
else:
d.appendlef... | from collections import deque
s = input()
q = int(input())
flip = 0
d = deque(list(s))
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 == 1:
d.append(c)
else:
d.appen... | [
"assignment.value.change",
"call.arguments.change"
] | 542,447 | 542,448 | u745812846 | python |
p02756 | from collections import deque
s = input()
q = int(input())
flip = 0
d = deque([s])
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:
d.append(c)
else:
d.appendlef... | from collections import deque
s = input()
q = int(input())
flip = 0
d = deque(list(s))
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 == 1:
d.append(c)
else:
d.appen... | [
"assignment.value.change",
"call.arguments.change",
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 542,449 | 542,448 | u745812846 | python |
p02756 | def main():
from sys import stdin
#input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bisect_... | def main():
from sys import stdin
#input = sys.stdin.readline
#sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bisect... | [
"call.remove"
] | 542,460 | 542,461 | u863442865 | python |
p02756 | from collections import deque
s = deque(input())
q = int(input())
flag = 1
for i in range(q):
st = input().split()
if int(st[0]) == 1:
flag *= -1
else:
tmp = int(st[1])*flag
if tmp == 1 or -2:
s.appendleft(st[2])
else:
s.append(st[2])
if flag == -1:
s.reverse()
print(''.join(s)) | from collections import deque
s = deque(input())
q = int(input())
flag = 1
for i in range(q):
st = input().split()
if int(st[0]) == 1:
flag *= -1
else:
tmp = int(st[1])*flag
if tmp == 1 or tmp == -2:
s.appendleft(st[2])
else:
s.append(st[2])
if flag == -1:
s.reverse()
print(''.join... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 542,467 | 542,468 | u693945629 | python |
p02756 | s = input()
q = int(input())
Flag = True
right=''
left=''
for i in range(q):
t = input()
if t[0] == '1':
Flag = not Flag
else:
_, f, c = t.split()
if Flag == False and f == '2' or Flag == True and f == '1':
left += c
else:
right += c
ans = right[::-1... | s = input()
q = int(input())
Flag = False
right=''
left=''
for i in range(q):
t = input()
if t[0] == '1':
Flag = not Flag
else:
_, f, c = t.split()
if Flag == False and f == '2' or Flag == True and f == '1':
right += c
else:
left += c
ans = left[::-1... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 542,470 | 542,471 | u651109406 | python |
p02756 | import sys
input = lambda: sys.stdin.readline().rstrip()
s=[i for i in input()]
x=0 ; st=[[],[]]
for _ in range(int(input())):
inp=list(map(str,input().split()))
if len(inp)==1: x^=1
else: st[(int(inp[1])-1)^x].append(inp[2])
if x==0:
st[0].reverse()
ans=st[0]+s+st[1]
elif x==1:
st[1].reverse()
... | import sys
input = lambda: sys.stdin.readline().rstrip()
s=[i for i in input()]
x=0 ; st=[[],[]]
for _ in range(int(input())):
inp=list(map(str,input().split()))
if len(inp)==1: x^=1
else: st[(int(inp[1])-1)^x].append(inp[2])
if x==0:
st[0].reverse()
ans=st[0]+s+st[1]
elif x==1:
st[1].reverse()
... | [
"call.add"
] | 542,476 | 542,477 | u092301301 | python |
p02756 | S=input()
Q=int(input())
Query=[[j for j in input().split()] for i in range(Q)]
c=0
S0=list(S)
for i in range(Q):
if Query[i][0]=='1':
c=c+1
else:
if ((Query[i][1]=='1')and(c%2==0)) or ((Query[i][1]=='2')and(c%2==1)):
S0.appendleft(Query[i][2])
else:
S0.append(Q... | from collections import deque
S=input()
Q=int(input())
Query=[[j for j in input().split()] for i in range(Q)]
c=0
S0=deque(S)
for i in range(Q):
if Query[i][0]=='1':
c=c+1
else:
if ((Query[i][1]=='1')and(c%2==0)) or ((Query[i][1]=='2')and(c%2==1)):
S0.appendleft(Query[i][2])
... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 542,478 | 542,479 | u327078256 | python |
p02756 | # キューを使ったアプローチ
from collections import deque
S = deque(input())
Q = int(input())
T = 0
for _ in range(Q):
Query = list(input().split())
if len(Query) == 1:
T ^= 1
elif T == 0:
m = Query[2]
if Query[1] == '1':
S.append(m)
else:
S.appendleft(m)
el... | # キューを使ったアプローチ
from collections import deque
S = deque(input())
Q = int(input())
T = 0
for _ in range(Q):
Query = list(input().split())
if len(Query) == 1:
T ^= 1
elif T == 0:
m = Query[2]
if Query[1] == '1':
S.appendleft(m)
else:
S.append(m)
el... | [
"identifier.change"
] | 542,488 | 542,489 | u125545880 | python |
p02756 | from collections import deque
s=list(input())
s=deque(s)
q=int(input())
re=False
for i in range(1,q+1):
q_i=input().split()
if q_i[0]=="1":
re= not re
else:
if q_i[1]=="1" and re==False:
s.appendleft(q_i[2])
elif q_i[1]=="2" and re==True:
s.appendleft(q_i[2]... | from collections import deque
s=list(input())
s=deque(s)
q=int(input())
re=False
for i in range(1,q+1):
q_i=input().split()
if q_i[0]=="1":
re= not re
else:
if q_i[1]=="1" and re==False:
s.appendleft(q_i[2])
elif q_i[1]=="2" and re==True:
s.appendleft(q_i[2]... | [
"assignment.add"
] | 542,519 | 542,520 | u189485655 | python |
p02756 | def main():
c = 0
s = input()
f = ''
b = ''
for _ in range(int(input())):
q = input().split()
if q[0] == '1':
c += 1
else:
if (q[1] == '1' and c%2 == 0) or (q[1]=='2' and c%2==1):
f = q[2] + f
else:
b += q[2]... | def main():
c = 0
s = input()
f = ''
b = ''
for _ in range(int(input())):
q = input().split()
if q[0] == '1':
c += 1
else:
if (q[1] == '1' and c%2 == 0) or (q[1]=='2' and c%2==1):
f = q[2] + f
else:
b += q[2]... | [
"control_flow.branch.if.condition.change"
] | 542,527 | 542,528 | u558182684 | python |
p02756 | ions
S = input()
Q = int(input())
rev = False
deque = collections.deque()
for c in S:
deque.append(c)
for _ in range(Q):
read = input()
if read == '1':
rev = not rev
else:
_, f, c = read.split()
if not rev:
if f == '1':
deque.appendleft(c)
... |
import collections
S = input()
Q = int(input())
rev = False
deque = collections.deque()
for c in S:
deque.append(c)
for _ in range(Q):
read = input()
if read == '1':
rev = not rev
else:
_, f, c = read.split()
if not rev:
if f == '1':
deque.appendle... | [] | 542,536 | 542,537 | u179053337 | python |
p02756 |
import collections
S = input()
Q = int(input())
rev = False
deque = collections.deque()
deque.append(S)
for _ in range(Q):
read = input()
if read == '1':
rev = not rev
else:
_, f, c = read.split()
if not rev:
if f == '1':
deque.appendleft(c)
... |
import collections
S = input()
Q = int(input())
rev = False
deque = collections.deque()
for c in S:
deque.append(c)
for _ in range(Q):
read = input()
if read == '1':
rev = not rev
else:
_, f, c = read.split()
if not rev:
if f == '1':
deque.appendle... | [
"identifier.change",
"call.arguments.change"
] | 542,538 | 542,537 | u179053337 | python |
p02756 | s = input()
q = int(input())
s1 = ""
s2 = ""
cnt = 1
for i in range(q):
l1 = list(input().split())
if len(l1) == 1:
cnt *= -1
else:
if (cnt == 1 and l1[1] == "1") or (cnt == -1 and l1[1] == "2"):
s1 = l1[2] + s1
else:
s2 = s2 + l1[2]
if cnt == 1:
print(s1+s+s2)
else:
print(s2[::-1]+s+s... | s = input()
q = int(input())
s1 = ""
s2 = ""
cnt = 1
for i in range(q):
l1 = list(input().split())
if len(l1) == 1:
cnt *= -1
else:
if (cnt == 1 and l1[1] == "1") or (cnt == -1 and l1[1] == "2"):
s1 = l1[2] + s1
else:
s2 = s2 + l1[2]
if cnt == 1:
print(s1+s+s2)
else:
print(s2[::-1]+s[:... | [] | 542,542 | 542,543 | u535236942 | python |
p02756 | from collections import deque
s = input()
q = int(input())
op = [input().split() for _ in range(q)]
flag = True
ans = deque()
ans.append(s)
for i in op:
if i[0] == "1":
flag = not flag
else:
if i[1] == "1":
if flag:
ans.appendleft(i[2])
else:
... | from collections import deque
s = input()
q = int(input())
op = [input().split() for _ in range(q)]
flag = True
ans = deque(s)
for i in op:
if i[0] == "1":
flag = not flag
else:
if i[1] == "1":
if flag:
ans.appendleft(i[2])
else:
ans.app... | [
"call.arguments.change",
"call.remove"
] | 542,546 | 542,547 | u116348130 | python |
p02756 | from collections import deque
s = input()
q = int(input())
query = [input() for _ in range(q)]
#s = deque(s)
inv = 0
for q in query :
if q[0] == '1':
inv += 1
else:
_,f,c = q.split()
if f == '1':
if inv % 2 == 0:
s.appendleft(c)
else:
... | from collections import deque
s = input()
q = int(input())
query = [input() for _ in range(q)]
s = deque(s)
inv = 0
for q in query :
if q[0] == '1':
inv += 1
else:
_,f,c = q.split()
if f == '1':
if inv % 2 == 0:
s.appendleft(c)
else:
... | [
"assignment.add"
] | 542,556 | 542,557 | u728473456 | python |
p02756 | s=input()
q=int(input())
from collections import deque
qq=deque(s)
cnt=0
for i in range(q):
j=input()
if j=="1":
cnt+=1
continue
_,k,l=j.split()
if (k=="2")^cnt%2:
qq.append(l)
else:
qq.appendleft(l)
if cnt%2==1:
print("".join(revesed(list(qq))))
else:
print(... | s=input()
q=int(input())
from collections import deque
qq=deque(s)
cnt=0
for i in range(q):
j=input()
if j=="1":
cnt+=1
continue
_,k,l=j.split()
if (k=="2")^cnt%2:
qq.append(l)
else:
qq.appendleft(l)
if cnt%2==1:
print("".join(reversed(list(qq))))
else:
print... | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 542,560 | 542,561 | u038815010 | python |
p02756 | from collections import deque
s = input()
q = int(input())
flag = True
atama = deque()
osiri = deque()
for i in range(q):
inp = input()
if inp == '1':
flag = not flag
else:
_, f, c = map(str, inp.split())
if f == '1':
if flag:
atama.appendleft(c)
... | from collections import deque
s = input()
q = int(input())
flag = True
atama = deque()
osiri = deque()
for i in range(q):
inp = input()
if inp == '1':
flag = not flag
else:
_, f, c = map(str, inp.split())
if f == '1':
if flag:
atama.appendleft(c)
... | [] | 542,566 | 542,567 | u540877546 | python |
p02756 | # D - String Formation
s = input()
q = int(input())
f = ''
b = ''
c = 0
for i in range(q):
query = input().split()
if query[0]=='1': c += 1 #t1
else: #t2
if c%2: #odd:reverse
if query[1]=='1': #f1
b += query[2]
else: #f2
f += query[2]
e... | # D - String Formation
s = input()
q = int(input())
f = ''
b = ''
c = 0
for i in range(q):
query = input().split()
if query[0]=='1': c += 1 #t1
else: #t2
if c%2: #odd:reverse
if query[1]=='1': #f1
b += query[2]
else: #f2
f += query[2]
e... | [] | 542,577 | 542,578 | u525065967 | python |
p02756 | from collections import deque
N = deque(input())
Q = int(input())
Qs = []
for _ in range(Q):
Qs.append(list(map(str, input().split())) )
k=0
for q in Qs:
if q[0] == '1':
k+=1
else:
if k%2 ==0:
if q[1]=='1':
N.appendleft(q[2])
else:
N.... | from collections import deque
N = deque(input())
Q = int(input())
Qs = []
for _ in range(Q):
Qs.append(list(map(str, input().split())) )
k=0
for q in Qs:
if q[0] == '1':
k+=1
else:
if k%2 ==0:
if q[1]=='1':
N.appendleft(q[2])
else:
N.... | [
"call.arguments.change"
] | 542,579 | 542,580 | u851319680 | python |
p02756 | s = input()
q = int(input())
revFlag = False
head, tail = [], []
for i in range(q):
query = list(input().split())
if int(query[0]) == 1:
revFlag = not revFlag
else:
if int(query[1]) == 1:
if not revFlag:
head.append(query[2])
else:
tail.append(query[2])
else:
if not ... | s = input()
q = int(input())
revFlag = False
head, tail = [], []
for i in range(q):
query = list(input().split())
if int(query[0]) == 1:
revFlag = not revFlag
else:
if int(query[1]) == 1:
if not revFlag:
head.append(query[2])
else:
tail.append(query[2])
else:
if not ... | [] | 542,583 | 542,584 | u852798899 | python |
p02756 | s = input()
q = int(input())
query = []
lead = ''
end = ''
inversion_flg = False
for j in range(q):
i = input().split()
if i[0] == "1":
if inversion_flg:
inversion_flg = False
else:
inversion_flg = True
else:
if inversion_flg:
if i[1] == "1":
... | s = input()
q = int(input())
query = []
lead = ''
end = ''
inversion_flg = False
for j in range(q):
i = input().split()
if i[0] == "1":
if inversion_flg:
inversion_flg = False
else:
inversion_flg = True
else:
if inversion_flg:
if i[1] == "1":
... | [] | 542,587 | 542,588 | u299791633 | python |
p02756 | import math
s = input()
q = int(input())
reverse_flag = 0
head = ""
tail = ""
for i in range(q):
query = input().split(" ")
if(len(query) == 1):
reverse_flag += 1
else:
if((reverse_flag + int(query[1]) % 2 == 0)):
tail += query[2]
else:
head = query[2] + head
ans_str = head + s + tail
... | import math
s = input()
q = int(input())
reverse_flag = 0
head = ""
tail = ""
for i in range(q):
query = input().split(" ")
if(len(query) == 1):
reverse_flag += 1
else:
if((reverse_flag + int(query[1])) % 2 == 0):
tail += query[2]
else:
head = query[2] + head
ans_str = head + s + tail
... | [
"control_flow.branch.if.condition.change"
] | 542,600 | 542,601 | u028620830 | python |
p02756 | from collections import deque
s = input()
t = s[::-1]
ss = deque(s)
tt = deque(s)
isS = True
n = int(input())
query = []
# print(q1, q2)
for i in range(n):
query.append(list(input().split()))
# print(query)
for i in range(n):
# Reverse
if query[i][0] == '1':
# s = s[::-1]
isS = not isS
... | from collections import deque
s = input()
t = s[::-1]
ss = deque(s)
tt = deque(t)
isS = True
n = int(input())
query = []
# print(q1, q2)
for i in range(n):
query.append(list(input().split()))
# print(query)
for i in range(n):
# Reverse
if query[i][0] == '1':
# s = s[::-1]
isS = not isS
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 542,602 | 542,603 | u600195339 | python |
p02756 | from collections import deque
s = deque()
s.append(input())
q = int(input())
reverse_status = False
for i in range(q):
query = list(map(format, input().split()))
if int(query[0]) == 1:
if reverse_status:
reverse_status = False
else:
reverse_status = True
else:
if int(query[1]) == 1:
... | from collections import deque
s = deque()
s.extend(list(input()))
q = int(input())
reverse_status = False
for i in range(q):
query = list(map(format, input().split()))
if int(query[0]) == 1:
if reverse_status:
reverse_status = False
else:
reverse_status = True
else:
if int(query[1]) == ... | [
"identifier.change",
"call.arguments.add",
"call.arguments.change"
] | 542,604 | 542,605 | u238956837 | python |
p02756 | from collections import deque
d=deque()
S=list(input())
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
flag=0 #反転なし
#print(query)
s=S
s2=""
d.extend(S)
print(d)
for i in range(Q):
#print(i,len(d))
if (len(query[i])==1):
if len(d)>1:
flag=(flag+1)%2 #反転フラグをひっくり返す
... | from collections import deque
d=deque()
S=list(input())
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
flag=0 #反転なし
#print(query)
s=S
s2=""
d.extend(S)
#print(d)
for i in range(Q):
#print(i,len(d))
if (len(query[i])==1):
if len(d)>1:
flag=(flag+1)%2 #反転フラグをひっくり返す
... | [
"call.remove"
] | 542,621 | 542,622 | u995004106 | python |
p02756 | from sys import stdin
def main():
S = list(stdin.readline().rstrip())
Q = int(input())
rev = 0
head = []
tail = []
for _ in range(Q):
q = stdin.readline()
if q[0] == "1":
rev = (rev+1)%2
else:
if q[2] == "1":
if rev == 0:
... | from sys import stdin
def main():
S = list(stdin.readline().rstrip())
Q = int(input())
rev = 0
head = []
tail = []
for _ in range(Q):
q = stdin.readline()
if q[0] == "1":
rev = (rev+1)%2
else:
if q[2] == "1":
if rev == 0:
... | [] | 542,625 | 542,626 | u038024401 | python |
p02756 | from collections import deque
def main():
S = input()
S = deque([c for c in S])
Q = int(input())
rvCt = 0
for _ in range(Q):
query = input().split()
if query[0] == '1':
rvCt += 1
else:
doReverse = False
if rvCt % 2 == 1:
do... | from collections import deque
def main():
S = input()
S = deque([c for c in S])
Q = int(input())
rvCt = 0
for _ in range(Q):
query = input().split()
if query[0] == '1':
rvCt += 1
else:
doReverse = False
if rvCt % 2 == 1:
do... | [
"identifier.change"
] | 542,629 | 542,630 | u074372598 | python |
p02756 | S = input()
nQ = int(input())
Ques = []
nReverse = 0
nAddFront= 0
nAddBack = 0
for i in range(nQ):
line = input().split()
if int(line[0]) == 1:
nReverse += 1
Ques.append([int(line[0])])
else:
if int(line[1]) == 1:
if nReverse % 2 == 0:
nAddFront += 1
else:
nAddBack += 1
... | S = input()
nQ = int(input())
Ques = []
nReverse = 0
nAddFront= 0
nAddBack = 0
for i in range(nQ):
line = input().split()
if int(line[0]) == 1:
nReverse += 1
Ques.append([int(line[0])])
else:
if int(line[1]) == 1:
if nReverse % 2 == 0:
nAddFront += 1
else:
nAddBack += 1
... | [
"expression.operator.change"
] | 542,633 | 542,634 | u509784400 | python |
p02756 | S = input()
nQ = int(input())
Ques = []
nReverse = 0
nAddFront= 0
nAddBack = 0
for i in range(nQ):
line = input().split()
if int(line[0]) == 1:
nReverse += 1
Ques.append([int(line[0])])
else:
if int(line[1]) == 1:
if nReverse % 2 == 0:
nAddFront += 1
else:
nAddBack += 1
... | S = input()
nQ = int(input())
Ques = []
nReverse = 0
nAddFront= 0
nAddBack = 0
for i in range(nQ):
line = input().split()
if int(line[0]) == 1:
nReverse += 1
Ques.append([int(line[0])])
else:
if int(line[1]) == 1:
if nReverse % 2 == 0:
nAddFront += 1
else:
nAddBack += 1
... | [
"call.remove",
"expression.operator.change"
] | 542,635 | 542,634 | u509784400 | python |
p02756 | s=input()
q=int(input())
trans=0
aft=""
bef=""
for i in range(q):
que=input()
if que[0]=="1":
trans=1-trans
else:
if (que[2]=="1" and trans==0) or (que[2]=="2" and trans==1):
bef=bef+que[4]
else:
aft=aft+que[4]
if trans==0:
print("".join(bef[::-1])+s+"".join(aft))
else:
print("".join(a... | s=input()
q=int(input())
trans=0
aft=""
bef=""
for i in range(q):
que=input()
if que[0]=="1":
trans=1-trans
else:
if (que[2]=="1" and trans==0) or (que[2]=="2" and trans==1):
bef=bef+que[4]
else:
aft=aft+que[4]
if trans==0:
print("".join(bef[::-1])+s+"".join(aft))
else:
print("".join(a... | [] | 542,639 | 542,640 | u731603651 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
alpha_map = {chr(i):i for i in range(97,123)}
alpha_map_inv = {i:chr(i) for i in range(97,123)}
a = deque()
for s in S:
a.append(s)
print(a)
reversed = False
for _ in range(Q):
query = list(map(str, input().split()))
if query[0] == '1':
if reverse... | from collections import deque
S = input()
Q = int(input())
alpha_map = {chr(i):i for i in range(97,123)}
alpha_map_inv = {i:chr(i) for i in range(97,123)}
a = deque()
for s in S:
a.append(s)
reversed = False
for _ in range(Q):
query = list(map(str, input().split()))
if query[0] == '1':
if reversed:
... | [
"call.remove"
] | 542,641 | 542,642 | u155659281 | python |
p02756 | S = input()
Q = int(input())
flg = "moto"
atama = list()
shippo = list()
for _ in range(Q):
tmp = list(map(str, input().split()))
if flg == "moto":
if int(tmp[0]) == 1:
flg = "hanten"
else:
if int(tmp[1]) == 1:
atama.append(tmp[2])
else:
... | S = input()
Q = int(input())
flg = "moto"
atama = list()
shippo = list()
for _ in range(Q):
tmp = list(map(str, input().split()))
if flg == "moto":
if int(tmp[0]) == 1:
flg = "hanten"
else:
if int(tmp[1]) == 1:
atama.append(tmp[2])
else:
... | [] | 542,643 | 542,644 | u161168905 | python |
p02756 | S = list(str(input()))
N = int(input())
top = []
end = []
order = []
state = True
for n in range(N):
order = input().split()
if order[0] == '2':
if (order[1] == '1') == state:
top.append(order[2])
else:
end.append(order[2])
elif state:
state = False
el... | S = list(str(input()))
N = int(input())
top = []
end = []
order = []
state = True
for n in range(N):
order = input().split()
if order[0] == '2':
if (order[1] == '1') == state:
top.append(order[2])
else:
end.append(order[2])
elif state:
state = False
el... | [] | 542,648 | 542,649 | u577725859 | python |
p02756 | def input_int():
return map(int, input().split())
def one_int():
return int(input())
def one_str():
return input()
def many_int():
return list(map(int, input().split()))
S= one_str()
Q = one_int()
Qs = [ input() for i in range(Q)]
def ss(S, Qs):
is_not_ac=False
head = ""
tail = ""
... | def input_int():
return map(int, input().split())
def one_int():
return int(input())
def one_str():
return input()
def many_int():
return list(map(int, input().split()))
S= one_str()
Q = one_int()
Qs = [ input() for i in range(Q)]
def ss(S, Qs):
is_not_ac=False
head = ""
tail = ""
... | [] | 542,650 | 542,651 | u688375653 | python |
p02756 | s = input()
q = int(input())
qs = [input().split() for i in range(q)]
n = False
l = r = ""
for op in qs:
if op[0] == '1':
n = not n
if op[0] == '2':
t , f, c = op
f = int(f)
if n:
f = 1 if f != 1 else 2
if f != 1:
l=c+l
elif f == 2:
... | s = input()
q = int(input())
qs = [input().split() for i in range(q)]
n = False
l = r = ""
for op in qs:
if op[0] == '1':
n = not n
if op[0] == '2':
t , f, c = op
f = int(f)
if n:
f = 1 if f != 1 else 2
if f == 1:
l=c+l
elif f == 2:
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 542,662 | 542,661 | u533328562 | python |
p02756 | #!python3
import sys
iim = lambda: map(int, input().rstrip().split())
from collections import deque
def resolve():
S = deque(input().split())
Q = int(input())
rev = False
for ti, *arg in (line.split() for line in sys.stdin):
if ti == "1":
rev = not rev
else:
f... | #!python3
import sys
iim = lambda: map(int, input().rstrip().split())
from collections import deque
def resolve():
S = deque(input().rstrip())
Q = int(input())
rev = False
for ti, *arg in (line.split() for line in sys.stdin):
if ti == "1":
rev = not rev
else:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 542,667 | 542,668 | u348805958 | python |
p02756 | s1=input()
q=int(input())
s0=[]
f=1
for i in range(q):
a=list(input().split())
#print(i,a,s)
if int(a[0])==1:
f=(f+1)%2
else:
if (f+int(a[1]))%2==0:
s0.append(a[2])
else:
s1.append(a[2])
if f==1:
print("".join(s0[::-1])+"".join(s1))
else:
print("".join(s1[::-1])+"".join(s0))
| s1=list(input())
q=int(input())
s0=[]
f=1
for i in range(q):
a=list(input().split())
#print(i,a,s)
if int(a[0])==1:
f=(f+1)%2
else:
if (f+int(a[1]))%2==0:
s0.append(a[2])
else:
s1.append(a[2])
if f==1:
print("".join(s0[::-1])+"".join(s1))
else:
print("".join(s1[::-1])+"".join(s0))
| [
"call.add",
"call.arguments.change"
] | 542,673 | 542,674 | u090649502 | python |
p02756 | s = input()
q = int(input())
rev_flag = False
x_lis = []
y_lis = []
for _ in range(q):
i = input()
if i == '1':
rev_flag = not rev_flag
else:
a,b,c = i.split()
if rev_flag:
if b == '1':
#s = s + c
y_lis.append(c)
else:
... | s = input()
q = int(input())
rev_flag = False
x_lis = []
y_lis = []
for _ in range(q):
i = input()
if i == '1':
rev_flag = not rev_flag
else:
a,b,c = i.split()
if rev_flag:
if b == '1':
#s = s + c
y_lis.append(c)
else:
... | [
"call.remove",
"call.arguments.change"
] | 542,675 | 542,676 | u105124953 | python |
p02756 | s = input()
q = int(input())
q_datas = [input().split() for _ in range(q)]
direction = 1 # 操作を始める前の向きを1、逆を-1とする
output_string = s
string1 = ''
string2 = ''
change_direction_count = 0
for query in q_datas :
if query[0] == '1':
direction *= -1
change_direction_count += 1
else:
if query[... | s = input()
q = int(input())
q_datas = [input().split() for _ in range(q)]
direction = 1 # 操作を始める前の向きを1、逆を-1とする
output_string = s
string1 = ''
string2 = ''
change_direction_count = 0
for query in q_datas :
if query[0] == '1':
direction *= -1
change_direction_count += 1
else:
if query[... | [] | 542,683 | 542,684 | u013956357 | python |
p02756 | s = input()
q = int(input())
query = [list(input().split()) for _ in range(q)]
f = True
l, r = [], []
for i in range(q):
if query[i][0] == "1":
f = not f
else:
if f:
if query[i][1] == "1":
l.append(query[i][2])
else:
r.append(query[i][2])
... | s = input()
q = int(input())
query = [list(input().split()) for _ in range(q)]
f = True
l, r = [], []
for i in range(q):
if query[i][0] == "1":
f = not f
else:
if f:
if query[i][1] == "1":
l.append(query[i][2])
else:
r.append(query[i][2])
... | [] | 542,697 | 542,698 | u832152513 | python |
p02756 | s = input()
q = int(input())
is_r = False
f_list = []
b_list = []
for i in range(q):
q_i = input().split(' ')
t_i = q_i[0]
if t_i == '1':
is_r = not is_r
else:
f_i = q_i[1]
if (f_i == '1' and not is_r) or (f_i == '2' and is_r):
f_list.append(q_i[2])
else:
... | s = input()
q = int(input())
is_r = False
f_list = []
b_list = []
for i in range(q):
q_i = input().split(' ')
t_i = q_i[0]
if t_i == '1':
is_r = not is_r
else:
f_i = q_i[1]
if (f_i == '1' and not is_r) or (f_i == '2' and is_r):
f_list.append(q_i[2])
else:
... | [
"call.arguments.change"
] | 542,703 | 542,704 | u062655521 | python |
p02756 | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI(): return map(in... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI(): return map(in... | [] | 542,705 | 542,706 | u642874916 | python |
p02756 | s = input()
N = int(input())
Q = [input().split() for _ in range(N)]
head = ''
tail = ''
reverse = 0
for q in Q:
if int(q[0]) == 1:
reverse = 1 - reverse
elif int(q[1]) == 1:
if reverse:
tail += q[2]
else:
head += q[2]
else:
if reverse:
h... | s = input()
N = int(input())
Q = [input().split() for _ in range(N)]
head = ''
tail = ''
reverse = 0
for q in Q:
if int(q[0]) == 1:
reverse = 1 - reverse
elif int(q[1]) == 1:
if reverse:
tail += q[2]
else:
head += q[2]
else:
if reverse:
h... | [] | 542,711 | 542,712 | u295178043 | python |
p02756 |
S = input()
Q = int(input())
# print(S, Q)
queries = []
for i in range(Q):
query = input()
queries.append(query)
from collections import deque
slist = deque()
slist.append(S)
isReversed = False
for query in queries:
if query == "1":
isReversed = not isReversed
else:
t, f, c = query.s... |
S = input()
Q = int(input())
# print(S, Q)
queries = []
for i in range(Q):
query = input()
queries.append(query)
from collections import deque
slist = deque(list(S))
isReversed = False
for query in queries:
if query == "1":
isReversed = not isReversed
else:
t, f, c = query.split()
... | [
"assignment.value.change",
"call.arguments.change"
] | 542,724 | 542,725 | u235783479 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
ans = deque()
ans.append(S)
reverse = False
for _ in range(Q):
query = input().split()
if query[0] == "1":
reverse = not reverse
if query[0] == "2":
F, C = query[1:]
if (F == "1" and not reverse) or (F == "2" and reverse):
... | from collections import deque
S = input()
Q = int(input())
ans = deque(S)
reverse = False
for _ in range(Q):
query = input().split()
if query[0] == "1":
reverse = not reverse
if query[0] == "2":
F, C = query[1:]
if (F == "1" and not reverse) or (F == "2" and reverse):
a... | [
"call.arguments.change",
"call.remove"
] | 542,728 | 542,729 | u811967730 | python |
p02756 | def main():
from collections import deque
s=input()
q=int(input())
turn = 2
d=deque(s)
for _ in [0]*q:
query = input()
if query[0] == "1":
t = int(query)
turn = 3 - turn
else:
t,f,c = map(str,query.split())
if (int(f) + turn)% 2 == 0:
... | def main():
from collections import deque
s=input()
q=int(input())
turn = 2
d=deque(s)
for _ in [0]*q:
query = input()
if query[0] == "1":
t = int(query)
turn = 3 - turn
else:
t,f,c = map(str,query.split())
if (int(f) + turn)% 2 == 0:
... | [
"call.add",
"call.arguments.change"
] | 542,730 | 542,731 | u752907966 | python |
p02756 | S=input()
Q=int(input())
flip=0
fr=''
ba=''
for i in range(Q):
Qq=input()
if(Qq.count(' ')>0):
ti,fi,ci=Qq.split()
if( flip%2==0 ):
if(fi=='1'):
fr=str(ci)+fr
else:
ba=ba+str(ci)
else:
if(fi=='1'):
... | S=input()
Q=int(input())
flip=0
fr=''
ba=''
for i in range(Q):
Qq=input()
if(Qq.count(' ')>0):
ti,fi,ci=Qq.split()
if( flip%2==0 ):
if(fi=='1'):
fr=str(ci)+fr
else:
ba=ba+str(ci)
else:
if(fi=='1'):
... | [
"control_flow.branch.if.condition.change"
] | 542,738 | 542,739 | u442855260 | python |
p02756 | s = input()
q = int(input())
top = ""
tail = ""
rev = 1
#プラスで順列
for i in range(q):
query = input()
if query == "1":
rev *= -1
elif query[2] == "1":
if rev == 1:
top += query[4]
else:
tail += query[4]
else:
if rev != 1:
top += query[4... | s = input()
q = int(input())
top = ""
tail = ""
rev = 1
#プラスで順列
for i in range(q):
query = input()
if query == "1":
rev *= -1
elif query[2] == "1":
if rev == 1:
top += query[4]
else:
tail += query[4]
else:
if rev != 1:
top += query[4... | [] | 542,762 | 542,763 | u631019293 | python |
p02756 | from collections import deque
S = input()
pre, post = deque(), deque()
Q = int(input())
reversed = False
for _ in range(Q):
query = input().split()
if query[0] == '1':
reversed = not reversed
pre, post = post, pre
else: # query[0] == 2
F, C = query[1:]
if F == '1':
if reversed:
pre... | from collections import deque
S = input()
pre, post = deque(), deque()
Q = int(input())
reversed = False
for _ in range(Q):
query = input().split()
if query[0] == '1':
reversed = not reversed
pre, post = post, pre
else: # query[0] == 2
F, C = query[1:]
if F == '1':
if reversed:
pre... | [
"call.arguments.change"
] | 542,764 | 542,765 | u512099209 | python |
p02756 | from collections import deque
d = deque(input())
q = int(input())
reverse = True
for _ in range(q):
query = list(input().split())
if query[0] == '1':
if reverse:
reverse = False
else:
reverse = True
continue
else:
if query[1] == '1':
if ... | from collections import deque
d = deque(input())
q = int(input())
reverse = False
for _ in range(q):
query = list(input().split())
if query[0] == '1':
if reverse:
reverse = False
else:
reverse = True
continue
else:
if query[1] == '1':
if... | [
"misc.opposites",
"assignment.value.change",
"call.add",
"call.arguments.change"
] | 542,769 | 542,770 | u861141787 | python |
p02756 | from collections import deque
d = deque()
S = input()
d.append(S)
Q = int(input())
Flag = True
for i in range(Q):
Query = input()
if Query[0] == "1":
Flag = not Flag
else:
QueryList = Query.split()
if Flag:
if QueryList[1] =="1":
d.appendleft(QueryList[... | from collections import deque
d = deque()
S = input()
d.append(S)
Q = int(input())
Flag = True
for i in range(Q):
Query = input()
if Query[0] == "1":
Flag = not Flag
else:
QueryList = Query.split()
if Flag:
if QueryList[1] =="1":
d.appendleft(QueryList[... | [
"identifier.change"
] | 542,776 | 542,777 | u638033979 | python |
p02756 | s=list(input())
q=int(input())
start=[]
owari=[]
r=1
for i in range(q):
data=input().split()
if(len(data)==1):
r*=-1
elif(data[1]=="1"):
if(r==1):
start.append(data[2])
else:
owari.append(data[2])
else:
if(r==1):
owari.append(data[2])
... | s=list(input())
q=int(input())
start=[]
owari=[]
r=1
for i in range(q):
data=input().split()
if(len(data)==1):
r*=-1
elif(data[1]=="1"):
if(r==1):
start.append(data[2])
else:
owari.append(data[2])
else:
if(r==1):
owari.append(data[2])
... | [
"call.add"
] | 542,788 | 542,789 | u591322332 | python |
p02756 | import sys
from collections import deque
def main():
input = sys.stdin.readline
s = input()[:-1]
q = int(input())
tmp = [input().split() for _ in range(q)]
flag = 0
ans = deque([s])
for t in tmp:
if len(t) == 1:
flag = ~flag
else:
f = int(t[1])
... | import sys
from collections import deque
def main():
input = sys.stdin.readline
s = input()[:-1]
q = int(input())
tmp = [input().split() for _ in range(q)]
flag = 0
ans = deque([s])
for t in tmp:
if len(t) == 1:
flag = ~flag
else:
f = int(t[1])
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"io.output.change",
"expression.operation.unary.add"
] | 542,790 | 542,791 | u973055892 | python |
p02756 | # -*- coding: utf-8 -*-
#import sys
from collections import deque
S = input().strip()
Q = int(input().strip())
Q_list = [input().strip() for _ in range(Q)]
#-----
# order = 1: 左→右
# order =-1: 左←右
order=1
dq = deque()
dq.append(S)
for line in Q_list:
if line == "1":
order *= -1
else:
t,f,c... | # -*- coding: utf-8 -*-
#import sys
from collections import deque
S = input().strip()
Q = int(input().strip())
Q_list = [input().strip() for _ in range(Q)]
#-----
# order = 1: 左→右
# order =-1: 左←右
order=1
dq = deque()
for word in S:
dq.append(word)
for line in Q_list:
if line == "1":
order *= -1
... | [
"identifier.change",
"call.arguments.change"
] | 542,794 | 542,795 | u530383736 | python |
p02756 | s=str(input())
q=int(input())
right=[]
left=[]
flag=0
for i in range(q):
a = input()
if int(a[0]) == 1:
if flag == 0:
flag=1
else:
flag=0
else:
if int(a[2]) == 1:
if flag == 0:
left.append(0,a[4])
else:
... | s=str(input())
q=int(input())
right=[]
left=[]
flag=0
for i in range(q):
a = input()
if int(a[0]) == 1:
if flag == 0:
flag=1
else:
flag=0
else:
if int(a[2]) == 1:
if flag == 0:
left.append(a[4])
else:
r... | [
"call.arguments.change"
] | 542,796 | 542,797 | u947327691 | python |
p02756 | from collections import deque
d = deque()
s = input()
d.append(s)
rev = 0
Q = int(input())
for q in range(Q):
ls = input().split()
print (ls)
if ls[0] == '1':
rev = (rev + 1) % 2
else:
if (int(ls[1]) + rev) % 2 == 0:
d.append(ls[2])
else:
d.appendleft(ls... | from collections import deque
d = deque()
s = input()
d.append(s)
rev = 0
Q = int(input())
for q in range(Q):
ls = input().split()
#print (ls)
if ls[0] == '1':
rev = (rev + 1) % 2
else:
if (int(ls[1]) + rev) % 2 == 0:
d.append(ls[2])
else:
d.appendleft(l... | [
"call.remove"
] | 542,800 | 542,801 | u709304134 | python |
p02756 | from collections import deque
import sys
input = sys.stdin.readline
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(input())
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
f = not f
else:
f_i = int(q[1])
if f_i == 1 ^ f:
ans.app... | from collections import deque
import sys
input = sys.stdin.readline
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(input())
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
f = not f
else:
f_i = int(q[1])
if (f_i == 1) ^ f:
ans.a... | [
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 542,802 | 542,803 | u652057333 | python |
p02756 | from collections import deque
import sys
input = sys.stdin.readline
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(input())
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
f = not f
else:
f_i = int(q[1])
if f_i ^ f:
ans.appendle... | from collections import deque
import sys
input = sys.stdin.readline
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(input())
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
f = not f
else:
f_i = int(q[1])
if (f_i == 1) ^ f:
ans.a... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change"
] | 542,804 | 542,803 | u652057333 | python |
p02756 | from collections import deque
import sys
input = sys.stdin.readline
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(input())
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
f = not f
else:
f_i = int(q[1])
if f_i ^ f:
ans.appendle... | from collections import deque
import sys
input = sys.stdin.readline
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(input())
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
f = not f
else:
f_i = int(q[1])
if (f_i == 1) ^ f:
ans.a... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change"
] | 542,805 | 542,803 | u652057333 | python |
p02756 | import collections
s = input()
q = int(input())
rev = 0
ans = collections.deque(['S'])
for _ in range(q):
query = list(input().split())
if int(query[0]) == 1:
rev += 1
else:
if int(query[1]) == 1: # 先頭
if rev%2 == 0:
ans.appendleft(query[2])
else:
ans.append(query[2])
... | import collections
s = input()
q = int(input())
rev = 0
ans = collections.deque(['S'])
for _ in range(q):
query = list(input().split())
if int(query[0]) == 1:
rev += 1
else:
if int(query[1]) == 1: # 先頭
if rev%2 == 0:
ans.appendleft(query[2])
else:
ans.append(query[2])
... | [
"identifier.change"
] | 542,806 | 542,807 | u800720322 | python |
p02756 | import collections
s = input()
q = int(input())
rev = 0
ans = collections.deque(['S'])
for _ in range(q):
query = list(input().split())
if int(query[0]) == 1:
rev += 1
else:
if int(query[1]) == 1: # 先頭
if rev%2 == 0:
ans.appendleft(query[2])
else:
ans.append(query[2])
... | import collections
s = input()
q = int(input())
rev = 0
ans = collections.deque(['S'])
for _ in range(q):
query = list(input().split())
if int(query[0]) == 1:
rev += 1
else:
if int(query[1]) == 1: # 先頭
if rev%2 == 0:
ans.appendleft(query[2])
else:
ans.append(query[2])
... | [
"identifier.change"
] | 542,808 | 542,807 | u800720322 | python |
p02756 | from collections import deque
s = input()
queue = deque([s])
q = int(input())
pre = 0
reverse = 0
for _ in range(q):
query = input()
if query == '1':
if pre:
pre = 0
else:
pre = 1
reverse += 1
else:
_, f, c = query.split()
if f == '1':
... | from collections import deque
s = input()
queue = deque(list(s))
q = int(input())
pre = 0
reverse = 0
for _ in range(q):
query = input()
if query == '1':
if pre:
pre = 0
else:
pre = 1
reverse += 1
else:
_, f, c = query.split()
if f == '1':
... | [
"assignment.value.change",
"call.arguments.change"
] | 542,809 | 542,810 | u940139461 | python |
p02756 | from collections import deque
s = input()
queue = deque([s])
q = int(input())
pre = 0
reverse = 0
for _ in range(q):
query = input()
if query == '1':
if pre:
pre = 0
else:
pre = 1
reverse += 1
else:
_, f, c = query.split()
if f == '1':
... | from collections import deque
s = input()
queue = deque(list(s))
q = int(input())
pre = 0
reverse = 0
for _ in range(q):
query = input()
if query == '1':
if pre:
pre = 0
else:
pre = 1
reverse += 1
else:
_, f, c = query.split()
if f == '1':
... | [
"assignment.value.change",
"call.arguments.change"
] | 542,811 | 542,810 | u940139461 | python |
p02756 | from collections import deque
S = deque(input())
Q = int(input())
reverse = 1
for i in range(Q):
q = input()
if (q == 1):
reverse *= -1
else:
integer, judge, cha = q.split()
if (judge == '1'):
if (reverse == 1):
S.appendleft(cha)
... | from collections import deque
S = deque(input())
Q = int(input())
reverse = 1
for i in range(Q):
q = input()
if (q == '1'):
reverse *= -1
else:
integer, judge, cha = q.split()
if (judge == '1'):
if (reverse == 1):
S.appendleft(cha)
... | [
"control_flow.branch.if.condition.change",
"expression.operation.unary.arithmetic.remove"
] | 542,814 | 542,815 | u015593272 | python |
p02756 | from collections import deque
s = deque(input())
print(s)
Q = int(input())
reverse = False
for i in range(Q):
q = input()
if q == "1":
reverse = False if reverse else True
else:
t, f, c = q.split(" ")
if f == "1":
if reverse:
s.append(c)
else:... | from collections import deque
s = deque(input())
Q = int(input())
reverse = False
for i in range(Q):
q = input()
if q == "1":
reverse = False if reverse else True
else:
t, f, c = q.split(" ")
if f == "1":
if reverse:
s.append(c)
else:
... | [
"call.remove"
] | 542,816 | 542,817 | u111473084 | python |
p02756 | from collections import deque
S = list(input())
Q = int(input())
d = deque(S)
flag = -1
for _ in range(Q):
q = list(input().split())
if q[0] == '1':
flag *= -1
else:
f = int(q[1])
c = q[2]
if flag == 1 and f == 1 or flag == -1 and f == 2:
d.appendleft(c)
... | from collections import deque
S = list(input())
Q = int(input())
d = deque(S)
flag = -1
for _ in range(Q):
q = list(input().split())
if q[0] == '1':
flag *= -1
else:
f = int(q[1])
c = q[2]
if flag == -1 and f == 1 or flag == 1 and f == 2:
d.appendleft(c)
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"expression.operation.unary.arithmetic.remove"
] | 542,820 | 542,821 | u500297289 | python |
p02756 | from collections import deque
S = list(input())
Q = int(input())
d = deque(S)
flag = -1
for _ in range(Q):
q = list(input().split())
if q[0] == '1':
flag *= -1
else:
f = int(q[1])
c = q[2]
if flag == 1 and f == 1 or flag == -1 and f == 2:
d.appendleft(c)
... | from collections import deque
S = list(input())
Q = int(input())
d = deque(S)
flag = -1
for _ in range(Q):
q = list(input().split())
if q[0] == '1':
flag *= -1
else:
f = int(q[1])
c = q[2]
if flag == -1 and f == 1 or flag == 1 and f == 2:
d.appendleft(c)
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"expression.operation.unary.arithmetic.remove"
] | 542,822 | 542,821 | u500297289 | python |
p02756 | from collections import deque
S = deque(input())
Q = int(input())
is_reversed = False
for _ in range(Q):
q = input().split()
if q[0] == "1":
is_reversed = not is_reversed
else:
f = int(q[1])
if is_reversed:
f ^= 1
c = q[2]
if f:
S.appendleft(c... | from collections import deque
S = deque(input())
Q = int(input())
is_reversed = False
for _ in range(Q):
q = input().split()
if q[0] == "1":
is_reversed = not is_reversed
else:
f = int(q[1]) - 1
if is_reversed:
f ^= 1
c = q[2]
if f:
S.append(c... | [
"identifier.change"
] | 542,825 | 542,826 | u097121858 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.