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 |
|---|---|---|---|---|---|---|---|
p02850 | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
... | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
... | [
"call.remove"
] | 655,994 | 655,995 | u024782094 | python |
p02850 | from collections import deque
n=int(input())
g=[[] for i in range(n)]
b=[0]*(n-1)
for i in range(n-1):
ai,bi=map(int,input().split())
g[ai-1].append(bi-1)
g[bi-1].append(ai-1)
b[i]=bi-1
#n=8
#g=[[1], [0, 2, 3, 4], [1], [1, 6], [1, 5], [4, 7], [3], [5]]
#n=6
#g=[[1, 2, 3, 4, 5], [0], [0], [0], [0],... | from collections import deque
n=int(input())
g=[[] for i in range(n)]
b=[0]*(n-1)
for i in range(n-1):
ai,bi=map(int,input().split())
g[ai-1].append(bi-1)
g[bi-1].append(ai-1)
b[i]=bi-1
#n=8
#g=[[1], [0, 2, 3, 4], [1], [1, 6], [1, 5], [4, 7], [3], [5]]
#b=[1, 2, 3, 4, 6, 5, 7]
#n=6
#g=[[1, 2, 3, 4... | [
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 655,996 | 655,997 | u576432509 | python |
p02850 | from collections import deque
N = int(input())
edges=[[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
edges[a].append((b, i))
edges[b].append((a, i))
next_set = deque([(0,0)])
colors = [0]*(N-1)
while next_set:
p, i = next_set.popleft()
cnt = 1 if col... | from collections import deque
N = int(input())
edges=[[] for _ in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
edges[a].append((b, i))
edges[b].append((a, i))
next_set = deque([(0,0)])
colors = [0]*(N-1)
while next_set:
p, i = next_set.popleft()
cnt = 1 if col... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 656,004 | 656,005 | u367701763 | python |
p02850 | def resolve():
N = int(input())
g = {}
for i in range(N-1):
a, b = list(map(int, input().split()))
g.setdefault(a-1, [])
g[a-1].append((b-1, i))
g.setdefault(b-1, [])
g[b-1].append((a-1, i))
nodes = [(None, 0)]
colors = [None for _ in range(N-1)]
... | def resolve():
N = int(input())
g = {}
for i in range(N-1):
a, b = list(map(int, input().split()))
g.setdefault(a-1, [])
g[a-1].append((b-1, i))
g.setdefault(b-1, [])
g[b-1].append((a-1, i))
nodes = [(None, 0)]
colors = [None for _ in range(N-1)]
... | [
"identifier.change",
"expression.operation.binary.change"
] | 656,010 | 656,011 | u106797249 | python |
p02850 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | [
"call.remove"
] | 656,018 | 656,019 | u285891772 | python |
p02850 |
import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def acinput():
return list(map(int, input().split(" ")))
def II():
return int(input())
directions=np.array([[1,0],[0,1],[-1,0],[0,-1]])
directions = list(map(np.array, directions))
mod = 10**9... |
import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def acinput():
return list(map(int, input().split(" ")))
def II():
return int(input())
directions=np.array([[1,0],[0,1],[-1,0],[0,-1]])
directions = list(map(np.array, directions))
mod = 10**9... | [
"call.add",
"call.arguments.change",
"io.output.change"
] | 656,034 | 656,035 | u346308892 | python |
p02850 | import sys
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
n = int(input())
edge = [[] for _ in range(n+1)]
for i in range(n-1):
a, b = map(int,input().split())
edge[a].append((b, i))
edge[b].append((a, i))
colors = 0
for i, line in enumerate(edge):
colors = max(... | import sys
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
n = int(input())
edge = [[] for _ in range(n+1)]
for i in range(n-1):
a, b = map(int,input().split())
edge[a].append((b, i))
edge[b].append((a, i))
colors = 0
for i, line in enumerate(edge):
colors = max(... | [
"call.add"
] | 656,041 | 656,042 | u599114793 | python |
p02850 | import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = map(int, input().split())
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
Ans = [-1] * (N-1)
def dfs(v=1, p=0, p_col=-1):
col = 1
for u, idx in E[v]:
... | import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = map(int, input().split())
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
Ans = [-1] * (N-1)
def dfs(v=1, p=0, p_col=-1):
col = 1
for u, idx in E[v]:
... | [
"call.remove"
] | 656,051 | 656,052 | u029000441 | python |
p02850 | import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = map(int, input().split())
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
Ans = [-1] * (N-1)
def dfs(v=1, p=0, p_col=-1):
col = 1
for u, idx in E[v]:
... | import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a, b = map(int, input().split())
E[a].append((b, i))
E[b].append((a, i))
K = max(len(e) for e in E)
print(K)
Ans = [-1] * (N-1)
def dfs(v=1, p=0, p_col=-1):
col = 1
for u, idx in E[v]:
... | [
"call.remove"
] | 656,051 | 656,053 | u029000441 | python |
p02850 | import sys
sys.setrecursionlimit(10**9)
N = int(input())
edge = [[] for i in range(N)]
count = [0] * N
color = {}
egs = []
for i in range(N-1):
a, b = map(int, input().split())
a -= 1
b -= 1
count[a] += 1
count[b] += 1
edge[a].append(b)
edge[b].append(a)
egs.append(tuple(sorted([a, b]))... | import sys
sys.setrecursionlimit(10**9)
N = int(input())
edge = [[] for i in range(N)]
count = [0] * N
color = {}
egs = []
for i in range(N-1):
a, b = map(int, input().split())
a -= 1
b -= 1
count[a] += 1
count[b] += 1
edge[a].append(b)
edge[b].append(a)
egs.append(tuple(sorted([a, b])... | [
"control_flow.branch.if.condition.change",
"control_flow.continue.add"
] | 656,060 | 656,059 | u707498674 | python |
p02850 | import sys
sys.setrecursionlimit(10**9)
N = int(input())
edge = [[] for i in range(N)]
count = [0] * N
color = {}
egs = []
for i in range(N-1):
a, b = map(int, input().split())
a -= 1
b -= 1
count[a] += 1
count[b] += 1
edge[a].append(b)
edge[b].append(a)
egs.append(tuple(sorted([a, b]))... | import sys
sys.setrecursionlimit(10**9)
N = int(input())
edge = [[] for i in range(N)]
count = [0] * N
color = {}
egs = []
for i in range(N-1):
a, b = map(int, input().split())
a -= 1
b -= 1
count[a] += 1
count[b] += 1
edge[a].append(b)
edge[b].append(a)
egs.append(tuple(sorted([a, b]))... | [
"control_flow.branch.if.condition.change",
"control_flow.continue.add"
] | 656,060 | 656,061 | u707498674 | python |
p02850 | n=int(input())
g=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
g[a-1].append((b-1,i))
vc=[0] * n
ec=[-1]*(n-1)
for p,ci in enumerate(g):
color = 1
for c, i in ci:
if vc[p] == c:
color += 1
vc[c] = color
ec[i] = color
color += 1
... | n=int(input())
g=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
g[a-1].append((b-1,i))
vc=[0] * n
ec=[-1]*(n-1)
for p,ci in enumerate(g):
color = 1
for c, i in ci:
if vc[p] == color:
color += 1
vc[c] = color
ec[i] = color
color += 1
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,070 | 656,071 | u242196904 | python |
p02850 | from collections import deque
N = int(input())
# グラフ準備
graph = [[] for _ in range(N + 1)]
seq = []
for _ in range(N - 1):
a, b = map(int, input().split())
graph[a].append(b)
seq.append(b)
# BFS
q = deque([1])
color = [0] * (N + 1)
while q:
checking_parent = q.popleft()
parent_color = color[chec... | # 参考：https://atcoder.jp/contests/abc146/submissions/10412733
from collections import deque
N = int(input())
# グラフ準備
graph = [[] for _ in range(N + 1)]
seq = []
for _ in range(N - 1):
a, b = map(int, input().split())
graph[a].append(b)
seq.append(b)
# BFS
q = deque([1])
color = [0] * (N + 1)
while q:
... | [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 656,094 | 656,095 | u134302690 | python |
p02850 | from collections import deque, defaultdict
N = int(input())
ab = [[int(i) for i in input().split()] for _ in range(N-1)]
#print(ab)
outs = defaultdict(list)
ins = defaultdict(int)
for v1, v2 in ab:
outs[v1].append(v2)
ins[v2] += 1
q = deque(v1 for v1 in range(1,N+1) if ins[v1] == 0)
hoji = []
dicthoji = {1:... | from collections import deque, defaultdict
N = int(input())
ab = [[int(i) for i in input().split()] for _ in range(N-1)]
#print(ab)
outs = defaultdict(list)
ins = defaultdict(int)
for v1, v2 in ab:
outs[v1].append(v2)
ins[v2] += 1
q = deque(v1 for v1 in range(1,N+1) if ins[v1] == 0)
hoji = []
dicthoji = {1:... | [
"call.remove"
] | 656,096 | 656,097 | u697559326 | python |
p02850 | import collections
from collections import deque
def tree(s):
INF=-10**9
dis = [INF for i in range(n)]
ans = [INF for i in range(n)]
dis[s]=0
def bfs():
d = deque()
d.append(s)
while len(d):
x = d.popleft()
cnt=1
for i in range(len(b[x])... | import collections
from collections import deque
def tree(s):
INF=-10**9
dis = [INF for i in range(n)]
ans = [INF for i in range(n)]
dis[s]=0
def bfs():
d = deque()
d.append(s)
while len(d):
x = d.popleft()
cnt=1
for i in range(len(b[x])... | [
"call.arguments.change"
] | 656,098 | 656,099 | u970899068 | python |
p02850 | from collections import deque
n=int(input())
E=[[]for _ in range(n)]
L=[]
for i in range(n-1):
a,b=map(int,input().split())
E[a-1].append(b-1)
L.append(b-1)
que=deque([0])
ans=[0]*n
while que:
s=que.pop()
color=1
for ni in E[s]:
if color==ans[s]:
color+=1
else:
ans[ni]=... | from collections import deque
n=int(input())
E=[[]for _ in range(n)]
L=[]
for i in range(n-1):
a,b=map(int,input().split())
E[a-1].append(b-1)
L.append(b-1)
que=deque([0])
ans=[0]*n
while que:
s=que.pop()
color=1
for ni in E[s]:
if color==ans[s]:
color+=1
ans[ni]=color
col... | [
"call.arguments.change",
"io.output.change"
] | 656,108 | 656,109 | u573754721 | python |
p02850 | import sys
input = sys.stdin.buffer.readline
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N + 1)]
for a, b in AB:
graph[a].append(b)
graph[b].append(a)
def make_tree(graph, root) -> (list, list, list):
INF = 10 ** 15
dist = [INF] * len(gra... | import sys
input = sys.stdin.buffer.readline
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N + 1)]
for a, b in AB:
graph[a].append(b)
graph[b].append(a)
def make_tree(graph, root) -> (list, list, list):
INF = 10 ** 15
dist = [INF] * len(gra... | [
"call.remove"
] | 656,121 | 656,122 | u296518383 | python |
p02850 | import sys
from collections import deque
def solve():
input = sys.stdin.readline
N = int(input())
edge = [[] for _ in range(N)]
order = dict()
for i in range(N-1):
a, b = map(int, input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
order[(min(a-1, b-1), max(... | import sys
from collections import deque
def solve():
input = sys.stdin.readline
N = int(input())
edge = [[] for _ in range(N)]
order = dict()
for i in range(N-1):
a, b = map(int, input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
order[(min(a-1, b-1), max(... | [
"assignment.remove"
] | 656,179 | 656,180 | u608088992 | python |
p02850 | import sys
from collections import deque
inputs = sys.stdin.readlines()
n = int(inputs[0])
edges = [tuple(map(int, x.split())) for x in inputs[1:]]
B = [e[1] for e in edges]
E = [[] for _ in range(N + 1)]
for a, b in edges:
E[a].append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.popleft()
c = 0
... | import sys
from collections import deque
inputs = sys.stdin.readlines()
n = int(inputs[0])
edges = [tuple(map(int, x.split())) for x in inputs[1:]]
B = [e[1] for e in edges]
E = [[] for _ in range(n + 1)]
for a, b in edges:
E[a].append(b)
Q = deque([1])
C = [0] * (n + 1)
while Q:
v = Q.popleft()
c = 0
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 656,188 | 656,189 | u417365712 | python |
p02850 | from collections import deque
n = int(input())
k = 0
data = [[] for _ in range(n)]
ans_index = []
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
data[a].append(b)
ans_index.append(b)
q = deque([0])
color = [0] * n
print(data)
while q:
cur = q.popleft()
c = 1
for ... | from collections import deque
n = int(input())
k = 0
data = [[] for _ in range(n)]
ans_index = []
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
data[a].append(b)
ans_index.append(b)
q = deque([0])
color = [0] * n
while q:
cur = q.popleft()
c = 1
for x in data[cu... | [
"call.remove"
] | 656,194 | 656,195 | u502731482 | python |
p02850 | from collections import deque
n=int(input())
arr=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
arr[a-1].append([b-1,i])
arr[b-1].append([a-1,i])
print(arr)
que=deque([0])
ans=[0]*(n-1)
par=[0]*n
par[0]=-1
while que:
x=que.popleft()
p=par[x]
color=1
for tup in arr[... | from collections import deque
n=int(input())
arr=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
arr[a-1].append([b-1,i])
arr[b-1].append([a-1,i])
que=deque([0])
ans=[0]*(n-1)
par=[0]*n
par[0]=-1
while que:
x=que.popleft()
p=par[x]
color=1
for tup in arr[x]:
... | [
"call.remove"
] | 656,225 | 656,226 | u669173971 | python |
p02850 | n=int(input())
import sys
sys.setrecursionlimit(10 ** 7)
graph = [[] for _ in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
graph[a - 1].append((b - 1, i))
graph[b - 1].append((a - 1, i))
# print(graph)
max_color=0
for graph_i in graph:
max_color=max(max_color, len(graph_i))
print... | n=int(input())
import sys
sys.setrecursionlimit(10 ** 7)
graph = [[] for _ in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
graph[a - 1].append((b - 1, i))
graph[b - 1].append((a - 1, i))
# print(graph)
max_color=0
for graph_i in graph:
max_color=max(max_color, len(graph_i))
print... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 656,238 | 656,239 | u405660020 | python |
p02850 | from collections import deque
n = int(input())
graph = [[] for _ in range(n)]
edges = {}
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
graph[a].append(b)
# graph[b].append(a)
edges[(a, b)] = i
# edges[(b, a)] = i
que = deque([0])
ans = [0] * (n - 1)
visited = [0] * ... | from collections import deque
n = int(input())
graph = [[] for _ in range(n)]
edges = {}
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
graph[a].append(b)
# graph[b].append(a)
edges[(a, b)] = i
# edges[(b, a)] = i
que = deque([0])
ans = [0] * (n - 1)
visited = [-1] *... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 656,240 | 656,241 | u940139461 | python |
p02850 | from collections import deque
from heapq import heappush, heappop
n = int(input()) # 入力が1つ
# map(int, input().split()) # 入力が複数
# [int(i) for i in input().split()] # 配列で数字
graph = [[] for _ in range(n)]
edge = {}
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
graph[a].append(b)
... | from collections import deque
from heapq import heappush, heappop
n = int(input()) # 入力が1つ
# map(int, input().split()) # 入力が複数
# [int(i) for i in input().split()] # 配列で数字
graph = [[] for _ in range(n)]
edge = {}
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
graph[a].append(b)
... | [
"call.add"
] | 656,242 | 656,243 | u940139461 | python |
p02850 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
ab = [list(map(int, readline().split())) for i in range(n - 1)]
gragh = [[] for j in range(n + 1)]
for a, b in ab:
gragh[a].append(b)
gragh[b].append(a)
root = 1
parent = [0] ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
ab = [list(map(int, readline().split())) for i in range(n - 1)]
gragh = [[] for j in range(n + 1)]
for a, b in ab:
gragh[a].append(b)
gragh[b].append(a)
root = 1
parent = [0] ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 656,266 | 656,267 | u691018832 | python |
p02850 | N = int(input())
data = [0]*(N-1)
cho = [0]*(N+1) #cho[i]にi番目の頂点の根元の色
res = [0]*(N-1) #枝の色
for i in range(0,N-1):
di = list(map(int, input().split()))
di.append(i)
data[i] = di
data = sorted(data)
print(data)
for i in range(0,N-1):
if i != 0 and data[i][0] == data[i-1][0]:
cur += 1
else:
... | N = int(input())
data = [0]*(N-1)
cho = [0]*(N+1) #cho[i]にi番目の頂点の根元の色
res = [0]*(N-1) #枝の色
for i in range(0,N-1):
di = list(map(int, input().split()))
di.append(i)
data[i] = di
data = sorted(data)
for i in range(0,N-1):
if i != 0 and data[i][0] == data[i-1][0]:
cur += 1
else:
cur = ... | [
"call.remove"
] | 656,285 | 656,286 | u698460655 | python |
p02850 | import sys
from collections import deque
# txt = "100000"
# for i in range(99999):
# txt += "\n" + str(i) +" " + str(i+1)
# def i():
# for l in txt.split("\n"):
# yield l
# input = i().__next__
def main():
N = int(input())
mawari = [[] for _ in range(N)]
e_num = [0] * N
for l in range... | import sys
from collections import deque
# txt = "100000"
# for i in range(99999):
# txt += "\n" + str(i) +" " + str(i+1)
# def i():
# for l in txt.split("\n"):
# yield l
# input = i().__next__
def main():
N = int(input())
mawari = [[] for _ in range(N)]
e_num = [0] * N
for l in range... | [] | 656,299 | 656,300 | u974620347 | python |
p02850 | import sys
sys.setrecursionlimit(100005)
N=int(input())
edges = [0 for i in range(N)]
edge_l = [[] for i in range(N)]
cols = [0 for i in range(N)]
out = 0
seen = [False for i in range(N)]
seen2 = [False for i in range(N)]
def paint(cur, parC):
if seen[cur]:
return
curC = 1
seen[cur] = True
for e in edge_l... | import sys
sys.setrecursionlimit(200000)
N=int(input())
edges = [0 for i in range(N)]
edge_l = [[] for i in range(N)]
cols = [0 for i in range(N)]
out = 0
seen = [False for i in range(N)]
seen2 = [False for i in range(N)]
def paint(cur, parC):
if seen[cur]:
return
curC = 1
seen[cur] = True
for e in edge_l... | [
"literal.number.integer.change",
"call.arguments.change"
] | 656,301 | 656,302 | u375076148 | python |
p02850 | import sys
input = sys.stdin.readline
n = int(input())
edges = [[] for _ in range(n)]
for i in range(n-1):
a,b = map(int,input().split())
edges[a-1].append((b-1,i))
edges[b-1].append((a-1,i))
print(edges)
ans = [-1] * (n-1)
q = [0]
visit = [False] * n
visit[0] = True
while q:
l = q.pop(-1)
li ... | import sys
input = sys.stdin.readline
n = int(input())
edges = [[] for _ in range(n)]
for i in range(n-1):
a,b = map(int,input().split())
edges[a-1].append((b-1,i))
edges[b-1].append((a-1,i))
ans = [-1] * (n-1)
q = [0]
visit = [False] * n
visit[0] = True
while q:
l = q.pop(-1)
li = []
for i... | [
"call.remove"
] | 656,311 | 656,312 | u623231048 | python |
p02850 | from collections import deque
N = int(input())
visited = [False]*N
tree = [[] for _ in range(N)]
tmp = []
for _ in range(N-1):
a, b = map(lambda x: int(x)-1, input().split())
tree[a].append(b)
tree[b].append(a)
tmp.append((a, b)) # 順番を保持するため
ans = {} # 連想配列で保持する
q = deque([0]) # 開始のノード
colors = [-1... | from collections import deque
N = int(input())
visited = [False]*N
tree = [[] for _ in range(N)]
tmp = []
for _ in range(N-1):
a, b = map(lambda x: int(x)-1, input().split())
tree[a].append(b)
tree[b].append(a)
tmp.append((a, b)) # 順番を保持するため
ans = {} # 連想配列で保持する
q = deque([0]) # 開始のノード
colors = [-1... | [
"assignment.add"
] | 656,342 | 656,343 | u708255304 | python |
p02850 | import sys
read = sys.stdin.read
n, *ab = map(int, read().split())
ans = [0]*(n-1)
edges = [[]for _ in range(n)]
used = [0]*n
for i, a, b in zip(range(n-1), *[iter(ab)] * 2):
edges[a].append([b, i])
for node in range(n):
unable = used[node]
color = 1
for to, id in edges[node]:
if color == u... | import sys
read = sys.stdin.read
n, *ab = map(int, read().split())
ans = [0]*(n-1)
edges = [[]for _ in range(n)]
used = [0]*n
for i, a, b in zip(range(n-1), *[iter(ab)] * 2):
edges[a-1].append([b-1, i])
for node in range(n):
unable = used[node]
color = 1
for to, id in edges[node]:
if color ... | [
"expression.operation.binary.add"
] | 656,362 | 656,363 | u380524497 | python |
p02850 | from collections import deque
n = int(input())
t = [list() for _ in range(n)]
color = [0] * (n-1)
for i in range(n-1):
a, b = map(int, input().split())
a -= 1
b -= 1
t[a].append((b, i))
q = deque([(0, 0)])
while q:
print(q)
v, pc = q.popleft()
nc = 0
for nv, edge in t[v]:
nc +=... | from collections import deque
n = int(input())
t = [list() for _ in range(n)]
color = [0] * (n-1)
for i in range(n-1):
a, b = map(int, input().split())
a -= 1
b -= 1
t[a].append((b, i))
q = deque([(0, 0)])
while q:
v, pc = q.popleft()
nc = 0
for nv, edge in t[v]:
nc += 1
if... | [
"call.remove"
] | 656,364 | 656,365 | u921518222 | python |
p02850 | # coding: utf-8
# Here your code !
import sys
sys.setrecursionlimit(10**6)
N = int(input())
v = [[] for i in range(N)]
for i in range(N-1):
a,b = map(int,input().split())
a,b = a-1,b-1
v[a].append([b,i])
print(v)
ans = [None] * (N-1)
def decide_colord(cur,color):
cnt = 1
for (to,j)in v[cur]... | # coding: utf-8
# Here your code !
import sys
sys.setrecursionlimit(10**6)
N = int(input())
v = [[] for i in range(N)]
for i in range(N-1):
a,b = map(int,input().split())
a,b = a-1,b-1
v[a].append([b,i])
ans = [None] * (N-1)
def decide_colord(cur,color):
cnt = 1
for (to,j)in v[cur]:
if ... | [
"call.remove"
] | 656,378 | 656,379 | u095562538 | python |
p02850 | import queue
n = int(input())
G = [[] for i in range(n)]
vp = [() for i in range(n - 1)]
for i in range(n - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
vp[i] = (a, b)
que = queue.Queue()
que.put(0)
used = [0] * n
used[0] = 1
K = 0
cs ... | import queue
n = int(input())
G = [[] for i in range(n)]
vp = [() for i in range(n - 1)]
for i in range(n - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
vp[i] = (a, b)
que = queue.Queue()
que.put(0)
used = [0] * n
used[0] = 1
K = 0
cs ... | [
"call.remove"
] | 656,382 | 656,383 | u760802228 | python |
p02850 | from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
ab = [list(map(lambda x:int(x)-1, input().split())) for _ in range(n-1)]
e = [[] for _ in range(n)]
p = [0] * n
c = [0] * n
d = [0] * n
for a, b in ab:
e[a].append(b)
e[b].append(a)
me = 0
q = [0]
p[0] = -1
while q:
x = q.p... | from sys import setrecursionlimit
setrecursionlimit(10 ** 6)
n = int(input())
ab = [list(map(lambda x:int(x)-1, input().split())) for _ in range(n-1)]
e = [[] for _ in range(n)]
p = [0] * n
c = [0] * n
d = [0] * n
for a, b in ab:
e[a].append(b)
e[b].append(a)
me = 0
q = [0]
p[0] = -1
while q:
x = q.p... | [
"literal.number.integer.change",
"assignment.value.change"
] | 656,399 | 656,400 | u824237520 | python |
p02850 | # -*- coding: utf-8 -*-
from collections import deque
n = int(input())
edges = [list(map(int, input().split())) for i in range(n-1)]
tree = {}
node_in = [0 for i in range(n)] # 頂点に入る辺は1つ
node_out = [[0] for i in range(n)] # 頂点から出る辺は1つ以上
for edge in sorted(edges):
a = edge[0] # 頂点a
b = edge[1] # 頂点b
colo... | # -*- coding: utf-8 -*-
from collections import deque
n = int(input())
edges = [list(map(int, input().split())) for i in range(n-1)]
tree = {}
node_in = [0 for i in range(n)] # 頂点に入る辺は1つ
node_out = [[0] for i in range(n)] # 頂点から出る辺は1つ以上
for edge in sorted(edges):
a = edge[0] # 頂点a
b = edge[1] # 頂点b
colo... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 656,422 | 656,423 | u461592867 | python |
p02850 | n = int(input())
vs = [[] for i in range(n)]
out = [0]*n
for i in range(n-1):
a, b = [int(i) for i in input().split()]
vs[a].append([b,i+1])
vs[b].append([a,i+1])
nex = [[0,-1]]
def coloring(index,defColor):
i=0
for v in vs[index]:
if i==defColor:
i+=1
out[v[1]]=i
... | n = int(input())
vs = [[] for i in range(n)]
out = [0]*n
for i in range(n-1):
a, b = [int(i)-1 for i in input().split()]
vs[a].append([b,i+1])
vs[b].append([a,i+1])
nex = [[0,-1]]
def coloring(index,defColor):
i=0
for v in vs[index]:
if i==defColor:
i+=1
out[v[1]]=i
... | [
"assignment.change"
] | 656,424 | 656,425 | u211706121 | python |
p02850 | import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==org:
cnt += 1
ans[org] = cnt
... | import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [0]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt += 1
ans[org] = cnt
... | [
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,432 | 656,433 | u256031597 | python |
p02850 | import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[]*N for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [0]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==org:
cnt += 1
ans[org] = cnt
... | import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [0]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt += 1
ans[org] = cnt
... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,434 | 656,433 | u256031597 | python |
p02850 | import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==org:
cnt += 1
ans[org] = cnt
... | import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt += 1
ans[org] = cnt
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,432 | 656,435 | u256031597 | python |
p02850 | import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[]*N for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [0]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==org:
cnt += 1
ans[org] = cnt
... | import sys
sys.setrecursionlimit(10**9)
N= int(input())
G = [[] for i in range(N)]
for i in range(N-1):
a, b = map(int, input().split())
G[a-1].append([b-1, i])
ans = [None]*(N-1)
def func(prt, col):
cnt = 1
for cld, org in G[prt]:
if cnt==col:
cnt += 1
ans[org] = cnt
... | [
"expression.operation.binary.remove",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 656,434 | 656,435 | u256031597 | python |
p02850 | import sys
from collections import deque
read = sys.stdin.read
def main():
N, *ab = map(int, read().split())
E = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(ab)] * 2):
E[a].append(b)
edge_order.append(b)
# 頂点1から幅優先探索
queue = deque([1])
color = [0] * (N+1)
wh... | import sys
from collections import deque
read = sys.stdin.read
def main():
N, *ab = map(int, read().split())
E = [[] for _ in range(N + 1)]
edge_order = []
for a, b in zip(*[iter(ab)] * 2):
E[a].append(b)
edge_order.append(b)
# 頂点1から幅優先探索
queue = deque([1])
color =... | [
"assignment.add"
] | 656,436 | 656,437 | u638456847 | python |
p02850 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
n = int(input())
child_list = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int, input().split())
a,b = a-1,b-1
child_list[a].append([b,i])
ans = [None]*(n-1)
def rec(node, parent_color_id):
default_color_id = 1
color_id... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
n = int(input())
child_list = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int, input().split())
a,b = a-1,b-1
child_list[a].append([b,i])
ans = [None]*(n-1)
def rec(node, parent_color_id):
default_color_id = 1
color_id... | [
"identifier.replace.remove",
"literal.replace.add"
] | 656,442 | 656,443 | u258391277 | python |
p02850 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
m = map(int,read().split())
AB = list(zip(m,m))
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
root = 1
parent = [0] * (N+1)
order... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
m = map(int,read().split())
AB = list(zip(m,m))
#print(N,m,AB)
graph = [[] for _ in range(N+1)]
for a,b in AB:
graph[a].append(b)
graph[b].append(a)
#print(a,b)
#print(gr... | [
"call.remove"
] | 656,444 | 656,445 | u902430070 | python |
p02850 | N = int(input())
AB =[]
V = [[] for _ in range(N)]
Edict = dict()
for _ in range(N-1):
a,b = map(int,input().split())
AB.append((a-1,b-1))
V[a-1].append(b-1)
V[b-1].append(a-1)
K = min(len(V[i]) for i in range(N))
for i in V:
i.sort()
for i,v in enumerate(V[0]):
Edict[(0,v)] = i
for i in range(1... | N = int(input())
AB =[]
V = [[] for _ in range(N)]
Edict = dict()
for _ in range(N-1):
a,b = map(int,input().split())
AB.append((a-1,b-1))
V[a-1].append(b-1)
V[b-1].append(a-1)
K = max(len(V[i]) for i in range(N))
for i in V:
i.sort()
for i,v in enumerate(V[0]):
Edict[(0,v)] = i
for i in range(1... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 656,469 | 656,470 | u202570162 | python |
p02850 | sys.setrecursionlimit(10**6)
n = int(input())
G = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int, input().split())
a,b = a-1,b-1
G[a].append([b,i])
ans = [None]*(n-1)
def rec(cur,color):
cnt = 1
for (to, j) in G[cur]:
if cnt == color:
cnt += 1
ans[j] = cnt
... | import sys
sys.setrecursionlimit(10**6)
n = int(input())
G = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int, input().split())
a,b = a-1,b-1
G[a].append([b,i])
ans = [None]*(n-1)
def rec(cur,color):
cnt = 1
for (to, j) in G[cur]:
if cnt == color:
cnt += 1
ans[... | [] | 656,477 | 656,478 | u896451538 | python |
p02850 | from collections import deque
N=int(input())
G=[[] for _ in range(N+1)]
edge={}
for i in range(N-1):
a,b=map(int, input().split())
G[a].append(b)
G[b].append(a)
edge[(a,b)]=i
edge[(b,a)]=i
que=deque()
que.append(1)
visited=[0]*(N+1)
visited[1]=0
ans=[0]*(N-1)
while que:
v=que.pop()
j=1
... | from collections import deque
N=int(input())
G=[[] for _ in range(N+1)]
edge={}
for i in range(N-1):
a,b=map(int, input().split())
G[a].append(b)
G[b].append(a)
edge[(a,b)]=i
edge[(b,a)]=i
que=deque()
que.append(1)
visited=[-1]*(N+1)
visited[1]=0
ans=[0]*(N-1)
while que:
v=que.pop()
j=1
... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 656,487 | 656,488 | u121921603 | python |
p02850 | from collections import deque
N=int(input())
G=[[] for _ in range(N+1)]
edge={}
for i in range(N-1):
a,b=map(int, input().split())
G[a].append(b)
G[b].append(a)
edge[(a,b)]=i
edge[(b,a)]=i
que=deque()
que.append(1)
visited=[0]*(N+1)
visited[1]=0
ans=[0]*(N-1)
while que:
v=que.pop()
j=1
... | from collections import deque
N=int(input())
G=[[] for _ in range(N+1)]
edge={}
for i in range(N-1):
a,b=map(int, input().split())
G[a].append(b)
G[b].append(a)
edge[(a,b)]=i
edge[(b,a)]=i
que=deque()
que.append(1)
visited=[-1]*(N+1)
visited[1]=0
ans=[0]*(N-1)
while que:
v=que.pop()
j=1
... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 656,489 | 656,488 | u121921603 | python |
p02840 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,a,d=map(int,input().split())
if(d==0):
if(a!=0):
print(n-1)
else:
print(1)
return
if(d<0)... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
from collections import defaultdict
def resolve():
n,a,d=map(int,input().split())
if(d==0):
if(a!=0):
print(n+1)
else:
print(1)
return
if(d<0)... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 656,571 | 656,572 | u440566786 | python |
p02840 | from operator import itemgetter
n, x, d = map(int, input().split())
if d == 0:
if x == 0:
print(1)
else:
print(n+1)
exit()
if d < 0:
x *= -1
d *= -1
p = dict()
q = dict()
for k in range(n+1):
temp = k * x % d
if temp in p.keys():
#print((k - p[temp]) * x)
... | from operator import itemgetter
n, x, d = map(int, input().split())
if d == 0:
if x == 0:
print(1)
else:
print(n+1)
exit()
if d < 0:
x *= -1
d *= -1
p = dict()
q = dict()
for k in range(n+1):
temp = k * x % d
if temp in p.keys():
#print((k - p[temp]) * x)
... | [
"control_flow.continue.add"
] | 656,669 | 656,670 | u824237520 | python |
p02840 | import sys
from collections import defaultdict
N, X, D = map(int, input().split())
if D == 0:
print(1 if D == 0 else N + 1)
sys.exit()
if D < 0:
X *= -1
D *= -1
dic = defaultdict(list)
for i in range(N + 1):
l = X*i + i*(i-1)//2*D
r = X*i + (N-1+N-1-(i-1))*i//2*D
dic[l % D].append((l // D, r // D + 1... | import sys
from collections import defaultdict
N, X, D = map(int, input().split())
if D == 0:
print(1 if X == 0 else N + 1)
sys.exit()
if D < 0:
X *= -1
D *= -1
dic = defaultdict(list)
for i in range(N + 1):
l = X*i + i*(i-1)//2*D
r = X*i + (N-1+N-1-(i-1))*i//2*D
dic[l % D].append((l // D, r // D + 1... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 656,677 | 656,678 | u006493569 | python |
p02840 | import math
n, X, D = map(int, input().split())
if D == 0:
if X == 0:
print(1)
else:
print(N + 1)
exit()
Y = dict()
for i in range(n + 1):
b = -2 * i * X
r = (n - 1 + n - i) * i // 2
l = (0 + i - 1) * i // 2
off = b % (-2 * D)
l += (b - off) // (-2 * D)
r += (b - off) // (-2 * D)
if off in Y:
Y[off]... | import math
n, X, D = map(int, input().split())
if D == 0:
if X == 0:
print(1)
else:
print(n + 1)
exit()
Y = dict()
for i in range(n + 1):
b = -2 * i * X
r = (n - 1 + n - i) * i // 2
l = (0 + i - 1) * i // 2
off = b % (-2 * D)
l += (b - off) // (-2 * D)
r += (b - off) // (-2 * D)
if off in Y:
Y[off]... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 656,727 | 656,728 | u484902431 | python |
p02851 | N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(1,N):
A[i]+=A[i-1]
A=[(A[i]-i-1)%K for i in range(N)]
A=[0]+A
from collections import Counter
if K>=N:
a=Counter(A)
ans=0
for v in a.values():
ans+=v*(v-1)/2
print(ans)
else:
ans=0
d={}
for i in range(K):
if A[i] in d:
... | N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(1,N):
A[i]+=A[i-1]
A=[(A[i]-i-1)%K for i in range(N)]
A=[0]+A
from collections import Counter
if K>N:
a=Counter(A)
ans=0
for v in a.values():
ans+=v*(v-1)/2
print(int(ans))
else:
ans=0
d={}
for i in range(K):
if A[i] in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 656,766 | 656,767 | u425184437 | python |
p02851 | from collections import defaultdict
n, k = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
s = [0] * (n + 1)
for i in range(n):
s[i + 1] = (s[i] + a[i]) % k
mp = defaultdict(int)
print(s)
ans = 0
for i in range(n + 1):
ans += mp[s[i]]
mp[s[i]] += 1
if i >= k - 1:
mp[s[i - k + 1]... | from collections import defaultdict
n, k = map(int, input().split())
a = list(map(lambda x: int(x) - 1, input().split()))
s = [0] * (n + 1)
for i in range(n):
s[i + 1] = (s[i] + a[i]) % k
mp = defaultdict(int)
ans = 0
for i in range(n + 1):
ans += mp[s[i]]
mp[s[i]] += 1
if i >= k - 1:
mp[s[i - k + 1]] -= 1
pri... | [
"call.remove"
] | 656,772 | 656,773 | u843175622 | python |
p02851 | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
"""
N^2なので素直に計算は無理，部分和を使いたいのでとりあえず累積和
[i+1:j]が条件を満たすとはS[j]-S[i]とj-iが合同．
移行して，S[j]-jとS[i]-iが合同
基本は個数だけ見れば良い
これだけだと，個数がKより大きい時にダメ
直近Kこの情報だけ持つ，今見てる数字が直近K個のものと何個... | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
"""
N^2なので素直に計算は無理，部分和を使いたいのでとりあえず累積和
[i+1:j]が条件を満たすとはS[j]-S[i]とj-iが合同．
移行して，S[j]-jとS[i]-iが合同
基本は個数だけ見れば良い
これだけだと，個数がKより大きい時にダメ
直近Kこの情報だけ持つ，今見てる数字が直近K個のものと何個... | [
"expression.operation.binary.add"
] | 656,774 | 656,775 | u498487134 | python |
p02851 | from collections import deque
n,k = map(int, input().split())
al = list(map(int, input().split()))
val_cnt = {}
val_cnt[0] = 1
val_q = deque([0])
if k == 1:
val_q.popleft()
ans = 0
curr_sum = 0
for i in range(n):
curr_sum += al[i]
curr_sum %= k
val = (curr_sum - (i+1))%k
val_cnt.setdefault(val,0)... | from collections import deque
n,k = map(int, input().split())
al = list(map(int, input().split()))
val_cnt = {}
val_cnt[0] = 1
val_q = deque([0])
if k == 1:
print(0)
exit()
ans = 0
curr_sum = 0
for i in range(n):
curr_sum += al[i]
curr_sum %= k
val = (curr_sum - (i+1))%k
val_cnt.setdefault(va... | [
"call.arguments.change",
"control_flow.exit.add"
] | 656,804 | 656,805 | u493520238 | python |
p02851 | N,K=map(int,input().split())
A=list(map(int,input().split()))
DP=dict()
if K==1:
print(0)
exit()
DP[0]=1
P=0
Y=[0]*(N+1)
for i in range(N):
Y[i+1]=(Y[i]+A[i]-1)%K
P+=DP.get(Y[i+1],0)
DP[Y[i+1]]=DP.get(Y[i+1],0)+1
if i>=K-2:
DP[Y[i-K+2]]-=1 | N,K=map(int,input().split())
A=list(map(int,input().split()))
DP=dict()
if K==1:
print(0)
exit()
DP[0]=1
P=0
Y=[0]*(N+1)
for i in range(N):
Y[i+1]=(Y[i]+A[i]-1)%K
P+=DP.get(Y[i+1],0)
DP[Y[i+1]]=DP.get(Y[i+1],0)+1
if i>=K-2:
DP[Y[i-K+2]]-=1
print(P) | [
"call.add"
] | 656,819 | 656,820 | u873915460 | python |
p02851 | from collections import defaultdict
N, K = map(int, input().split())
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] +=... | from collections import defaultdict
N, K = map(int, input().split())
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N+1)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] ... | [
"expression.operation.binary.add"
] | 656,876 | 656,877 | u476604182 | python |
p02851 | from collections import defaultdict
N, K = map(int, input().split())
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] +=... | from collections import defaultdict
N, K = map(int, input().split())
A = [(int(c)%K)-1 for c in input().split()]
B = [0]
for c in A:
B += [B[-1]+c]
dic = defaultdict(int)
ldic = defaultdict(int)
for i in range(min(K,N+1)):
c = B[i]
dic[c%K] += 1
ans = 0
#print(dic)
for i in range(1,N+1):
x = B[i-1]
ldic[x%K] ... | [
"expression.operation.binary.add"
] | 656,876 | 656,878 | u476604182 | python |
p02851 | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def L... | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def L... | [
"assignment.remove"
] | 657,049 | 657,050 | u623819879 | python |
p02851 | n,k=map(int,input().split())
a=list(map(int,input().split()))
a=list(map(lambda x:x-1 ,a))
if k==1:
print(0)
s=[0]
for i in range(n):
s.append(s[-1]+a[i])
s=list(map(lambda x:x%k,s))
from collections import defaultdict
d=defaultdict(int)
d[0]=1
ans=0
for i in range(1,n+1):
ans+=d[s[i]]
d[s[i]]+=1
... | n,k=map(int,input().split())
a=list(map(int,input().split()))
a=list(map(lambda x:x-1 ,a))
if k==1:
print(0)
exit()
s=[0]
for i in range(n):
s.append(s[-1]+a[i])
s=list(map(lambda x:x%k,s))
from collections import defaultdict
d=defaultdict(int)
d[0]=1
ans=0
for i in range(1,n+1):
ans+=d[s[i]]
d[s[... | [
"call.add"
] | 657,053 | 657,054 | u366959492 | python |
p02851 | import sys
from collections import defaultdict
from copy import deepcopy
import itertools
input = sys.stdin.readline
# 文字列の場合は普通のinput()を使うか下を使う
# input = sys.stdin.readline().rstrip()
N, K = map(int, input().split())
A = list(map(int, input().split()))
S = [0] + list(itertools.accumulate(A))
"""
「iからjまで」--->「0からjまで」-... | import sys
from collections import defaultdict
from copy import deepcopy
import itertools
input = sys.stdin.readline
# 文字列の場合は普通のinput()を使うか下を使う
# input = sys.stdin.readline().rstrip()
N, K = map(int, input().split())
A = list(map(int, input().split()))
S = [0] + list(itertools.accumulate(A))
"""
「iからjまで」--->「0からjまで」-... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 657,055 | 657,056 | u107639613 | python |
p02851 | #!/usr/bin/env python3
import sys
from collections import Counter
input = sys.stdin.readline
INF = 10**9
n, k = [int(item) for item in input().split()]
a = [int(item) - 1 for item in input().split()]
cumsum = [0] * (n + 1)
for i in range(n):
cumsum[i+1] = cumsum[i] + a[i]
cumsum[i+1] %= k
ls = list(set(cumsum... | #!/usr/bin/env python3
import sys
from collections import Counter
input = sys.stdin.readline
INF = 10**9
n, k = [int(item) for item in input().split()]
a = [int(item) - 1 for item in input().split()]
cumsum = [0] * (n + 1)
for i in range(n):
cumsum[i+1] = cumsum[i] + a[i]
cumsum[i+1] %= k
ls = list(set(cumsum... | [] | 657,136 | 657,137 | u052499405 | python |
p02851 | import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n - 1):
a[i] -= 1
a[i + 1] += a[i]
a[n - 1] -= 1
memo = {0 : []}
for i in range(n):
if a[i] % k not in memo.keys():
memo[a[i] % k] = [i]
else:
memo[a[i] % k].append(i)
ans = bisect.bisect_left(memo[0], k... | import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n - 1):
a[i] -= 1
a[i + 1] += a[i]
a[n - 1] -= 1
memo = {0 : []}
for i in range(n):
if a[i] % k not in memo.keys():
memo[a[i] % k] = [i]
else:
memo[a[i] % k].append(i)
ans = bisect.bisect_left(memo[0], k... | [
"call.remove"
] | 657,144 | 657,145 | u671455949 | python |
p02851 | import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n - 1):
a[i] -= 1
a[i + 1] += a[i]
a[n - 1] -= 1
memo = {}
for i in range(n):
if a[i] % k not in memo.keys():
memo[a[i] % k] = [i]
else:
memo[a[i] % k].append(i)
ans = bisect.bisect_left(memo[0], k - 1)
... | import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n - 1):
a[i] -= 1
a[i + 1] += a[i]
a[n - 1] -= 1
memo = {0 : []}
for i in range(n):
if a[i] % k not in memo.keys():
memo[a[i] % k] = [i]
else:
memo[a[i] % k].append(i)
ans = bisect.bisect_left(memo[0], k... | [] | 657,146 | 657,145 | u671455949 | python |
p02851 | n, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
cnt = {0:1}
ans = 0
for i in range(1, n+1):
left = i - k + 1
if left >= 0:
ldif = (a[left] - left) % k
if ldif < 0: ldif += k
cnt[ldif] -= 1
a[i] += a[i-1]
dif = (a[i] - i) % k
if dif < 0: dif ... | n, k = map(int, input().split())
a = [0] + list(map(int, input().split()))
cnt = {0:1}
ans = 0
for i in range(1, n+1):
left = i - k
if left >= 0:
ldif = (a[left] - left) % k
if ldif < 0: ldif += k
cnt[ldif] -= 1
a[i] += a[i-1]
dif = (a[i] - i) % k
if dif < 0: dif += k... | [
"expression.operation.binary.remove"
] | 657,174 | 657,175 | u299869545 | python |
p02852 | import sys
import heapq
def main():
input = sys.stdin.readline
n, m = map(int, input().split())
s = input()
inf = pow(10, 6)
ans = [inf]*(n+1)
key = []
heapq.heapify(key)
heapq.heappush(key, (0, n))
ans[n] = 0
index = n-1
count = 0
while key:
sub = heapq.heappop(key)
s1, s2 = sub[0],... | import sys
import heapq
def main():
input = sys.stdin.readline
n, m = map(int, input().split())
s = input()
inf = pow(10, 6)
ans = [inf]*(n+1)
key = []
heapq.heapify(key)
heapq.heappush(key, (0, n))
ans[n] = 0
index = n-1
count = 0
while key:
sub = heapq.heappop(key)
s1, s2 = sub[0],... | [
"assignment.add"
] | 657,244 | 657,245 | u021548497 | python |
p02852 | import sys
import heapq
def main():
input = sys.stdin.readline
n, m = map(int, input().split())
s = input()
inf = pow(10, 6)
ans = [inf]*(n+1)
key = []
heapq.heapify(key)
heapq.heappush(key, (0, n))
ans[n] = 0
index = n-1
count = 0
while key:
sub = heapq.heappop(key)
s1, s2 = sub[0],... | import sys
import heapq
def main():
input = sys.stdin.readline
n, m = map(int, input().split())
s = input()
inf = pow(10, 6)
ans = [inf]*(n+1)
key = []
heapq.heapify(key)
heapq.heappush(key, (0, n))
ans[n] = 0
index = n-1
count = 0
while key:
sub = heapq.heappop(key)
s1, s2 = sub[0],... | [
"assignment.add"
] | 657,244 | 657,246 | u021548497 | python |
p02852 | n,m = map(int,input().split())
s = input()
now = n
ans_rev = []
while(now != 0):
for i in range( now-m,now+1):
if(i == now):
print(-1)
exit()
if(s[i] == '1'):
continue
ans_rev.append(now - i)
now = i
break
print(' '.join(map(str, ans_rev... | n,m = map(int,input().split())
s = input()
now = n
ans_rev = []
while(now != 0):
for i in range( max(0,now-m),now+1):
if(i == now):
print(-1)
exit()
if(s[i] == '1'):
continue
ans_rev.append(now - i)
now = i
break
print(' '.join(map(str, ... | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 657,267 | 657,268 | u490642448 | python |
p02852 | n,m=map(int,input().split())
s=input()
x=n
a=[]
while x!=0:
for i in range(min(m,x),0,-1):
if s[x-i]=="0":
x-=i
a.append(i)
break
if i==1:print(-1);exit()
print(a[::-1]) | n,m=map(int,input().split())
s=input()
x=n
a=[]
while x!=0:
for i in range(min(m,x),0,-1):
if s[x-i]=="0":
x-=i
a.append(i)
break
if i==1:print(-1);exit()
print(*a[::-1]) | [
"call.arguments.change"
] | 657,316 | 657,317 | u227082700 | python |
p02852 | n,m=map(int,input().split())
s=input()
s=s[::-1]
r,l,cnt,k,=0,0,0,0
ans=[]
while 1:
while cnt<m:
r+=1
if r==n:
ans.append(r-k)
print(r,l)
print(*ans[::-1])
exit()
if s[r]=='0':
l=r
cnt+=1
if r-l==m:
print(-1)
exit()
ans.append(l-k)
k=l
cnt=r-l | n,m=map(int,input().split())
s=input()
s=s[::-1]
r,l,cnt,k,=0,0,0,0
ans=[]
while 1:
while cnt<m:
r+=1
if r==n:
ans.append(r-k)
print(*ans[::-1])
exit()
if s[r]=='0':
l=r
cnt+=1
if r-l==m:
print(-1)
exit()
ans.append(l-k)
k=l
cnt=r-l | [
"call.remove"
] | 657,343 | 657,344 | u169138653 | python |
p02852 | def main():
N, M = map(int, input().split())
S = input()
p = N
a = []
while p > 0:
for i in range(min(M, p), 0, -1):
if S[p - i] == '0':
p = p - i
a.append(str(i))
break
else:
return -1
return ''.join(i f... | def main():
N, M = map(int, input().split())
S = input()
p = N
a = []
while p > 0:
for i in range(min(M, p), 0, -1):
if S[p - i] == '0':
p = p - i
a.append(str(i))
break
else:
return -1
return ' '.join(i ... | [
"literal.string.change",
"function.return_value.change"
] | 657,400 | 657,401 | u316464887 | python |
p02852 | from collections import deque
N,M=map(int,input().split())
S=input()
j=N
ans=deque()
while j>0:
for i in range(M,0,-1):
if j-i==0:
ans.appendleft(i)
print(*ans)
elif j-i<0:
continue
if S[j-i]=="0":
ans.appendleft(i)
j-=i
... | from collections import deque
N,M=map(int,input().split())
S=input()
j=N
ans=deque()
while j>0:
for i in range(M,0,-1):
if j-i==0:
ans.appendleft(i)
print(*ans)
elif j-i<0:
continue
if S[j-i]=="0":
ans.appendleft(i)
j-=i
... | [
"control_flow.break.add"
] | 657,402 | 657,403 | u121921603 | python |
p02852 | from collections import deque
N,M=map(int,input().split())
S=input()
j=N
ans=deque()
while j>0:
for i in range(M,0,-1):
if j-i==0:
ans.appendleft(i)
print(*ans)
elif j-i<0:
continue
if S[j-i]=="0":
ans.append(i)
j-=i
if i... | from collections import deque
N,M=map(int,input().split())
S=input()
j=N
ans=deque()
while j>0:
for i in range(M,0,-1):
if j-i==0:
ans.appendleft(i)
print(*ans)
elif j-i<0:
continue
if S[j-i]=="0":
ans.appendleft(i)
j-=i
... | [
"identifier.change",
"control_flow.break.add"
] | 657,404 | 657,403 | u121921603 | python |
p02852 | import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N, M = map(int, input().split())
S = input()
rS = [i for i in reversed(S)]
res = []
step = 0
lenS = len(S)
while 1:
if step == lenS-1:
break
for i in range(M, -1, -1):
# print(' i:', i)
if step+i > lenS-1:
c... | import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N, M = map(int, input().split())
S = input()
rS = [i for i in reversed(S)]
res = []
step = 0
lenS = len(S)
while 1:
if step == lenS-1:
break
for i in range(M, -1, -1):
if step+i > lenS-1:
continue
if i == 0... | [
"call.add"
] | 657,409 | 657,410 | u625729943 | python |
p02852 | n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=-1
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
... | n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=0
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
... | [
"assignment.value.change",
"expression.operation.unary.remove"
] | 657,489 | 657,488 | u223904637 | python |
p02852 | n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=-1
while nk<n+1:
for i in range(min(n+1-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
... | n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=0
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
... | [
"assignment.value.change",
"expression.operation.unary.remove",
"expression.operation.binary.remove"
] | 657,491 | 657,488 | u223904637 | python |
p02852 | n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=-1
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
... | n,m=map(int,input().split())
s=list(str(input()))
f=0
mf=0
for i in range(n+1):
if s[i]=='1':
f+=1
mf=max(mf,f)
else:
f=0
if mf>=m:
print(-1)
exit()
reans=[]
s.reverse()
nk=0
while nk<n:
for i in range(min(n-nk,m),0,-1):
if s[nk+i]=='0':
nk=nk+i
... | [
"assignment.value.change",
"expression.operation.unary.remove"
] | 657,492 | 657,488 | u223904637 | python |
p02852 | N, M = list(map(int, input().split()))
S = list(input())
D = []
t = N
while t > 0:
print(t)
if t - M <= 0:
D.append(t)
break
for i in range(M, 0, -1):
if S[t - i] == "0":
D.append(i)
t -= i
break
else:
print(-1)
exit()
for i in range(len(D) -1, -1, -1):
print(D[i],end =... | N, M = list(map(int, input().split()))
S = list(input())
D = []
t = N
while t > 0:
if t - M <= 0:
D.append(t)
break
for i in range(M, 0, -1):
if S[t - i] == "0":
D.append(i)
t -= i
break
else:
print(-1)
exit()
for i in range(len(D) -1, -1, -1):
print(D[i],end = " ") | [
"call.remove"
] | 657,547 | 657,548 | u456353530 | python |
p02850 | from collections import deque
def bfs(succs, preds, start, colors):
saisyoku = {}
queue = deque([start])
used = 0
while queue:
v = queue.popleft()
for u in preds[v]:
used = saisyoku[preds[v][u]]
c = 1
for w in succs[v]:
if used and c == used:
... | from collections import deque
def bfs(succs, preds, start):
saisyoku = {}
queue = deque([start])
used = 0
while queue:
v = queue.popleft()
for u in preds[v]:
used = saisyoku[preds[v][u]]
c = 1
for w in succs[v]:
if used and c == used:
... | [] | 657,565 | 657,566 | u127873832 | python |
p02853 | x,y = map(int,input().split())
c = 0
if x==1:
c+=300000
elif x == 2:
c+=200000
elif x == 3:
c+=100000
if y==1:
c+=300000
elif y == 2:
c+=200000
elif y == 3:
c+=100000
if x == 1 and y == 1:
x+=400000
print(c) | x,y = map(int,input().split())
c = 0
if x==1:
c+=300000
elif x == 2:
c+=200000
elif x == 3:
c+=100000
if y==1:
c+=300000
elif y == 2:
c+=200000
elif y == 3:
c+=100000
if x == 1 and y == 1:
c+=400000
print(c) | [
"identifier.change"
] | 657,598 | 657,599 | u629540524 | python |
p02853 | x, y = map(int, input().split())
prize = [300000, 100000, 200000]
total = 0
if x <= 3:
total += prize[x-1]
if y <= 3:
total += prize[y-1]
if x == y == 1:
total += 400000
print(total) | x, y = map(int, input().split())
prize = [300000, 200000, 100000]
total = 0
if x <= 3:
total += prize[x-1]
if y <= 3:
total += prize[y-1]
if x == y == 1:
total += 400000
print(total) | [] | 657,601 | 657,602 | u896791216 | python |
p02853 | x,y=map(int,input().split())
if x==y==1:
print(1000000)
A=[300000,200000,100000]+[0]*1000
print(A[x-1]+A[y-1])
| x,y=map(int,input().split())
if x==y==1:
print(1000000);exit()
A=[300000,200000,100000]+[0]*1000
print(A[x-1]+A[y-1])
| [] | 657,603 | 657,604 | u023229441 | python |
p02853 | x,y = map(int,input().split())
if x == 1 and y == 1:
print(1000000)
elif x == 1 and y == 2 or x == 2 or y == 1:
print(500000)
elif x == 2 and y == 2 or x == 3 and y == 1 or x == 1 or y == 3:
print(400000)
elif x == 3 and y == 2 or x == 2 and y == 3 or x == 1 and y >= 4 or x >= 4 and y == 1:
print(300000... | x,y = map(int,input().split())
if x == 1 and y == 1:
print(1000000)
elif x == 1 and y == 2 or x == 2 and y == 1:
print(500000)
elif x == 2 and y == 2 or x == 3 and y == 1 or x == 1 and y == 3:
print(400000)
elif x == 3 and y == 2 or x == 2 and y == 3 or x == 1 and y >= 4 or x >= 4 and y == 1:
print(3000... | [
"control_flow.branch.if.condition.change"
] | 657,609 | 657,610 | u397953026 | python |
p02853 | X, Y = map(int, input().split())
def solver(X, Y):
if X == 1 and Y == 1:
print(1000000)
return
a = 0
if X == 1:
a += 300000
if X == 2:
a += 200000
if X == 3:
a += 100000
if Y == 1:
a += 300000
if Y == 2:
a += 200000
if Y == 3:... | X, Y = map(int, input().split())
def solver(X, Y):
if X == 1 and Y == 1:
print(1000000)
return
a = 0
if X == 1:
a += 300000
if X == 2:
a += 200000
if X == 3:
a += 100000
if Y == 1:
a += 300000
if Y == 2:
a += 200000
if Y == 3:... | [
"literal.number.integer.change"
] | 657,611 | 657,612 | u642012866 | python |
p02853 | x,y = map(int,input().split())
a = [0]*210
a[:3] = [300000, 200000, 100000]
if x == y and x == 1:
print(400000)
else:
print(a[x-1] + a[y-1])
| x,y = map(int,input().split())
a = [0]*210
a[:3] = [300000, 200000, 100000]
if x == y and x == 1:
print(1000000)
else:
print(a[x-1] + a[y-1])
| [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 657,613 | 657,614 | u624613992 | python |
p02853 | a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:1000000}
if a>3:
x=0
else:
x=a
if b>3:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans) | a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>3:
x=0
else:
x=a
if b>3:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans) | [
"literal.number.integer.change",
"assignment.value.change"
] | 657,621 | 657,622 | u123745130 | python |
p02853 | a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>4:
x=0
else:
x=a
if b>4:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans) | a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>3:
x=0
else:
x=a
if b>3:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans) | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 657,623 | 657,622 | u123745130 | python |
p02853 | a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:1000000}
if a>4:
x=0
else:
x=a
if b>4:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans) | a,b=map(int,input().split())
lst={0:0,1:300000,2:200000,3:100000}
if a>3:
x=0
else:
x=a
if b>3:
y=0
else:
y=b
if x==1 and y==1:
ans=1000000
else :
ans=lst[x]+lst[y]
print(ans) | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 657,624 | 657,622 | u123745130 | python |
p02853 | x,y=map(int, input())
coin=0
if x==1 and y==1:
coin+=400000
if x==1:
coin+=300000
if y==1:
coin+=300000
if x==2:
coin+=200000
if y==2:
coin+=200000
if x==3:
coin+=100000
if y==3:
coin+=100000
print(coin) | x,y=map(int, input().split())
coin=0
if x==1 and y==1:
coin+=400000
if x==1:
coin+=300000
if y==1:
coin+=300000
if x==2:
coin+=200000
if y==2:
coin+=200000
if x==3:
coin+=100000
if y==3:
coin+=100000
print(coin)
| [
"call.add"
] | 657,631 | 657,632 | u088488125 | python |
p02853 | def p(n):
if n == 1:
return 300000
elif n == 2:
return 200000
elif n == 3:
return 300000
else:
return 0
x, y = map(int, input().split())
ans = 0
if x == y == 1:
ans += 400000
ans += p(x) + p(y)
print(ans)
| def p(n):
if n == 1:
return 300000
elif n == 2:
return 200000
elif n == 3:
return 100000
else:
return 0
x, y = map(int, input().split())
ans = 0
if x == y == 1:
ans += 400000
ans += p(x) + p(y)
print(ans)
| [
"literal.number.integer.change",
"function.return_value.change"
] | 657,635 | 657,636 | u654240084 | python |
p02853 | x, y = map(int, input().split())
A, B = [0] * 206, [0] * 206
A[1] = 300000
A[2] = 200000
A[3] = 100000
B[1] = 300000
B[2] = 300000
B[3] = 300000
if x == 1 and y == 1:
print(A[x] + B[y] + 400000)
else:
print(A[x] + B[y]) | x, y = map(int, input().split())
A, B = [0] * 206, [0] * 206
A[1] = 300000
A[2] = 200000
A[3] = 100000
B[1] = 300000
B[2] = 200000
B[3] = 100000
if x == 1 and y == 1:
print(A[x] + B[y] + 400000)
else:
print(A[x] + B[y]) | [
"literal.number.integer.change",
"assignment.value.change"
] | 657,637 | 657,638 | u627803856 | python |
p02853 | a = list(map(int,input().split()))
ans = 0
for v in a:
if v == 1:
ans += 300000
elif v == 2:
ans += 200000
else:
ans += 100000
if sum(a) == 2:
ans += 400000
print(ans) | a = list(map(int,input().split()))
ans = 0
for v in a:
if v == 1:
ans += 300000
elif v == 2:
ans += 200000
elif v == 3:
ans += 100000
if sum(a) == 2:
ans += 400000
print(ans) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 657,639 | 657,640 | u143051858 | python |
p02853 | X, Y = map(int, input().split())
price = [0, 300000, 200000, 100000]
ans = price[X] + price[Y] + 400000*(X == Y == 1)
print(ans) | X, Y = map(int, input().split())
price = [0, 300000, 200000, 100000] + [0]*300
ans = price[X] + price[Y] + 400000*(X == Y == 1)
print(ans) | [
"assignment.change"
] | 657,648 | 657,649 | u922449550 | python |
p02853 | X,Y=map(int, input().split())
v1 = [300000, 200000, 100000]
v2 = [300000, 200000, 100000]
x = 0
y = 0
if X <= 3:
x = int(v1[X-1])
if Y <= 3:
y = int(v2[Y-1])
if (X==1 & Y==1):
print(int(x + y + 400000))
else:
print(int(x + y)) | X,Y=map(int, input().split())
v1 = [300000, 200000, 100000]
v2 = [300000, 200000, 100000]
x = 0
y = 0
if X <= 3:
x = int(v1[X-1])
if Y <= 3:
y = int(v2[Y-1])
if ((X==1) & (Y==1)):
print(int(x + y + 400000))
else:
print(int(x + y)) | [
"control_flow.branch.if.condition.change"
] | 657,652 | 657,653 | u019355060 | python |
p02853 | X, Y = map(int, input().split())
ans = 0
for z in [X,Y]:
if z == 3:
ans += 10**5
elif z == 2:
ans += 2*10**5
elif z == 1:
ans += 3*10**5
if X == Y:
ans += 4*10**5
print(ans) | X, Y = map(int, input().split())
ans = 0
for z in [X,Y]:
if z == 3:
ans += 10**5
elif z == 2:
ans += 2*10**5
elif z == 1:
ans += 3*10**5
if X == Y == 1:
ans += 4*10**5
print(ans)
| [
"control_flow.branch.if.condition.change"
] | 657,654 | 657,655 | u086503932 | python |
p02853 | x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i == 2:
ans += 200000
elif i == 3:
ans += 100000
if top_count != 0:
print(ans + 400000)
else:
print(ans) | x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i == 2:
ans += 200000
elif i == 3:
ans += 100000
if top_count == 2:
print(ans + 400000)
else:
print(ans) | [] | 657,660 | 657,661 | u068142202 | python |
p02853 | x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i ==2:
ans += 200000
elif i == 3:
ans += 100000
if top_count != 0:
print(ans + 400000)
else:
print(ans) | x = list(map(int, input().split()))
top_count = 0
ans = 0
for i in x:
if i == 1:
ans += 300000
top_count += 1
elif i == 2:
ans += 200000
elif i == 3:
ans += 100000
if top_count == 2:
print(ans + 400000)
else:
print(ans) | [] | 657,662 | 657,661 | u068142202 | python |
p02853 | X, Y = map(int, input().split())
ans = 0
if X == 1 and Y == 1:
asn = 1000000
else:
if X == 1:
ans += 300000
elif X == 2:
ans += 200000
elif X == 3:
ans += 100000
if Y == 1:
ans += 300000
elif Y == 2:
ans += 200000
elif Y ==3:
ans += 100000
prin... | X, Y = map(int, input().split())
ans = 0
if X == 1 and Y == 1:
ans = 1000000
else:
if X == 1:
ans += 300000
elif X == 2:
ans += 200000
elif X == 3:
ans += 100000
if Y == 1:
ans += 300000
elif Y == 2:
ans += 200000
elif Y ==3:
ans += 100000
prin... | [
"assignment.variable.change",
"identifier.change"
] | 657,663 | 657,664 | u211236379 | python |
p02853 | x,y = map(int,input().split())
p = 0
pr = [300000,200000,100000]
if(x < 3):p += pr[x-1]
if(y < 3):p += pr[y-1]
if(x == y and x == 1):p += 400000
print(p) | x,y = map(int,input().split())
p = 0
pr = [300000,200000,100000]
if(x <= 3):p += pr[x-1]
if(y <= 3):p += pr[y-1]
if(x == y and x == 1):p += 400000
print(p) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 657,665 | 657,666 | u030726788 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.