Datasets:

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
p02690
x = int(input()) for i in range(120): for j in range(-119, a): if i**5 - j**5 == x: print(i, j) exit()
x=int(input()) for i in range(120): for j in range(-95,i): if i**5-j**5==x:print(i,j);exit()
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "identifier.change" ]
426,625
426,632
u764215612
python
p02690
x = int(input()) for i in range(120): for j in range(-119, a): if i**5 - j**5 == x: print(i, j) exit()
x = int(input()) for i in range(120): for j in range(-95, i): if i**5 - j**5 == x: print(i, j) exit()
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "identifier.change" ]
426,625
426,633
u764215612
python
p02690
x = int(input()) for i in range(120): for j in range(-119, a): if i**5 - j**5 == x: print(i, j) exit()
x = int(input()) for i in range(120): for j in range(-99, i): if i**5 - j**5 == x: print(i, j) exit()
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "identifier.change" ]
426,625
426,634
u764215612
python
p02690
x = int(input()) for i in range(120): for j in range(-119, a): if i**5 - j**5 == x: print(i, j) exit()
x = int(input()) for i in range(120): for j in range(-119, i): if i**5 - j**5 == x: print(i, j) exit()
[ "identifier.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
426,625
426,635
u764215612
python
p02690
x = int(input()) for i in range(-118,120): for j in range(-119,129): if i**5 - j**5 == x: print(i, j)
x = int(input()) for i in range(120): for j in range(-119,129): if i**5 - j**5 == x: print(i, j) exit()
[ "call.arguments.change", "call.add" ]
426,636
426,637
u764215612
python
p02690
x = int(input()) for i in range(-118,120): for j in range(-119,129): if i**5 - j**5 == x: print(i, j)
x=int(input()) for i in range(-118,120): for j in range(-119,129): if i**5-j**5==x: print(i,j) exit()
[ "call.add" ]
426,636
426,638
u764215612
python
p02690
from collections import defaultdict as dc x = int(input()) d = dc(lambda:0) for i in range(10): d[i**5] = i # print(d) f=0 l = list(d.items()) # print(l) for i in range(len(l)): for j in range(len(l)): if l[i][0] - l[j][0] == x: print(l[i][1],l[j][1]) f=1 break ...
from collections import defaultdict as dc x = int(input()) d = dc(lambda:0) for i in range(200): d[i**5] = i # print(d) f=0 l = list(d.items()) # print(l) for i in range(len(l)): for j in range(len(l)): if l[i][0] - l[j][0] == x: print(l[i][1],l[j][1]) f=1 break ...
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
426,646
426,647
u627327835
python
p02690
from collections import defaultdict as dc x = int(input()) d = dc(lambda:0) for i in range(10): d[i**5] = i # print(d) f=0 l = list(d.items()) # print(l) for i in range(len(l)): for j in range(len(l)): if l[i][0] - l[j][0] == x: print(l[i][1],l[j][1]) f=1 break ...
from collections import defaultdict as dc x = int(input()) d = dc(lambda:0) for i in range(200): d[i**5] = i # print(d) f=0 l = list(d.items()) # print(l) for i in range(len(l)): for j in range(len(l)): if l[i][0] - l[j][0] == x: print(l[i][1],l[j][1]) f=1 break ...
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "identifier.change", "variable_access.subscript.index.change", "io.output.change" ]
426,648
426,647
u627327835
python
p02690
x=int(input()) for i in range(-500,501): for j in range(-500,501): if i**5+j**5==x: print(i,j) exit()
x=int(input()) for i in range(-500,501): for j in range(-500,501): if i**5-j**5==x: print(i,j) exit()
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
426,672
426,673
u350248178
python
p02690
x = int(input()) for a in range(200): for b in range(-200, a): if a**5-b**5==x: print(a, b) break
x = int(input()) for a in range(200): for b in range(-200, a): if a**5-b**5==x: print(a, b) break else: continue break
[ "control_flow.continue.add", "control_flow.break.add" ]
426,697
426,698
u318127926
python
p02690
X = int(input()) for A in range(-120, 120): for B in range(-120,120): if A**5 - B**5 == X: print(str(A) + " " + str(B)) break break
X = int(input()) for A in range(-120, 120): for B in range(-120, 120): if A**5 - B**5 == X: print(str(A) + " " + str(B)) quit()
[ "call.arguments.change" ]
426,739
426,740
u817692975
python
p02690
def main(x): for i in range(-120,120): for j in range(-120,120): if(i**5-j**5 == x): print(str(i)+" "+str(j)) return if __name__ == '__main__': main(input())
def main(x): for i in range(-120,120): for j in range(-120,120): if(i**5-j**5 == int(x)): print(str(i)+" "+str(j)) return if __name__ == '__main__': main(input())
[ "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change", "call.add" ]
426,868
426,869
u929996201
python
p02690
X = int(input()) for i in range(-130, 130): for j in range(-130, 130): if X == i ** 5 - j ** 5: print(i, j)
X = int(input()) for i in range(-130, 130): for j in range(-130, 130): if X == i ** 5 - j ** 5: print(i, j) exit()
[ "call.add" ]
426,878
426,879
u186542450
python
p02690
X = int(input()) for i in range(-130, 130): for j in range(-130, 130): if X == i ** 5 + j ** 5: print(i, j)
X = int(input()) for i in range(-130, 130): for j in range(-130, 130): if X == i ** 5 - j ** 5: print(i, j) exit()
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change", "call.add" ]
426,880
426,879
u186542450
python
p02690
import sys def f(x): N = -1000 for a in range(-N, N+1): A = a**5 B = A-x for j in range(-N, N+1): if j ** 5 == B: print(a, j) return x, = map(int, input().split()) f(x)
import sys def f(x): N = 1000 for a in range(-N, N+1): A = a**5 B = A-x for j in range(-N, N+1): if j ** 5 == B: print(a, j) return x, = map(int, input().split()) f(x)
[ "expression.operation.unary.arithmetic.remove" ]
426,887
426,888
u941407962
python
p02690
import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul from copy import deepcopy from string import ascii_lowercase, ascii_uppercase...
import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul from copy import deepcopy from string import ascii_lowercase, ascii_uppercase...
[ "identifier.change", "control_flow.branch.if.condition.change" ]
426,889
426,890
u083960235
python
p02690
def f(a,b): return a**5 - b**5 x = int(input()) for a in range(-3,3): for b in range(-3,3): if f(a,b) == x: print(a,b) quit()
def f(a,b): return a**5 - b**5 x = int(input()) for a in range(-125,125): for b in range(-125,125): if f(a,b) == x: print(a,b) quit()
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
426,900
426,901
u257856080
python
p02690
def abc166_d(): x = int(input()) for i in range(-126, 127): for j in range(-126, 127): if i**5 + j**5 == x: print('{} {}'.format(i, j)) return abc166_d()
def abc166_d(): x = int(input()) for i in range(-126, 127): for j in range(-126, 127): if i**5 - j**5 == x: print('{} {}'.format(i, j)) return abc166_d()
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
426,909
426,910
u426764965
python
p02690
N=int(input()) for A in range(-118,120): for B in range(-119.119): if A**5-B**5==N: print(A,B)
N=int(input()) for A in range(-118,120): for B in range(-119,119): if A**5-B**5==N: print(A,B) exit()
[ "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "call.arguments.add", "call.add" ]
426,957
426,958
u109617108
python
p02690
N=int(input()) for A in range(-118,120): for B in range(-119.119): if A**5-B**5==N: print(A,B)
N=int(input()) for A in range(-118,120): for B in range(-119,119): if A**5-B**5==N: print(A,B) exit()
[ "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "call.arguments.add", "call.add" ]
426,959
426,958
u109617108
python
p02690
x = int(input()) for a in range(-200, 200): for b in range(-200, 200): if a**5 - b**5 == x: print(a, b) break
x = int(input()) for a in range(-200, 200): for b in range(-200, 200): if a**5 - b**5 == x: print(a, b) exit()
[ "control_flow.break.remove", "control_flow.exit.add", "call.add" ]
426,960
426,961
u933341648
python
p02690
def resolve(): x = int(input()) five = [] for i in range(-1000, 1001): five.append(i ** 5) for i in range(len(five)): for j in range(len(five)): if x == abs(five[i] - five[j]): if five[i] >= five[j]: print("{} {}".format(i - 999, j - 999))...
def resolve(): x = int(input()) five = [] for i in range(-1000, 1001): five.append(i ** 5) for i in range(len(five)): for j in range(len(five)): if x == abs(five[i] - five[j]): if five[i] >= five[j]: print("{} {}".format(i - 1000, j - 1000...
[ "literal.number.integer.change", "call.arguments.change", "io.output.change", "expression.operation.binary.change" ]
427,012
427,013
u793868662
python
p02690
x = int(input()) lower = -1 upper = -1 for i in range(100000000): pow5 = pow(i, 5) if lower == -1 and pow5 >= x: lower = i - 1 break for i in range(lower, 100000000): pow5 = pow(i, 5) if upper == -1 and pow5 - pow(i-1, 5) >= x: upper = i break for a in range(lower-1, u...
x = int(input()) lower = -1 upper = -1 for i in range(100000000): pow5 = pow(i, 5) if lower == -1 and pow5 >= x: lower = i - 1 break for i in range(lower, 100000000): pow5 = pow(i, 5) if upper == -1 and pow5 - pow(i-1, 5) >= x: upper = i break for a in range(-upper-1, ...
[ "call.arguments.change", "expression.operation.binary.change", "control_flow.loop.range.bounds.upper.change", "expression.operation.unary.add" ]
427,019
427,020
u059407991
python
p02690
X = int(input()) #x^5-y^5=(x-y)(x^4+x^3y+x^2y^2+xy^3+y^4) #for x in range(1, 121): # if ((x**5) - ((x-1)**5)) >= 1000000000: # print(x) for a in range(0, 121): for b in reversed(range(-122, 120)): if b**5 == a**5-X: print(a, b) break
X = int(input()) #x^5-y^5=(x-y)(x^4+x^3y+x^2y^2+xy^3+y^4) #for x in range(1, 121): # if ((x**5) - ((x-1)**5)) >= 1000000000: # print(x) for a in range(0, 121): for b in reversed(range(-122, 120)): if b**5 == a**5-X: print(a, b) exit()
[ "control_flow.break.remove", "control_flow.exit.add", "call.add" ]
427,042
427,043
u449863068
python
p02690
X = int(input()) #x^5-y^5=(x-y)(x^4+x^3y+x^2y^2+xy^3+y^4) #for x in range(1, 121): # if ((x**5) - ((x-1)**5)) >= 1000000000: # print(x) for a in range(0, 121): for b in reversed(range(-121, 120)): if b**5 == a**5-X: print(a, b) break
X = int(input()) #x^5-y^5=(x-y)(x^4+x^3y+x^2y^2+xy^3+y^4) #for x in range(1, 121): # if ((x**5) - ((x-1)**5)) >= 1000000000: # print(x) for a in range(0, 121): for b in reversed(range(-122, 120)): if b**5 == a**5-X: print(a, b) exit()
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "control_flow.break.remove", "control_flow.exit.add", "call.add" ]
427,044
427,043
u449863068
python
p02690
x = int(input()) d = dict() for i in range(-100, 101): d[i**5] = i for i in d: if x+i in d: print(d[i], d[x+i]) break
x = int(input()) d = dict() for i in range(-200, 201): d[i**5] = i for i in d: if x+i in d: print(d[x+i], d[i]) break
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "expression.operation.binary.remove" ]
427,091
427,090
u687667446
python
p02690
a = int(input()) for i in range(-1000, 1000): for j in range(-1000, 1000): if i**5 - j**5 == a: print(i,j) break
a = int(input()) for i in range(-1000, 1000): for j in range(-1000, 1000): if i**5 - j**5 == a: print(i,j) quit()
[ "call.add" ]
427,119
427,120
u948875995
python
p02690
x = int(input()) for a in range(-200,200): for b in range(-200,200): if pow(a,5)- pow(b,5)==x: print(a,b) break
x = int(input()) for a in range(-200,200): for b in range(-200,200): if pow(a,5)- pow(b,5)==x: print(a,b) exit()
[ "control_flow.break.remove", "control_flow.exit.add", "call.add" ]
427,238
427,239
u888100977
python
p02690
x = int(input()) q = 0 while abs(x) > q**5: q += 1 deta = False for A in range(-q, q+1): if deta: break for B in range(-q, q+1): if A**5 - B**5 == x: print(A,B) break
x = int(input()) q = 0 while abs(x) > q**4: q += 1 deta = False for A in range(-q, q+1): if deta: break for B in range(-q, q+1): if A**5 - B**5 == x: print(A,B) deta = True break
[ "literal.number.integer.change", "control_flow.loop.condition.change" ]
427,247
427,246
u973108807
python
p02690
x = int(input()) for a in range(10**4): for b in range(10**4): if(a**5 + b**5 == x): print(a, -b) break elif(a**5 - b**5 == x): print(a, b) break else: break
x = int(input()) for a in range(10**3): for b in range(10**3): if(a**5 + b**5 == x): print(a, -b) break elif(a**5 - b**5 == x): print(a, b) break else: continue break
[ "literal.number.integer.change", "call.arguments.change", "expression.operation.binary.change", "control_flow.loop.range.bounds.upper.change", "control_flow.continue.add" ]
427,304
427,305
u578323547
python
p02690
x = int(input()) for a in range(10**4): for b in range(10**4): if(a**5 + b**5 == x): print(a, -b) break elif(a**5 - b**5 == x): print(a, b) break else: break
x = int(input()) for a in range(10**4): for b in range(10**4): if(a**5 + b**5 == x): print(a, -b) break elif(a**5 - b**5 == x): print(a, b) break else: continue break
[ "control_flow.continue.add" ]
427,304
427,307
u578323547
python
p02690
X = int(input()) p = [0]*1000 flag = False for i in range(1000): p[i] = i**5 for i in range(1,1000): for j in range(1,1000): if p[i]-p[j] == X: a = i b = j flag=True if p[i] + p[j] ==X: a=i b=-j flag=True ...
X = int(input()) p = [0]*1000 flag = False for i in range(1000): p[i] = i**5 for i in range(1000): for j in range(1000): if p[i]-p[j] == X: a = i b = j flag=True if p[i] + p[j] ==X: a=i b=-j flag=True i...
[ "call.arguments.change" ]
427,312
427,313
u226849101
python
p02690
x=int(input()) for a in range(-500,500,1): for b in range(-500,500,1): if x==pow(a,5)-pow(b,5): print(a,b)
x=int(input()) for a in range(-500,500,1): for b in range(-500,500,1): if x==pow(a,5)-pow(b,5): print(a,b) exit()
[ "call.add" ]
427,341
427,342
u518064858
python
p02690
X = int(input()) N = 200 for i in range(N): for j in range(N): if i**5 - j**5 == X: print(i, j) exit() if (-i)**5 - j**5 == X: print(i, j) exit() if i**5 - (-j)**5 == X: print(i, j) exit() if (-i)**5 - (-j)**5 ==...
X = int(input()) N = 200 for i in range(N): for j in range(N): if i**5 - j**5 == X: print(i, j) exit() if (-i)**5 - j**5 == X: print(-i, j) exit() if i**5 - (-j)**5 == X: print(i, -j) exit() if (-i)**5 - (-j)**5 ...
[ "expression.operation.unary.add", "call.arguments.change" ]
427,345
427,346
u865298224
python
p02690
X = int(input()) for a in range(-200, 200): for b in range(-200, 200): if a**5-b**5 == X: print(a, b) break
X = int(input()) for a in range(-200, 200): for b in range(-200, 200): if a**5-b**5 == X: print(a, b) break else: continue break
[ "control_flow.continue.add", "control_flow.break.add" ]
427,350
427,351
u830054172
python
p02690
a=int(input()) ok=False for i in range(-120,120): for j in range(-120,120): if i**5+j**5==a: print(i,j) ok=True break if ok: break
a=int(input()) ok=False for i in range(-120,120): for j in range(-120,120): if i**5-j**5==a: print(i,j) ok=True break if ok: break
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
427,372
427,373
u156383602
python
p02690
import sys import itertools X = int(input()) N = 10 ABs = [] for i in range(N): ABs.append(i**5) for i in range(N): for j in range(N): if ABs[i]-ABs[j] == X: print(i,j) sys.exit() elif ABs[i]+ABs[j] == X: print(i,-j) sys.exit()
import sys import itertools X = int(input()) N = 120 ABs = [] for i in range(N): ABs.append(i**5) for i in range(N): for j in range(N): if ABs[i]-ABs[j] == X: print(i,j) sys.exit() elif ABs[i]+ABs[j] == X: print(i,-j) sys.exit()
[ "literal.number.integer.change", "assignment.value.change" ]
427,376
427,375
u996665352
python
p02690
import sys import itertools X = int(input()) N = 10 ABs = [] for i in range(N): ABs.append(i**5) for i in range(N): for j in range(N): if ABs[i]-ABs[j] == X: print(i,j) sys.exit() elif ABs[i]+ABs[j] == X: print(i,-j) sys.exit()
import sys import itertools X = int(input()) N = 300 ABs = [] for i in range(N): ABs.append(i**5) for i in range(N): for j in range(N): if ABs[i]-ABs[j] == X: print(i,j) sys.exit() elif ABs[i]+ABs[j] == X: print(i,-j) sys.exit()
[ "literal.number.integer.change", "assignment.value.change" ]
427,376
427,377
u996665352
python
p02690
x=int(input()) a=0 b=0 for i in range(0,x): for j in range(-i,x): if i**5-j**5==x: a=i b=j break else: continue break print(a,b)
x=int(input()) a=0 b=0 for i in range(-500,500): for j in range(-500,500): if i**5-j**5==x: a=i b=j break else: continue break print(a,b)
[ "call.arguments.change", "control_flow.loop.range.bounds.lower.change", "expression.operation.unary.add", "control_flow.loop.range.bounds.upper.change", "identifier.replace.remove", "literal.replace.add" ]
427,384
427,381
u575534159
python
p02690
X = int(input()) B = [n**5 for n in range(300)] A = [] for i in range(300): a = i**5- X if i**5 >= X else X-i**5 A.append(a) for j in range(300): if A[j] in B: a = j b = B.index(A[j]) if a**5-b**5 == X: print(a,b) elif a**+b**5 == X: print(a,-b) ...
X = int(input()) B = [n**5 for n in range(200)] A = [] for i in range(200): a = i**5- X if i**5 >= X else X-i**5 A.append(a) for j in range(200): if A[j] in B: a = j b = B.index(A[j]) if a**5-b**5 == X: print(a,b) elif a**5+b**5 == X: print(a,-b) ...
[ "literal.number.integer.change", "assignment.value.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "control_flow.branch.if.condition.change" ]
427,395
427,396
u496821919
python
p02690
import sys def input(): return sys.stdin.readline().rstrip() def main(): X = int(input()) for a in range(-120, 120): a5 = a ** 5 for b in range(-120, 120): if a5 + b ** 5 == X: print(a, b) exit() if __name__ == '__main__': main()
import sys def input(): return sys.stdin.readline().rstrip() def main(): X = int(input()) for a in range(-120, 120): a5 = a ** 5 for b in range(-120, 120): if a5 - b ** 5 == X: print(a, b) exit() if __name__ == '__main__': main()
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
427,414
427,415
u250583425
python
p02690
X=int(input()) for A in range(-10**3, 10**3): for B in range(-10**3, 10**3): if A**5-B**5==X: print(A, B)
X=int(input()) for A in range(-10**3, 10**3): for B in range(-10**3, 10**3): if A**5-B**5==X: print(A, B) exit()
[ "call.add" ]
427,435
427,436
u095021077
python
p02690
# coding: utf-8 #約数列挙 def make_divisors(n): divisors = [] for i in range(1, int(n**0.5)+1): if n % i == 0: divisors.append(i) if i != n // i: divisors.append(n//i) divisors.sort() return divisors #main X = int(input()) F = make_divisors(X) #intのみのlistは、直...
# coding: utf-8 #約数列挙 def make_divisors(n): divisors = [] for i in range(1, int(n**0.5)+1): if n % i == 0: divisors.append(i) if i != n // i: divisors.append(n//i) divisors.sort() return divisors #main X = int(input()) F = make_divisors(X) #intのみのlistは、直...
[]
427,443
427,444
u707808519
python
p02690
import math, sys X = int(input()) for a in range(-200,200): a5 == a**5 for b in range(-200,200): if a5-b**5==X: print(str(a)+" "+str(b)) sys.exit()
import math, sys X = int(input()) for a in range(-200,200): a5 = a**5 for b in range(-200,200): if a5-b**5==X: print(str(a)+" "+str(b)) sys.exit()
[ "expression.operation.compare.replace.remove", "assignment.replace.add", "misc.typo" ]
427,459
427,460
u465900169
python
p02690
X=int(input()) for a in range(-200,201): for b in range(-200,201): if a^5 - b^5 == X: print(a,b) exit()
X=int(input()) for a in range(-200,201): for b in range(-200,201): if a**5 - b**5 == X: print(a,b) exit()
[ "control_flow.branch.if.condition.change" ]
427,504
427,505
u343977188
python
p02690
import math x = int(input()) for i in range(-1000, 1000): for j in range(-1000, 1000): if math.pow(a, 5) == x + math.pow(b, 5): print(a, b) exit()
import math x = int(input()) for a in range(-1000, 1000): for b in range(-1000, 1000): if math.pow(a, 5) == x + math.pow(b, 5): print(a, b) exit()
[ "identifier.change" ]
427,506
427,507
u935840914
python
p02690
x=int(input()) for i in range(-1000,1000): for j in range(-1000,1000): if i**5-j**5==x: print(i,j) keep=1 break if keep==1: break
x=int(input()) keep=0 for i in range(-1000,1000): for j in range(-1000,1000): if i**5-j**5==x: print(i,j) keep=1 break if keep==1: break
[ "assignment.add" ]
427,514
427,515
u277641173
python
p02690
import sys import itertools sys.setrecursionlimit(1000000000) from heapq import heapify,heappop,heappush,heappushpop import math import collections x = int(input()) for i in range(-1000,1001): for j in range(-1000,1001): if i**5 - j**5 == x: print(i,j)
import sys import itertools sys.setrecursionlimit(1000000000) from heapq import heapify,heappop,heappush,heappushpop import math import collections x = int(input()) for i in range(-1000,1001): for j in range(-1000,1001): if i**5 - j**5 == x: print(i,j) sys.exit()
[ "call.add" ]
427,538
427,539
u379142263
python
p02690
X=int(input()) def ans(): for x in range(-10,10): for y in range(-10,10): if X==(x**5-y**5): print('{} {}'.format(x,y)) return x,y ans()
X=int(input()) def ans(): for x in range(-118,119): for y in range(-119,118): if X==(x**5-y**5): print('{} {}'.format(x,y)) return x,y ans()
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
427,551
427,550
u272682534
python
p02690
x = int(input()) for a in range(-1000, 1000): for b in range(-1000, 1000): if a**5 - b**5 == a: print(a, b) quit()
x = int(input()) for a in range(-1000, 1000): for b in range(-1000, 1000): if a**5 - b**5 == x: print(a, b) quit()
[ "identifier.change", "control_flow.branch.if.condition.change" ]
427,566
427,567
u067986264
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)
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.add" ]
427,590
427,591
u118211443
python
p02690
import itertools max_num = 2000 num_list = [i for i in range(-max_num, max_num+1)] num_comb = list(itertools.combinations(num_list, 2)) x = int(input().strip()) for comb in num_comb: a = comb[0] b = comb[1] a5 = a ** 5 b5 = b ** 5 if a5 - b5 == x: print(a, b) break
import itertools max_num = 200 num_list = [i for i in range(-max_num, max_num+1)] num_comb = list(itertools.permutations(num_list, 2)) x = int(input().strip()) for comb in num_comb: a = comb[0] b = comb[1] # print(a, b) a5 = a ** 5 b5 = b ** 5 if a5 - b5 == x: print(a, b) bre...
[ "literal.number.integer.change", "assignment.value.change", "identifier.change", "call.arguments.change" ]
427,728
427,727
u064136529
python
p02690
x = int(input()) for a in range(-10000, 10001): p = a ** 5 l, r = -10000, 10001 while r - l > 1: m = (l + r) // 2 if m ** 5 <= p - x: l = m else: r = m if l ** 5 == p - x: print(p, l) exit(0)
x = int(input()) for a in range(-10000, 10001): p = a ** 5 l, r = -10000, 10001 while r - l > 1: m = (l + r) // 2 if m ** 5 <= p - x: l = m else: r = m if l ** 5 == p - x: print(a, l) exit(0)
[ "identifier.change", "call.arguments.change", "io.output.change" ]
427,740
427,739
u143509139
python
p02690
x = int(input()) for a in range(-100, 101): p = a ** 5 l, r = -1000, 1001 while r - l > 1: m = (l + r) // 2 if m ** 5 <= p - x: l = m else: r = m if l ** 5 == p - x: print(p, l) exit(0)
x = int(input()) for a in range(-10000, 10001): p = a ** 5 l, r = -10000, 10001 while r - l > 1: m = (l + r) // 2 if m ** 5 <= p - x: l = m else: r = m if l ** 5 == p - x: print(a, l) exit(0)
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "assignment.value.change", "identifier.change", "io.output.change" ]
427,741
427,739
u143509139
python
p02690
x = int(input()) flag = True for a in range(1, 65): for b in range(1, 65): if a ** 5 - b ** 5 == x: print(' '.join([str(a), str(b)])) flag = False break if not flag: break
x = int(input()) flag = True for a in range(-500, 500): for b in range(-500, 500): if a ** 5 - b ** 5 == x: print(' '.join([str(a), str(b)])) flag = False break if not flag: break
[ "call.arguments.change", "control_flow.loop.range.bounds.lower.change", "expression.operation.unary.add", "control_flow.loop.range.bounds.upper.change", "literal.number.integer.change" ]
427,774
427,772
u688311353
python
p02690
def make_divisors(n): divisors = [] for i in range(1, int(n**0.5)+1): if n % i == 0: divisors.append(i) if i != n // i: divisors.append(n//i) # divisors.sort() return divisors x = input() X = int(x) div = make_divisors(X) for item in div: for A in ...
def make_divisors(n): divisors = [] for i in range(1, int(n**0.5)+1): if n % i == 0: divisors.append(i) if i != n // i: divisors.append(n//i) # divisors.sort() return divisors x = input() X = int(x) div = make_divisors(X) for item in div: for A in ...
[ "control_flow.break.add", "control_flow.continue.add" ]
427,837
427,838
u391725895
python
p02690
import sys x=int(input()) for a in range(1,10**3): for b in range(1,10**3): if a**5 - b**5==x: print(a,b) sys.exit() if (-a)**5 - b**5==x: print(-a,b) sys.exit() if a**5 - (-b)**5==x: print(a,-b) sys.exit() if (...
import sys x=int(input()) for a in range(10**3): for b in range(10**3): if a**5 - b**5==x: print(a,b) sys.exit() if (-a)**5 - b**5==x: print(-a,b) sys.exit() if a**5 - (-b)**5==x: print(a,-b) sys.exit() if (-a)*...
[ "call.arguments.change" ]
427,912
427,913
u557729026
python
p02690
x = int(input()) a = 0 while True: b5 = a**5 - x print(b5) if b5 >= 0: for b in range(b5+1): if b**5 == b5: print(a, b) exit() if b**5 > b5: break else: b5m = -b5 for bm in range(b5m+1): if...
x = int(input()) a = 0 while True: b5 = a**5 - x if b5 >= 0: for b in range(b5+1): if b**5 == b5: print(a, b) exit() if b**5 > b5: break else: b5m = -b5 for bm in range(b5m+1): if bm**5 == b5m:...
[ "call.remove" ]
427,951
427,952
u761154175
python
p02690
ans = int(input()) res = round(ans**0.2) for i in range(-res, res+1): for j in range(-res, res+1): if j**5 - i**5 == ans: print(i,j) exit()
ans = int(input()) res = 10*round(ans**0.2) for i in range(-res, res+1): for j in range(-res, res+1): if i**5 - j**5 == ans: print(i,j) exit()
[ "identifier.change", "control_flow.branch.if.condition.change" ]
427,981
427,982
u189023301
python
p02690
X = int(input()) for i in range(-10, 10): for j in range(-10, 10): if pow(i, 5) - pow(j, 5) == X: print(i, j) exit()
X = int(input()) for i in range(-200, 200): for j in range(-200, 200): if pow(i, 5) - pow(j, 5) == X: print(i, j) exit()
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
428,170
428,169
u206890818
python
p02690
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(1000)] Ans=[] for a in A: for b in A: if a+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(201)] Ans=[] for a in A: for b in A: if a**5+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
[ "literal.number.integer.change", "assignment.value.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
428,196
428,194
u969190727
python
p02690
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(201)] Ans=[] for a in A: for b in A: if a+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(201)] Ans=[] for a in A: for b in A: if a**5+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
[ "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
428,197
428,194
u969190727
python
p02690
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(101)] Ans=[] for a in A: for b in A: if a+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(201)] Ans=[] for a in A: for b in A: if a**5+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
[ "literal.number.integer.change", "assignment.value.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
428,198
428,194
u969190727
python
p02690
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(41)] Ans=[] for a in A: for b in A: if a+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(201)] Ans=[] for a in A: for b in A: if a**5+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
[ "literal.number.integer.change", "assignment.value.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
428,199
428,194
u969190727
python
p02690
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(1,41)] Ans=[] for a in A: for b in A: if a+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
import sys input=lambda: sys.stdin.readline().rstrip() x=int(input()) A=[int(i) for i in range(201)] Ans=[] for a in A: for b in A: if a**5+b**5==x and not Ans: Ans=[a,-b] if a**5-b**5==x and not Ans: Ans=[a,b] print(*Ans)
[ "literal.number.integer.change", "assignment.value.change", "call.arguments.change", "control_flow.loop.range.bounds.lower.change", "control_flow.branch.if.condition.change", "control_flow.loop.for.condition.change" ]
428,200
428,194
u969190727
python
p02690
X = int(input()) for a in range(-100,101) : powa = pow(a,5) for b in range(-100,101) : powb = pow(b,5) if (powa + powb == X) : print(a,b) exit()
X = int(input()) for a in range(-1000,1001) : powa = pow(a,5) for b in range(-1000,1001) : powb = pow(b,5) # print(a,b,powa,powb) if (powa - powb == X) : print(a,b) 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" ]
428,321
428,320
u993642190
python
p02690
x = int(input()) for a in range(-100,100): f = 0 for b in range(-100,100): if a**5+b**5==x: print(a,b) f = 1 break if f: break
x = int(input()) for a in range(-1000,1000): f = 0 for b in range(-1000,1000): if a**5-b**5==x: print(a,b) f = 1 break if f: break
[ "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" ]
428,425
428,424
u657173608
python
p02690
x = int(input()) for i in range(-10,10): for j in range(-10,10): if i**5 - j**5 == x: print(i,j) quit()
x = int(input()) for i in range(-1000,1000): for j in range(-1000,1000): if i**5 - j**5 == x: print(i,j) quit()
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
428,452
428,451
u669770320
python
p02690
x = int(input()) ans = [] for i in range(0, x//2+1): a = i**5 diff = x - a print(diff) if diff == 0: ans.append(i) ans.append(0) break elif diff < 0: j = 0 while True: b = j**5 if diff*(-1) < b: break if a...
x = int(input()) ans = [] for i in range(0, x//2+1): a = i**5 diff = x - a if diff == 0: ans.append(i) ans.append(0) break elif diff < 0: j = 0 while True: b = j**5 if diff*(-1) < b: break if a-b == x: ...
[ "call.remove" ]
428,479
428,480
u296101474
python
p02690
import itertools X = int(input()) ansL1 = [i for i in range(130)] ansL2 = [i * (-1) for i in range(1, 130)] ansL1.extend(ansL2) L1 = [pow(i, 5)for i in range(130)] L2 = [pow((-1)*i, 5)for i in range(1, 130)] L1.extend(L2) print(L1) for v in itertools.combinations(L1, 2): if v[0] - v[1] == X: for i in ra...
import itertools X = int(input()) ansL1 = [i for i in range(130)] ansL2 = [i * (-1) for i in range(1, 130)] ansL1.extend(ansL2) L1 = [pow(i, 5)for i in range(130)] L2 = [pow((-1)*i, 5)for i in range(1, 130)] L1.extend(L2) for v in itertools.combinations(L1, 2): if v[0] - v[1] == X: for i in range(len(L1...
[ "call.remove" ]
428,483
428,484
u318029285
python
p02690
x = int(input()) p = 0 while True: p += 1 for i in range(-p,p): for j in range(-p,p): # print (i,j) if i**5 + j**5 == x: print (i,j) exit ()
x = int(input()) p = 0 while True: p += 1 for i in range(-p,p): for j in range(-p,p): if i**5 - j**5 == x: print (i,j) exit ()
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
428,564
428,565
u422272120
python
p02690
x = int(input()) s = [] flag = 0 for i in range(-100, 100): s.append(i**5) a = -80 for n in s: b = -80 for m in s: if n-m == x: print(a,b) flag = 1 break if flag: break b += 1 a += 1
x = int(input()) s = [] flag = 0 for i in range(-200, 200): s.append(i**5) a = -200 for n in s: b = -200 for m in s: if n-m == x: print(a,b) flag = 1 break if flag: break b += 1 a += 1
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "assignment.value.change" ]
428,668
428,667
u819407764
python
p02690
from sys import exit def make_divisors(n): divisors = [] for i in range(1, int(n**0.5)+1): if n % i == 0: divisors.append(i) if i != n // i: divisors.append(n//i) # divisors.sort() return divisors X = int(input()) lists = make_divisors(X) print(lists...
from sys import exit def make_divisors(n): divisors = [] for i in range(1, int(n**0.5)+1): if n % i == 0: divisors.append(i) if i != n // i: divisors.append(n//i) # divisors.sort() return divisors X = int(input()) lists = make_divisors(X) for i in ra...
[ "call.remove" ]
428,682
428,683
u871303155
python
p02690
import sys import math import fractions from collections import deque from collections import defaultdict sys.setrecursionlimit(10**7) X = int(input()) l = [] for i in range(0, 1000): l.append(i ** 5) for i in range(len(l)): for j in range(len(l)): if l[i] + l[j] == X: print(i, j) ...
import sys import math import fractions from collections import deque from collections import defaultdict sys.setrecursionlimit(10**7) X = int(input()) l = [] for i in range(0, 1000): l.append(i ** 5) for i in range(len(l)): for j in range(len(l)): if l[i] - l[j] == X: print(i, j) ...
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
428,684
428,685
u743229067
python
p02690
def foo(): for i in range(len(F)): for j in range(len(F)): if F[i] + F[j] == X: print(i, j) return if F[i] - F[j] == X: print(i, -j) return X = int(input()) F = [i**5 for i in range(1000)] flg = False foo()
def foo(): for i in range(len(F)): for j in range(len(F)): if F[i] + F[j] == X: print(i, -j) return if F[i] - F[j] == X: print(i, j) return X = int(input()) F = [i**5 for i in range(1000)] flg = False foo()
[ "expression.operation.unary.add", "call.arguments.change", "expression.operation.unary.arithmetic.remove" ]
428,690
428,691
u734529045
python
p02690
#!/usr/bin/env python3 import sys def show(): for i in range(100): print(i, i**5) def solve(X: int): A = [(i ** 5, i) for i in range(100)] for a, b in A: for aa, bb in A: if a - aa == X: return b, -bb if a + aa == X: return b, bb ...
#!/usr/bin/env python3 import sys def show(): for i in range(100): print(i, i**5) def solve(X: int): A = [(i ** 5, i) for i in range(1000)] for a, b in A: for aa, bb in A: if a - aa == X: return b, bb if a + aa == X: return b, -bb ...
[ "literal.number.integer.change", "assignment.value.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change", "expression.operation.unary.arithmetic.remove", "expression.operation.unary.add", "function.return_value.change" ]
428,699
428,700
u477320129
python
p02690
x = int(input()) rs = [i ** 5 for i in range(300)] for r in rs: if r <= x: if x - r in rs: print(rs.index(r), rs.index(x - r)) break if r > x: if r - x in rs: print(rs.index(r), - rs.index(r - x)) break
x = int(input()) rs = [i ** 5 for i in range(300)] for r in rs: if r <= x: if x - r in rs: print(rs.index(r), - rs.index(x - r)) break if r > x: if r - x in rs: print(rs.index(r), rs.index(r - x)) break
[ "expression.operation.unary.add", "call.arguments.change", "expression.operation.unary.arithmetic.remove" ]
428,703
428,704
u458925609
python
p02690
x = int(input()) flag = 0 for i in range(1, 110): for j in range(-100, 100): if i ** 5 - j ** 5 == x: print(i, j) flag = 1 break if flag == 1: break
x = int(input()) flag = 0 for i in range(-200, 200): for j in range(-200, 200): if i ** 5 - j ** 5 == x: print(i, j) flag = 1 break if flag == 1: break
[ "call.arguments.change", "control_flow.loop.range.bounds.lower.change", "expression.operation.unary.add", "control_flow.loop.range.bounds.upper.change", "literal.number.integer.change" ]
428,715
428,716
u047197186
python
p02690
#!/usr/bin/env python3 import sys def solve(X: int): # b が負 for a in range(0, 101): for b in range(0, -101, -1): if a**5 + b**5 == X: print(a, b) exit() for a in range(0, 121): for b in range(0, 120): if a**5 + b**5 == X: ...
#!/usr/bin/env python3 import sys def solve(X: int): # b が負 for a in range(0, 101): for b in range(0, -101, -1): if a**5 - b**5 == X: print(a, b) exit() for a in range(0, 121): for b in range(0, 120): if a**5 - b**5 == X: ...
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
428,998
428,999
u328099989
python
p02690
x = int(input()) for a in range(10**4): for b in range(-10**4,10**4): if a**5 - b**5 == X: print(a,b) break else: continue break
X = int(input()) for a in range(10**4): for b in range(-10**4,10**4): if a**5 - b**5 == X: print(a,b) break else: continue break
[ "assignment.variable.change", "identifier.change" ]
429,009
429,010
u726285999
python
p02690
X = int(input()) C = 0 for i in range(-0000,1000): if C == 1: break for j in range(-0000,1000): if i**5-j**5 == X: print(i,j) C += 1 break
X = int(input()) C = 0 for i in range(-1000,1000): if C == 1: break for j in range(-1000,1000): if i**5-j**5 == X: print(i,j) C += 1 break
[ "literal.number.integer.change", "call.arguments.change", "control_flow.loop.range.bounds.upper.change" ]
429,098
429,099
u988191897
python
p02690
lis = [i ** 5 for i in range(-300,300)] x = int(input()) for i in range(len(lis)): for j in range(len(lis)): if lis[i] + lis[j] == x: print(i-300,j-300) exit()
lis = [i ** 5 for i in range(-300,300)] x = int(input()) for i in range(len(lis)): for j in range(len(lis)): if lis[i] - lis[j] == x: print(i-300,j-300) exit()
[ "misc.opposites", "expression.operator.arithmetic.change", "control_flow.branch.if.condition.change" ]
429,262
429,263
u667024514
python
p02690
X = int(input()) L = [i ** 5 for i in range(0, 500)] for i in L: for j in L: if i + j == X: print(int(i**0.2), int(j**0.2)) exit() if i - j == X: print(int(i**0.2), -int(j**0.2)) exit() if -i + j == X: print(-int(i**0.2), int(j**0.2...
X = int(input()) L = [i ** 5 for i in range(0, 500)] for i in L: for j in L: if i + j == X: print(int(i**0.2), -int(j**0.2)) exit() if i - j == X: print(int(i**0.2), int(j**0.2)) exit() if -i + j == X: print(-int(i**0.2), -int(j**0....
[ "expression.operation.unary.add", "call.arguments.change", "expression.operation.unary.arithmetic.remove" ]
429,338
429,339
u329709276
python
p02690
import math x = int(input()) for i in range(1,101): for j in range(-100,101): a5 = pow(i , 5) b5 = pow(j, 5) if a5 - b5 == x: exit(print(i , j))
import math x = int(input()) for i in range(-1000,1001): for j in range(-1000,1001): a5 = pow(i , 5) b5 = pow(j, 5) if a5 - b5 == x: exit(print(i , j))
[ "call.arguments.change", "control_flow.loop.range.bounds.lower.change", "expression.operation.unary.add", "control_flow.loop.range.bounds.upper.change", "literal.number.integer.change" ]
429,564
429,563
u733581231
python
p02690
x=int(input()) a=0 b=64 while True: t=a**5+b**5 if t==x: break if t>x: b-=1 else: a+=1 print(a,b)
x=int(input()) a=0 b=-64 while True: t=a**5-b**5 if t==x: break if t>x: b+=1 else: a+=1 print(a,b)
[ "expression.operation.unary.add", "misc.opposites", "expression.operator.arithmetic.change", "assignment.value.change", "expression.operation.binary.change", "expression.operator.change" ]
429,671
429,672
u651663683
python
p02690
import sys sys.setrecursionlimit(10**6) from math import floor,ceil,sqrt,factorial,log from heapq import heappop, heappush, heappushpop from collections import Counter,defaultdict,deque from itertools import accumulate,permutations,combinations,product,combinations_with_replacement from bisect import bisect_left,bisect...
import sys sys.setrecursionlimit(10**6) from math import floor,ceil,sqrt,factorial,log from heapq import heappop, heappush, heappushpop from collections import Counter,defaultdict,deque from itertools import accumulate,permutations,combinations,product,combinations_with_replacement from bisect import bisect_left,bisect...
[ "call.arguments.change", "control_flow.loop.range.bounds.lower.change", "expression.operation.unary.add", "control_flow.loop.range.bounds.upper.change", "literal.number.integer.change" ]
429,899
429,900
u404290207
python
p02691
from collections import Counter n=int(input()) a=list(map(int,input().split())) q1=[] q2=[] for i in range(n): q1.append(i+a[i]) q2.append(i-a[i]) c2=Counter(q2) ans=0 for i in c1.keys(): ans+=c2[i] print(ans)
from collections import Counter n=int(input()) a=list(map(int,input().split())) q1=[] q2=[] for i in range(n): q1.append(i+a[i]) q2.append(i-a[i]) c2=Counter(q2) ans=0 for i in q1: ans+=c2[i] print(ans)
[ "call.remove" ]
429,903
429,904
u094191970
python
p02691
import sys def Ii():return int(sys.stdin.buffer.readline()) def Mi():return map(int,sys.stdin.buffer.readline().split()) def Li():return list(map(int,sys.stdin.buffer.readline().split())) n = Ii() a = Li() x = [0]*n ans = 0 for i in range(n): print(x) if a[i]+i < n: x[a[i]+i] += 1 if i-a[i] >= 0: ans +=...
import sys def Ii():return int(sys.stdin.buffer.readline()) def Mi():return map(int,sys.stdin.buffer.readline().split()) def Li():return list(map(int,sys.stdin.buffer.readline().split())) n = Ii() a = Li() x = [0]*n ans = 0 for i in range(n): if a[i]+i < n: x[a[i]+i] += 1 if i-a[i] >= 0: ans += x[i-a[i]] ...
[ "call.remove" ]
429,939
429,940
u726823037
python
p02691
import collections N = int(input()) A = list(map(int , input().split())) # N = 32 # A = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7, 9, 3, 2, 3, 8, 4, 6, 2, 6, 4, 3, 3, 8, 3, 2, 7, 9, 5] # N = 6 # A = [2, 3, 3, 1, 3, 1] i = [k for k in range(1,N+1)] j = [k for k in range(1,N+1)] Li = [i[k]+A[k] for k in range(N)] Rj...
import collections N = int(input()) A = list(map(int , input().split())) # N = 32 # A = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5, 8, 9, 7, 9, 3, 2, 3, 8, 4, 6, 2, 6, 4, 3, 3, 8, 3, 2, 7, 9, 5] # N = 6 # A = [2, 3, 3, 1, 3, 1] i = [k for k in range(1,N+1)] j = [k for k in range(1,N+1)] Li = [i[k]+A[k] for k in range(N)] Rj...
[ "call.add" ]
429,941
429,942
u529737989
python
p02691
n = int(input()) a = list(map(int, input().split())) ans = 0 cnt = defaultdict(int) for i in range(n): ans += cnt[i - a[i]] cnt[i + a[i]] += 1 print(ans)
from collections import defaultdict n = int(input()) a = list(map(int, input().split())) ans = 0 cnt = defaultdict(int) for i in range(n): ans += cnt[i - a[i]] cnt[i + a[i]] += 1 print(ans)
[]
429,965
429,966
u801049006
python
p02691
from collections import deque from heapq import heapify,heappop,heappush,heappushpop from copy import copy,deepcopy from itertools import product,permutations,combinations,combinations_with_replacement from collections import defaultdict,Counter from bisect import bisect_left,bisect_right # from math import gcd,ceil,fl...
from collections import deque from heapq import heapify,heappop,heappush,heappushpop from copy import copy,deepcopy from itertools import product,permutations,combinations,combinations_with_replacement from collections import defaultdict,Counter from bisect import bisect_left,bisect_right # from math import gcd,ceil,fl...
[ "expression.operation.binary.remove" ]
429,980
429,981
u255673886
python
p02691
import collections import sys readline = sys.stdin.readline def main(): n = int(readline().rstrip()) A = list(map(int, readline().rstrip().split())) ans = 0 c = collections.Counter() for i in range(n): ans += c[i + 1 - A[i]] c[i + 1 + A[i]] += 1 print(c) print(ans) if ...
import collections import sys readline = sys.stdin.readline def main(): n = int(readline().rstrip()) A = list(map(int, readline().rstrip().split())) ans = 0 c = collections.Counter() for i in range(n): ans += c[i + 1 - A[i]] c[i + 1 + A[i]] += 1 print(ans) if __name__ == '_...
[ "call.remove" ]
430,017
430,018
u395202850
python
p02691
from collections import Counter N = int(input()) A = list(map(int, input().split())) #cnt = 0 #for i in range(N): # for j in range(i, N): # if j - i == A[i] + A[j]: # cnt += 1 Ap = [A[i]+i for i in range(len(A))] Am = [i-A[i] for i in range(len(A))] S = set(Ap) & set(Am) Cp = Counter(Ap) Cm = Counter(Am) ...
from collections import Counter N = int(input()) A = list(map(int, input().split())) #cnt = 0 #for i in range(N): # for j in range(i, N): # if j - i == A[i] + A[j]: # cnt += 1 Ap = [A[i]+i for i in range(len(A))] Am = [i-A[i] for i in range(len(A))] S = set(Ap) & set(Am) Cp = Counter(Ap) Cm = Counter(Am) ...
[ "call.add" ]
430,025
430,026
u312907447
python
p02690
x=int(input()) for i in range(-200,200): for j in range(-200,200): if a**5-b**5==x: print(a,b) exit()
x=int(input()) for a in range(-200,200): for b in range(-200,200): if a**5-b**5==x: print(a,b) exit()
[ "identifier.change" ]
430,067
430,068
u223904637
python
p02691
from bisect import bisect_left, bisect_right N = int(input()) A = list(map(int, input().split())) Ap = [i - A[i] for i in range(N)] Ap.sort() print(Ap) ans = 0 for i in range(N): ans += bisect_right(Ap, i + A[i]) - bisect_left(Ap, i + A[i]) print(ans)
from bisect import bisect_left, bisect_right N = int(input()) A = list(map(int, input().split())) Ap = [i - A[i] for i in range(N)] Ap.sort() ans = 0 for i in range(N): ans += bisect_right(Ap, i + A[i]) - bisect_left(Ap, i + A[i]) print(ans)
[ "call.remove" ]
430,125
430,126
u847923740
python
p02691
n=int(input()) y=list(map(int,input().split())) from collections import Counter lhs=Counter([j+y[j] for j in range(n)]) rhs=Counter([j-y[j] for j in range(n)]) count=0 for i in lhs: if i in rhs: count+=lhs[i]+rhs[i] print(count)
n=int(input()) y=list(map(int,input().split())) from collections import Counter lhs=Counter([j+y[j] for j in range(n)]) rhs=Counter([j-y[j] for j in range(n)]) count=0 for i in lhs: if i in rhs: count+=lhs[i]*rhs[i] print(count)
[ "expression.operator.arithmetic.change", "expression.operation.binary.change" ]
430,143
430,144
u241348301
python
p02691
from collections import Counter N = int(input()) A = list(map(int, input().split())) p = [i+Ai for i, Ai in zip(range(1, N+1), A)] q = [j-Aj for j, Aj in zip(range(1, N+1), A)] pc = Counter(p) qc = Counter(q) r = sum(pc[k]*qc[k] for k in pc.keys() & qc.keys())
from collections import Counter N = int(input()) A = list(map(int, input().split())) p = [i+Ai for i, Ai in zip(range(1, N+1), A)] q = [j-Aj for j, Aj in zip(range(1, N+1), A)] pc = Counter(p) qc = Counter(q) r = sum(pc[k]*qc[k] for k in pc.keys() & qc.keys()) print(r)
[ "call.add" ]
430,210
430,211
u599547273
python
p02691
from collections import defaultdict n = int(input()) a = list(map(int, input().split())) memo = defaultdict(int) ans = 0 for i, x in enumerate(a, 1): print(memo) ans += memo[i - x] memo[x + i] += 1 print(ans)
from collections import defaultdict n = int(input()) a = list(map(int, input().split())) memo = defaultdict(int) ans = 0 for i, x in enumerate(a, 1): ans += memo[i - x] memo[x + i] += 1 print(ans)
[ "call.remove" ]
430,236
430,237
u665038048
python
p02691
n = int(input()) a = list(map(int, input().split())) dict_diffs = dict() for i in range(1, n+1): dict_diffs[i+a[i-1]] = dict_diffs1.get(i+a[i-1], 0) + 1 total = 0 for j in range(1, n+1): total += dict_diffs1.get(j-a[j-1], 0) print(total)
n = int(input()) a = list(map(int, input().split())) dict_diffs = dict() for i in range(1, n+1): dict_diffs[i+a[i-1]] = dict_diffs.get(i+a[i-1], 0) + 1 total = 0 for j in range(1, n+1): total += dict_diffs.get(j-a[j-1], 0) print(total)
[ "assignment.value.change", "identifier.change", "expression.operation.binary.change" ]
430,238
430,239
u460375306
python
p02691
n=int(input()) A=list(map(int,input().split())) L,R={},{} for i,a in enumerate(A): l,r = i-a,i+a if l in L: L[l]=0 if r in R: R[r]=0 L[l]+=1 R[r]+=1 count = 0 for x in L: if x not in R: continue count += L[x]*R[x] print(count)
n=int(input()) A=list(map(int,input().split())) L,R={},{} for i,a in enumerate(A): l,r = i-a,i+a if l not in L: L[l]=0 if r not in R: R[r]=0 L[l]+=1 R[r]+=1 count = 0 for x in L: if x not in R: continue count += L[x]*R[x] print(count)
[ "control_flow.branch.if.condition.change" ]
430,287
430,288
u221061152
python