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 |
|---|---|---|---|---|---|---|---|
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
ans = [1] * n
for i in range(m):
ai, bi = map(int, input().split())
if h[ai-1] >= h[bi-1]:
ans[bi-1] = 0
elif h[ai-1] < h[bi-1]:
ans[ai-1] = 0
print(sum(ans)) | n, m = map(int, input().split())
h = list(map(int, input().split()))
ans = [1] * n
for i in range(m):
ai, bi = map(int, input().split())
if h[ai-1] >= h[bi-1]:
ans[bi-1] = 0
if h[ai-1] <= h[bi-1]:
ans[ai-1] = 0
print(sum(ans)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,462 | 423,461 | u010178026 | python |
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(m)]
# create graph
g = []
for i in range(n):
g.append(set())
for i in range(m):
g[l[i][0]-1].add(l[i][1]-1)
g[l[i][1]-1].add(l[i][0]-1)
ans = 0
# seach
for i in range(n):
if len(g[i... | n, m = map(int, input().split())
h = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(m)]
# create graph
g = []
for i in range(n):
g.append(set())
for i in range(m):
g[l[i][0]-1].add(l[i][1]-1)
g[l[i][1]-1].add(l[i][0]-1)
# search
ans = 0
for i in range(n):
if len(g... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 423,469 | 423,470 | u561870477 | python |
p02689 | n, m = list(map(int, input().split()))
H = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
ans = [1] * (n)
route = [1] * (n)
for i in range(len(ab)):
a, b = ab[i]
if H[a-1] <= H[b-1]:
ans[a-1] = 0
elif H[b-1] <= H[a-1]:
ans[b-1] = 0
print(sum(ans)) | n, m = list(map(int, input().split()))
H = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
ans = [1] * (n)
route = [1] * (n)
for i in range(len(ab)):
a, b = ab[i]
if H[a-1] <= H[b-1]:
ans[a-1] = 0
if H[b-1] <= H[a-1]:
ans[b-1] = 0
print(sum(ans)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,474 | 423,475 | u057993957 | python |
p02689 | n, m = list(map(int, input().split()))
H = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
ans = [1] * (n)
route = [1] * (n)
for i in range(len(ab)):
a, b = ab[i]
if H[a-1] <= H[b-1]:
ans[a-1] = 0
elif H[b-1] <= H[a-1]:
ans[b-1] = 0
print(sum(cnt)) | n, m = list(map(int, input().split()))
H = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
ans = [1] * (n)
route = [1] * (n)
for i in range(len(ab)):
a, b = ab[i]
if H[a-1] <= H[b-1]:
ans[a-1] = 0
if H[b-1] <= H[a-1]:
ans[b-1] = 0
print(sum(ans)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 423,476 | 423,475 | u057993957 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int, input().split()))
s = [1]*len(h)
A = []
B = []
for i in range(m):
a, b = input().split()
A.append(int(a))
B.append(int(b))
for j in range(m):
if h[A[j]-1] > h[B[j]-1]:
s[B[j]-1] = 0
elif h[A[i]-1] < h[B[j]-1]:
s[A[j]-1] = 0... | n,m = map(int,input().split())
h = list(map(int, input().split()))
s = [1]*len(h)
A = []
B = []
for i in range(m):
a, b = input().split()
A.append(int(a))
B.append(int(b))
for j in range(m):
if h[A[j]-1] > h[B[j]-1]:
s[B[j]-1] = 0
elif h[A[j]-1] < h[B[j]-1]:
s[A[j]-1] = 0... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 423,481 | 423,482 | u491762407 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
p = [0 for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
if h[a-1] > h[b-1]:
p[b-1] = -1
if h[a-1] < h[b-1]:
p[a-1] = -1
print(p.count(0)) | n,m = map(int,input().split())
h = list(map(int,input().split()))
p = [0 for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
if h[a-1] >= h[b-1]:
p[b-1] = -1
if h[a-1] <= h[b-1]:
p[a-1] = -1
print(p.count(0)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,497 | 423,498 | u342563578 | python |
p02689 | N,M = input().split()
N = int(N)
M = int(M)
o_height = input().split()
result = []
for i in range(N):
result.append(True)
while(M):
road = input().split()
if int(o_height[int(road[0])-1]) < int(o_height[int(road[1])-1]):
result[int(road[0])-1] = False
elif int(o_height[int(road[0])-1]) < int(o... | N,M = input().split()
N = int(N)
M = int(M)
o_height = input().split()
result = []
for i in range(N):
result.append(True)
while(M):
road = input().split()
if int(o_height[int(road[0])-1]) < int(o_height[int(road[1])-1]):
result[int(road[0])-1] = False
elif int(o_height[int(road[0])-1]) == int(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,501 | 423,502 | u931011688 | python |
p02689 | #!/usr/bin/env python3
n, m = map(int, input().split())
*h, = map(int, input().split())
h = [0] + h
i = [0] + [1] * n
for j in range(m):
a, b = map(int, input().split())
if h[a] >= h[b]:
i[b] = 0
elif h[a] <= h[b]:
i[a] = 0
print(sum(i))
| #!/usr/bin/env python3
n, m = map(int, input().split())
*h, = map(int, input().split())
h = [0] + h
i = [0] + [1] * n
for j in range(m):
a, b = map(int, input().split())
if h[a] >= h[b]:
i[b] = 0
if h[a] <= h[b]:
i[a] = 0
print(sum(i)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,528 | 423,529 | u373047809 | python |
p02689 | #!/usr/bin/env python3
n, m = map(int, input().split())
*h, = map(int, input().split())
h = [0] + h
i = [0] + [1] * n
for j in range(m):
a, b = map(int, input().split())
if h[a] >= h[b]:
i[b] = 0
elif h[a] <= h[b]:
i[a] = 0
print(n-sum(i))
| #!/usr/bin/env python3
n, m = map(int, input().split())
*h, = map(int, input().split())
h = [0] + h
i = [0] + [1] * n
for j in range(m):
a, b = map(int, input().split())
if h[a] >= h[b]:
i[b] = 0
if h[a] <= h[b]:
i[a] = 0
print(sum(i)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove",
"expression.operation.binary.remove"
] | 423,530 | 423,529 | u373047809 | python |
p02689 | N, M = map(int, input().split())
ListH = list(map(int, input().split()))
ListAB = [list(map(int, input().split())) for i in range(M)]
Cnt=[0]*N
for i in range(M):
if ListH[ListAB[i][0]-1]==ListH[ListAB[i][1]-1]:
Cnt[ListAB[i][0]-1] = 1
Cnt[ListAB[i][1]-1] = 1
else :
if ListH[ListAB[i][0]-1] > ListH[... | N, M = map(int, input().split())
ListH = list(map(int, input().split()))
ListAB = [list(map(int, input().split())) for i in range(M)]
Cnt=[0]*N
for i in range(M):
if ListH[ListAB[i][0]-1]==ListH[ListAB[i][1]-1]:
Cnt[ListAB[i][0]-1] = 1
Cnt[ListAB[i][1]-1] = 1
else :
if ListH[ListAB[i][0]-1] > ListH[... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 423,531 | 423,532 | u112629957 | python |
p02689 | N,M = map(int,input().split())
H = [0]
H.extend(list(map(int,input().split())))
R = [[] for _ in range(N+1)]
for i in range(M):
a,b = map(int,input().split())
R[a].append(b)
R[b].append(a)
ans = N
# print(H)
# print(R)
for i in range(1,N+1):
for j in R[i]:
if H[i] < H[j]:
ans = ans - 1
break... | N,M = map(int,input().split())
H = [0]
H.extend(list(map(int,input().split())))
R = [[] for _ in range(N+1)]
for i in range(M):
a,b = map(int,input().split())
R[a].append(b)
R[b].append(a)
ans = N
# print(H)
# print(R)
for i in range(1,N+1):
for j in R[i]:
if H[i] <= H[j]:
ans = ans - 1
brea... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,535 | 423,536 | u441254033 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
H = set(range(n))
print(h)
for i in range(m):
a,b = map(int,input().split())
if h[a-1] <= h[b-1]:
H.discard(a-1)
if h[a-1] >= h[b-1]:
H.discard(b-1)
print(len(H)) | n,m = map(int,input().split())
h = list(map(int,input().split()))
H = set(range(n))
for i in range(m):
a,b = map(int,input().split())
if h[a-1] <= h[b-1]:
H.discard(a-1)
if h[a-1] >= h[b-1]:
H.discard(b-1)
print(len(H)) | [
"call.remove"
] | 423,541 | 423,542 | u678505520 | python |
p02689 | N, M = list(map(int, input().split()))
H_list = list(map(int, input().split()))
road_list = []
for _ in range(M):
road_list.append([])
for i in range(M):
a, b = list(map(int, input().split()))
H_a, H_b = [H_list[a - 1], H_list[b - 1]]
if H_a <= H_b:
road_list[a - 1].append(a)
elif H_b <= H_... | N, M = list(map(int, input().split()))
H_list = list(map(int, input().split()))
road_list = []
for _ in range(N):
road_list.append([])
for i in range(M):
a, b = list(map(int, input().split()))
H_a, H_b = [H_list[a - 1], H_list[b - 1]]
if H_a <= H_b:
road_list[a - 1].append(b)
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,545 | 423,546 | u384476576 | python |
p02689 | import collections
n,m = (int(i) for i in input().split())
h = [int(i) for i in input().split()]
ab =[[0]]*n
print(ab)
for _ in range(m):
a,b = (int(i) for i in input().split())
if h[a-1]-h[b-1]>0:
ab[b-1]=["a"]
elif h[a-1]-h[b-1]<0:
ab[a-1]=["a"]
else:
ab[a-1]=["a"]
ab[b-1]=["a"]
print(ab.count([0])) | import collections
n,m = (int(i) for i in input().split())
h = [int(i) for i in input().split()]
ab =[[0]]*n
for _ in range(m):
a,b = (int(i) for i in input().split())
if h[a-1]-h[b-1]>0:
ab[b-1]=["a"]
elif h[a-1]-h[b-1]<0:
ab[a-1]=["a"]
else:
ab[a-1]=["a"]
ab[b-1]=["a"]
print(ab.count([0])) | [
"call.remove"
] | 423,547 | 423,548 | u811068179 | python |
p02689 | number_of_observatory, number_of_road = map(int, input().split())
height_list = [0] # 1始まりで合わせるため
height_list.extend(list(map(int, input().split())))
road_list = []
for i in range(number_of_road):
li = list(map(int, input().split()))
road_list.append(li) # start・end の順に格納
counta = 0
not_good_list = []
# 良い展... | number_of_observatory, number_of_road = map(int, input().split())
height_list = [0] # 1始まりで合わせるため
height_list.extend(list(map(int, input().split())))
road_list = []
for i in range(number_of_road):
li = list(map(int, input().split()))
road_list.append(li) # start・end の順に格納
counta = 0
not_good_list = []
# 良い展... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 423,551 | 423,552 | u161537170 | python |
p02689 | h, m =map(int,input().strip().split())
height=list(map(int,input().strip().split()) )
lst=[1]*h
for i in range(m):
a,b=map(int,input().strip().split())
if height[a-1]>height[b-1]:
lst[b-1]=0
elif height[a-1]<height[b-1]:
lst[a-1]=0
else:
lst[b - 1] = 0
lst[a - 1] = 0
pr... | h, m =map(int,input().strip().split())
height=list(map(int,input().strip().split()) )
lst=[1]*h
for i in range(m):
a,b=map(int,input().strip().split())
if height[a-1]>height[b-1]:
lst[b-1]=0
elif height[a-1]<height[b-1]:
lst[a-1]=0
else:
lst[b - 1] = 0
lst[a - 1] = 0
p... | [
"call.remove"
] | 423,559 | 423,560 | u264281836 | python |
p02689 | N , M = map(int,input().split())
Height = [h_i for h_i in map(int,input().split())]
Roots = []
counter = [0 for i in range(N)]
for j in range(M):
root = [c_i -1 for c_i in map(int,input().split())]
#print(root)
if Height[root[0]]<Height[root[1]]:
counter[root[0]] += 1
elif Height[root[0]]==Heigh... | N , M = map(int,input().split())
Height = [h_i for h_i in map(int,input().split())]
Roots = []
counter = [0 for i in range(N)]
for j in range(M):
root = [c_i -1 for c_i in map(int,input().split())]
#print(root)
if Height[root[0]]<Height[root[1]]:
counter[root[0]] += 1
elif Height[root[0]]==Heigh... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,565 | 423,566 | u878384274 | python |
p02689 | import numpy
inp=input().split(" ")
n=int(inp[0])
m=int(inp[1])
inh=input().split(" ")
for i in range(len(inh)):
inh[i]=int(inh[i])
pairs=numpy.zeros(2*m,dtype=">i4").reshape(-1,2)
for i in range(m):
a=input().split(" ")
pairs[i][0]=int(a[0])
pairs[i][1]=int(a[1])
lists=[[] for i in range(n+1)]
for i in range(... | import numpy
inp=input().split(" ")
n=int(inp[0])
m=int(inp[1])
inh=input().split(" ")
for i in range(len(inh)):
inh[i]=int(inh[i])
pairs=numpy.zeros(2*m,dtype=">i4").reshape(-1,2)
for i in range(m):
a=input().split(" ")
pairs[i][0]=int(a[0])
pairs[i][1]=int(a[1])
lists=[[] for i in range(n)]
for i in range(le... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 423,567 | 423,568 | u246907970 | python |
p02689 | n,m = map(int,input().split())
h = tuple(map(int,input().split()))
l = set([tuple(map(int,input().split())) for i in range(m)])
x = [[] for i in range(n)]
ans=0
for t in l:
x[t[0]-1].append(h[t[1]-1])
x[t[1]-1].append(h[t[0]-1])
for k,li in enumerate(x):
a = h[k]
if li == []:
pass
else:
... | n,m = map(int,input().split())
h = tuple(map(int,input().split()))
l = set([tuple(map(int,input().split())) for i in range(m)])
x = [[] for i in range(n)]
ans=0
for t in l:
x[t[0]-1].append(h[t[1]-1])
x[t[1]-1].append(h[t[0]-1])
for k,li in enumerate(x):
a = h[k]
if li == []:
ans+=1
else:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,577 | 423,578 | u867826040 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
g = [1]*n
for i in range(m):
a,b = map(int,input().split())
if h[a-1] >= h[b-1]:
g[b-1] = 0
elif h[b-1] >= h[a-1]:
g[a-1] = 0
print(sum(g)) | n,m = map(int,input().split())
h = list(map(int,input().split()))
g = [1]*n
for i in range(m):
a,b = map(int,input().split())
if h[a-1] >= h[b-1]:
g[b-1] = 0
if h[b-1] >= h[a-1]:
g[a-1] = 0
print(sum(g)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,579 | 423,580 | u970737570 | python |
p02689 | N,M=map(int,input().split())
H=list(map(int,input().split()))
#tenbo=[x for x in range(1,N+1)]
tenbo=[1]*N
ABlist=[]
count=N
for i in range(M):
A,B=map(int,input().split())
if H[A-1]<H[B-1]:
tenbo[A-1]=0
elif H[B-1]<H[A-1]:
tenbo[B-1]=0
elif H[A-1]==H[B-1]:
tenbo[A-1]=H[B-1]=0
#print(tenbo)
print(t... | N,M=map(int,input().split())
H=list(map(int,input().split()))
#tenbo=[x for x in range(1,N+1)]
tenbo=[1]*N
ABlist=[]
count=N
for i in range(M):
A,B=map(int,input().split())
if H[A-1]<H[B-1]:
tenbo[A-1]=0
elif H[B-1]<H[A-1]:
tenbo[B-1]=0
elif H[A-1]==H[B-1]:
tenbo[A-1]=tenbo[B-1]=0
#print(tenbo)
pri... | [
"assignment.variable.change",
"identifier.change"
] | 423,581 | 423,582 | u870736713 | python |
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
l = [[] for _ in range(n)]
ans = 0
for _ in range(m):
a, b = map(int, input().split())
l[a-1].append(h[b-1])
l[b-1].append(h[a-1])
for i in range(n):
s = h[i]
x = l[i]
print(i)
if len(x) == 0:
ans += 1
... | n, m = map(int, input().split())
h = list(map(int, input().split()))
l = [[] for _ in range(n)]
ans = 0
for _ in range(m):
a, b = map(int, input().split())
l[a-1].append(h[b-1])
l[b-1].append(h[a-1])
for i in range(n):
s = h[i]
x = l[i]
if len(x) == 0:
ans += 1
continue
... | [
"call.remove"
] | 423,585 | 423,586 | u950825280 | python |
p02689 | a,b = map(int, input().split())
List = [list(map(int, input().split())) for i in range(b+1)]
#i番目の展望台の高さ List[0][i-1](i>=1)
Flag=[1]*a
for i in range(1,b+1):
m = List[i][0]-1 # 比較する展望台の番号
n = List[i][1]-1 # 比較する展望台の番号
if List[0][m] < List[0][n]:
Flag[m]=0
elif List[0][n] < List[0][m]:
Flag[n]=0
elif L... | a,b = map(int, input().split())
List = [list(map(int, input().split())) for i in range(b+1)]
#i番目の展望台の高さ List[0][i-1](i>=1)
Flag=[1]*a
for i in range(1,b+1):
m = List[i][0]-1 # 比較する展望台の番号
n = List[i][1]-1 # 比較する展望台の番号
if List[0][m] < List[0][n]:
Flag[m]=0
elif List[0][n] < List[0][m]:
Flag[n]=0
elif L... | [
"assignment.add"
] | 423,591 | 423,592 | u113255362 | python |
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
res = [1]*n
for el in ab:
if h[el[0]-1] >= h[el[1]-1] :
res[el[1]-1] = 0
elif h[el[0]-1] <= h[el[1]-1] :
res[el[0]-1] = 0
print(sum(res))
| n, m = map(int, input().split())
h = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
res = [1]*n
for el in ab:
if h[el[0]-1] >= h[el[1]-1] :
res[el[1]-1] = 0
if h[el[0]-1] <= h[el[1]-1] :
res[el[0]-1] = 0
print(sum(res))
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,600 | 423,601 | u094158322 | python |
p02689 | n, m = (int(i) for i in input().split())
h = list(map(int,input().split()))
A = []
B = []
for i in range(m):
a, b = (int(i) for i in input().split())
A.append(a)
B.append(b)
x = [True]*n
for i in range(m):
if(h[A[i]-1] >= h[B[i]-1]):
x[B[i]-1] = False
elif(h[A[i]-1] <= h[B[i]-1]):
... | n, m = (int(i) for i in input().split())
h = list(map(int,input().split()))
A = []
B = []
for i in range(m):
a, b = (int(i) for i in input().split())
A.append(a)
B.append(b)
x = [True]*n
for i in range(m):
if(h[A[i]-1] >= h[B[i]-1]):
x[B[i]-1] = False
if(h[A[i]-1] <= h[B[i]-1]):
x[... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,629 | 423,630 | u777922433 | python |
p02689 | n, m = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
t = h[::1]
for i in range(m):
a, b = [int(i) for i in input().split()]
if h[a-1] > h[b-1]:
t[b-1] = 0
if h[a-1] < h[b-1]:
t[a-1] = 0
else:
t[a-1] = 0
t[b-1] = 0
ans = 0
for i in t:
if i !=... | n, m = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
t = h[::1]
for i in range(m):
a, b = [int(i) for i in input().split()]
if h[a-1] > h[b-1]:
t[b-1] = 0
elif h[a-1] < h[b-1]:
t[a-1] = 0
else:
t[a-1] = 0
t[b-1] = 0
ans = 0
for i in t:
if i ... | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 423,639 | 423,640 | u067694718 | python |
p02689 | N,M = map(int, input().split())
print(M)
Hs = list(map(int, input().split()))
i = 0
ABs = []
while True:
if M <= i:
break
ABs.append(list(map(int, input().split())))
i += 1
r = [0] * N
for A, B in ABs:
if Hs[A-1] <= Hs[B-1]:
r[A-1] = -1
if Hs[B-1] <= Hs[A-1]:
r[B-1] = -1
print(r.count(0))
| N,M = map(int, input().split())
Hs = list(map(int, input().split()))
i = 0
ABs = []
while True:
if M <= i:
break
ABs.append(list(map(int, input().split())))
i += 1
r = [0] * N
for A, B in ABs:
if Hs[A-1] <= Hs[B-1]:
r[A-1] = -1
if Hs[B-1] <= Hs[A-1]:
r[B-1] = -1
print(r.count(0))
| [
"call.remove"
] | 423,647 | 423,648 | u599925824 | python |
p02689 | N,M=map(int,input().split())
H=list(map(int,input().split()))
n=[1 for i in range(N)]
for i in range(M):
A,B=map(int,input().split())
if H[A-1]>H[B-1]:
n[B-1]=0
if H[A-1]<H[B-1]:
n[A-1]=0
else:
n[A-1],n[B-1]=0,0
print(sum(n)) | N,M=map(int,input().split())
H=list(map(int,input().split()))
n=[1 for i in range(N)]
for i in range(M):
A,B=map(int,input().split())
if H[A-1]>H[B-1]:
n[B-1]=0
elif H[A-1]<H[B-1]:
n[A-1]=0
else:
n[A-1]=0
n[B-1]=0
print(sum(n)) | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 423,651 | 423,652 | u962944068 | python |
p02689 | N, M = map(int, input().split())
high = list(map(int, input().split()))
road = [list(map(int, input().split())) for i in range(M)]
p=[True for _ in range(N)]
for i in road:
if high[i[0]-1]<=high[i[1]-1] and p[i[0]-1]==True:
p[i[0]-1]=False
elif high[i[0]-1]>=high[i[1]-1] and p[i[1]-1]==True:
... | N, M = map(int, input().split())
high = list(map(int, input().split()))
road = [list(map(int, input().split())) for i in range(M)]
p=[True for _ in range(N)]
for i in road:
if high[i[0]-1]<=high[i[1]-1] and p[i[0]-1]==True:
p[i[0]-1]=False
if high[i[0]-1]>=high[i[1]-1] and p[i[1]-1]==True:
... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,656 | 423,657 | u637551956 | python |
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
a = list()
b = list()
for x in range(0, m):
A, B = map(int, input().split())
a.append(A)
b.append(B)
check = [0]*n
for x, y in zip(a, b):
if check[x-1] != 1:
if h[x-1] > h[y-1]:
check[x-1] = 1
else:
... | n, m = map(int, input().split())
h = list(map(int, input().split()))
a = list()
b = list()
for x in range(0, m):
A, B = map(int, input().split())
a.append(A)
b.append(B)
check = [0]*n
for x, y in zip(a, b):
if check[x-1] != -1:
if h[x-1] > h[y-1]:
check[x-1] = 1
else:
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 423,663 | 423,664 | u806403461 | python |
p02689 | N, M = map(int, input().split())
height = input().split()
area = [[] for i in range(N)]
for i in range(M):
road = input().split()
for place in road:
area[int(road[0])-1].append(int(height[int(road[1])-1]))
area[int(road[1])-1].append(int(height[int(road[0])-1]))
counter = 0
for i in range(N):
... | N, M = map(int, input().split())
height = input().split()
area = [[] for i in range(N)]
for i in range(M):
road = input().split()
for place in road:
area[int(road[0])-1].append(int(height[int(road[1])-1]))
area[int(road[1])-1].append(int(height[int(road[0])-1]))
counter = 0
for i in range(N):
... | [
"call.remove"
] | 423,667 | 423,668 | u185393907 | python |
p02689 | n,m = list(map(int,input().strip().split()))
h = list(map(int,input().split()))
temp = [1] * n
ans = int(0)
for i in range(m):
a,b = list(map(int,input().strip().split()))
if h[a-1] > h[b-1]:
temp[b-1] *= 0
elif h[a-1] == h[b-i]:
temp[a-1] *= 0
temp[b-1] *= 0
else:
temp[a... | n,m = list(map(int,input().strip().split()))
h = list(map(int,input().split()))
temp = [1] * n
ans = int(0)
for i in range(m):
a,b = list(map(int,input().strip().split()))
if h[a-1] > h[b-1]:
temp[b-1] *= 0
elif h[a-1] == h[b-1]:
temp[a-1] *= 0
temp[b-1] *= 0
else:
temp[a... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 423,676 | 423,677 | u676258045 | python |
p02689 | N, M = map(int,input().split())
H = list(map(int,input().split()))
flag = [1] * N
for __ in range(M):
A, B = map(int,input().split())
if H[A - 1] < H[B - 1]:
flag[A - 1] = 0
elif H[A - 1] < H[B - 1]:
flag[B - 1] = 0
elif H[A - 1] == H[B - 1]:
flag[A - 1] = 0
flag[B - 1]... | N, M = map(int,input().split())
H = list(map(int,input().split()))
flag = [1] * N
for __ in range(M):
A, B = map(int,input().split())
if H[A - 1] < H[B - 1]:
flag[A - 1] = 0
elif H[A - 1] > H[B - 1]:
flag[B - 1] = 0
elif H[A - 1] == H[B - 1]:
flag[A - 1] = 0
flag[B - 1]... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,678 | 423,679 | u189056821 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
A = []
B = []
for i in range(M):
A_, B_ = map(int, input().split())
A.append(A_)
B.append(B_)
l = [1] * N
for i in range(M):
if H[A[i]-1] >= H[B[i]-1]:
l[B[i]-1] = 0
if H[A[i]-1] <= H[B[i]-1]:
l[B[i]-1] = 0
print(s... | N, M = map(int, input().split())
H = list(map(int, input().split()))
A = []
B = []
for i in range(M):
A_, B_ = map(int, input().split())
A.append(A_)
B.append(B_)
l = [1] * N
for i in range(M):
if H[A[i]-1] >= H[B[i]-1]:
l[B[i]-1] = 0
if H[A[i]-1] <= H[B[i]-1]:
l[A[i]-1] = 0
print(s... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 423,689 | 423,690 | u663438907 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
L = [0]*N
for i in range(N):
L[i] = [1]
print(L)
for i in range(M):
A, B = map(int, input().split())
if H[A-1] > H[B-1]:
L[B-1].append(0)
elif H[A-1] < H[B-1]:
L[A-1].append(0)
else:
L[A-1].append(0)
... | N, M = map(int, input().split())
H = list(map(int, input().split()))
L = [0]*N
for i in range(N):
L[i] = [1]
for i in range(M):
A, B = map(int, input().split())
if H[A-1] > H[B-1]:
L[B-1].append(0)
elif H[A-1] < H[B-1]:
L[A-1].append(0)
else:
L[A-1].append(0)
L[B-1].a... | [
"call.remove"
] | 423,693 | 423,694 | u133174241 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
root = [[] for i in range(n)]
for _ in range(n-1):
a, b = (int(x) for x in input().split())
root[b-1].append(a-1)
root[a-1].append(b-1)
ans = 0
for i in range(n):
flag = True
if len(root[i]) > 0:
for j in root[i]:
... | n,m = map(int,input().split())
h = list(map(int,input().split()))
root = [[] for i in range(n)]
for _ in range(m):
a, b = (int(x) for x in input().split())
root[b-1].append(a-1)
root[a-1].append(b-1)
ans = 0
for i in range(n):
flag = True
if len(root[i]) > 0:
for j in root[i]:
... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 423,734 | 423,735 | u411203878 | python |
p02689 | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n,m=map(int,input().split())
H=[int(_) for _ in input().split()]
HH= [0]*n
for i in range(m):
a,b=map(int,input().split())
HH[a-1]=max(HH[a-1],H[b-1])
HH[b-1]=max(HH[b-1],H[a-1])
ans=0
for i,hh in e... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n,m=map(int,input().split())
H=[int(_) for _ in input().split()]
HH= [0]*n
for i in range(m):
a,b=map(int,input().split())
HH[a-1]=max(HH[a-1],H[b-1])
HH[b-1]=max(HH[b-1],H[a-1])
ans=0
for i,hh in e... | [
"call.remove"
] | 423,753 | 423,754 | u810356688 | python |
p02689 | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
N, M = map(int, readline().split())
H = list(map(int, readline().split()))
G = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, readline().split())
G[A-1]... | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
N, M = map(int, readline().split())
H = list(map(int, readline().split()))
G = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, readline().split())
G[A-1]... | [
"expression.operation.binary.remove"
] | 423,755 | 423,756 | u016881126 | python |
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
ab = [[int(i) for i in input().split()] for i in range(m)]
l = [1] * n
for i in range(m):
if h[ab[i][0] - 1] < h[ab[i][1] - 1]:
l[ab[i][0] - 1] = 0
elif h[ab[i][0] - 1] < h[ab[i][1] - 1]:
l[ab[i][1] - 1] = 0
else:
l... | n, m = map(int, input().split())
h = list(map(int, input().split()))
ab = [[int(i) for i in input().split()] for i in range(m)]
l = [1] * n
for i in range(m):
if h[ab[i][0] - 1] < h[ab[i][1] - 1]:
l[ab[i][0] - 1] = 0
elif h[ab[i][0] - 1] > h[ab[i][1] - 1]:
l[ab[i][1] - 1] = 0
else:
l... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,769 | 423,770 | u148423304 | python |
p02689 | n,m = map(int, input().split())
h = list(map(int, input().split()))
t = [1 for i in range(n)]
for i in range(0,m):
a,b = map(int, input().split())
if h[a-1] >= h[b-1]:
t[b-1] = 0
elif h[a-1] <= h[b-1]:
t[a-1] = 0
print(sum(t)) | n,m = map(int, input().split())
h = list(map(int, input().split()))
t = [1 for i in range(n)]
for i in range(0,m):
a,b = map(int, input().split())
if h[a-1] >= h[b-1]:
t[b-1] = 0
if h[a-1] <= h[b-1]:
t[a-1] = 0
print(sum(t)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,771 | 423,772 | u589913372 | python |
p02689 | #!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import functools
import heapq
import itertools
import logging
import math
import random
import string
import sys
from argparse import ArgumentParser
from co... | #!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import functools
import heapq
import itertools
import logging
import math
import random
import string
import sys
from argparse import ArgumentParser
from co... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,775 | 423,776 | u323395306 | python |
p02689 | n, m = list(map(int, input().split(' ')))
hn = list(map(int, input().split(' ')))
abm = [None] * m
d = defaultdict(list)
for i in range(m):
v = list(map(int, input().split(' ')))
d[v[0]].append(v[1])
d[v[1]].append(v[0])
count = 0
for i in range(1, n + 1):
cand = d.get(i)
if cand is None:
... | from collections import defaultdict
n, m = list(map(int, input().split(' ')))
hn = list(map(int, input().split(' ')))
abm = [None] * m
d = defaultdict(list)
for i in range(m):
v = list(map(int, input().split(' ')))
d[v[0]].append(v[1])
d[v[1]].append(v[0])
count = 0
for i in range(1, n + 1):
ca... | [] | 423,777 | 423,778 | u940743763 | python |
p02689 | from sys import stdin
from collections import defaultdict
N,M = [int(x) for x in stdin.readline().rstrip().split()]
H = [int(x) for x in stdin.readline().rstrip().split()]
d = defaultdict(set)
for i in range(M):
A,B = [int(x) for x in stdin.readline().rstrip().split()]
d[A].add(B)
d[B].add(A)
ans = 0
f... | from sys import stdin
from collections import defaultdict
N,M = [int(x) for x in stdin.readline().rstrip().split()]
H = [int(x) for x in stdin.readline().rstrip().split()]
d = defaultdict(set)
for i in range(M):
A,B = [int(x) for x in stdin.readline().rstrip().split()]
d[A].add(B)
d[B].add(A)
ans = 0
f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,779 | 423,780 | u405256066 | python |
p02689 | from sys import stdin
from collections import defaultdict
N,M = [int(x) for x in stdin.readline().rstrip().split()]
H = [int(x) for x in stdin.readline().rstrip().split()]
d = defaultdict(set)
for i in range(M):
A,B = [int(x) for x in stdin.readline().rstrip().split()]
d[A].add(B)
d[B].add(A)
ans = 0
f... | from sys import stdin
from collections import defaultdict
N,M = [int(x) for x in stdin.readline().rstrip().split()]
H = [int(x) for x in stdin.readline().rstrip().split()]
d = defaultdict(set)
for i in range(M):
A,B = [int(x) for x in stdin.readline().rstrip().split()]
d[A].add(B)
d[B].add(A)
ans = 0
f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 423,781 | 423,780 | u405256066 | python |
p02689 | import numpy as np
N, M = map(int,input().split())
H = list(map(int,input().split()))
goodpoint = [1]*N #1 is good point
for i in range (M):
A, B = map(int,input().split())
if H[A-1] <=H[B-1]:
goodpoint[A-1] = 0
if H[B-1] <=H[A-1]:
goodpoint[B-1] = 0
print(sum((np.array(goodpoint)==0)*1))
| import numpy as np
N, M = map(int,input().split())
H = list(map(int,input().split()))
goodpoint = [1]*N #1 is good point
for i in range (M):
A, B = map(int,input().split())
if H[A-1] <=H[B-1]:
goodpoint[A-1] = 0
if H[B-1] <=H[A-1]:
goodpoint[B-1] = 0
print(sum((np.array(goodpoint)==1)*1))#... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 423,794 | 423,795 | u221345507 | python |
p02689 | n,m=map(int, input().split())
h=list(map(int, input().split()))
root=[list(map(int,input().split())) for _ in range(m)]
ans=0
lis=[1 for _ in range(n)]
for i in range(len(root)):
a=root[i][0]
b=root[i][1]
if h[a-1] > h[b-1]:
lis[b-1]=0
elif h[a-1]< h[b-1]:
lis[a-1]=0
else:
... | n,m=map(int, input().split())
h=list(map(int, input().split()))
root=[list(map(int,input().split())) for _ in range(m)]
ans=0
lis=[1 for _ in range(n)]
for i in range(len(root)):
a=root[i][0]
b=root[i][1]
if h[a-1] > h[b-1]:
lis[b-1]=0
elif h[a-1]< h[b-1]:
lis[a-1]=0
else:
... | [] | 423,798 | 423,799 | u098588273 | python |
p02689 | n,m = map(int,input().split())
h_list = list(map(int,input().split()))
n_list = [1]*n
for i in range(m):
a,b = map(int,input().split())
if h_list[a-1] > h_list[b-1]:
n_list[b-1] = 0
elif h_list[a-1] < h_list[b-1]:
n_list[b-1] = 0
else:
n_list[b-1] = 0
n_list[b-1] = 0
coun... | n,m = map(int,input().split())
h_list = list(map(int,input().split()))
n_list = [1]*n
for i in range(m):
a,b = map(int,input().split())
if h_list[a-1] > h_list[b-1]:
n_list[b-1] = 0
elif h_list[a-1] < h_list[b-1]:
n_list[a-1] = 0
else:
n_list[a-1] = 0
n_list[b-1] = 0
coun... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 423,802 | 423,803 | u482157295 | python |
p02689 | N, M = map(int, input().split())
Hi = list(map(int, input().split()))
is_judge_list = [1 for i in range(N)]
for j in range(M):
A, B = map(int, input().split())
if Hi[A-1] > Hi[B-1]:
is_judge_list[B-1] = 0
elif Hi[B-1] > Hi[A-1]:
is_judge_list[A-1] = 0
else:
is_judge_list[A-1] = ... | N, M = map(int, input().split())
Hi = list(map(int, input().split()))
is_judge_list = [1 for i in range(N)]
for j in range(M):
A, B = map(int, input().split())
if Hi[A-1] > Hi[B-1]:
is_judge_list[B-1] = 0
elif Hi[B-1] > Hi[A-1]:
is_judge_list[A-1] = 0
else:
is_judge_list[A-1] = ... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 423,817 | 423,818 | u773711732 | python |
p02689 | # -*- coding: utf-8 -*-
n, m = map(int, input().split())
h = list(map(int, input().split()))
h_cond = [True]*n
count = 0
for i in range(m):
tmp_a, tmp_b = map(int, input().split())
if h[tmp_a-1] < h[tmp_b-1]:
h_cond[tmp_a-1] = False
elif h[tmp_a-1] > h[tmp_b-1]:
h_cond[tmp_b-1] = False
... | # -*- coding: utf-8 -*-
n, m = map(int, input().split())
h = list(map(int, input().split()))
h_cond = [True]*n
count = 0
for i in range(m):
tmp_a, tmp_b = map(int, input().split())
if h[tmp_a-1] < h[tmp_b-1]:
h_cond[tmp_a-1] = False
elif h[tmp_a-1] > h[tmp_b-1]:
h_cond[tmp_b-1] = False
... | [
"identifier.change",
"call.arguments.change"
] | 423,849 | 423,850 | u326245870 | python |
p02689 | n,m=map(int,input().split())
h=list(map(int,input().split()))
ab=[list(map(int,input().split())) for i in range(m)]
d=[ [] for i in range(n+1)]
for i in range(m):
#a=ab[i][0]
#b=ab[i][1]
d[ab[i][0]].append(h[ab[i][1]-1])
d[ab[i][1]].append(h[ab[i][0]-1])
count=0
d.pop(0)
for i in range(0,len(d)):
if len(d[i])... | n,m=map(int,input().split())
h=list(map(int,input().split()))
ab=[list(map(int,input().split())) for i in range(m)]
d=[ [] for i in range(n+1)]
for i in range(m):
#a=ab[i][0]
#b=ab[i][1]
d[ab[i][0]].append(h[ab[i][1]-1])
d[ab[i][1]].append(h[ab[i][0]-1])
count=0
d.pop(0)
for i in range(0,len(d)):
if len(d[i])... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,855 | 423,856 | u017415492 | python |
p02689 | from collections import defaultdict
def main():
N, M = list(map(int, input().split(' ')))
H = list(map(int, input().split(' ')))
obs = defaultdict(list)
for _ in range(M):
A, B = list(map(int, input().split(' ')))
A -= 1
B -= 1
obs[A].append(B)
obs[B].append(A)
... | from collections import defaultdict
def main():
N, M = list(map(int, input().split(' ')))
H = list(map(int, input().split(' ')))
obs = defaultdict(list)
for _ in range(M):
A, B = list(map(int, input().split(' ')))
A -= 1
B -= 1
obs[A].append(B)
obs[B].append(A)
... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 423,869 | 423,870 | u892487306 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(M)]
tmp=[0]*N
for li in S:
A=li[0]-1
B=li[1]-1
if H[A]>=H[B]:
tmp[B]=1
elif H[A]<=H[B]:
tmp[A]=1
c=tmp.count(0)
print(c) | N, M = map(int, input().split())
H = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(M)]
tmp=[0]*N
for li in S:
A=li[0]-1
B=li[1]-1
if H[A]>=H[B]:
tmp[B]=1
if H[A]<=H[B]:
tmp[A]=1
c=tmp.count(0)
print(c) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,873 | 423,874 | u693391925 | python |
p02689 | n,m=map(int,input().split())
h=list(map(int,input().split()))
gooddict={i:1 for i in range(1,n+1)}
for i in range(m):
a,b=map(int,input().split())
if h[a-1]<=h[b-1]:
gooddict[a]=0
if h[a-1]>=h[b-1]:
gooddict[b]=0
count=0
for i in range(1,n+1):
if gooddict[i]==1:
count+=1
print(count)
print(good... | n,m=map(int,input().split())
h=list(map(int,input().split()))
gooddict={i:1 for i in range(1,n+1)}
for i in range(m):
a,b=map(int,input().split())
if h[a-1]<=h[b-1]:
gooddict[a]=0
if h[a-1]>=h[b-1]:
gooddict[b]=0
count=0
for i in range(1,n+1):
if gooddict[i]==1:
count+=1
print(count) | [
"call.remove"
] | 423,900 | 423,901 | u594956556 | python |
p02689 | N,M=map(int,input().split())
H=list(map(int,input().split()))
graph=[0]*N
for i in range(M):
A,B=map(int,input().split())
A,B=A-1,B-1
if H[A]<H[B]:
graph[A]+=1
elif H[B]>H[A]:
graph[B]+=1
else:
graph[A]+=1
graph[B]+=1
ans=graph.count(0)
print(ans) | N,M=map(int,input().split())
H=list(map(int,input().split()))
graph=[0]*N
for i in range(M):
A,B=map(int,input().split())
A,B=A-1,B-1
if H[A]<H[B]:
graph[A]+=1
elif H[B]<H[A]:
graph[B]+=1
else:
graph[A]+=1
graph[B]+=1
ans=graph.count(0)
print(ans) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,905 | 423,906 | u338824669 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
flag = [False for i in range(N)]
count = N
for i in range(M):
a, b = map(int, input().split())
if H[a - 1] <= H[b - 1] and flag[a - 1] is False:
flag[a - 1] = True
count -= 1
elif H[a - 1] >= H[b - 1] and flag[b - 1] is Fa... | N, M = map(int, input().split())
H = list(map(int, input().split()))
flag = [False for i in range(N)]
count = N
for i in range(M):
a, b = map(int, input().split())
if H[a - 1] <= H[b - 1] and flag[a - 1] is False:
flag[a - 1] = True
count -= 1
if H[a - 1] >= H[b - 1] and flag[b - 1] is Fals... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,907 | 423,908 | u581337384 | python |
p02689 | import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readli... | import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readli... | [
"control_flow.continue.add"
] | 423,931 | 423,932 | u854685063 | python |
p02689 | import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readli... | import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readli... | [
"control_flow.continue.add",
"control_flow.break.add"
] | 423,933 | 423,932 | u854685063 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = [1]*n
for i in range(m):
a,b = map(int,input().split())
if h[a-1]>h[b-1]:
ans[b-1] = 0
if h[b-1]>h[a-1]:
ans[a-1] = 0
else:
ans[a-1] = 0
ans[b-1] = 0
print(ans.count(1)) | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = [1]*n
for i in range(m):
a,b = map(int,input().split())
if h[a-1]>h[b-1]:
ans[b-1] = 0
elif h[b-1]>h[a-1]:
ans[a-1] = 0
else:
#print("a")
ans[a-1] = 0
ans[b-1] = 0
print(ans.count(1)) ... | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 423,951 | 423,952 | u021915951 | python |
p02689 | N, M = map(int,input().split())
good = [0]*N
H = list(map(int,input().split()))
for j in range(M):
a, b = map(int,input().split())
if(H[a-1] == H[b-1]):
good[a-1] += 1
good[b-1] += 1
break
elif(H[a-1] < H[b-1]):
good[a-1] += 1
else:
good[b-1] += 1
count = 0
for i in range(N):
if(good[i] ... | N, M = map(int,input().split())
good = [0]*N
H = list(map(int,input().split()))
for j in range(M):
a, b = map(int,input().split())
if(H[a-1] == H[b-1]):
good[a-1] += 1
good[b-1] += 1
elif(H[a-1] < H[b-1]):
good[a-1] += 1
else:
good[b-1] += 1
count = 0
for i in range(N):
if(good[i] == 0):
... | [
"control_flow.break.remove"
] | 423,953 | 423,954 | u927373043 | python |
p02689 | N, M = map(int, input().split())
heights = list(map(int, input().split()))
highest = [True for _ in range(N)]
for m in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
val_a = heights[a]
val_b = heights[b]
# print("a= {} b= {}".format(a,b))
# print("vala= {} valb= {}".format(val_a,va... | N, M = map(int, input().split())
heights = list(map(int, input().split()))
highest = [True for _ in range(N)]
for m in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
val_a = heights[a]
val_b = heights[b]
# print("a= {} b= {}".format(a,b))
# print("vala= {} valb= {}".format(val_a,va... | [
"assignment.remove"
] | 423,963 | 423,964 | u871303155 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
arr = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
arr[a-1].append(b-1)
arr[b-1].append(a-1)
for i in range(len(h)):
tmph = h[i]
flg = 1
if arr[i]:
for j in arr[i]:
if tmph ... | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
arr = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
arr[a-1].append(b-1)
arr[b-1].append(a-1)
for i in range(len(h)):
tmph = h[i]
flg = 1
if arr[i]:
for j in arr[i]:
if tmph ... | [
"call.remove"
] | 423,983 | 423,984 | u476124554 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
arr = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
arr[a-1].append(b-1)
arr[b-1].append(a-1)
for i in range(len(h)):
tmph = h[i]
flg = 1
if arr[i]:
for j in arr[i]:
if tmph ... | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
arr = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
arr[a-1].append(b-1)
arr[b-1].append(a-1)
for i in range(len(h)):
tmph = h[i]
flg = 1
if arr[i]:
for j in arr[i]:
if tmph ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,985 | 423,984 | u476124554 | python |
p02689 | N, M = map(int,input().split())
Hs = list(map(int,input().split()))
L = [[] for i in range(N)]
count = 0
for i in range(M):
A, B = map(int,input().split())
(L[A-1]).append(Hs[B-1])
(L[B-1]).append(Hs[A-1])
for i in range(N):
if not L[i]:
count+=1
continue
if i+1 > max(L[i]):
... | N, M = map(int,input().split())
Hs = list(map(int,input().split()))
L = [[] for i in range(N)]
count = 0
for i in range(M):
A, B = map(int,input().split())
(L[A-1]).append(Hs[B-1])
(L[B-1]).append(Hs[A-1])
for i in range(N):
if not L[i]:
count+=1
continue
if Hs[i] > max(L[i]):
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 423,994 | 423,995 | u188138642 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
l = [1] * N
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
if H[a] >= H[b]:
l[b] = 0
if a <= b:
l[a] = 0
print(sum(l))
| N, M = map(int, input().split())
H = list(map(int, input().split()))
l = [1] * N
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
if H[a] >= H[b]:
l[b] = 0
if H[a ]<= H[b]:
l[a] = 0
print(sum(l))
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 423,998 | 423,999 | u500297289 | python |
p02689 | #template
def inputlist(): return [int(k) for k in input().split()]
#template
N,M = inputlist()
H = inputlist()
graph = [[] for _ in range(N)]
print(graph)
for i in range(M):
A,B = inputlist()
A -=1
B -=1
graph[A].append(B)
graph[B].append(A)
ans = 0
for i in range(N):
h = H[i]
k = 0
fo... | #template
def inputlist(): return [int(k) for k in input().split()]
#template
N,M = inputlist()
H = inputlist()
graph = [[] for _ in range(N)]
for i in range(M):
A,B = inputlist()
A -=1
B -=1
graph[A].append(B)
graph[B].append(A)
ans = 0
for i in range(N):
h = H[i]
k = 0
for j in graph[... | [
"call.remove"
] | 424,008 | 424,009 | u490553751 | python |
p02689 | N,M = map(int,input().split())
H = list(map(int,input().split()))
li = [1 for i in range(N)]
for i in range(M):
a,b = map(int,input().split())
a-=1
b-=1
if H[a]>=H[b]:
li[b]=0
elif H[a]<=H[b]:
li[a]=0
# print(li)
ans = 0
for i in range(N):
if li[i]:
ans += 1
print(ans)... | N,M = map(int,input().split())
H = list(map(int,input().split()))
li = [1 for i in range(N)]
for i in range(M):
a,b = map(int,input().split())
a-=1
b-=1
if H[a]>=H[b]:
li[b]=0
if H[a]<=H[b]:
li[a]=0
# print(li)
ans = 0
for i in range(N):
if li[i]:
ans += 1
print(ans)
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 424,010 | 424,011 | u626468554 | python |
p02689 | # -*- coding: utf-8 -*-
n,m=map(int,input().split())
h=list(map(int,input().split()))
ans=[True for _ in range(n)]
for i in range(m):
a,b=map(int,input().split())
if h[a-1]>=h[b-1]:
ans[b-1]=False
elif h[a-1]<=h[b-1]:
ans[a-1]=False
print(ans.count(True)) | # -*- coding: utf-8 -*-
n,m=map(int,input().split())
h=list(map(int,input().split()))
ans=[True for _ in range(n)]
for i in range(m):
a,b=map(int,input().split())
if h[a-1]>=h[b-1]:
ans[b-1]=False
if h[a-1]<=h[b-1]:
ans[a-1]=False
print(ans.count(True)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 424,012 | 424,013 | u578694888 | python |
p02689 | n, m = map(int, input().split())
H = list(map(int, input().split()))
X=[[0] for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
X[a-1].append(b)
X[b-1].append(a)
t=0
for i in range(n):
E=list(H[k-1] for k in X[i])
if max(E) < H[i]:
t+=1
print(t) | n, m = map(int, input().split())
H = list(map(int, input().split()))
X=[[] for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
X[a-1].append(b)
X[b-1].append(a)
t=0
for i in range(n):
E=[0]+list(H[k-1] for k in X[i])
if max(E) < H[i]:
t+=1
print(t) | [
"assignment.change"
] | 424,028 | 424,029 | u745687363 | python |
p02689 | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10 ** 7)
def main():
N, M = map(int, input().split())
H = list(map(int, input().split()))
good = [True] * N
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
if H[a] < H[b]:
goo... | import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10 ** 7)
def main():
N, M = map(int, input().split())
H = list(map(int, input().split()))
good = [True] * N
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
if H[a] < H[b]:
goo... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 424,046 | 424,047 | u325956328 | python |
p02689 | import collections
n,m = list(map(int,input().split()))
tower_high = list(map(int,input().split()))
good_tower = [1]*n
def check_tower(a,b):
if tower_high[a]<tower_high[b]:
good_tower[a]=0
elif tower_high[a] > tower_high[b]:
good_tower[b]=0
else:
good_tower[a]=0
good_tower[b... | import collections
n,m = list(map(int,input().split()))
tower_high = list(map(int,input().split()))
good_tower = [1]*n
def check_tower(a,b):
if tower_high[a]<tower_high[b]:
good_tower[a]=0
elif tower_high[a] > tower_high[b]:
good_tower[b]=0
else:
good_tower[a]=0
good_tower[b... | [
"call.remove"
] | 424,050 | 424,051 | u657786757 | python |
p02689 | N, M = map(int, input().split())
high_list = list(map(int, input().split()))
check_list = [1]*N
for i in range(M):
a_, b_ = map(int, input().split())
if high_list[a_-1] < high_list[b_-1]:
check_list[a_-1] = 0
elif high_list[a_-1] > high_list[b_-1]:
check_list[b_-1] = 0
elif high_list[a_-1] == high_lis... | N, M = map(int, input().split())
high_list = list(map(int, input().split()))
check_list = [1]*N
for i in range(M):
a_, b_ = map(int, input().split())
if high_list[a_-1] < high_list[b_-1]:
check_list[a_-1] = 0
elif high_list[a_-1] > high_list[b_-1]:
check_list[b_-1] = 0
elif high_list[a_-1] == high_l... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 424,054 | 424,055 | u756030237 | python |
p02689 | N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
A, B = list(map(int, input().split()))
G[A - 1].append(B-1)
G[B-1].append(A-1)
ans = 0
for i in range(N):
self_h = H[i]
self_max_flag = True
for to in range(len(G[i])):
... | N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
A, B = list(map(int, input().split()))
G[A - 1].append(B - 1)
G[B - 1].append(A - 1)
ans = 0
for i in range(N):
self_h = H[i]
self_max_flag = True
for to in G[i]:
... | [
"call.remove",
"call.arguments.change"
] | 424,066 | 424,067 | u880400515 | python |
p02689 | N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
A, B = list(map(int, input().split()))
G[A - 1].append(B-1)
G[B-1].append(A-1)
ans = 0
for i in range(N):
self_h = H[i]
self_max_flag = True
for to in range(len(G[i])):
... | N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
G = [[] for i in range(N)]
for i in range(M):
A, B = list(map(int, input().split()))
G[A - 1].append(B - 1)
G[B - 1].append(A - 1)
ans = 0
for i in range(N):
self_h = H[i]
self_max_flag = True
for to in G[i]:
... | [
"call.remove",
"call.arguments.change"
] | 424,068 | 424,067 | u880400515 | python |
p02689 | N,M = map(int,input().split())
H = [int(x) for x in input().split()]
AB = [[int(x) for x in input().split()]for i in range(M)]
good = [-1]*N
for j in range(M):
if H[AB[j][0]-1] > H[AB[j][1]-1]:
good[AB[j][0]-1] = 1
good[AB[j][1]-1] = 0
elif H[AB[j][0]-1] < H[AB[j][1]-1]:
good[AB[j][0]-1] = 0
good... | N,M = map(int,input().split())
H = [int(x) for x in input().split()]
AB = [[int(x) for x in input().split()]for i in range(M)]
good = [-1]*N
for j in range(M):
if H[AB[j][0]-1] > H[AB[j][1]-1]:
good[AB[j][0]-1] *= 1
good[AB[j][1]-1] *= 0
elif H[AB[j][0]-1] < H[AB[j][1]-1]:
good[AB[j][0]-1] *= 0
g... | [
"assignment.value.change"
] | 424,069 | 424,070 | u855378574 | python |
p02689 | n, m = map(int, input().split())
hList = [int(x) for x in input().split()]
tenboudai = [1 for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
if hList[a - 1] == hList[b - 1]:
tenboudai[a - 1] = 0
tenboudai[b - 1] = 0
elif hList[a - 1] > hList[b - 1]:
tenboudai[b... | n, m = map(int, input().split())
hList = [int(x) for x in input().split()]
tenboudai = [1 for i in range(n)]
for i in range(m):
a, b = map(int, input().split())
if hList[a - 1] == hList[b - 1]:
tenboudai[a - 1] = 0
tenboudai[b - 1] = 0
elif hList[a - 1] > hList[b - 1]:
tenboudai[b... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 424,083 | 424,084 | u693945629 | python |
p02689 | import sys
input = sys.stdin.readline
def main():
N,M = map(int,input().split())
H = tuple(map(int,input().split()))
good = [1]*N
for _ in range(M):
a,b = map(int,input().split())
a-=1;b-=1
if H[a]<H[b]:
good[a] = 0
elif H[a] > H[b]:
good[a] = 0
... | import sys
input = sys.stdin.readline
def main():
N,M = map(int,input().split())
H = tuple(map(int,input().split()))
good = [1]*N
for _ in range(M):
a,b = map(int,input().split())
a-=1;b-=1
if H[a]<H[b]:
good[a] = 0
elif H[a] ==H[b]:
good[a] = 0
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 424,098 | 424,099 | u704284486 | python |
p02690 | x=int(input())
for i in range(-118,120):
for j in range(-119,1119):
if i**5+j**5==x:
print(i,j)
exit() | x=int(input())
for i in range(-118,120):
for j in range(-119,1119):
if i**5-j**5==x:
print(i,j)
exit() | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 424,160 | 424,161 | u583507988 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
h = []
for i in H:
h.append(i)
for i in range(M):
a, b = map(int, input().split())
if h[a-1] <= H[b-1] and h[b-1] != -1:
h[a-1] = -1
if h[b-1] <= H[a-1] and h[b-1] != -1:
h[b-1] = -1
ans = N
for i in h:
if i == -1... | N, M = map(int, input().split())
H = list(map(int, input().split()))
h = []
for i in H:
h.append(i)
for i in range(M):
a, b = map(int, input().split())
if h[a-1] <= H[b-1] and h[a-1] != -1:
h[a-1] = -1
if h[b-1] <= H[a-1] and h[b-1] != -1:
h[b-1] = -1
ans = N
for i in h:
if i == -1... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 424,184 | 424,185 | u513434790 | python |
p02689 | n,m=map(int, input().split())
h = list(map(int, input().split()))
ab=[list(map(int,list(input().split()))) for i in range(m)]
ans = [1]*n
for i in ab:
if h[i[0]-1] <= h[i[1]-1]:
ans[i[0]-1] = 0
if h[i[0]-1] >= h[i[1]-1]:
ans[i[0]-2] = 0
print(ans.count(1)) | n,m=map(int, input().split())
h = list(map(int, input().split()))
ab=[list(map(int,list(input().split()))) for i in range(m)]
ans = [1]*n
for i in ab:
if h[i[0]-1] <= h[i[1]-1]:
ans[i[0]-1] = 0
if h[i[0]-1] >= h[i[1]-1]:
ans[i[1]-1] = 0
print(ans.count(1)) | [
"literal.number.integer.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 424,197 | 424,198 | u300579805 | python |
p02689 | # coding: utf-8
def main():
N, M = map(int, input().split())
H = list(map(int, input().split()))
A = [None] * M
B = [None] * M
for i in range(M):
A[i], B[i] = map(int, input().split())
A[i] -= 1
B[i] -= 1
paths = {i: [] for i in range(N)}
for i in range(M):
... | # coding: utf-8
def main():
N, M = map(int, input().split())
H = list(map(int, input().split()))
A = [None] * M
B = [None] * M
for i in range(M):
A[i], B[i] = map(int, input().split())
A[i] -= 1
B[i] -= 1
paths = [[] for _ in range(N)]
for i in range(M):
... | [
"assignment.value.change",
"identifier.change"
] | 424,199 | 424,200 | u063896676 | python |
p02689 | N,M = map(int,input().split())
H = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(M)]
load = [[] for _ in range(N)]
ans = 0
for a,b in AB:
a-=1
b-=1
load[a].append(b)
load[b].append(a)
for i,lis in enumerate(load):
if len(lis)==N-1:
ans+=1
else:
judge = True
... | N,M = map(int,input().split())
H = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(M)]
load = [[] for _ in range(N)]
ans = 0
for a,b in AB:
a-=1
b-=1
load[a].append(b)
load[b].append(a)
for i,lis in enumerate(load):
if len(lis)==0:
ans+=1
else:
judge = True
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 424,205 | 424,206 | u268554510 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
g = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
g[a].append(h[b])
g[b].append(h[a])
ans = 0
for i in range(n):
if len(g[i]) == 0:
ans +=1
continue
if h[i] >= ma... | n,m = map(int,input().split())
h = list(map(int,input().split()))
g = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
g[a].append(h[b])
g[b].append(h[a])
ans = 0
for i in range(n):
if len(g[i]) == 0:
ans +=1
continue
if h[i] > max... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 424,217 | 424,218 | u818349438 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
g = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
g[a].append(h[b])
g[b].append(h[a])
ans = 0
for i in range(n):
if len(g[i]) == 0:continue
if h[i] >= max(g[i]):ans += 1
print(ans)
| n,m = map(int,input().split())
h = list(map(int,input().split()))
g = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
g[a].append(h[b])
g[b].append(h[a])
ans = 0
for i in range(n):
if len(g[i]) == 0:
ans +=1
continue
if h[i] > max... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 424,219 | 424,218 | u818349438 | python |
p02689 | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from collections import deque
from math import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = float('inf')
#############
# Functions #
###########... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
from collections import deque
from math import gcd
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = float('inf')
#############
# Functions #
###########... | [
"expression.operation.binary.remove"
] | 424,222 | 424,223 | u493130708 | python |
p02690 | x = int(input())
for a in range(-120,121):
for b in range(-120,121):
if a**5 - b**5 == x:
print(a,b)
break
| x = int(input())
for a in range(-120,121):
for b in range(-120,121):
if a**5 - b**5 == x:
print(a,b)
exit()
| [
"control_flow.break.remove",
"control_flow.exit.add",
"call.add"
] | 424,258 | 424,259 | u295120316 | python |
p02690 | x=int(input())
for i in range(-200,200):
for j in range(-200,200):
if i**5-j**5==x:
prtin(i,j)
exit()
| x=int(input())
for i in range(-200,200):
for j in range(-200,200):
if i**5-j**5==x:
print(i,j)
exit()
| [
"identifier.change",
"call.function.change"
] | 424,266 | 424,267 | u344065503 | python |
p02690 | x = int(input())
aa, bb = 0, 0
for i in range(-200, 200):
for j in range(-200, 200):
if(j**5 - i**5 == x):
aa, bb = i, j
if(aa != 0 or bb != 0):
break
if(aa != 0 or bb != 0):
break
print(str(aa) + " " + str(bb)) | x = int(input())
aa, bb = 0, 0
for i in range(-200, 200):
for j in range(-200, 200):
if(i**5 - j**5 == x):
aa, bb = i, j
if(aa != 0 or bb != 0):
break
if(aa != 0 or bb != 0):
break
print(str(aa) + " " + str(bb)) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 424,319 | 424,320 | u583276018 | python |
p02690 | import sys
def resolve(in_):
x = int(in_.read())
for a in range(-118, 119 + 1):
for b in range(-118, 119 + 1):
if x == a ** 5 - b ** 5:
return a, b
raise ValueError()
def main():
answer = resolve(sys.stdin.buffer)
print('{} {}'.format(answer))
if __name__ ==... | import sys
def resolve(in_):
x = int(in_.read())
for a in range(-118, 119 + 1):
for b in range(-118, 119 + 1):
if x == a ** 5 - b ** 5:
return a, b
raise ValueError()
def main():
answer = resolve(sys.stdin.buffer)
print('{} {}'.format(*answer))
if __name__ =... | [
"call.arguments.change"
] | 424,325 | 424,326 | u317423698 | python |
p02690 | x=int(input())
for i in range(-120,120):
for j in range(-120,120):
if i**5-j**5==x:
print(i,j)
break | x=int(input())
for i in range(-120,120):
for j in range(-120,120):
if i**5-j**5==x:
print(i,j)
exit() | [
"control_flow.break.remove",
"control_flow.exit.add",
"call.add"
] | 424,329 | 424,330 | u768256617 | python |
p02690 | x=int(input())
for i in range(-120,120):
for j in range(-120.120):
if i**5-j**5==x:
print(i,j)
break | x=int(input())
for i in range(-120,120):
for j in range(-120,120):
if i**5-j**5==x:
print(i,j)
exit() | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add",
"control_flow.break.remove",
"control_flow.exit.add",
"call.add"
] | 424,331 | 424,330 | u768256617 | python |
p02690 | x = int(input())
for i in range(0, 120):
for j in range(-119, 120):
if (i**5 + j**5) == x:
print(i,j)
exit()
| x = int(input())
for i in range(-119, 120):
for j in range(-119, 120):
if i**5 - j**5 == x:
print(i,j)
exit() | [
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.unary.add",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 424,436 | 424,437 | u188827677 | python |
p02690 | x = int(input())
for i in range(0, 120):
for j in range(-119, 120):
if (i**5 + j**5) == x:
print(i,j)
exit()
| x = int(input())
for i in range(0, 120):
for j in range(-119, 120):
if (i**5 - j**5) == x:
print(i,j)
exit()
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 424,436 | 424,439 | u188827677 | python |
p02690 | x = int(input())
for a in range(1000):
for b in range(1000):
if a ** 5 - b ** 5 == x:
print(a,b)
exit()
| x = int(input())
for a in range(-1000,1000):
for b in range(-1000,1000):
if a ** 5 - b ** 5 == x:
print(a,b)
exit()
| [
"call.arguments.add"
] | 424,474 | 424,475 | u626217906 | python |
p02690 | x=int(input())
for i in range(-118,120):
for j in range(-118,120):
if i**2-j**2==x:
print(i,j)
exit(1)
| x=int(input())
# an = n^5 - (n - 1)^5
# a -> 120~-119 -> -118~119
# b -> 119~-120 -> -119~118
for i in range(-118,120):
for j in range(-119,119):
if i**5-j**5==x:
print(i,j)
exit()
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 424,490 | 424,489 | u322616042 | python |
p02690 | X = int(input())
for i in range(-100,101):
for j in range(-100,101):
if i**5+j**5==X:
print(i,j)
exit() | X = int(input())
for i in range(-1000,1001):
for j in range(-1000,1001):
if i**5-j**5==X:
print(i,j)
exit() | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 424,551 | 424,550 | u759412327 | python |
p02690 | import sys
import heapq
from decimal import Decimal
input = sys.stdin.readline
x = int(input())
for i in range(1,1000):
for j in range(-1000,1000):
if i**5 + j**5 == x:
print(i,j)
exit(0) | import sys
import heapq
from decimal import Decimal
input = sys.stdin.readline
x = int(input())
for i in range(-1000,1000):
for j in range(-1000,1000):
if i**5 - j**5 == x:
print(i,j)
exit(0) | [
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.unary.add",
"control_flow.loop.range.bounds.upper.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 424,588 | 424,589 | u048004795 | python |
p02690 | import sys
import heapq
from decimal import Decimal
input = sys.stdin.readline
x = int(input())
for i in range(-1000,1000):
for j in range(-1000,1000):
if i**5 + j**5 == x:
print(i,j)
break
| import sys
import heapq
from decimal import Decimal
input = sys.stdin.readline
x = int(input())
for i in range(-1000,1000):
for j in range(-1000,1000):
if i**5 - j**5 == x:
print(i,j)
exit(0) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.exit.add",
"call.arguments.add"
] | 424,590 | 424,589 | u048004795 | python |
p02690 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import product
def main():
x = int(input())
n5 = [i**5 for i in range(1000)]
c = product(n5, repeat=2)
for ce in c:
print(ce)
if ce[0] + ce[1] == x:
r = (int(ce[0]**0.2), int(ce[1]**0.2)* -1)
... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
#import numpy as np
from itertools import product
def main():
x = int(input())
n5 = [i**5 for i in range(201)]
c = product(n5, repeat=2)
for ce in c:
if ce[0] + ce[1] == x:
r = (int(ce[0]**0.2), int(ce[1]**0.2)* -1)
... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.remove"
] | 424,599 | 424,600 | u072717685 | python |
p02690 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import combinations
def main():
x = int(input())
n5 = [i**5 for i in range(65)]
c = combinations(n5, 2)
for ce in c:
if ce[0] + ce[1] == x:
r = (int(ce[0]**0.2), int(ce[1]**0.2)* -1)
break
... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
#import numpy as np
from itertools import product
def main():
x = int(input())
n5 = [i**5 for i in range(201)]
c = product(n5, repeat=2)
for ce in c:
if ce[0] + ce[1] == x:
r = (int(ce[0]**0.2), int(ce[1]**0.2)* -1)
... | [
"identifier.change",
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.function.change"
] | 424,602 | 424,600 | u072717685 | python |
p02690 | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import product
def main():
x = int(input())
n5 = [i**5 for i in range(1000)]
c = product(n5, repeat=2)
for ce in c:
print(ce)
if ce[0] + ce[1] == x:
r = (int(ce[0]**0.2), int(ce[1]**0.2)* -1)
... | import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from itertools import product
def main():
x = int(input())
n5 = [i**5 for i in range(1000)]
c = product(n5, repeat=2)
for ce in c:
if ce[0] + ce[1] == x:
r = (int(ce[0]**0.2), int(ce[1]**0.2)* -1)
break
... | [
"call.remove"
] | 424,599 | 424,604 | u072717685 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.