input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
print((a[n//2]-a[n//2-1])) | n=int(eval(input()));l=sorted(map(int,input().split()));print((l[n//2]-l[n//2-1])) | p02989 |
from collections import Counter
N = int(eval(input()))
d = Counter(list(map(int, input().split())))
ans = 0
l, r = 0, N
for K in range(10**5+1):
if l == r:
ans += 1
l += d[K]
r -= d[K]
print(ans) | N = int(eval(input()))
d = sorted(list(map(int, input().split())), reverse=True)
print((d[N//2-1] - d[N//2])) | p02989 |
N = int(eval(input()))
L = list(int(i) for i in input().split())
n = N//2
cnt = 0
data = sorted(L)
data1 = data[:n]
data2 = data[n:]
for i in range(100000):
if max(data1) < i and i <= min(data2):
cnt += 1
print(cnt) | N = int(eval(input()))
L = list(int(i) for i in input().split())
n = N//2
data = sorted(L)
data1 = data[:n]
data2 = data[n:]
print((min(data2) - max(data1))) | p02989 |
n = int(eval(input()))
d_lis = [int(d) for d in input().split()]
cnt = 0
ans = 0
for i in range(max(d_lis)+1):
cnt += d_lis.count(i)
if cnt == n // 2:
ans += 1
print(ans) | n = int(eval(input()))
d_lis = list(map(int,input().split()))
li = sorted(d_lis)
mid = n // 2
print((li[mid] - li[mid-1])) | p02989 |
n = int(eval(input()))
d = [int(i) for i in input().split()]
c = 0
for k in range(1,max(d)+1):
arc = []
abc = []
for j in range(len(d)):
if d[j] >= k:
arc.append(d[j])
else:
abc.append(d[j])
if len(abc) == len(arc):
c += 1
print(c) | n = int(eval(input()))
d = [int(i) for i in input().split()]
d.sort()
ans = d[len(d)//2] - d[len(d)//2-1]
print(ans)
| p02989 |
N=int(eval(input()))
d=list(map(int,input().split()))
n=0
for k in range(1,10**5+1):
m=0
for b in d:
if b<k:
m+=1
if m==N/2:
n+=1
print(n) | N=int(eval(input()))
d=sorted(list(map(int,input().split())))
print((d[int(N/2)]-d[int(N/2-1)])) | p02989 |
n = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
print((d[n // 2] - d[n // 2 - 1]))
| n = int(eval(input()))
a = sorted(list(map(int, input().split())))
m = n // 2
print((a[m] - a[m - 1]))
| p02989 |
n = int(eval(input()))
m = n//2
D = list(map(int, input().split()))
D.sort()
D.reverse()
if D[m-1] == D[m]:
print((0))
exit()
else:
print((D[m-1]-D[m]))
exit() | n = int(eval(input()))
D = list(map(int, input().split()))
D.sort()
if D[n//2-1] == D[n//2]:
print((0))
else:
print((D[n//2] - D[n//2-1])) | p02989 |
a = int(eval(input()))
b = list(map(int,input().split()))
c = sorted(b)
print((c[int(0.5*a)]-c[int(0.5*a-1)])) | N = int(eval(input()))
D = sorted(map(int,input().split()))
print((max(0,D[N//2]-D[N//2-1]))) | p02989 |
from bisect import bisect
N = int(eval(input()))
D = list(map(int,input().split()))
D.sort()
ans = 0
for i in range(10**5+5):
j = bisect(D, i)
if j==N//2:
ans += 1
elif j>N//2:
break
print(ans) | N = int(eval(input()))
D = list(map(int,input().split()))
D.sort()
print((D[N//2] - D[N//2-1])) | p02989 |
N = int(eval(input()))
d = sorted(list(map(int, input().split())))
ans = 0
for i in range(1,d[-1] + 1):
if sum(x <i for x in d) == N//2:
ans += 1
else:
pass
print(ans) | N = int(eval(input()))
d = sorted(list(map(int, input().split())))
print((d[N//2] - d[N//2 - 1])) | p02989 |
a=[]
i=1
k=1
l=0
rk=[]
bk=[]
a.append(int(eval(input())))
for x in input().split(" "):
a.append(int(x))
while k<=100000:
while i<=a[0]:
if a[i]>=k:
rk.append(a[i])
else:
bk.append(a[i])
i+=1
if len(rk)==len(bk):
l+=1
rk=[]
... | n=0
a=[]
i=1
ii=1
l=0
tasu=0
rk=[]
bk=[]
n=int(eval(input()))
for x in input().split(" "):
a.append(int(x))
a.sort()
print((a[int(len(a)/2)]-a[int(len(a)/2)-1])) | p02989 |
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
ans = 0
start_num = d[int(n / 2 - 1)]
end_num = d[int(n / 2)]
ans = end_num - start_num
print(ans)
| n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[n // 2] - d[n // 2 - 1]))
| p02989 |
num_input = int(eval(input()))
input_arr = [int(x) for x in input().split()]
max_input = max(input_arr)
count = 0
for input_ in range(max_input):
first_arr = [s for s in input_arr if input_ < s]
second_arr = [s for s in input_arr if input_ >= s]
if len(first_arr) == len(second_arr):
coun... | num_input = int(eval(input()))
input_arr = [int(x) for x in input().split()]
max_input = max(input_arr)
count = 0
second_arr =[]
first_arr = []
sorted_arr = sorted(input_arr)
ans = sorted_arr[int(num_input/2)] - sorted_arr[int(num_input/2)-1]
print(ans) | p02989 |
def calculate(arr):
length = len(arr)
s1 = (length // 2) - 1
s2 = (length // 2)
if arr[s2] == arr[s1]:
return 0
else:
return arr[s2] - arr[s1]
def rank(arr):
lastIndex = len(arr) - 1
while lastIndex > 0:
for i in range(lastIndex):
if ar... | def calculate(arr):
length = len(arr)
s1 = (length // 2) - 1
s2 = (length // 2)
if arr[s2] == arr[s1]:
return 0
else:
return arr[s2] - arr[s1]
N = int(eval(input()))
if N == 0:
result = 0
else:
list = list([int(s) for s in input().split(" ")])
list.sor... | p02989 |
n = int(eval(input()))
d = list(map(int, input().split()))
d = sorted(d)
min_ans = d[n//2-1]
max_ans = d[n//2]
print((max_ans - min_ans)) | n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)
print((a[n // 2] - a[n // 2 - 1])) | p02989 |
n = eval(input())
l = list(map(int,input().split()))
num =0
for i in range(max(l)+1):
s =0
u =0
for j in l:
if j <i:
s +=1
else:
u +=1
if s ==u:
num +=1
print(num) | n = eval(input())
l = list(map(int,input().split()))
m = sorted(l)
if len(m)%2!=0:
print((0))
else:
i = len(m)//2 -1
ans = m[i+1]-m[i]
print(ans) | p02989 |
N=int(eval(input()))
d=list(map(int, input().split()))
C=N//2
for x in reversed(list(range(1,N+1))):
for y in range(0,x-1):
if d[y]<d[y+1]:
t=d[y]
d[y]=d[y+1]
d[y+1]=t
if d[C]==d[C-1]:
print((0))
else:
print((d[C-1]-d[C]))
| N=int(eval(input()))
d=list(map(int, input().split()))
C=N//2
d.sort()
if d[C]==d[C-1]:
print((0))
else:
print((d[C]-d[C-1]))
| p02989 |
n = int(eval(input()))
d = sorted(list(map(int, input().split())))
ans = 0
for i in range(d[n//2-1]+1,d[n//2]+1):
ans +=1
print(ans) | n = int(eval(input()))
d = sorted(list(map(int, input().split())))
if d[n//2]==d[n//2 - 1]:
print((0))
else:
print((d[n//2]-d[n//2 - 1])) | p02989 |
x = int(eval(input()))
y = input().split()
for u in range(len(y)):
y[u] = int(y[u])
y = sorted(y)
count = 0
for i in range(max(y)):
a = [u for u in y if u > i]
if len(a) == int(len(y) / 2):
count += 1
print(count) | x = int(eval(input()))
y = input().split()
for u in range(len(y)):
y[u] = int(y[u])
y = sorted(y)
count = y[int(len(y) / 2)] - y[int((len(y) / 2)) - 1]
print(count) | p02989 |
#ABC132_C
N=int(eval(input()))
d=list(map(int,input().split()))
L=2
R=2*10**5
while 1:
#print('Lis',L)
#print('Ris',R)
k=int((L+R)/2)
#print('kis',k)
ABC_num=0
for i in range(len(d)):
if d[i]<k:
ABC_num+=1
#print('ABC_num_is',ABC_num)
if ABC_num==... | #ABC132_C
N=int(eval(input()))
d=list(map(int,input().split()))
d.sort()
ans=d[int(N/2)]-d[int(N/2-1)]
print(ans) | p02989 |
N=int(eval(input()))
D=[int(s) for s in input().split()]
D=sorted(D)
sum=[]
count=0
for i in reversed(list(range(len(D)))):
sum.append(D.pop(i))
if len(sum) == len(D):
Ans=len(sum)
break
for i in range(D[Ans-1],sum[Ans-1],1):
count+=1
print(count) | N=int(eval(input()))
d=[int(s) for s in input().split(" ")]
d.sort()
K=d[(N//2)]-d[(N//2)-1]
print(K) | p02989 |
N = int(eval(input()))
d_list = list(map(int, input().split()))
count = 0
for k in range(min(d_list), max(d_list) + 1):
ABC = 0
ARC = 0
for i in range(N):
if k > d_list[i]:
ABC += 1
else:
ARC += 1
if ABC > ARC:
break
elif ABC == ARC:
... | N = int(eval(input()))
d_list = list(map(int, input().split()))
d_list.sort()
k = d_list[int(N/2)]
count = 0
for i in range(N):
if count == int(N/2):
print((d_list[int(N/2)] - d_list[int(N/2)-1]))
break
elif k > d_list[i]:
count += 1
else:
pass
else: # kの候補の右端は... | p02989 |
n = int(eval(input()))
d = list(map(int, input().split()))
d = sorted(d)
l = []
now = 0
ans = 0
for i in range(n-1):
if d[i] != d[i+1]:
a = d.index(d[i])
b = d.count(d[i])
index = a+b-1
#print(index)
if index+1 == n/2:
#print(d[i+1], d[i])
... | n = int(eval(input()))
d = list(map(int,input().split()))
d = sorted(d)
print((d[int(n/2)]-d[int(n/2)-1])) | p02989 |
n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
ans=0
for k in range(1,d[-1]+1):
abc=[k>i for i in d]
arc=[k<=i for i in d]
if sum(arc)==sum(abc):
ans+=1
print(ans) | n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[n//2]-d[(n//2)-1])) | p02989 |
N = int(eval(input()))
d = list(map(int, input().split(' ')))
c = 0
mid = (max(d) + min(d))//2
for i in range(mid//2, mid*2):
a = sum([1 for val in d if val < i])
b = sum([1 for val in d if val >= i])
if a == b:
c += 1
print(c) | N = int(eval(input()))
d = list(map(int, input().split(' ')))
d.sort()
print(( d[N//2] - d[N//2 - 1] ))
| p02989 |
N = int(eval(input()))
d = list(map(int, input().split()))
cnt = 0
maxd = max(d)
mind = min(d)
for K in range(mind, maxd+1):
if len([i for i in d if i >= K]) == len([i for i in d if i < K]): cnt += 1
print(cnt)
| N = int(eval(input()))
d = list(map(int, input().split()))
sor_d = sorted(d)
print((sor_d[int(N*0.5)]-sor_d[int(N*0.5)-1])) | p02989 |
import sys
input = sys.stdin.readline
inpl = lambda: list(map(int,input().split()))
N = int(eval(input()))
d = sorted(inpl())
if N % 2:
print((0))
else:
print((d[N//2]-d[N//2-1])) | print(((lambda N,d:((N+1)%2)*(d[N//2]-d[N//2-1]))(int(eval(input())),sorted(list(map(int,input().split())))))) | p02989 |
N = int(eval(input()))
d = list(map(int, input().split()))
"""
d = [9, 1, 4, 4, 6, 7]
#N = 8
N = 6
#d = [9, 1, 14, 5, 5, 4, 4, 14]
d = [9, 1, 4, 4, 6, 7]
"""
# prob
# [number,value]
prob = []
cnt = 0
for i in d:
prob.append([cnt, i])
cnt += 1
""" print(prob)
print(sorted(prob, key=lambda x:... | N = int(eval(input()))
d = list(map(int, input().split()))
"""
d = [9, 1, 4, 4, 6, 7]
#N = 8
N = 6
#d = [9, 1, 14, 5, 5, 4, 4, 14]
d = [9, 1, 4, 4, 6, 7]
"""
# prob
# [number,value]
prob = []
cnt = 0
for i in d:
prob.append([cnt, i])
cnt += 1
""" print(prob)
print(sorted(prob, key=lambda x:... | p02989 |
import sys
import bisect
input = sys.stdin.readline
def main():
n=int(eval(input()))
d = list(map(int,input().split()))
cnt=0
d.sort()
a=d[0]
b=d[n-1]
c=b-a+1
for i in range(c):
index=bisect.bisect_right(d,i+a)
D=d[index:]
lend=len(D)
... | import sys
import bisect
input = sys.stdin.readline
def main():
n=int(eval(input()))
d = list(map(int,input().split()))
cnt=0
d.sort()
a=d[(n//2)-1]
b=d[(n//2)]
ans=b-a
print(ans)
main()
| p02989 |
k=int(eval(input()))
d=sorted(list(map(int,input().split())))
ans=0
for i in range(d[int(len(d)/2)-1]+1,d[int(len(d)/2)]+1):
ans+=1
print(ans) | n=int(eval(input()))
a=sorted(list(map(int,input().split())))
p=a[n//2-1]
q=a[n//2]
print((q-p)) | p02989 |
n=int(eval(input()))
l=[int(s) for s in input().split()]
cnt=0
mx=max(l)
for i in range(1,mx+1):
k=i
arc=0
abc=0
for j in range(len(l)):
if l[j]>=k:
arc+=1
else:
abc+=1
if arc==abc:
cnt+=1
print(cnt) | n=int(eval(input()))
l=[int(s) for s in input().split()]
cnt=0
l.sort()
print((l[n//2]-l[n//2-1])) | p02989 |
N = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
if d[N//2-1] == d[N//2]:
print((0))
else:
print((d[N//2]-d[N//2-1])) | N = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[N//2]-d[N//2-1])) | p02989 |
N = int(eval(input()))
D = [int(i) for i in input().split(" ")]
count = 0
maxd = max(D)
for i in range(maxd+1):
ARC = []
ABC = []
for j in D:
if i < j:
ARC.append(j)
else:
ABC.append(j)
if len(ARC) == len(ABC):
count+=1
print(count) | N = int(eval(input()))
D = [int(i) for i in input().split(" ")]
D.sort()
print((D[int(N/2)]-D[int(N/2)-1])) | p02989 |
n = int(eval(input()))
d = list(map(int,input().split()))
c = 0
k = 1
d.sort()
for i in range(1,max(d)+1):
ab = [j for j in d if i <= j]
ar = [j for j in d if i > j]
#print(ab,ar)
if(len(ab)==len(ar)):
c = c + 1
ab = 0
ar = 0
print(c) | n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[int(n/2)] - d[int(n/2)-1])) | p02989 |
#ABC132 C
N = int(eval(input()))
D = list(map(int,input().split()))
count = 0
for K in range(max(D) + 1):
A = []
B = []
for i in range(N):
if D[i] >= K:
A.append(D[i])
else:
B.append(D[i])
if len(A) == len(B):
count += 1
... | #ABC132 C
N = int(eval(input()))
D = list(map(int,input().split()))
D.sort()
A = list(range(D[int(N/2)-1]+1,D[int(N/2)]+1))
print((len(A))) | p02989 |
N = int(eval(input()))
D = sorted([int(i) for i in input().split()])
maxK = D[N // 2]
minK = D[N // 2 - 1]
print((maxK - minK)) | n = int(eval(input()))
D = sorted([int(i) for i in input().split()])
if n % 2 == 1:
print((0))
else:
m = n // 2
print((D[m] - D[m - 1])) | p02989 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
d = [int(i) for i in input().split()]
d.sort()
ans = d[n // 2] - d[n // 2 - 1]
print((max(ans, 0)))
| # -*- coding: utf-8 -*-
n = int(eval(input()))
d = [int(i) for i in input().split()]
d.sort()
k = d[n // 2] - d[n // 2 - 1]
print(k)
| p02989 |
# -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
D =[int(i) for i in input().split()]
count = 0
D.sort()
D.reverse()
#print(D)
for j in range(100000):
if j > D[0]:
break
for i in range(N):
if D[i] < j:
if i == (N/... | # -*- coding: utf-8 -*-
def main():
N = int(eval(input()))
D =[int(i) for i in input().split()]
#count = 0
D.sort()
D.reverse()
center = D[int(N/2)]
print((D[int((N/2))-1]-center))
if __name__ == '__main__':
main() | p02989 |
from sys import stdin
import itertools
n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
li.sort()
key = n//2
print((li[key:][0]-li[:key][-1])) | n = int(eval(input()))
d = list(map(int,input().split()))
d.sort()
print((d[n//2]-d[n//2-1])) | p02989 |
N = int(eval(input()))
d = list(map(int, input().split()))
c = 0
c_R = 0
c_B = 0
d_min = min(d)
d_max = max(d)
for K in range(d_min,d_max+1):
c_R = 0
c_B = 0
for i in range(N):
if K <= d[i] :
c_R = c_R + 1
else:
c_B = c_B + 1
if c_R == c_B:
... | N = int(eval(input()))
d = list(map(int, input().split()))
d.sort()
K = d[N//2]
J = d[N//2 - 1]
if K == J :
print((0))
else:
print((K - J)) | p02989 |
n = int(eval(input()))
d = list(map(int,input().split()))
ans = 0
k_m = max(d)
for i in range(1, k_m+1):
abc = []
arc = []
arc = [j for j in d if j >= i]
abc = [k for k in d if k < i]
if len(arc) == len(abc):
ans += 1
print(ans) | n = int(eval(input()))
d = sorted(list(map(int,input().split())))
print((d[n//2] - d[n//2-1])) | p02989 |
from collections import deque
S = input().rstrip('\r\n')
S_list = deque(S)
Q = int(eval(input()))
for _ in range(Q):
query = input().rstrip('\r\n')
t, f, c = '', '', ''
if len(query) == 1:
t = query
else:
t, f, c = query.split(' ')
if t == '1':
S_list.revers... | from collections import deque
S = input().rstrip('\r\n')
S_list = deque(S)
is_reverse = False
Q = int(eval(input()))
for _ in range(Q):
query = input().rstrip('\r\n')
t, f, c = '', '', ''
if len(query) == 1:
t = query
else:
t, f, c = query.split(' ')
if t == '1':
... | p02756 |
from collections import deque
S = input().rstrip('\r\n')
S_list = deque(S)
is_reverse = False
Q = int(eval(input()))
for _ in range(Q):
query = input().rstrip('\r\n')
t, f, c = '', '', ''
if len(query) == 1:
t = query
else:
t, f, c = query.split(' ')
if t == '1':
... | import sys
input = sys.stdin.readline
from collections import deque
def main():
S = input().rstrip("\r\n")
Q = int(eval(input()))
d = deque(S)
reverse = False
for _ in range(Q):
q = input().rstrip("\r\n")
if q == "1":
reverse = not reverse
else:
... | p02756 |
from collections import deque
d = deque(list(input()))
for _ in range(int(input())):
a = input()
if a[0] == '1':
d.reverse()
elif a[2] == '1':
d.appendleft(a[4])
else:
d.append(a[4])
print(*d, sep='')
| from collections import deque
d = deque(list(input()))
flag = 1
for _ in range(int(input())):
a = input()
if a[0] == '1':
flag *= -1
elif a[2] == '1' and flag == 1:
d.appendleft(a[4])
elif a[2] == '1' and flag == -1:
d.append(a[4])
elif a[2] == '2' and flag == 1:... | p02756 |
from collections import deque
s,q=deque([*input()]),int(input())
for i in range(q):
t=input().split()
if len(t)==1:
s.reverse()
else:
t,f,c=t
if f=='1': s.appendleft(c)
else: s.append(c)
print(*s,sep='')
| from collections import deque
s,q=deque([*input()]),int(input())
judge=False
for i in range(q):
t=input().split()
if len(t)==1:
judge = not judge
else:
t,f,c=t
if not judge and f=='1': s.appendleft(c)
elif not judge and f=='2': s.append(c)
elif judge and f=='1': s.append(c)
els... | p02756 |
import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
s = readline().decode().strip()
q = int(readline())
is_... | import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
s = readline().decode().strip()
q = int(readline())
is_... | p02756 |
from sys import stdin
def main():
S = stdin.readline().rstrip()
Q = int(eval(input()))
rev = 0
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(eval(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":
... | p02756 |
# coding: utf-8
S = input().split()
Q = int(eval(input()))
def pop(left, right, rev, f, c):
left_ = left
if rev == 1:
if f == '1':
left_ = left[::-1]
left_.append(c)
left_ = left_[::-1]
else:
right.append(c)
else:
if f ==... | # coding: utf-8
S = input().split()
Q = int(eval(input()))
def pop(left, right, rev, f, c):
if rev == 1:
if f == '1':
left.append(c)
else:
right.append(c)
else:
if f == '1':
right.append(c)
else:
left.append(c)
r... | p02756 |
def solve(string):
s, q, *qs = string.split("\n")
for _q in qs:
if _q == "1":
s = s[::-1]
continue
_, f, c = _q.split()
s = c + s if f == "1" else s + c
return s
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip()... | def solve(string):
s, q, *qs = string.split("\n")
pre = []
post = []
r = False
for _q in qs[::-1]:
if _q == "1":
r = not r
continue
_, f, c = _q.split()
if r and f == "2" or not r and f == "1":
pre.append(c)
else:
... | p02756 |
from collections import deque
def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
... | def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input()... | p02756 |
import sys
input = sys.stdin.readline
S=list(input()[:-1])
Q=int(input()[:-1])
f=0
for _ in range(Q):
q=input().split()
if int(q[0])==1:
f = (f+1)%2
if int(q[0])==2:
if int(q[1])==1:
if f==0:
SS=[q[2]]
SS.extend(S)
... | import sys
input = sys.stdin.readline
S=list(input()[:-1])
Q=int(input()[:-1])
f=0
back=[]
forward=[]
for _ in range(Q):
q=input().split()
if int(q[0])==1:
f = (f+1)%2
if int(q[0])==2:
if int(q[1])==1:
if f==0:
forward.append(q[2])
e... | p02756 |
# D - String Formation
from collections import deque
def main():
S = input().rstrip()
Q = int(eval(input()))
queue = deque(S)
to_beginning, to_end = queue.appendleft, queue.append
is_reversed = 0
for _ in range(Q):
query = input().split()
if query[0] == "1":
... | # D - String Formation
from collections import deque
def main():
S = input().rstrip()
Q = int(eval(input()))
queue = deque(S)
to_beginning, to_end = queue.appendleft, queue.append
is_reversed = False
for _ in range(Q):
query = input().split()
if query[0] == "1":
... | p02756 |
# D - String Formation
from collections import deque
def main():
S = input().rstrip()
Q = int(eval(input()))
queue = deque(S)
is_reversed = 0
for _ in range(Q):
query = input().split()
if query[0] == "1":
is_reversed ^= 1
continue
com, ... | # D - String Formation
import sys
from collections import deque
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
S = readline().rstrip()
_ = readline()
queries = readlines()
queue = deque(S)
to_beginning, to_end = queue.appendleft, queue.append
is_revers... | p02756 |
s = list(input())
n = int(input())
head = []
tail = []
cnt = 0
for _ in range(n):
li = list(input().split())
if li[0] == '1':
head, tail = tail, head
s = s[::-1]
cnt += 1
else:
if li[1] == '1':
head += li[2]
else:
tail += li[2]... | s = list(input())
n = int(input())
head = []
tail = []
cnt = 0
for _ in range(n):
li = list(input().split())
if li[0] == '1':
head, tail = tail, head
cnt += 1
else:
if li[1] == '1':
head += li[2]
else:
tail += li[2]
if cnt % 2 != 0:
... | p02756 |
s = list(input())
n = int(input())
head = []
tail = []
cnt = 0
for _ in range(n):
li = list(input().split())
if li[0] == '1':
head, tail = tail, head
cnt += 1
else:
if li[1] == '1':
head += li[2]
else:
tail += li[2]
if cnt % 2 != 0:
... | s = list(input())
n = int(input())
head = []
tail = []
cnt = 0
for _ in range(n):
li = list(input().split())
if li[0] == '1':
head, tail = tail, head
cnt += 1
else:
if li[1] == '1':
head.append(li[2])
else:
tail.append(li[2])
if cnt ... | p02756 |
import sys
input = sys.stdin.readline
s = input().strip('\n')
q = int(input().strip('\n'))
j = ''.join
turn = 0
for _ in range(q):
query = input().strip('\n')
if len(query) == 1:
turn += 1
else:
two, f, c = query.split()
if f == '1':
if turn % 2 == 0:
... | import sys
input = sys.stdin.readline
s = input().strip()
q = int(eval(input()))
query = [list(input().strip().split()) for _ in range(q)]
left = ''
right = ''
t = False
for ls in query:
if len(ls) == 1:
t = not t
else:
two, f, c = ls
if f == '1':
if t:
... | p02756 |
from collections import deque
s = input()
q = int(input())
d = deque(s)
for _ in range(q):
Q = list(input().split())
if Q[0]=='1':
d = deque(reversed(d))
elif Q[0]=='2':
if Q[1]=='1':
d.appendleft(Q[2])
elif Q[1]=='2':
d.append(Q[2])
print(*d, sep='')
| from collections import deque
s = input()
q = int(input())
d = deque(s)
inv = 0
for _ in range(q):
Q = list(input().split())
if Q[0]=='1':
inv += 1
elif Q[0]=='2':
if Q[1]=='1':
if inv%2==0:
d.appendleft(Q[2])
else:
d.append(Q[2])
elif Q[1]=='2':
... | p02756 |
import sys
input = sys.stdin.readline
def main():
S = input().replace('\n', '')
Q = int(eval(input()))
for _ in range(Q):
query = input().split()
if len(query) == 1:
S = S[::-1]
else:
T, F, C = query
if int(F) == 1:
... | import sys
input = sys.stdin.readline
def main():
S = input().replace('\n', '')
Q = int(eval(input()))
flg = 0
head = ""
tail = ""
for _ in range(Q):
query = input().split()
if len(query) == 1:
head, tail = tail, head
flg += 1
else... | p02756 |
import sys
input = sys.stdin.readline
s = input().split()[0]
q = int(eval(input()))
for _ in range(q):
q_i = input().split()
if len(q_i) == 1:
s = s[::-1]
else:
_, f, c = q_i
f = int(f)
if f == 1:
s = c + s
else:
s = s + c
... | import sys
input = sys.stdin.readline
s = input().split()[0]
q = int(eval(input()))
left, right = [], []
state = 1
for _ in range(q):
q_i = input().split()
if len(q_i) == 1:
state = (state)%2 + 1
else:
_, f, c = q_i
f = int(f)
if (f+state)%2 == 0:
... | p02756 |
#初期入力
import sys
input = sys.stdin.readline
S = input().split()
S=S[0]
Q = int(eval(input()))
FQ_dic =tuple()
rev =0
for i in range(Q):
FQ_dic =tuple(input().split())
if FQ_dic[0] =="1": #逆転する
rev +=1
else: #逆転なし
if FQ_dic[1]=="1": #後... | #前・左につける変数、後ろ・右につける変数を用意して最後に足す
#前・左は最後にひっくり返す（abc ⇒cba)
#初期入力
import sys
input = sys.stdin.readline
S = input()
S=S.strip("\n")
Q = int(input())
FQ_dic={}
for i in range(Q):
FQ_dic[i] =input().split()
rev =0
front =""
back =""
for i in range(Q):
# print(S)
if FQ_dic[i][0] =="1": #逆転... | p02756 |
import sys
input = sys.stdin.readline
S = input().strip()
Q = int(eval(input()))
reverse = False
for _ in range(Q):
s = input().strip()
if s.startswith("1"):
reverse = not reverse
else:
_, f, c = s.split()
if f == "1":
if reverse:
S = S ... | import sys
input = sys.stdin.readline
S = input().strip()
Q = int(eval(input()))
reverse = False
before = ""
after = ""
for _ in range(Q):
s = input().strip()
if s[0] == "1":
reverse = not reverse
else:
_, f, c = s.split()
if f == "1":
if reverse:
... | p02756 |
import sys
input = sys.stdin.readline
def sol():
s=input().rstrip()
q=int(eval(input()))
x=0
for i in range(q):
l=tuple([i for i in input().split()])
if l[0]=="1":
x=(x+1)%2
elif l[1]=="1":
if x==0: s=l[2]+s
else: s=s+l[2]
... | import sys
input = sys.stdin.readline
def sol():
s=input().rstrip()
q=int(eval(input()))
x=0
a,b="",""
for i in range(q):
l=tuple([i for i in input().split()])
if l[0]=="1":
x=(x+1)%2
elif l[1]=="1":
if x==0: a=l[2]+a
else: b... | p02756 |
from collections import deque
s = deque(input())
q = int(input())
for i in range(q):
t = input()
if len(t) == 1:
s.reverse()
else:
if t[2] == "1":
s.appendleft(t[4])
else:
s.append(t[4])
print(*s, sep="")
| from collections import deque
s = deque(input())
q = int(input())
rev = 0
for i in range(q):
t = input()
if rev == 0:
if len(t) == 1:
rev = 1
else:
if t[2] == "1":
s.appendleft(t[4])
else:
s.append(t[4])
else... | p02756 |
#!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
s = input().strip()
q = int(eval(input()))
state = 1
swap = [0, 2, 1]
for _ in range(q):
x = input().strip()
if x == '1':
state *= -1
else:
_, f, c = x.split(' ')
f = int(f)
if state == -1:
f = s... | #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
s = input().strip()
q = int(eval(input()))
state = 1
swap = [0, 2, 1]
ss = []
es = []
for _ in range(q):
x = input().strip()
if x == '1':
state *= -1
else:
_, f, c = x.split(' ')
f = int(f)
if state... | p02756 |
'''
∧_,,∧ 究極奥義「WAがACになーれ！！」
（`・ω・)つ━☆・*。
⊂ ノ ・゜+.
し’´Ｊ *・
'''
s=input()
a=[]
b=[]
now=1
q=int(input())
for i in range(q):
x=list(input().split())
if x[0]=="1":
now*=-1
else:
if now==1 and x[1]=="2" or now==-1 and x[1]=="1":
b.append(x[2])
... | s=input()
a=[]
b=[]
now=True
q=int(input())
for i in range(q):
x=list(input().split())
if x[0]=="1":
now=not now
else:
if now and x[1]=="2" or not now and x[1]=="1":
b.append(x[2])
else:
a.append(x[2])
if now:
ans=a[::-1]+list(s)+b
else:
... | p02756 |
from collections import deque
s = list(input())
q = int(input())
ans = deque(s)
for i in range(q):
arr = list(map(str, input().split()))
if arr[0] == '1':
ans.reverse()
else:
if arr[1] == '1':
ans.appendleft(arr[2])
else:
ans.append(arr[2])
prin... | from collections import deque
s = list(input())
q = int(input())
ans = deque(s)
cnt = 0
for i in range(q):
arr = list(map(str, input().split()))
if arr[0] == '1':
cnt += 1
cnt %= 2
else:
if (arr[1] == '1' and cnt == 0) or (arr[1] == '2' and cnt == 1):
ans.... | p02756 |
from collections import deque
s = deque(input())
q = int(input())
l = list(list(input().split()) for _ in range(q))
for i in l:
if len(i)==1:
s.reverse()
else:
a,f,c = i
if f=="1":
s.appendleft(c)
else:
s.append(c)
print(*s,sep="")
| from collections import deque
s = deque(input())
q = int(input())
l = list(list(input().split()) for _ in range(q))
t = 0
for i in l:
if len(i)==1:
t += 1
else:
a,f,c = i
if (f=="1" and t%2==0) or (f=="2" and t%2==1) :
s.appendleft(c)
else:
s.append(c)
if t%2==1:
s.rever... | p02756 |
from collections import deque
import sys
input=sys.stdin.readline
moji=deque([])
s=input().rstrip()
for i in range(len(s)):
moji.append(ord(s[i]))
q=int(eval(input()))
rev=0
for _ in range(q):
qw=input().split()
if qw[0]=="1":
rev+=1
else:
f=qw[1]
c=qw[2]
if f=="1":
if rev%2==0:
moj... | alph="abcdefghijklmnopqrstuvwxyz"
from collections import deque
import sys
input=sys.stdin.readline
moji=deque([])
s=input().rstrip()
for i in range(len(s)):
for j in range(26):
if s[i]==alph[j]:
moji.append(j)
break
q=int(eval(input()))
rev=0
for _ in range(q):
qw=input().split()
if qw[0]=="1... | p02756 |
import sys
import collections
import itertools
def resolve(in_):
one = ord(b'1')
two = ord(b'2')
# print(f'{one=} {two=}')
S = in_.readline().strip()
q = collections.deque(S)
# print(f'{S=} {q=}')
reverse_flag = 0
Q = int(in_.readline())
for query in itertools.isl... | import sys
import collections
import itertools
def resolve(in_):
one = ord(b'1')
two = ord(b'2')
# print(f'{one=} {two=}')
S = in_.readline().strip()
q = collections.deque(S)
# print(f'{S=} {q=}')
reverse_flag = False
Q = int(in_.readline())
for query in itertools... | p02756 |
S = input()
Q = int(input())
reverse = False
for _ in range(Q):
cmd = input().split()
if cmd[0] == "1":
reverse = not reverse
else:
top = (cmd[1] == "1") ^ reverse
S = cmd[2] + S if top else S + cmd[2]
print(S[::-1]) if reverse else print(S)
| S = input()
Q = int(input())
head, tail = "", ""
reverse = False
for _ in range(Q):
cmd = input().split()
if cmd[0] == "1":
reverse = not reverse
else:
top = (cmd[1] == "1") ^ reverse
if top:
head += cmd[2]
else:
tail += cmd[2]
print(tail... | p02756 |
from collections import deque
revFlag = False
s = deque(input())
q = int(input())
for i in range(q):
a,b,c, *_ = input().split() + [None, None]
if(a == '1'):
revFlag = not revFlag
else:
if(revFlag):
s.reverse()
revFlag = False
i... | from collections import deque
revFlag = False
s = deque(input())
q = int(input())
for i in range(q):
a,b,c, *_ = input().split() + [None, None]
if(a == '1'):
revFlag = not revFlag
else:
b = int(b)
if(revFlag):
b = (int(b)%2)+1
... | p02756 |
from sys import stdin
s = list(stdin.readline().rstrip())
q = int(stdin.readline().rstrip())
t = []
for i in range(q):
t.append([x for x in stdin.readline().rstrip().split()])
r = 0
for i in range(q):
if int(t[i][0]) == 1:
if r == 1:
r = 0
else:
r = 1
els... | from sys import stdin
s = list(stdin.readline().rstrip())
q = int(stdin.readline().rstrip())
t = []
k = []
for i in range(q):
t.append([x for x in stdin.readline().rstrip().split()])
r = 0
for i in range(q):
if int(t[i][0]) == 1:
if r == 1:
r = 0
else:
r = 1
... | p02756 |
from collections import deque
def main():
s = input()
q = int(input())
d = deque(s)
is_reversed = False
for _ in range(q):
query = list(input().split())
if query[0] == "1":
if is_reversed:
is_reversed = False
else:
... | def main():
s = list(input())
t = []
q = int(input())
for _ in range(q):
query = list(input().split())
if query[0] == "1":
s, t = t, s
elif query[0] == "2":
if query[1] == "1":
t.append(query[2])
elif query[1] == ... | p02756 |
import sys
sys.setrecursionlimit(4100000)
import math
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
def resolve():
S = [x for x in sys.stdin.readline().split()][0] # 文字列 一つ
Q = [int(x) for x in sys.stdin.readline().split()][0] # int 一つ
# ... | import sys
sys.setrecursionlimit(4100000)
import math
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
from collections import deque
def resolve():
S = [x for x in sys.stdin.readline().split()][0] # 文字列 一つ
Q = [int(x) for x in sys.stdin.readlin... | p02756 |
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
... | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
... | p02756 |
#n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
a, b = map(int, input().split())
A.append(a)
B.append(b)'''
def main():
import sys
input = sys.stdin.readline
s = input().rstrip("\n")
q = int(eval(input()))
han = 0
qq=[input(... | #n = int(input())
#l = list(map(int, input().split()))
'''
A=[]
B=[]
for i in range():
a, b = map(int, input().split())
A.append(a)
B.append(b)'''
def main():
import sys
input = sys.stdin.readline
s = input().rstrip("\n")
q = int(eval(input()))
qq = [input().spl... | p02756 |
import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys... | p02756 |
from sys import stdin
S = (stdin.readline().rstrip())
Q = int(stdin.readline().rstrip())
cnt = 0
ccnt = 0
s = ["@"]
for i in range(Q):
data = [(x) for x in stdin.readline().rstrip().split()]
if data[0] == "2":
ccnt = 0
if data[1] == "1":
if cnt % 2 == 0:
#... | from sys import stdin
S = (stdin.readline().rstrip())
Q = int(stdin.readline().rstrip())
cnt = 0
ccnt = 0
s = "@"
for i in range(Q):
data = [(x) for x in stdin.readline().rstrip().split()]
if data[0] == "2":
ccnt = data[2]
if data[1] == "1":
if cnt % 2 == 0:
... | p02756 |
from sys import stdin
s = str(stdin.readline().rstrip())
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに
q= int(stdin.readline().rstrip())
hanten = 0
for i in range(q):
l = list(map(str, stdin.readline().rstrip().spli... | from sys import stdin
s = str(stdin.readline().rstrip())
#A, B, C = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに
q= int(stdin.readline().rstrip())
hanten = 0
t=""
u=""
for i in range(q):
l = list(map(str, stdin.readline()... | p02756 |
S = input()
N = int(input())
direct = 0
for i in range(N):
X = input().split()
if len(X) == 1:
direct = 1 - direct
else:
if (X[1] == "1" and direct == 0) or (X[1] == "2" and direct == 1):
S = X[2] + S
else:
S += X[2]
print(S) if direct == 0 else print(S[::-1])
| S = input()
f = ""
N = int(input())
direct = 0
for i in range(N):
X = input().split()
if len(X) == 1:
direct = 1 - direct
else:
if (X[1] == "1" and direct == 0) or (X[1] == "2" and direct == 1):
f += X[2]
else:
S += X[2]
print(f[::-1]+S) if direct == 0 else print(S[::-1]+f)
| p02756 |
from collections import deque
d = deque()
S = input()
d.append(S)
N = int(input())
direct = 0
for i in range(N):
X = input().split()
if len(X) == 1:
direct = 1 - direct
else:
if (X[1] == "1" and direct == 0) or (X[1] == "2" and direct == 1):
d.appendleft(X[2])
else:
d.append(... | from collections import deque
d = deque()
S = input()
d.append(S)
N = int(input())
direct = 1
for i in range(N):
X = input().split()
if len(X) == 1:
direct *= -1
else:
if (X[1] == "1" and direct == 1) or (X[1] == "2" and direct == -1):
d.appendleft(X[2])
else:
d.append(X[2])
... | p02756 |
s = list(input().strip())
q = int(input().strip())
queries = []
one_count = 0
one_counts = []
for i in range(q):
inp = input().split()
queries.append(inp)
if inp[0] == "1":
one_count += 1
one_counts.append(one_count)
one_counts = list([(one_count - x) for x in one_counts])
if one_cou... | s = list(input().strip())
q = int(input().strip())
queries = []
one_count = 0
one_counts = []
for i in range(q):
inp = input().split()
queries.append(inp)
if inp[0] == "1":
one_count += 1
one_counts.append(one_count)
one_counts = list([(one_count - x) for x in one_counts])
if one_cou... | p02756 |
import sys
def ep(*params):
print(*params,file=sys.stderr)
l = ''
r = ''
S = input().rstrip()
Q = int(input())
mode = 0
for _ in range(Q):
ope = list(input().split())
if ope[0] == '1':
mode = (mode + 1)%2
else:
op = (int(ope[1]) + mode)%2
if op == 1:
... | import sys
def ep(*params):
print(*params,file=sys.stderr)
l = ''
r = ''
S = input().rstrip()
Q = int(input())
mode = 0
for _ in range(Q):
ope = list(input().split())
if ope[0] == '1':
mode = (mode + 1)%2
else:
op = (int(ope[1]) + mode)%2
if op == 1:
... | p02756 |
S=__import__('collections').deque(input())
for _ in range(int(input())):
T=input()
if T<'2':S.reverse()
else:(S.appendleft if T[2]<'2'else S.append)(T[4])
print(*S,sep='')
| S,f=__import__('collections').deque(input()),0
for _ in range(int(input())):
T=input()
if T<'2':f=1-f
else:(S.appendleft if (T[2]<'2')^f else S.append)(T[4])
if f:S.reverse()
print(*S,sep='')
| p02756 |
s = input()
n = int(input())
rev = 0
for i in range(n):
q = input().split()
if q[0] == '1':
rev = (rev + 1) % 2
else:
head = int(q[1]) % 2
if head ^ rev:
s = q[2] + s
else:
s += q[2]
print(s[::-1]) if rev else print(s)
| s = input()
n = int(input())
rev = 0
sh = ''
for i in range(n):
q = input().split()
if q[0] == '1':
rev = (rev + 1) % 2
else:
head = int(q[1]) % 2
if head ^ rev:
sh += q[2]
# print('sh', sh)
else:
s += q[2]
# pr... | p02756 |
import sys
from collections import deque
S=input()
Q=eval(input())
Query=[ sys.stdin.readline().split() for _ in range(Q) ]
s1=deque()
s2=deque()
judge={}
judge["front"]="s1"
judge["end"]="s2"
cnt=0
for x in Query:
if x[0]=="1":
n=x[0]
cnt+=1
elif x[0]=="2":
n,f,c=x... | # -*- coding: utf-8 -*-
import sys
from collections import deque
S=sys.stdin.readline().strip()
Q=int(sys.stdin.readline().strip())
cnt=0 #反転した回数
deq1=deque()
deq2=deque()
for _ in range(Q):
t=sys.stdin.readline().split()
if t[0]=="1": #反転
cnt+=1 #反転回数をカウント
elif t[0]=="2": #文字... | p02756 |
from collections import deque
S=input()
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
ans=deque(S)
for i,q in enumerate(query):
if len(q)==1:
ans.reverse()
else:
_,f,c=q
if f=='1':
ans.appendleft(c)
else:
ans.append(c)
print(*ans,sep='')
| from collections import deque
S=input()
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
ans=deque(S)
reverse=False
for i,q in enumerate(query):
if len(q)==1:
reverse=not reverse
else:
_,f,c=q
if (f=='2') ^ reverse:
ans.append(c)
else:
ans.appendlef... | p02756 |
from collections import deque
S=input()
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
ans=deque(S)
reverse=False
for i,q in enumerate(query):
if len(q)==1:
reverse=not reverse
else:
_,f,c=q
if (f=='2') ^ reverse:
ans.append(c)
else:
ans.appendlef... | from collections import deque
S=input()
Q=int(input())
query=[list(map(str,input().split())) for _ in range(Q)]
d=deque(S)
reverse=False
for q in query:
if len(q)==1:
reverse=not reverse
else:
_,f,c=q
if f=='1':
d.append(c) if reverse else d.appendleft(c)
else:
d.appendle... | p02756 |
import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
a, *ret = sys.stdin.readline().rstrip()
ret.insert(0, a)
Q = int(sys.stdin.readline().rstrip())
for q in range(Q):
line = sys.stdin.readline().split()
if line[0] == '1... | import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
ret = sys.stdin.readline().rstrip()
Q = int(sys.stdin.readline().rstrip())
m = ""
u = ""
r = 0
for q in range(Q):
line = sys.stdin.readline().split()
if line[0... | 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... | 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... | p02756 |
from collections import deque
S = deque(list(input().strip()))
Q = int(eval(input()))
cnt = 0
for _ in range(Q):
q = list(input().split())
if int(q[0])==1:
cnt += 1
else:
if cnt%2==0:
if int(q[1])==1:
S.appendleft(q[2])
else:
... | from collections import deque
S = deque(list(input().strip()))
Q = int(eval(input()))
cnt = 0
for _ in range(Q):
q = list(input().split())
if int(q[0])==1:
cnt += 1
else:
if cnt%2==0:
if int(q[1])==1:
S.appendleft(q[2])
else:
... | p02756 |
from collections import deque
S = deque(list(input().strip()))
Q = int(eval(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)
... | from collections import deque
S = deque(list(input().strip()))
Q = int(eval(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)
el... | p02756 |
from collections import deque
S = deque(list(input().strip()))
Q = int(eval(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)
el... | S = input().strip()
Q = int(eval(input()))
ind = 1
x = []
y = []
for i in range(Q):
q = list(input().split())
if len(q)==1:
ind = ind*(-1)
else:
if q[1]=="1":
if ind>0:
x.append(q[2])
else:
y.append(q[2])
else:
... | p02756 |
import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import deque
def resolve():
S = input()
Q = int(input())
Query = [input().split() for _ in range(Q)]
S_deque = deque()
for s in S:
S_deque.append(s)
for q in Query:
if q[0]=='1':
... | import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import deque
def resolve():
S = input()
Q = int(input())
Query = [input().split() for _ in range(Q)]
S_deque = deque()
for s in S:
S_deque.append(s)
is_reversed = False
for q in Query:
... | p02756 |
from collections import deque
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(eval(input()))
for i in range(q):
q = list(map(str, input().split()))
if int(q[0]) == 1:
if f:
f = False
else:
f = True
else:
f_i = int(q[1])
... | from collections import deque
import sys
input = sys.stdin.readline
s = str(input().rstrip())
ans = deque(list(s))
f = True
q = int(eval(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) ^ ... | p02756 |
from sys import stdin
from collections import deque
# not AC
# def get_result(data):
# S, Q = data[0][0], int(data[1][0])
# for i in range(Q):
# if data[i+2][0] == '1':
# S = S[::-1]
# else:
# F, C = data[i+2][1], data[i+2][2]
# if F == '1':
# ... | from sys import stdin
from collections import deque
# not AC
# def get_result(data):
# S, Q = data[0][0], int(data[1][0])
# for i in range(Q):
# if data[i+2][0] == '1':
# S = S[::-1]
# else:
# F, C = data[i+2][1], data[i+2][2]
# if F == '1':
# ... | p02756 |
import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log
from collections import Counter, defaultdict
from operator import itemgetter
INF = float('inf'); MOD = 10**9+7
def I(): return int(eval(input()))
def MI(): return list(map(int, input().sp... | import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log
from collections import Counter, defaultdict, deque
from operator import itemgetter
INF = float('inf'); MOD = 10**9+7
def I(): return int(eval(input()))
def MI(): return list(map(int, input... | p02756 |
import sys
from collections import deque
s = list(sys.stdin.readline().rstrip())
q = int(sys.stdin.readline())
s = deque(s)
for _ in range(q):
query = sys.stdin.readline().split()
if len(query) == 1:
s.reverse()
elif query[1] == '1':
s.appendleft(query[2])
else:
s... | import sys
from collections import deque
s = list(sys.stdin.readline().rstrip())
q = int(sys.stdin.readline())
head = 0
s = deque(s)
for _ in range(q):
query = sys.stdin.readline().split()
if len(query) == 1:
head = 1 if head == 0 else 0
elif (query[1] == '1' and head == 1) or (query[1... | p02756 |
s,_,*q=open(0)
a=['','']
p=1
for q in q:
p^=q[0]<'2'
a[(q<'2 2')^p]+=q[-2]*(q[0]>'1')
print((a[p^1][::-1]+s[:-1][::p or-1]+a[p])) | s,_,*q=open(0)
a=['','']
p=1
for q in q:
p^=q<'2'
a[(q<'2 2')^p]+=q[-2]*(q>'2')
print((a[p^1][::-1]+s[:-1][::p or-1]+a[p])) | p02756 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.