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 | resolve()
def resolve():
S = str(input())
Q = int(input())
rev_flag = 1
head_str = ""
tail_str = ""
for _ in range(Q):
query = input() # contains spaces
if query[0] == "1":
rev_flag *= -1
else:
h_or_t_flag = 1 if query[2] == "1" else -1
... | def resolve():
S = str(input())
Q = int(input())
rev_flag = 1
head_str = ""
tail_str = ""
for _ in range(Q):
query = input() # contains spaces
if query[0] == "1":
rev_flag *= -1
else:
h_or_t_flag = 1 if query[2] == "1" else -1
h_or_t_f... | [
"call.remove",
"call.add"
] | 542,829 | 542,830 | u811817592 | python |
p02756 | # -*- coding: utf-8 -*-
S = str(input())
Q = int(input())
rev_flag = 1
head_str = ""
tail_str = ""
for _ in range(Q):
query = str(input())
if query[0] == "1":
rev_flag *= -1
else:
h_or_t_flag = 1 if query[1] == "1" else -1
h_or_t_flag *= rev_flag
if h_or_t_flag == 1... | # -*- coding: utf-8 -*-
S = str(input())
Q = int(input())
rev_flag = 1
head_str = ""
tail_str = ""
for _ in range(Q):
query = str(input()) # contains spaces
if query[0] == "1":
rev_flag *= -1
else:
h_or_t_flag = 1 if query[2] == "1" else -1
h_or_t_flag *= rev_flag
i... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 542,831 | 542,832 | u811817592 | python |
p02756 | from collections import deque
s = input()
n = int(input())
query = [0]*n
rev = 0
for i in range(n):
query[i] = list(map(str, input().split()))
if query[i][0] == '1':
rev = rev + 1
begin = deque()
end = deque()
pal = 0
for i in range(n):
if int(query[i][0]) == 1:
pal = (pal+1)%2
else:
... | from collections import deque
s = input()
n = int(input())
query = [0]*n
rev = 0
for i in range(n):
query[i] = list(map(str, input().split()))
if query[i][0] == '1':
rev = rev + 1
begin = deque()
end = deque()
pal = 0
for i in range(n):
if int(query[i][0]) == 1:
pal = (pal+1)%2
else:
... | [
"call.remove"
] | 542,837 | 542,838 | u021916304 | python |
p02756 | from collections import deque
s = input()
q = int(input())
ans = deque(s)
rev = 0
for i in range(q):
qi = input()
if qi[0] == '1':
rev += 1
else:
parity = rev % 2
if (int(qi[2]) + parity) % 2:
ans.appendleft(qi[4])
else:
ans.append(qi[4])
if parity:
... | from collections import deque
s = input()
q = int(input())
ans = deque(s)
rev = 0
for i in range(q):
qi = input()
if qi[0] == '1':
rev += 1
else:
parity = rev % 2
if (int(qi[2]) + parity) % 2:
ans.appendleft(qi[4])
else:
ans.append(qi[4])
parity = rev... | [
"assignment.add"
] | 542,842 | 542,843 | u347600233 | python |
p02756 | s = collections.deque(list(input()))
q = int(input())
rev = 0
for i in range(q):
tfc = list(input().split())
if tfc[0]=='1':
rev = abs(rev-1)
else:
t,f,c = tfc
if rev:
if f=='1':
s.append(c)
else:
s.appendleft(c)
else:
... | import collections
s = collections.deque(list(input()))
q = int(input())
rev = 0
for i in range(q):
tfc = list(input().split())
if tfc[0]=='1':
rev = abs(rev-1)
else:
t,f,c = tfc
if rev:
if f=='1':
s.append(c)
else:
s.appendlef... | [] | 542,855 | 542,856 | u807028974 | python |
p02756 | s = input()
q = int(input())
query_list = []
for _ in range(q):
query_list += [input()]
def query1(s):
s = s[::-1]
return s
def query2_1(letters,s):
s = letters[4] + s
return s
def query2_2(letters,s):
s = s + letters[4]
return s
true_position = True
left = ""
right = ""
for i in ran... | s = input()
q = int(input())
query_list = []
for _ in range(q):
query_list += [input()]
def query1(s):
s = s[::-1]
return s
def query2_1(letters,s):
s = letters[4] + s
return s
def query2_2(letters,s):
s = s + letters[4]
return s
true_position = True
left = ""
right = ""
for i in ran... | [] | 542,857 | 542,858 | u114641312 | python |
p02756 | s = input()
q = int(input())
query_list = [input().split() for _ in range(q)]
front = []
back = []
is_reverse = False
for query in query_list:
if query[0] == '1':
is_reverse = not is_reverse
elif query[0] == '2':
key = int(query[1])
value = query[2]
if (key == 1 and not is_reve... | s = input()
q = int(input())
query_list = [input().split() for _ in range(q)]
front = []
back = []
is_reverse = False
for query in query_list:
if query[0] == '1':
is_reverse = not is_reverse
elif query[0] == '2':
key = int(query[1])
value = query[2]
if (key == 1 and not is_reve... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 542,866 | 542,867 | u319345083 | python |
p02756 | def main():
from collections import deque
S = deque(input())
Q = int(input())
q_list = [input().split() for _ in range(Q)]
flag = False
for q in q_list:
if len(q) == 1:
t = q[0]
else:
t, f, c = q
if t == '1':
flag = not flag
... | def main():
from collections import deque
S = deque(input())
Q = int(input())
q_list = [input().split() for _ in range(Q)]
flag = False
for q in q_list:
if len(q) == 1:
t = q[0]
else:
t, f, c = q
if t == '1':
flag = not flag
... | [
"call.add"
] | 542,870 | 542,871 | u239917977 | python |
p02756 | def main():
from collections import deque
S = deque(input().split())
Q = int(input())
q_list = [input().split() for _ in range(Q)]
flag = False
for q in q_list:
if len(q) == 1:
t = q[0]
else:
t, f, c = q
if t == '1':
flag = not flag
... | def main():
from collections import deque
S = deque(input())
Q = int(input())
q_list = [input().split() for _ in range(Q)]
flag = False
for q in q_list:
if len(q) == 1:
t = q[0]
else:
t, f, c = q
if t == '1':
flag = not flag
... | [
"call.remove"
] | 542,872 | 542,871 | u239917977 | python |
p02756 | def main():
from collections import deque
S = deque(input().split())
Q = int(input())
q_list = [input().split() for _ in range(Q)]
flag = True
for q in q_list:
if len(q) == 1:
t = q[0]
else:
t, f, c = q
if t == '1':
flag = not flag
... | def main():
from collections import deque
S = deque(input())
Q = int(input())
q_list = [input().split() for _ in range(Q)]
flag = False
for q in q_list:
if len(q) == 1:
t = q[0]
else:
t, f, c = q
if t == '1':
flag = not flag
... | [
"misc.opposites",
"assignment.value.change"
] | 542,873 | 542,871 | u239917977 | python |
p02756 | from collections import deque
s=deque(list(input()))
q=int(input())
rev=0
for i in range(q):
l=list(input().split())
if len(l)==1:
# s.reverse()
rev+=1
else:
t,f,c=l[0],l[1],l[2]
if rev%2==0:
if f=='1':
s.appendleft(c)
else:
s.append(c)
else:
if f=='1':
... | from collections import deque
s=deque(list(input()))
q=int(input())
rev=0
for i in range(q):
l=list(input().split())
if len(l)==1:
# s.reverse()
rev+=1
else:
t,f,c=l[0],l[1],l[2]
if rev%2==0:
if f=='1':
s.appendleft(c)
else:
s.append(c)
else:
if f=='1':
... | [
"identifier.change"
] | 542,874 | 542,875 | u094191970 | python |
p02756 |
def main2(s,x,q):
res = s
rev = 1 #-1なら反転中
lstA = []
lstB = []
for op in q:
if int(op[0]) == 1:
rev = rev * -1
elif int(op[1])*rev == 1 or int(op[1])*rev == -2:
lstA.append(op[2])
elif int(op[1])*rev == -1 or int(op[1])*rev == 2:
lstB.appe... | def main2(s,x,q):
res = s
rev = 1 #-1なら反転中
lstA = []
lstB = []
for op in q:
if int(op[0]) == 1:
rev = rev * -1
elif int(op[1])*rev == 1 or int(op[1])*rev == -2:
lstA.append(op[2])
elif int(op[1])*rev == -1 or int(op[1])*rev == 2:
lstB.appen... | [] | 542,882 | 542,883 | u358957649 | python |
p02756 | def main2(s,x,q):
res = s
rev = 1 #-1なら反転中
lstA = []
lstB = []
for op in q:
if int(op[0]) == 1:
rev = rev * -1
elif int(op[1])*rev == 1 or int(op[1])*rev == -2:
lstA.append(op[2])
elif int(op[1])*rev == -1 or int(op[1])*rev == 2:
lstB.appen... | def main2(s,x,q):
res = s
rev = 1 #-1なら反転中
lstA = []
lstB = []
for op in q:
if int(op[0]) == 1:
rev = rev * -1
elif int(op[1])*rev == 1 or int(op[1])*rev == -2:
lstA.append(op[2])
elif int(op[1])*rev == -1 or int(op[1])*rev == 2:
lstB.appen... | [] | 542,884 | 542,883 | u358957649 | 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:
... | [
"call.add"
] | 542,887 | 542,888 | u213497190 | python |
p02756 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [] | 542,891 | 542,892 | u191874006 | python |
p02756 | from collections import deque
S=input()
s=deque(S)
Q=int(input())
Que=[list(map(str, input().split())) for _ in range(Q)]
#print(Que)
a=0
for i in range(Q):
if Que[i][0]=="1":
a+=1
elif Que[i][0]=="2":
if a%2==0:
if Que[i][1]=="2":
s.append(Que[i][2])
elif... | from collections import deque
S=input()
s=deque(S)
Q=int(input())
Que=[list(map(str, input().split())) for _ in range(Q)]
#print(Que)
a=0
for i in range(Q):
if Que[i][0]=="1":
a+=1
elif Que[i][0]=="2":
if a%2==0:
if Que[i][1]=="2":
s.append(Que[i][2])
elif... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 542,893 | 542,894 | u349444371 | python |
p02756 | from collections import deque
s = deque((str(input())).split())
loop = int(input())
rev = 0
for i in range(loop):
queries = input().split()
if len(queries) == 1:
rev = (rev+1) % 2
else:
type = int(queries[1])
c = str(queries[2])
if (type + rev) % 2 == 1:
s.appen... | from collections import deque
s = deque((str(input())))
loop = int(input())
rev = 0
for i in range(loop):
queries = input().split()
if len(queries) == 1:
rev = (rev+1) % 2
else:
type = int(queries[1])
c = str(queries[2])
if (type + rev) % 2 == 1:
s.appendleft(c)... | [
"call.remove"
] | 542,895 | 542,896 | u396858476 | python |
p02756 | # -*- coding: utf-8 -*-
def abc158d(s_init, n, query):
head = ""
tail = ""
reverse = 0
for i in range(n):
tgt = query[i]
if tgt[0] == "1":
reverse = (reverse + 1) % 2
elif tgt[0] == "2":
if tgt[1] == "1":
if reverse == 0:
... | # -*- coding: utf-8 -*-
def abc158d(s_init, n, query):
head = ""
tail = ""
reverse = 0
for i in range(n):
tgt = query[i]
if tgt[0] == "1":
reverse = (reverse + 1) % 2
elif tgt[0] == "2":
if tgt[1] == "1":
if reverse == 0:
... | [] | 542,897 | 542,898 | u838560769 | python |
p02756 | s = input()
q = int(input())
from collections import deque
ss = deque(s)
flg = True
for i in range(q):
t = input().split()
if t[0] == '1':
flg = not flg
else:
if t[1] == '2':
ss.append(t[2]) if flg else ss.appendleft(t[2])
else:
ss.append(t[2]) if not flg else ss.appendleft(t[2])
... | s = input()
q = int(input())
from collections import deque
ss = deque(s)
flg = True
for i in range(q):
t = input().split()
if t[0] == '1':
flg = not flg
else:
if t[1] == '2':
ss.append(t[2]) if flg else ss.appendleft(t[2])
else:
ss.append(t[2]) if not flg else ss.appendleft(t[2])
s... | [
"assignment.add"
] | 542,899 | 542,900 | u441254033 | python |
p02756 | s = input()
n = int(input())
x = []
y = []
r = 1
for i in range(n):
q = input().split()
if q[0] == '1':
r = -r
elif q[1] == '1':
z = q[2][0]
if r == 1:
x.append(z)
else:
y.append(z)
else:
z = q[2][0]
if r == -1:
x.append... | s = input()
n = int(input())
x = []
y = []
r = 1
for i in range(n):
q = input().split()
if q[0] == '1':
r = -r
elif q[1] == '1':
z = q[2][0]
if r == 1:
x.append(z)
else:
y.append(z)
else:
z = q[2][0]
if r == -1:
x.append... | [] | 542,909 | 542,910 | u546386229 | python |
p02756 | import sys
S = input()
Q = int(input())
flag=0
mae = ''
matsu = ''
for i in range(Q):
r = sys.stdin.readline().rstrip('\n')
if r == '1':
flag = 1 - flag
else:
ni, f, c = r.split()
if f=='1':
if flag == 0:
mae += c
else:
matsu... | import sys
S = input()
Q = int(input())
flag=0
mae = ''
matsu = ''
for i in range(Q):
r = sys.stdin.readline().rstrip('\n')
if r == '1':
flag = 1 - flag
else:
ni, f, c = r.split()
if f=='1':
if flag == 0:
mae += c
else:
matsu... | [] | 542,913 | 542,914 | u744920373 | python |
p02756 | import sys
S = input()
Q = int(input())
flag=0
mae = ''
matsu = ''
for i in range(Q):
r = sys.stdin.readline().strip('\n')
if r == '1':
flag = 1- flag
else:
ni, f, c = r.split()
if f=='1':
if flag == 0:
mae += c
else:
matsu +=... | import sys
S = input()
Q = int(input())
flag=0
mae = ''
matsu = ''
for i in range(Q):
r = sys.stdin.readline().rstrip('\n')
if r == '1':
flag = 1 - flag
else:
ni, f, c = r.split()
if f=='1':
if flag == 0:
mae += c
else:
matsu... | [
"assignment.value.change",
"identifier.change"
] | 542,915 | 542,914 | u744920373 | python |
p02756 | from queue import deque
def main():
que=deque()
que.append(input())
head = True
for i in range(int(input())):
q=input().split()
if q[0]=="1":
head = not head
else:
h = q[1]=="1"
if (head and h) or (not head and not head):
que.ap... | from queue import deque
def main():
que=deque()
que.append(input())
head = True
for i in range(int(input())):
q=input().split()
if q[0]=="1":
head = not head
else:
h = q[1]=="1"
if (head and h) or (not head and not h):
que.appen... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 542,916 | 542,917 | u211706121 | python |
p02756 | import sys
input = sys.stdin.readline
s = input().split()[0]
q = int(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:
left += [c]
... | import sys
input = sys.stdin.readline
s = input().split()[0]
q = int(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:
left += [c]
... | [] | 542,918 | 542,919 | u102275718 | python |
p02756 | S = input()
Q = int(input())
rev = 1
head = []
tail = []
for _ in range(Q):
lst = input().split()
if (lst[0] == '1'):
rev *= -1
else:
if (lst[1] == '1'):
pos = rev
else:
pos = -1 * rev
if (pos == 1):
head.append(lst[2])
else:
... | S = input()
Q = int(input())
rev = 1
head = []
tail = []
for _ in range(Q):
lst = input().split()
if (lst[0] == '1'):
rev *= -1
else:
if (lst[1] == '1'):
pos = rev
else:
pos = -1 * rev
if (pos == 1):
head.append(lst[2])
else:
... | [] | 542,929 | 542,930 | u439009525 | python |
p02756 | S = input()
Q = int(input())
Atama = []
Osiri = []
rev = [0]*Q
for i in range(Q):
a = list(input().split())
if len(a) == 1:##T_i=1
rev[i] = 1
else:#T_i == 2
if a[1] == "1":
Atama.append([i,a[2],1])
else:
Osiri.append([i,a[2],-1])
##revの累積和
Rev = []
tmp = 0
r ... | S = input()
Q = int(input())
Atama = []
Osiri = []
rev = [0]*Q
for i in range(Q):
a = list(input().split())
if len(a) == 1:##T_i=1
rev[i] = 1
else:#T_i == 2
if a[1] == "1":
Atama.append([i,a[2],1])
else:
Osiri.append([i,a[2],-1])
##revの累積和
Rev = []
tmp = 0
r ... | [
"call.add"
] | 542,931 | 542,932 | u497952650 | python |
p02756 | from collections import deque
S = deque(input().strip())
q = int(input())
rev = True
for _ in enumerate(range(q)):
query = input().split()
if query[0] == '1':
rev = not rev
else:
if (query[1] == '1') ^ rev:
S.appendleft(query[2])
else:
S.append(query[2])
S =... | from collections import deque
S = deque(input().strip())
q = int(input())
rev = False
for _ in range(q):
query = input().split()
if query[0] == '1':
rev = not rev
else:
if (query[1] == '1') ^ rev:
S.appendleft(query[2])
else:
S.append(query[2])
S = S if not ... | [
"misc.opposites",
"assignment.value.change",
"call.remove",
"call.arguments.change"
] | 542,935 | 542,936 | u417365712 | python |
p02756 | S=input()
Q=int(input())
c=0
left=""
right=""
for i in range(Q):
T=list(map(str,input().split()))
if len(T)==1:
c+=1
else:
if (T[1]=="1" and c%2==0) or (T[1]=="2" and c%2==1):
left+=T[2]
else:
right+=T[2]
if c%2==0:
ans=left[::-1]+S+right
else:
ans=ri... | S=input()
Q=int(input())
c=0
left=""
right=""
for i in range(Q):
T=list(map(str,input().split()))
if len(T)==1:
c+=1
else:
if (T[1]=="1" and c%2==0) or (T[1]=="2" and c%2==1):
left+=T[2]
else:
right+=T[2]
if c%2==0:
ans=left[::-1]+S+right
else:
ans=ri... | [] | 542,939 | 542,940 | u703528810 | python |
p02756 | S = input()
Q = int(input())
Query = [list(input().split()) for i in range(Q)]
ans = [S]
X = []
Y = []
state = 1
for k in range(Q):
if Query[k][0]=="1":
state *= -1
elif Query[k][0]=="2":
if Query[k][1]=="1":
if state == 1:
X.append(Query[k][2])
else:
... | S = list(input())
Q = int(input())
Query = [list(input().split()) for i in range(Q)]
ans = S
X = []
Y = []
state = 1
for k in range(Q):
if Query[k][0]=="1":
state *= -1
elif Query[k][0]=="2":
if Query[k][1]=="1":
if state == 1:
X.append(Query[k][2])
else... | [
"call.add",
"call.arguments.change"
] | 542,948 | 542,949 | u212786022 | python |
p02756 | s=input()
q=int(input())
muki=True
a=[[_ for _ in input().split()] for i in range(q)]
front=""
back=""
for i in a:
if i[0]=="1":
muki=not muki
continue
if (i[1]=="1" and muki) or (i[1]=="2" and not muki):
front+=i[2]
else:
back+=i[2]
if muki:
print(front+s+back)
else:
... | s=input()
q=int(input())
muki=True
a=[[_ for _ in input().split()] for i in range(q)]
front=""
back=""
for i in a:
if i[0]=="1":
muki=not muki
continue
if (i[1]=="1" and muki) or (i[1]=="2" and not muki):
front=i[2]+front
else:
back+=i[2]
if muki:
print(front+s+back)
else... | [
"assignment.value.change"
] | 542,960 | 542,961 | u619197965 | python |
p02756 | #!/usr/bin/env python3
import sys
from collections import deque
DEBUG = False
def solve():
return
def read_int_list(sep = " "):
return [int(s) for s in sys.stdin.readline().rstrip().split(sep)]
def read_int():
return int(sys.stdin.readline())
def read_str():
return sys.stdin.readline().rstrip()
... | #!/usr/bin/env python3
import sys
from collections import deque
DEBUG = False
def solve():
return
def read_int_list(sep = " "):
return [int(s) for s in sys.stdin.readline().rstrip().split(sep)]
def read_int():
return int(sys.stdin.readline())
def read_str():
return sys.stdin.readline().rstrip()
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 542,962 | 542,963 | u641851773 | python |
p02756 | from collections import deque
S = input()
N = int(input())
d = deque()
d.append(S)
# Trueであれば順方向
direction = True
for i in range(N):
query = input()
if query[0] == "1":
t = int(query)
else:
t, f, c = query.split()
t = int(t)
f = int(f)
if t == 1:
#True-False... | from collections import deque
S = list(input())
N = int(input())
d = deque()
d.extend(S)
# Trueであれば順方向
direction = True
for i in range(N):
query = input()
if query[0] == "1":
t = int(query)
else:
t, f, c = query.split()
t = int(t)
f = int(f)
if t == 1:
#True... | [
"call.add",
"call.arguments.change",
"identifier.change"
] | 542,968 | 542,969 | u821869821 | python |
p02756 | S = input()
Q = int(input())
front = ''
back = ''
r_flg = False
for i in range(Q):
q = input()
if q == '1':
r_flg = False if r_flg else True
continue
t,f,c = q.split()
if not r_flg:
if f == '1':
front += c
else:
back += c
else:
... | S = input()
Q = int(input())
front = ''
back = ''
r_flg = False
for i in range(Q):
q = input()
if q == '1':
r_flg = False if r_flg else True
continue
t,f,c = q.split()
if not r_flg:
if f == '1':
front += c
else:
back += c
else:
... | [] | 542,970 | 542,971 | u922487073 | python |
p02756 | s = list(input())
q = int(input())
front = []
end = []
flip = False
for i in range(q):
x = input()
if x == "1":
flip = flip ^ True
else:
z,f,c = x.split()
f = bool(int(f)-1)
if flip ^ f:
front.append(c)
else:
end.append(c)
if not flip:
s = ... | s = list(input())
q = int(input())
front = []
end = []
flip = False
for i in range(q):
x = input()
if x == "1":
flip = flip ^ True
else:
z,f,c = x.split()
f = bool(int(f)-1)
if flip ^ f:
end.append(c)
else:
front.append(c)
if flip:
s = s[::... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 542,988 | 542,989 | u025463382 | python |
p02756 | S = input()
Q = int(input())
front = ''
back = ''
T_count = 0
for i in range(Q):
command = input().split()
if command[0] == '1':
T_count = (T_count+1)%2
else:
if (int(command[1]) + T_count)%2 == 1:
front += command[2]
else:
back += command[2]
if T_count ==... | S = input()
Q = int(input())
front = ''
back = ''
T_count = 0
for i in range(Q):
command = input().split()
if command[0] == '1':
T_count = (T_count+1)%2
else:
if (int(command[1]) + T_count)%2 == 1:
front += command[2]
else:
back += command[2]
if T_count ==... | [] | 542,990 | 542,991 | u747602774 | python |
p02756 | S = input()
Q = int(input())
heads_min_idx = 0
heads_max_idx = 0
tails_min_idx = 0
tails_max_idx = 0
heads = {}
tails = {}
rev_flag = 1 # 1 or -
for q in range(Q):
tmp_q = input()
if tmp_q == '1':
rev_flag *= -1
else:
_, f, c = tmp_q.split()
if rev_flag == 1:
if f == '1... | S = input()
Q = int(input())
heads_min_idx = 0
heads_max_idx = 0
tails_min_idx = 0
tails_max_idx = 0
heads = {}
tails = {}
rev_flag = 1 # 1 or -
for q in range(Q):
tmp_q = input()
if tmp_q == '1':
rev_flag *= -1
else:
_, f, c = tmp_q.split()
if rev_flag == 1:
if f == '1... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operator.change"
] | 542,994 | 542,995 | u673361376 | python |
p02756 | from collections import deque
s=input()
q=int(input())
rev=0
head=deque()
tail=deque()
for _ in range(q):
Q=input().split()
if len(Q)==1:
rev=1-rev
if len(Q)==3:
if(rev==0 and Q[1]=="1" )or (rev==1 and Q[1]=="2"):
head.appendleft(Q[2])
else :
tail.append(Q[2])... | from collections import deque
s=input()
q=int(input())
rev=0
head=deque()
tail=deque()
for _ in range(q):
Q=input().split()
if len(Q)==1:
rev=1-rev
if len(Q)==3:
if(rev==0 and Q[1]=="1" )or (rev==1 and Q[1]=="2"):
head.appendleft(Q[2])
else :
tail.append(Q[2])... | [] | 542,996 | 542,997 | u664373116 | python |
p02756 | import math
from collections import deque
def main():
s = deque(input())
q = int(input())
counter = 0
for _ in range(q):
query = [t for t in input().split()]
if len(query)==1:
counter +=1
else:
f = (counter+int(query[1]))%2
if query[1]==1:
... | import math
from collections import deque
def main():
s = deque(input())
q = int(input())
counter = 0
for _ in range(q):
query = [t for t in input().split()]
if len(query)==1:
counter +=1
else:
f = (counter+int(query[1]))%2
if f==1:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.integer.change"
] | 543,017 | 543,018 | u711238850 | python |
p02756 | import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from math import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from ... | import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from math import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from ... | [] | 543,019 | 543,020 | u978494963 | python |
p02756 | import sys
fastinput = sys.stdin.readline
from collections import deque
S = input()
Q = int(input())
ans = deque([S])
Reverse = False
for q in range(Q):
query = fastinput().split()
if query[0]=="1":
Reverse = not Reverse
elif (query[1]=="1") ^ Reverse:#左側にくっつく
ans.appendleft(query[2])
el... | import sys
fastinput = sys.stdin.readline
from collections import deque
S = input()
Q = int(input())
ans = deque([S])
Reverse = False
for q in range(Q):
query = fastinput().split()
if query[0]=="1":
Reverse = not Reverse
elif (query[1]=="1") ^ Reverse:#左側にくっつく
ans.appendleft(query[2])
el... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 543,021 | 543,022 | u268516119 | python |
p02756 | import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from math import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
s=input()
q=int(input())
query=[in... | import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from math import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
s=input()
q=int(input())
query=[in... | [
"call.remove"
] | 543,044 | 543,045 | u654470292 | python |
p02756 | s = input()
q = int(input())
import sys
input = sys.stdin.readline
qs = [list(input().split()) for _ in range(q)]
left = ''
right = ''
front = True
for i in qs:
if(i[0] == '1'):
front = not front
continue
f = int(i[1])
c = i[2]
if(front + f == 2):
right = right + c
else... | s = input()
q = int(input())
import sys
input = sys.stdin.readline
qs = [list(input().split()) for _ in range(q)]
left = ''
right = ''
front = False
for i in qs:
if(i[0] == '1'):
front = not front
continue
f = int(i[1])
c = i[2]
if(front + f == 2):
right = right + c
els... | [
"misc.opposites",
"assignment.value.change"
] | 543,046 | 543,047 | u490642448 | python |
p02756 |
s = input()
q = int(input())
import sys
input = sys.stdin.readline
qs = [list(input().split()) for _ in range(q)]
left = ''
right = ''
front = True
for i in qs:
if(i[0] == '1'):
front = not front
continue
f = int(i[1])
c = i[2]
if(front + f == 2):
right = right + c
els... | s = input()
q = int(input())
import sys
input = sys.stdin.readline
qs = [list(input().split()) for _ in range(q)]
left = ''
right = ''
front = False
for i in qs:
if(i[0] == '1'):
front = not front
continue
f = int(i[1])
c = i[2]
if(front + f == 2):
right = right + c
els... | [
"misc.opposites",
"assignment.value.change"
] | 543,048 | 543,047 | u490642448 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
d = deque()
for i in S:
d.append(i)
flag = True
for _ in range(Q):
q = [i for i in input().split()]
if int(q[0]) == 1:
flag = not flag
else:
if (int(q[1]) == 1 and flag) or (int(q[0]) == 2 and not flag):
d.appendleft... | from collections import deque
S = input()
Q = int(input())
d = deque()
for i in S:
d.append(i)
flag = True
for _ in range(Q):
q = [i for i in input().split()]
if int(q[0]) == 1:
flag = not flag
else:
if (int(q[1]) == 1 and flag) or (int(q[1]) == 2 and not flag):
d.appendleft... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 543,058 | 543,059 | u256281774 | python |
p02756 | #import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
import itertools
#import bisect
import copy
from functools import lru_cache
def sosuhante(n):
for k in range(2, int(math.sqrt(n))+1):
if n% k ==0:
return False
return True
def cmb(n, r):
if n - r < r:... | #import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
import itertools
#import bisect
import copy
from functools import lru_cache
def sosuhante(n):
for k in range(2, int(math.sqrt(n))+1):
if n% k ==0:
return False
return True
def cmb(n, r):
if n - r < r:... | [] | 543,068 | 543,069 | u366482170 | python |
p02756 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list... | [
"call.remove"
] | 543,070 | 543,071 | u624696727 | python |
p02756 | S=input()
Q=int(input())
inv=False
head=""
last=""
for i in range(Q):
qu=input().split(" ")
if int(qu[0])==1:
inv=not inv
else:
F=int(qu[1])
if inv:
F=3-F
if F==1:
head+=qu[2]
else:
last+=qu[2]
if inv:
print(last[::-1]+S+head)
... | S=input()
Q=int(input())
inv=False
head=""
last=""
for i in range(Q):
qu=input().split(" ")
if int(qu[0])==1:
inv=not inv
else:
F=int(qu[1])
if inv:
F=3-F
if F==1:
head+=qu[2]
else:
last+=qu[2]
if inv:
print(last[::-1]+S[::-1]+... | [] | 543,078 | 543,079 | u783255320 | python |
p02756 | from collections import deque
s = list(input())
s = deque(s)
n = int(input())
cnt = 0
for i in range(n):
q = list(map(str,input().split()))
if q[0] == '1':
cnt += 1
else:
if cnt % 2 == 0:
if q[1] == '1':
s.appendleft(q[2])
else:
s.appen... | from collections import deque
s = list(input())
s = deque(s)
n = int(input())
cnt = 0
for i in range(n):
q = list(map(str,input().split()))
if q[0] == '1':
cnt += 1
else:
if cnt % 2 == 0:
if q[1] == '1':
s.appendleft(q[2])
else:
s.appen... | [
"call.remove"
] | 543,086 | 543,087 | u361381049 | python |
p02756 | s=input()
a=[]
b=[]
d=0
for i in range(int(input())):
q=input()
if q=="1":d^=1
else:
_,f,c=q.split()
f=int(f)-1
if d==0:
if f==0:a.append(c)
else:b.append(c)
else:
if f==1:a.append(c)
else:b.append(c)
if d==0:print("".join(a)[::-1]+s+"".join(b))
else:print("".join(b)[::-1]+... | s=input()
a=[]
b=[]
d=0
for i in range(int(input())):
q=input()
if q=="1":d^=1
else:
_,f,c=q.split()
f=int(f)-1
if d==0:
if f==0:a.append(c)
else:b.append(c)
else:
if f==1:a.append(c)
else:b.append(c)
if d==0:print("".join(a)[::-1]+s+"".join(b))
else:print("".join(b)[::-1]+... | [] | 543,119 | 543,120 | u227082700 | python |
p02756 | # -*- coding: utf-8 -*-
import sys
from collections import deque
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
S=input()
Q=int(input())
f=False
ans=deque([S])
for _ in range(Q):
Query=list(input().split())
if Query[... | # -*- coding: utf-8 -*-
import sys
from collections import deque
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
S=input()
Q=int(input())
f=False
ans=deque(list(S))
for _ in range(Q):
Query=list(input().split())
if Qu... | [
"assignment.value.change",
"call.arguments.change"
] | 543,123 | 543,124 | u714642969 | python |
p02756 | from collections import deque
s = list(input())
q = int(input())
query = [list(input().split()) for i in range(q)]
deq = deque(s)
flag = 1
for i in range(q):
if query[i][0] == "1":
flag ^= 1
else:
_, f, c = query[i]
f = int(f) % 2
if flag ^ f:
deq.appendleft(c)
... | from collections import deque
s = list(input())
q = int(input())
query = [list(input().split()) for i in range(q)]
deq = deque(s)
flag = 1
for i in range(q):
if query[i][0] == "1":
flag ^= 1
else:
_, f, c = query[i]
f = int(f) % 2
if flag ^ f:
deq.append(c)
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 543,127 | 543,128 | u794173881 | python |
p02756 | s = input()
q = int(input())
r_addition = ""
l_addition = ""
is_rev = False
for i in range(q):
qs = input().split()
if len(qs) == 1:
is_rev = not is_rev
else:
if int(qs[1]) == 1:
if is_rev:
r_addition += qs[2]
else:
l_addition += qs[... | s = input()
q = int(input())
r_addition = ""
l_addition = ""
is_rev = False
for i in range(q):
qs = input().split()
if len(qs) == 1:
is_rev = not is_rev
# print(is_rev)
else:
if int(qs[1]) == 1:
if is_rev:
r_addition += qs[2]
else:
... | [] | 543,137 | 543,138 | u231685196 | python |
p02748 | import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
a,b,m = map(int, input().split())
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
ans = min(aa) + min(bb)
for i in range(m):
x,y,c = map(int, input().split())
x,y = x-1, y-1
tmp = aa[x] + aa[y] - c
a... | import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
a,b,m = map(int, input().split())
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
ans = min(aa) + min(bb)
for i in range(m):
x,y,c = map(int, input().split())
x,y = x-1, y-1
tmp = aa[x] + bb[y] - c
a... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 543,139 | 543,140 | u803848678 | python |
p02757 | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, P = map(int, input().split())
S = input()
if P == 2 or P == 5:
ans = 0
for i in range(N):
if int(S[i]) % P == 0:
... | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, P = map(int, input().split())
S = input()
if P == 2 or P == 5:
ans = 0
for i in range(N):
if int(S[i]) % P == 0:
... | [
"identifier.replace.add",
"literal.replace.remove"
] | 543,309 | 543,310 | u346812984 | python |
p02757 | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | import math
from functools import reduce
from collections import deque, defaultdict
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]... | [] | 543,311 | 543,312 | u407160848 | python |
p02757 | n, p = [int(i) for i in input().split()]
s = input()
digit_rm = [0 for _ in range(n)]
for i in range(n):
digit_rm[i] = (int(s[n-1-i]) * pow(10, i, p) ) % p
remain = [0 for _ in range(n)]
for i in range(n):
if i == 0:
remain[i] = digit_rm[i]
else:
remain[i] = (remain[i-1] + digit_rm[i]) % p
pcnt = [0 for _ ... | n, p = [int(i) for i in input().split()]
s = input()
digit_rm = [0 for _ in range(n)]
for i in range(n):
digit_rm[i] = (int(s[n-1-i]) * pow(10, i, p) ) % p
remain = [0 for _ in range(n)]
for i in range(n):
if i == 0:
remain[i] = digit_rm[i]
else:
remain[i] = (remain[i-1] + digit_rm[i]) % p
pcnt = [0 for _ ... | [
"expression.operation.binary.remove"
] | 543,321 | 543,322 | u915647268 | python |
p02757 | # from collections import Counter
n, p = map(int, input().split())
s = [int(i) for i in input()]
p_cnt = 0
if p == 2 or p == 5:
for i in range(n):
if s[i] % p == 0:
p_cnt += i+1
else:
s = s[::-1]
div_dic = dict(zip(range(p), [0] * p))
tmp = 0
for i in range(n):
tmp += s... | n, p = map(int, input().split())
s = [int(i) for i in input()]
p_cnt = 0
if p == 2 or p == 5:
for i in range(n):
if s[i] % p == 0:
p_cnt += i+1
else:
s = s[::-1]
div_dic = dict(zip(range(p), [0] * p))
tmp = 0
for i in range(n):
tmp += s[i] * pow(10, i, p)
... | [
"call.remove"
] | 543,340 | 543,341 | u471641802 | python |
p02757 | n, p = map(int, input().split())
s = list(map(int, input()))
ans = 0
if p == 2 or p == 5:
for i, x in enumerate(s):
if (p == 2 and not x % 2) or (p == 5 and (x == 0 or x == 5)):
ans += i+1
print(ans)
exit()
s.reverse()
cum = [0] * (n+1)
for i in range(n):
cum[i+1] = (cum[i] + s[i] ... | n, p = map(int, input().split())
s = list(map(int, input()))
ans = 0
if p == 2 or p == 5:
for i, x in enumerate(s):
if (p == 2 and not x % 2) or (p == 5 and (x == 0 or x == 5)):
ans += i+1
print(ans)
exit()
s.reverse()
cum = [0] * (n+1)
for i in range(n):
cum[i+1] = (cum[i] + s[i] ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 543,375 | 543,376 | u193182854 | python |
p02757 | N,P=map(int,input().split())
S=input()
s=[0 for i in range(N+1)]
a=[0 for i in range(N+1)]
a[0]=(10**0)%P
for i in range(N):
A=a[i]
a[i+1]=(A*(10%P))%P
s[i+1]=(s[i]+A*int(S[N-i-1]))%P
d=[0 for i in range(P)]
for i in range(len(s)):
d[s[i]]+=1
ans=0
if P!=2 and P!=5:
for D in d:
ans+=D*(D-1)/... | N,P=map(int,input().split())
S=input()
s=[0 for i in range(N+1)]
a=[0 for i in range(N+1)]
a[0]=(10**0)%P
for i in range(N):
A=a[i]
a[i+1]=(A*(10%P))%P
s[i+1]=(s[i]+A*int(S[N-i-1]))%P
d=[0 for i in range(P)]
for i in range(len(s)):
d[s[i]]+=1
ans=0
if P!=2 and P!=5:
for D in d:
ans+=D*(D-1)/... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 543,412 | 543,413 | u521602455 | python |
p02757 | n, p = map(int, input().split())
s = list(map(int, list(input())))
if p == 2 or p == 5:
ans = 0
for i in range(n):
if s[i] % p == 0:
ans += i
print(ans)
else:
lis = [0] * p
cnt = 0
kurai = 1
for i in s[::-1]:
cnt += i * kurai % p
cnt %= p
lis[cnt] ... | n, p = map(int, input().split())
s = list(map(int, list(input())))
if p == 2 or p == 5:
ans = 0
for i in range(n):
if s[i] % p == 0:
ans += i + 1
print(ans)
else:
lis = [0] * p
cnt = 0
kurai = 1
for i in s[::-1]:
cnt += i * kurai % p
cnt %= p
lis[c... | [
"expression.operation.binary.add"
] | 543,482 | 543,483 | u923270446 | python |
p02757 | from collections import Counter
n,p=map(int,input().split())
s=input()
ans=0
if p==2 or p==5:
for i,j in enumerate(s):
if int(j)%p==0:
ans +=i+1
else:
num,point=0,1
A=[0]
for i in s[::-1]:
num +=int(i)*point
num %=p
A.append(num)
point *=10
po... | from collections import Counter
n,p=map(int,input().split())
s=input()
ans=0
if p==2 or p==5:
for i,j in enumerate(s):
if int(j)%p==0:
ans +=i+1
else:
num,point=0,1
A=[0]
for i in s[::-1]:
num +=int(i)*point
num %=p
A.append(num)
point *=10
po... | [
"identifier.change",
"expression.operation.binary.change"
] | 543,484 | 543,485 | u905203728 | python |
p02757 | N, P = map(int, input().split())
S = input()
total = 0
if P == 2:
for idx, right_value in enumerate(S, 1):
if int(int(right_value)%2==0):
total += idx
elif P == 5:
valid_options = (0, 5)
for idx, right_value in enumerate(S, 1):
if int(int(right_value) in valid_options):
total += idx
else:
hi... | N, P = map(int, input().split())
S = input()
total = 0
if P == 2:
for idx, right_value in enumerate(S, 1):
if int(int(right_value)%2==0):
total += idx
elif P == 5:
valid_options = (0, 5)
for idx, right_value in enumerate(S, 1):
if int(int(right_value) in valid_options):
total += idx
else:
hi... | [
"expression.operation.binary.remove"
] | 543,507 | 543,508 | u460375306 | python |
p02757 | n,p = map(int,input().split())
s = input()
ans = 0
if p == 2 or p == 5:
for i,c in enumerate(s,1):
if int(c)%2 == 0: ans += i
else:
cnt = [0]*p
cnt[0] = 1
x = 0
d = 1
for c in s[::-1]:
x += d*int(c)
x %= p
cnt[x%p] += 1
d *= 10
d %= p
# print(c... | n,p = map(int,input().split())
s = input()
ans = 0
if p == 2 or p == 5:
for i,c in enumerate(s,1):
if int(c)%p == 0: ans += i
else:
cnt = [0]*p
cnt[0] = 1
x = 0
d = 1
for c in s[::-1]:
x += d*int(c)
x %= p
cnt[x%p] += 1
d *= 10
d %= p
# print(c... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 543,571 | 543,572 | u677121387 | python |
p02757 | n,p = map(int,input().split())
s = input()
ans = 0
if p == 2:
for i,c in enumerate(s,1):
if int(c)%2 == 0: ans += i
else:
cnt = [0]*p
cnt[0] = 1
x = 0
d = 1
for c in s[::-1]:
x += d*int(c)
x %= p
cnt[x%p] += 1
d *= 10
d %= p
# print(cnt)
fo... | n,p = map(int,input().split())
s = input()
ans = 0
if p == 2 or p == 5:
for i,c in enumerate(s,1):
if int(c)%p == 0: ans += i
else:
cnt = [0]*p
cnt[0] = 1
x = 0
d = 1
for c in s[::-1]:
x += d*int(c)
x %= p
cnt[x%p] += 1
d *= 10
d %= p
# print(c... | [
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 543,573 | 543,572 | u677121387 | python |
p02757 | from collections import defaultdict
N, P = map(int,input().split())
S = input()
if P==5:
ans = 0
for i,m in enumerate(S):
if m == '5' or m == '0':
ans += i+1
elif P==2:
ans = 0
for i,m in enumerate(S):
if int(m) % 2 ==0:
ans += i+1
else:
S = S[::-1]
primd... | from collections import defaultdict
N, P = map(int,input().split())
S = input()
if P==5:
ans = 0
for i,m in enumerate(S):
if m == '5' or m == '0':
ans += i+1
elif P==2:
ans = 0
for i,m in enumerate(S):
if int(m) % 2 ==0:
ans += i+1
else:
S = S[::-1]
primd... | [
"call.arguments.change"
] | 543,596 | 543,597 | u595905528 | python |
p02757 | n, mod = map(int, input().split())
s = input()
total = 0
if mod == 2 or mod == 5:
for i, q in enumerate(s):
if int(q)%mod == 0:
total += i+1
else:
counts = [0]*mod
counts[0] = 1
h = 0
d = 1
for t in reversed(s):
m = int(s)*d%mod
h = (h+m)%mod
total += counts[h]
counts[h] += 1
d = (d*10)%mod
pri... | n, mod = map(int, input().split())
S = input()
total = 0
if mod == 2 or mod == 5:
for i, q in enumerate(S):
if int(q)%mod == 0:
total += i+1
else:
counts = [0]*mod
counts[0] = 1
h = 0
d = 1
for s in reversed(S):
m = int(s)*d%mod
h = (h+m)%mod
total += counts[h]
counts[h] += 1
d = (d*10)%mod
pri... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change"
] | 543,603 | 543,604 | u723792785 | python |
p02757 | from collections import Counter
N, P = map(int, input().split())
S = list(map(int, list(input())))
ans = 0
if P in (2, 5):
cnt = 0
for i, s in enumerate(S):
if s % 2 == 0:
ans += i+1
else:
S.reverse()
now = 0
d = [0] * (N+1)
for i in range(N):
now += S[i] * pow(10, i,... | from collections import Counter
N, P = map(int, input().split())
S = list(map(int, list(input())))
ans = 0
if P in (2, 5):
cnt = 0
for i, s in enumerate(S):
if s % P == 0:
ans += i+1
else:
S.reverse()
now = 0
d = [0] * (N+1)
for i in range(N):
now += S[i] * pow(10, i,... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 543,641 | 543,642 | u814781830 | python |
p02757 | N, P = map(int, input().split())
S = input()
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
if int(s) % P == 0:
ans += i + 1
else:
counts = [0] * P
h = 0
d = 1
for s in reversed(S):
m = int(s) * d % P
h = (h + m) % P
counts[h] += 1
d = (d... | N, P = map(int, input().split())
S = input()
ans = 0
if P == 2 or P == 5:
for i, s in enumerate(S):
if int(s) % P == 0:
ans += i + 1
else:
counts = [0] * P
h = 0
d = 1
for s in reversed(S):
m = int(s) * d % P
h = (h + m) % P
counts[h] += 1
d = (d... | [] | 543,658 | 543,659 | u765758367 | python |
p02757 | n, p = map(int, input().split())
s = input()
a = []
c = 0
if p == 2:
b = [0]*n
for i in range(n):
if int(s[i])%2 == 0:
b[i] += 1
for i in range(n):
if b[i] == 1:
c += i+1
elif p == 5:
b = [0]*n
for i in range(n):
if int(s[i])%5 == 0:
b[i] +... | n, p = map(int, input().split())
s = input()
a = []
c = 0
if p == 2:
b = [0]*n
for i in range(n):
if int(s[i])%2 == 0:
b[i] += 1
for i in range(n):
if b[i] == 1:
c += i+1
elif p == 5:
b = [0]*n
for i in range(n):
if int(s[i])%5 == 0:
b[i] +... | [
"call.remove"
] | 543,660 | 543,661 | u785573018 | python |
p02757 | from collections import *
n, p = map(int, input().split())
s = list(map(int, input()))
if p%10==0:
r = 0
for i in range(n):
if s[i]%p==0:
r += i+1
print(r)
exit()
c = Counter()
c[0] += 1
v = r = 0
k = 1
for i in s[::-1]:
v += int(i)*k
v %= p
r += c[v]
c[v] += 1
k ... | from collections import *
n, p = map(int, input().split())
s = list(map(int, input()))
if 10%p==0:
r = 0
for i in range(n):
if s[i]%p==0:
r += i+1
print(r)
exit()
c = Counter()
c[0] += 1
v = r = 0
k = 1
for i in s[::-1]:
v += int(i)*k
v %= p
r += c[v]
c[v] += 1
k ... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 543,680 | 543,681 | u268210555 | python |
p02757 | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
#import queue
from copy import copy, deepcopy
from operator import itemgetter
import bisect#2分探索
#bisect_left(l,x), bisect(l,x)
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを... | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
#import queue
from copy import copy, deepcopy
from operator import itemgetter
import bisect#2分探索
#bisect_left(l,x), bisect(l,x)
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを... | [
"identifier.change",
"expression.operation.binary.change"
] | 543,688 | 543,689 | u424768586 | python |
p02757 | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
#import queue
from copy import copy, deepcopy
from operator import itemgetter
import bisect#2分探索
#bisect_left(l,x), bisect(l,x)
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを... | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
#import queue
from copy import copy, deepcopy
from operator import itemgetter
import bisect#2分探索
#bisect_left(l,x), bisect(l,x)
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを... | [
"expression.operation.binary.add"
] | 543,690 | 543,689 | u424768586 | python |
p02757 | from math import pow
N, P = map(int, input().split())
S = list(map(int, list(input())))
l = len(S)
if P == 2:
ans = 0
for i in range(l):
if S[i]%2 == 0:
ans += i+1
elif P == 5:
ans = 0
for i in range(l):
if S[i]%5 == 0:
ans += i+1
else:
data = [0]*P
temp ... | N, P = map(int, input().split())
S = list(map(int, list(input())))
l = len(S)
if P == 2:
ans = 0
for i in range(l):
if S[i]%2 == 0:
ans += i+1
elif P == 5:
ans = 0
for i in range(l):
if S[i]%5 == 0:
ans += i+1
else:
data = [0]*P
temp = 0
ans = 0
f... | [] | 543,713 | 543,714 | u135346354 | python |
p02757 | N,P=[int(s) for s in input().split()]
S=list(input())
if P!=2 and P!=5:
ls=[0 for _ in range(N)]
mod=[0 for _ in range(P)]
d=10
ls[0]=int(S[-1])
mod[ls[0]]+=1
for i in range(1,N):
ls[i]=(ls[i-1]+d*int(S[-1-i]))%2019
d=(d*10)%2019
mod[ls[i]]+=1
#print(ls)
#print(mod)
ans=mod[0]
for i in... | N,P=[int(s) for s in input().split()]
S=list(input())
if P!=2 and P!=5:
ls=[0 for _ in range(N)]
mod=[0 for _ in range(P)]
d=10
ls[0]=int(S[-1])%P
mod[ls[0]]+=1
for i in range(1,N):
ls[i]=(ls[i-1]+d*int(S[-1-i]))%P
d=(d*10)%P
mod[ls[i]]+=1
#print(ls)
#print(mod)
ans=mod[0]
for i in ran... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 543,800 | 543,801 | u918601425 | python |
p02757 | N,P = map(int,input().split())
S = input()
def solve(S,N,P):
if P == 2:
ans = 0
for i in range(N):
if int(S[i])%P == 0:
ans += i+1
return ans
if P == 5:
ans = 0
for i in range(N):
if int(S[i])%P == 0:
ans += i+1
... | N,P = map(int,input().split())
S = input()
def solve(S,N,P):
if P == 2:
ans = 0
for i in range(N):
if int(S[i])%P == 0:
ans += i+1
return ans
if P == 5:
ans = 0
for i in range(N):
if int(S[i])%P == 0:
ans += i+1
... | [
"call.add",
"call.arguments.change"
] | 543,804 | 543,805 | u698919163 | python |
p02757 | N,P=map(int,input().split())
S=str(input())
ans=0
if 10%P==0:
for i in range(N):
if int(S[i])%P==0:
ans+=i+1
else:
rem = [0]*P
mod = 0
ten = 1
rem[mod]=1
for i in range(N):
mod=(mod+S[N-i-1]*ten)%P
ten=ten*10%P
rem[mod]+=1
for j in rem:
an... | N,P=map(int,input().split())
S=str(input())
ans=0
if 10%P==0:
for i in range(N):
if int(S[i])%P==0:
ans+=i+1
else:
rem = [0]*P
mod = 0
ten = 1
rem[mod]=1
for i in range(N):
mod=(mod+int(S[N-i-1])*ten)%P
ten=ten*10%P
rem[mod]+=1
for j in rem:
... | [
"call.add",
"call.arguments.change"
] | 543,836 | 543,837 | u181644161 | python |
p02757 | def i1():
return int(input())
def i2():
return [int(i) for i in input().split()]
[n,p]=i2()
s=input()
if p==2 or p==5:
x1=0
for i in range(n):
if int(s[i])%p==0:
x1+=i+1
print(x1)
else:
t=0
x2=0
d={0:1}
a=1
for i in range(n)[::-1]:
t+=int(s[i])*a
t%=p
a*=10
a%... | def i1():
return int(input())
def i2():
return [int(i) for i in input().split()]
[n,p]=i2()
s=input()
if p==2 or p==5:
x1=0
for i in range(n):
if int(s[i])%p==0:
x1+=i+1
print(x1)
else:
t=0
x2=0
d={0:1}
a=1
for i in range(n)[::-1]:
t+=int(s[i])*a
t%=p
a*=10
a%... | [
"identifier.replace.add",
"literal.replace.remove"
] | 543,882 | 543,883 | u619631862 | python |
p02757 | N, P = map(int, input().split())
S = list(input())
if P != 2 and P != 5:
count = [0] * P
ans = 0
tmp = 0
for i in range(N - 1, -1, -1):
tmp += int(S[i]) * pow(10 ** (N - 1 - i), P)
tmp %= P
ans += count[tmp]
count[tmp] += 1
ans += count[0]
# print (count)
pr... | N, P = map(int, input().split())
S = list(input())
if P != 2 and P != 5:
count = [0] * P
ans = 0
tmp = 0
for i in range(N - 1, -1, -1):
tmp += int(S[i]) * pow(10, (N - 1 - i), P)
tmp %= P
ans += count[tmp]
count[tmp] += 1
ans += count[0]
# print (count)
prin... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 543,933 | 543,934 | u263830634 | python |
p02757 | n, p = map(int, input().split())
s = list(input())
ans = 0
if p == 2 or p == 5:
for i in range(n):
if int(s[i]) % p == 0:
ans += i + 1
else:
d = [0] * (n + 1)
ten = 1
for i in range(n - 1, -1, -1):
a = int(s[i]) * 10 ** ten % p
ten *= 10
ten %= p
d[i ... | n, p = map(int, input().split())
s = list(input())
ans = 0
if p == 2 or p == 5:
for i in range(n):
if int(s[i]) % p == 0:
ans += i + 1
else:
d = [0] * (n + 1)
ten = 1
for i in range(n - 1, -1, -1):
a = int(s[i]) * ten % p
ten *= 10
ten %= p
d[i - 1] ... | [
"expression.operation.binary.remove"
] | 543,964 | 543,965 | u737298927 | python |
p02756 | # --*-coding:utf-8-*--
S = input()
Q = int(input())
A = []
B = []
revFlag = False;
for _ in range(Q):
q = input().split()
if q[0] == '1':
revFlag = not revFlag
A,B = B,A
else:
if q[1] == '1':
A.append(q[2])
else:
B.append(q[2])
if revFlag:
A... | # --*-coding:utf-8-*--
S = input()
Q = int(input())
A = []
B = []
revFlag = False;
for _ in range(Q):
q = input().split()
if q[0] == '1':
revFlag = not revFlag
A,B = B,A
else:
if q[1] == '1':
A.append(q[2])
else:
B.append(q[2])
if revFlag:
A... | [
"call.remove",
"call.arguments.change"
] | 544,038 | 544,039 | u729417323 | python |
p02756 | from collections import deque
S = input()
Q = int(input())
d = deque()
d.append(S)
reverse = False
for _ in range(Q):
tmp = input().split()
q = int(tmp[0])
if q == 1:
reverse = not reverse
elif q == 2:
f = int(tmp[1])
if f == 1:
if reverse:
d.append(tm... | from collections import deque
S = input()
Q = int(input())
d = deque()
d.append(S)
reverse = False
for _ in range(Q):
tmp = input().split()
q = int(tmp[0])
if q == 1:
reverse = not reverse
elif q == 2:
f = int(tmp[1])
if f == 1:
if reverse:
d.append(tm... | [
"identifier.change"
] | 544,042 | 544,043 | u291766461 | python |
p02756 | s = input()
q = int(input())
add_head = ""
add_tail = ""
rev = False
for _ in range(q):
query = input().split()
if query[0] == "1":
rev = not rev
else:
if query[1] == "1":
if rev:
add_tail = add_tail + query[2]
else:
add_head = add_head... | s = input()
q = int(input())
add_head = ""
add_tail = ""
rev = False
for _ in range(q):
query = input().split()
if query[0] == "1":
rev = not rev
else:
if query[1] == "1":
if rev:
add_tail = add_tail + query[2]
else:
add_head = add_head... | [] | 544,044 | 544,045 | u023540496 | python |
p02756 | # ABC158d
def main():
import sys
sys.setrecursionlimit(10**6)
# 再帰関数を使わない限りPypyで出すこと
def dump(*args):
sys.stderr.write(str(args))
s = input()
q = int(input())
query = [input().split() for _ in range(q)]
mode = 0
from collections import deque
que = deque()
que.app... | # ABC158d
def main():
import sys
sys.setrecursionlimit(10**6)
# 再帰関数を使わない限りPypyで出すこと
def dump(*args):
sys.stderr.write(str(args))
s = input()
q = int(input())
query = [input().split() for _ in range(q)]
mode = 0
from collections import deque
que = deque(list(s))
... | [
"assignment.value.change",
"call.arguments.change"
] | 544,048 | 544,049 | u278356323 | python |
p02756 | S = input()
N = int(input())
pre = ""
suf = ""
f = 1
for i in range(N):
Q = input()
if Q[0] == "1":
f *= -1
elif Q[2] == "1":
if f > 0:
pre = Q[4] + pre
else:
suf = sef + Q[4]
else:
if f < 0:
pre = Q[4] + pre
else:
suf = sef + Q[4]
ans = pre + S + suf
if f > 0:
pr... | S = input()
N = int(input())
pre = ""
suf = ""
f = 1
for i in range(N):
Q = input()
if Q[0] == "1":
f *= -1
elif Q[2] == "1":
if f > 0:
pre = Q[4] + pre
else:
suf = suf + Q[4]
else:
if f < 0:
pre = Q[4] + pre
else:
suf = suf + Q[4]
ans = pre + S + suf
if f > 0:
pr... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 544,060 | 544,061 | u779728630 | python |
p02756 | from collections import deque
s = deque(input().strip())
q = int(input())
reverseFlag = 1
for _ in range(q):
query = input().strip()
if query[0] == "1":
reverseFlag = 1 - reverseFlag
else:
lf = reverseFlag + int(query[2])
if lf % 2 == 0:
s.append(query[4])
else... | from collections import deque
s = deque(input().strip())
q = int(input())
reverseFlag = 0
for _ in range(q):
query = input().strip()
if query[0] == "1":
reverseFlag = 1 - reverseFlag
else:
lf = reverseFlag + int(query[2])
if lf % 2 == 0:
s.append(query[4])
else... | [
"literal.number.integer.change",
"assignment.value.change"
] | 544,062 | 544,063 | u569280127 | python |
p02756 | import sys
input = sys.stdin.readline
s = input().rstrip('\n')
q = int(input())
s1 = []
s2 = []
k = 0
for i in range(q):
r = input().rstrip("\n")
if r == "1":
k = (k + 1) % 2
else:
_, f, c = r.split()
f = int(f) - 1
if (k + f) % 2:
s2.append(c)
else:
... | import sys
input = sys.stdin.readline
s = input().rstrip('\n')
q = int(input())
s1 = []
s2 = []
k = 0
for i in range(q):
r = input().rstrip("\n")
if r == "1":
k = (k + 1) % 2
else:
_, f, c = r.split()
f = int(f) - 1
if (k + f) % 2:
s2.append(c)
else:
... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 544,070 | 544,071 | u711539583 | python |
p02757 | from collections import deque
import numpy as np
n, p = map(int, input().split())
d = deque(input())
ans = 0
if p == 2 or p == 5:
for i in range(n):
k = int(d.popleft())
if n % p == 0:
ans += i + 1
else:
sub = [0 for i in range(n)]
wk = 0
for i in range(n):
k = int(d.pop())
wk = (wk + k... | from collections import deque
import numpy as np
n, p = map(int, input().split())
d = deque(input())
ans = 0
if p == 2 or p == 5:
for i in range(n):
k = int(d.popleft())
if k % p == 0:
ans += i + 1
else:
sub = [0 for i in range(n)]
wk = 0
for i in range(n):
k = int(d.pop())
wk = (wk + k... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 544,083 | 544,084 | u671455949 | python |
p02757 | from collections import deque
import numpy as np
n, p = map(int, input().split())
d = deque(input())
ans = 0
if p == 2 or p == 5:
for i in range(n):
k = int(d.popleft())
if n % p == 0:
ans += i + 1
else:
sub = [0 for i in range(n)]
wk = 0
for i in range(n):
k = int(d.pop())
wk = (wk + k... | from collections import deque
import numpy as np
n, p = map(int, input().split())
d = deque(input())
ans = 0
if p == 2 or p == 5:
for i in range(n):
k = int(d.popleft())
if k % p == 0:
ans += i + 1
else:
sub = [0 for i in range(n)]
wk = 0
for i in range(n):
k = int(d.pop())
wk = (wk + k... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.remove"
] | 544,085 | 544,084 | u671455949 | python |
p02757 | #!python3
iim = lambda: map(int, input().rstrip().split())
def resolve():
N, P = iim()
S = list(map(int, input().rstrip()))
if P == 2 or P == 5:
cnt = 0
for i, si in enumerate(S):
if si % P == 0:
cnt += i + 1
print(cnt)
return
T = [0] * P
... | #!python3
iim = lambda: map(int, input().rstrip().split())
def resolve():
N, P = iim()
S = list(map(int, input().rstrip()))
if P == 2 or P == 5:
cnt = 0
for i, si in enumerate(S):
if si % P == 0:
cnt += i + 1
print(cnt)
return
T = [0] * P
... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 544,128 | 544,129 | u348805958 | python |
p02757 | n, p = map(int, input().split())
s = input()
ans = 0
if p in (2, 5):
for i, j in enumerate(s):
if int(j) % p == 0:
ans += i + 1
else:
cnt = [0] * p
cnt[0] = 1
now = 0
for i, j in enumerate(reversed(s)):
now = (int(s) * pow(10, i, p) + now) % p
ans += cnt[now]
... | n, p = map(int, input().split())
s = input()
ans = 0
if p in (2, 5):
for i, j in enumerate(s):
if int(j) % p == 0:
ans += i + 1
else:
cnt = [0] * p
cnt[0] = 1
now = 0
for i, j in enumerate(reversed(s)):
now = (int(j) * pow(10, i, p) + now) % p
ans += cnt[now]
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 544,134 | 544,135 | u195054737 | python |
p02757 | n, p = map(int, input().split())
s = list(map(int, list(input())))
u = [ 0 for i in range(n+1)]
d = 1
for i in range(n):
u[n-(i+1)] = (u[n-i] + s[n-1-i] * d) % p
d *= 10 * d % p
# print(u, d)
def solve(u, s):
if p == 2 or p == 5:
return solve1(s)
else:
return solve2(u)
def solve1(s... | n, p = map(int, input().split())
s = list(map(int, list(input())))
u = [ 0 for i in range(n+1)]
d = 1
for i in range(n):
u[n-(i+1)] = (u[n-i] + s[n-1-i] * d) % p
d = 10 * d % p
# print(u, d)
def solve(u, s):
if p == 2 or p == 5:
return solve1(s)
else:
return solve2(u)
def solve1(s)... | [
"assignment.value.change"
] | 544,169 | 544,170 | u861141787 | python |
p02757 | import sys
n,p = map(int, input().split())
s = input()
if p == 2 or p == 5:
ans = 0
for i in range(len(s)):
if int(s) % p == 0:
ans += i + 1
print(ans)
sys.exit(0)
last_mod = 0
keta_mod = 1
mod_array = [0] * p
mod_array[0] = 1
for i in reversed(range(len(s))):
tmp = int(s[i]) * keta_mo... | import sys
n,p = map(int, input().split())
s = input()
if p == 2 or p == 5:
ans = 0
for i in range(len(s)):
if int(s[i]) % p == 0:
ans += i + 1
print(ans)
sys.exit(0)
last_mod = 0
keta_mod = 1
mod_array = [0] * p
mod_array[0] = 1
for i in reversed(range(len(s))):
tmp = int(s[i]) * keta... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 544,207 | 544,208 | u952491523 | python |
p02757 | n,p = map(int, input().split())
s = list(map(int, list(ns())))
if p in (2, 5):
print(sum(i+1 for i in range(n) if s[i]%p == 0))
exit(0)
ans = g = 0
d = [0]*p
d[0] = 1
t = 1
for i in range(n-1,-1,-1):
g = (g + s[i]*t)%p
ans += d[g]
d[g] += 1
t = (t*10)%p
print(ans) | n,p = map(int, input().split())
s = list(map(int, list(input())))
if p in (2, 5):
print(sum(i+1 for i in range(n) if s[i]%p == 0))
exit(0)
ans = g = 0
d = [0]*p
d[0] = 1
t = 1
for i in range(n-1,-1,-1):
g = (g + s[i]*t)%p
ans += d[g]
d[g] += 1
t = (t*10)%p
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 544,222 | 544,223 | u543954314 | python |
p02757 | N, P = map(int, input().split())
S = input()
res = 0
if P == 2 or P == 5:
for i in range(N):
if int(S[i]) % P == 0:
res += i + 1
else:
mp = [0]*len(S)
mp[0] = 1
cur = 0
p10 = 1
for c in S[::-1]:
cur = (cur + int(c)*p10) % P
res += mp[cur]
mp[cur] += 1... | N, P = map(int, input().split())
S = input()
res = 0
if P == 2 or P == 5:
for i in range(N):
if int(S[i]) % P == 0:
res += i + 1
else:
mp = [0]*P
mp[0] = 1
cur = 0
p10 = 1
for c in S[::-1]:
cur = (cur + int(c)*p10) % P
res += mp[cur]
mp[cur] += 1
... | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 544,234 | 544,235 | u637170240 | python |
p02757 | p = int(input().split()[1])
s = input()
if 10 % p == 0:
r = sum(i for i, x in enumerate(s, 1) if int(x) % p == 0)
else:
d = [1] + [0] * (p - 1)
t = 0
for x in reversed(s):
t = (t + int(x) * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) for i in d) // 2
print(r) | p = int(input().split()[1])
s = input()
if 10 % p == 0:
r = sum(i for i, x in enumerate(s, 1) if int(x) % p == 0)
else:
d = [1] + [0] * (p - 1)
t, y = 0, 1
for x in reversed(s):
t = (t + int(x) * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) for i in d) // 2
print(r) | [] | 544,243 | 544,244 | u021019433 | python |
p02757 | p = int(input().split()[1])
s = input()
if 10 % p == 0:
r = sum(i for i, x in enumerate(s, 1) if int(x) % p == 0)
else:
d = [1] + [0] * (p - 1)
s, y = 0, 1
for x in reversed(s):
t = (t + int(x) * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)
print(r) | p = int(input().split()[1])
s = input()
if 10 % p == 0:
r = sum(i for i, x in enumerate(s, 1) if int(x) % p == 0)
else:
d = [1] + [0] * (p - 1)
t, y = 0, 1
for x in reversed(s):
t = (t + int(x) * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)
print(r) | [
"assignment.variable.change",
"identifier.change"
] | 544,246 | 544,247 | u021019433 | python |
p02757 | p = int(input().split()[1])
s = input()
if 10 % p == 0:
r = sum(i for i, x in enumerate(s, 1) if int(x) % p == 0)
else:
d = [1] + [0] * (p - 1)
s, y = 0, 1
for x in reversed(s):
s = (s + int(x) * y) % p
d[s] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)
print(r) | p = int(input().split()[1])
s = input()
if 10 % p == 0:
r = sum(i for i, x in enumerate(s, 1) if int(x) % p == 0)
else:
d = [1] + [0] * (p - 1)
t, y = 0, 1
for x in reversed(s):
t = (t + int(x) * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)
print(r) | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 544,248 | 544,247 | u021019433 | python |
p02757 | p = int(input().split()[1])
s = input()
if 10 % p:
s = reversed(s)
a = enumerate(s, 1)
if 10 % p == 0:
r = sum(i for i, x in a if x % p == 0)
else:
d = [1] + [0] * (p - 1)
t, y = 0, 1
for i, x in a:
t = (t + x * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)
print(r)
| p = int(input().split()[1])
s = input()
if 10 % p:
s = reversed(s)
a = enumerate(map(int, s), 1)
if 10 % p == 0:
r = sum(i for i, x in a if x % p == 0)
else:
d = [1] + [0] * (p - 1)
t, y = 0, 1
for i, x in a:
t = (t + x * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)
prin... | [
"call.add",
"call.arguments.change"
] | 544,251 | 544,252 | u021019433 | python |
p02757 | I = lambda s:map(int, s)
p = int(input().split()[1])
s = input()
if 10 % p == 0:
r = sum(i for i, x in enumerate(I(s), 1) if x % p == 0)
else:
d = [1] + [0] * 9
t, y = 0, 1
for i, x in enumerate(I(reversed(s)), 1):
t = (t + x * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i in d)... | I = lambda s:map(int, s)
p = int(input().split()[1])
s = input()
if 10 % p == 0:
r = sum(i for i, x in enumerate(I(s), 1) if x % p == 0)
else:
d = [1] + [0] * (p - 1)
t, y = 0, 1
for i, x in enumerate(I(reversed(s)), 1):
t = (t + x * y) % p
d[t] += 1
y = y * 10 % p;
r = sum(i * (i - 1) // 2 for i... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 544,256 | 544,257 | u021019433 | python |
p02757 | n, P = map(int, input().split())
S = input()
ans = 0
#----------------------------------------------
# 1.
# int(S[a:b]) * 10 ** (n - b) == (int(S[a: n]) - int(S[b: n])) で表される
# 例
# S = 1234
# a = 1, b = 3 のとき
# 23 = (234 - 4) // 10 ** (4 - 3)
# = 230 // 10
# = 23
#
# 2.
# Pは素数のため P = 2, 5 のとき以外は １０の約数でない
# A * ... | n, P = map(int, input().split())
S = input()
ans = 0
#----------------------------------------------
# 1.
# int(S[a:b]) * 10 ** (n - b) == (int(S[a: n]) - int(S[b: n])) で表される
# 例
# S = 1234
# a = 1, b = 3 のとき
# 23 = (234 - 4) // 10 ** (4 - 3)
# = 230 // 10
# = 23
#
# 2.
# Pは素数のため P = 2, 5 のとき以外は １０の約数でない
# A * ... | [
"call.remove"
] | 544,273 | 544,274 | u023958502 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.