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 |
|---|---|---|---|---|---|---|---|
p02615 | # coding: utf-8
def main():
N = int(input())
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
ans = A[0]
rest = N-2
i = 1
while rest > 0:
if i == len(A):
break
if rest >= 2:
ans += 2 * A[i]
rest -= 2
else:
... | # coding: utf-8
def main():
N = int(input())
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
ans = A[0]
rest = N-2
i = 1
while rest > 0:
if i == len(A):
break
if rest >= 2:
ans += 2 * A[i]
rest -= 2
else:
... | [] | 325,469 | 325,470 | u063896676 | python |
p02615 | n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
ans=a[0]
for i in range(2,len(a)):
ans+=(a[(i+1)//2])
print(ans)
| n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
ans=a[0]
for i in range(2,len(a)):
ans+=(a[(i)//2])
print(ans)
| [
"expression.operation.binary.remove"
] | 325,483 | 325,484 | u408148811 | python |
p02615 | n=int(input())
ls=list(map(int,input().split()))
ls.sort(reserved=True)
ans=ls[0]
pls=[ls.pop(0),ls.pop(0)]#入った人を突っ込む
cnt=0#plsの隣使いきりカウント
scnt=0#2人行けるからそこのカウント
for i in ls:
pls.append(i)
ans+=pls[cnt+1]
if scnt==0:
scnt=1
else:
scnt=0
cnt+=1
print(ans) | n=int(input())
ls=list(map(int,input().split()))
ls.sort(reverse=True)
ans=ls[0]
pls=[ls.pop(0),ls.pop(0)]#入った人を突っ込む
cnt=0#plsの隣使いきりカウント
scnt=0#2人行けるからそこのカウント
for i in ls:
pls.append(i)
ans+=pls[cnt+1]
if scnt==0:
scnt=1
else:
scnt=0
cnt+=1
print(ans)
| [
"identifier.change",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 325,489 | 325,490 | u291988695 | python |
p02615 | from math import ceil,floor,comb,factorial,gcd,pow,sqrt,log2,cos,sin,tan,pi,inf
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import... | from math import ceil,floor,comb,factorial,gcd,pow,sqrt,log2,cos,sin,tan,pi,inf
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import... | [] | 325,496 | 325,497 | u603958124 | python |
p02615 | from heapq import heapify, heappop, heappush
N,*A=map(int, open(0).read().split())
A=sorted(A, reverse=True)
L=[0]*N
R=[0]*N
ans=0
L[0]=0
R[0]=0
H=[(A[0],0,0)]
heapify(H)
for i in range(1,N):
a=A[i]
p,pl,pr=heappop(H)
ans+=p
L[pr]=i
R[pl]=i
L[i]=pl
R[i]=pr
heappush(H,(min(A[pl],a),pl,i))... | from heapq import heapify, heappop, heappush
N,*A=map(int, open(0).read().split())
A=sorted(A, reverse=True)
L=[0]*N
R=[0]*N
ans=0
L[0]=0
R[0]=0
H=[(-A[0],0,0)]
heapify(H)
for i in range(1,N):
a=A[i]
p,pl,pr=heappop(H)
ans+=-p
L[pr]=i
R[pl]=i
L[i]=pl
R[i]=pr
heappush(H,(-min(A[pl],a),pl,... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 325,516 | 325,517 | u732412551 | python |
p02615 | n = int(input())-2
A = list(map(int,input().split()))
A.sort(reverse=True)
ans = A[0]
for i in range(n//2):
ans += 2*A[i+1]
if n%2 != 0:
ans += A[n//2]
print(ans) | n = int(input())-2
A = list(map(int,input().split()))
A.sort(reverse=True)
ans = A[0]
for i in range(n//2):
ans += 2*A[i+1]
if n%2 != 0:
ans += A[n//2+1]
print(ans) | [
"expression.operation.binary.add"
] | 325,524 | 325,525 | u496821919 | python |
p02615 | import sys
sys.setrecursionlimit(10 ** 7)
#import bisect
#import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
import itertools
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(input())
A = list(map(lambda ... | import sys
sys.setrecursionlimit(10 ** 7)
#import bisect
#import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
import itertools
import heapq
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(input())
A = list(map(lambda ... | [
"call.remove"
] | 325,534 | 325,535 | u408071652 | python |
p02615 | N = int(input())
A = list(map(int,input().split()))
A.sort()
print(sum(A[N//2:])*2-A[-1]-(N%2)*A[0]) | N = int(input())
A = list(map(int,input().split()))
A.sort()
print(sum(A[N//2:])*2-A[-1]-(N%2)*A[N//2]) | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 325,549 | 325,550 | u327466606 | python |
p02615 | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse = True)
ans = sum(A[:N // 2]) * 2 - A[0]
print(ans)
if N % 2 == 1:
ans += A[N // 2]
print(ans) | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse = True)
ans = sum(A[:N // 2]) * 2 - A[0]
if N % 2 == 1:
ans += A[N // 2]
print(ans) | [
"call.remove"
] | 325,556 | 325,557 | u189479417 | python |
p02615 | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse = True)
ans = sum(A[:N // 2]) * 2 - A[0]
if N % 2 == 1:
ans += A[N % 2]
print(ans) | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse = True)
ans = sum(A[:N // 2]) * 2 - A[0]
if N % 2 == 1:
ans += A[N // 2]
print(ans) | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 325,558 | 325,557 | u189479417 | python |
p02615 | N = int(input())
A_s = list(map(int, input().split()))
A_s = list(reversed(sorted(A_s)))
answer = 0
for i in range(N-1):
answer += A_s[i+1//2]
print (answer) | N = int(input())
A_s = list(map(int, input().split()))
A_s = list(reversed(sorted(A_s)))
answer = 0
for i in range(N-1):
answer += A_s[int(i+1)//2]
print (answer) | [
"call.add",
"call.arguments.change"
] | 325,567 | 325,568 | u309039873 | python |
p02608 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N = int(input())
ans = [0] * (6 * 10**4 + 10)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
ans[x**2 + y**2 + z**2 + x * y + y * z + x * z] += 1
for i in range(N):
print(an... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N = int(input())
ans = [0] * (6 * 10**4 + 10)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
ans[x**2 + y**2 + z**2 + x * y + y * z + x * z - 1] += 1
for i in range(N):
prin... | [
"expression.operation.binary.add"
] | 325,579 | 325,580 | u143212659 | python |
p02608 | import sys
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
n = int(input().rstrip())
ans = [0 for _ in range(n)]
for x in range(1, 101):
for y in range(x, 101):
for z in range(y, 101):
tmp = pow(x, 2) + pow(y, 2) + pow(z, 2) + ... | import sys
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
n = int(input().rstrip())
ans = [0 for _ in range(n)]
for x in range(1, 101):
for y in range(x, 101):
for z in range(y, 101):
tmp = pow(x, 2) + pow(y, 2) + pow(z, 2) + ... | [
"control_flow.continue.remove",
"control_flow.break.add",
"assignment.value.change"
] | 325,581 | 325,582 | u839509562 | python |
p02608 | import collections
import sys
A = []
n = int(input())
for i in range(1,35):
for j in range(1,35):
for k in range(1,35):
A.append(i**2+j**2+k**2+i*j+j*k+k*i)
c = collections.Counter(A)
for x in range(1,n+1):
print(c[x])
sys.exit() | import collections
import sys
A = []
n = int(input())
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
A.append(i**2+j**2+k**2+i*j+j*k+k*i)
c = collections.Counter(A)
for x in range(1,n+1):
print(c[x])
sys.exit()
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 325,583 | 325,584 | u487594898 | python |
p02608 | N = int(input())
ans = [0 for _ in range(N+1)]
for x in range(1, 101):
for y in range(x, 101):
for z in range(y, 101):
v = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if v < N:
if x == y == z:
ans[v] += 1
elif x == y or x == z... | N = int(input())
ans = [0 for _ in range(N+1)]
for x in range(1, 101):
for y in range(x, 101):
for z in range(y, 101):
v = x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
if v < N+1:
if x == y == z:
ans[v] += 1
elif x == y or x ==... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 325,587 | 325,588 | u212328220 | python |
p02608 | #C
n = int(input())
f = [0 for _ in range(10**5)]
for i in range(1,60):
for j in range(1,60):
for k in range(1,60):
f[i**2 + j**2 + k**2 + i*j + j*k + k*i] += 1
for l in range(n):
print(f[l+1]) | #C
n = int(input())
f = [0 for _ in range(10**5)]
for i in range(1,105):
for j in range(1,105):
for k in range(1,105):
f[i**2 + j**2 + k**2 + i*j + j*k + k*i] += 1
for l in range(n):
print(f[l+1]) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 325,608 | 325,609 | u771007149 | python |
p02608 | #C
n = int(input())
f = [0 for _ in range(10**5)]
for i in range(1,50):
for j in range(1,50):
for k in range(1,50):
f[i**2 + j**2 + k**2 + i*j + j*k + k*i] += 1
for l in range(n):
print(f[l+1]) | #C
n = int(input())
f = [0 for _ in range(10**5)]
for i in range(1,105):
for j in range(1,105):
for k in range(1,105):
f[i**2 + j**2 + k**2 + i*j + j*k + k*i] += 1
for l in range(n):
print(f[l+1]) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 325,610 | 325,609 | u771007149 | python |
p02608 | ans = [0 for _ in range(10001)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
w = x*x + y*y + z*z + x*y + y*z + z*x
if w <= 10000:
ans[w] += 1
print(*ans[1:int(input())], sep="\n") | ans = [0 for _ in range(10001)]
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
w = x*x + y*y + z*z + x*y + y*z + z*x
if w <= 10000:
ans[w] += 1
print(*ans[1:int(input())+1], sep="\n") | [
"expression.operation.binary.add"
] | 325,643 | 325,644 | u218843509 | python |
p02608 | ans = [0 for i in range(10050)]
for i in range(1, 105):
for j in range(1, 105):
for k in range(1, 105):
v = i**2 + j**2 + k**2 + i*j + j*k + i*k
if v < 10050:
ans[v] +1
n = int(input())
for i in range(n):
print(ans[i+1])
| ans = [0 for i in range(10050)]
for i in range(1, 105):
for j in range(1, 105):
for k in range(1, 105):
v = i**2 + j**2 + k**2 + i*j + j*k + i*k
if v < 10050:
ans[v]+=1
n = int(input())
for i in range(n):
print(ans[i+1])
| [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 325,648 | 325,649 | u852798899 | python |
p02608 | import numpy as np
n = int(input())
res = [0]*(n+1)
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
x = i*i + j*j + k*k + i*j + j*k + k*i
if x <= n:
res[x] += 1
for i in range(1,n):
print(res[i])
| import numpy as np
n = int(input())
res = [0]*(n+1)
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
x = i*i + j*j + k*k + i*j + j*k + k*i
if x <= n:
res[x] += 1
for i in range(1,n+1):
print(res[i])
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 325,656 | 325,657 | u110996038 | python |
p02608 | N = int(input())
ans = [0]*(N+1)
i = 102
for x in range(1,i):
for y in range(1,i):
for z in range(1,i):
total = (x + y + z)**2 - (x*y + y*z + x*z)
if total <= N+1:
ans[total] += 1
for i in range(1,N+1):
print(ans[i]) | N = int(input())
ans = [0]*(N+1)
i = 102
for x in range(1,i):
for y in range(1,i):
for z in range(1,i):
total = (x + y + z)**2 - (x*y + y*z + x*z)
if total <= N:
ans[total] += 1
for i in range(1,N+1):
print(ans[i]) | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 325,662 | 325,663 | u566987397 | python |
p02608 | N = int(input())
total = 0
ans = [0]*(N+1)
i = 100
for x in range(1,i):
for y in range(1,i):
for z in range(1,i):
total = (x + y + z)**2 - (x*y + y*z + x*z)
if total <= N+1:
ans[total] += 1
for i in range(1,N+1):
print(ans[i]) | N = int(input())
ans = [0]*(N+1)
i = 102
for x in range(1,i):
for y in range(1,i):
for z in range(1,i):
total = (x + y + z)**2 - (x*y + y*z + x*z)
if total <= N:
ans[total] += 1
for i in range(1,N+1):
print(ans[i]) | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 325,664 | 325,663 | u566987397 | python |
p02608 | n = int(input())
ANS = [0] * (n)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = (x + y + z)**2 - z*(x + y) - (x*y)
if tmp > n: continue
ANS[tmp] += 1
for ans in ANS[1:]:
print(ans)
| n = int(input())
ANS = [0] * (n+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = (x + y + z)**2 - z*(x + y) - (x*y)
if tmp > n: continue
ANS[tmp] += 1
for ans in ANS[1:]:
print(ans) | [
"assignment.change"
] | 325,665 | 325,666 | u968404618 | python |
p02608 | n = int(input())
ANS = [0] * (n+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = (x + y + z)**2 - z*(x + y) - (x*y)
if tmp > n: continue
ANS[tmp] += 1
for ans in ANS:
print(ans) | n = int(input())
ANS = [0] * (n+1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
tmp = (x + y + z)**2 - z*(x + y) - (x*y)
if tmp > n: continue
ANS[tmp] += 1
for ans in ANS[1:]:
print(ans) | [] | 325,667 | 325,666 | u968404618 | python |
p02608 | N = int(input())
f = {}
for x in range(1, 110):
for y in range(1, 110):
for z in range(1, 110):
t = x*x+y*y+z*z+x*y+y*z+z*x
f[t] = (f[t]+1 if t in f.keys() else 1)
for i in range(i,N+1):
print(f[i] if i in f.keys() else 0) | N = int(input())
f = {}
for x in range(1, 110):
for y in range(1, 110):
for z in range(1, 110):
t = x*x+y*y+z*z+x*y+y*z+z*x
f[t] = (f[t]+1 if t in f.keys() else 1)
for i in range(1,N+1):
print(f[i] if i in f.keys() else 0) | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 325,694 | 325,695 | u211109468 | python |
p02608 | N = int(input())
f = {}
for x in range(1, 110):
for y in range(1, 110):
for z in range(1, 110):
t = x*x+y*y+z*z+x*y+y*z+z*x
f[t] = (f[t]+1 if t in f.keys() else 1)
for i in range(1, N):
print(f[i] if i in f.keys() else 0) | N = int(input())
f = {}
for x in range(1, 110):
for y in range(1, 110):
for z in range(1, 110):
t = x*x+y*y+z*z+x*y+y*z+z*x
f[t] = (f[t]+1 if t in f.keys() else 1)
for i in range(1,N+1):
print(f[i] if i in f.keys() else 0) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 325,696 | 325,695 | u211109468 | python |
p02608 | import math
N = int(input())
ans = [0] * (N + 1)
for i in range(1, int(math.sqrt(N)) + 1):
for j in range(1, int(math.sqrt(N)) + 1):
for k in range(1, int(math.sqrt(N)) + 1):
v = i * i + j * j + k * k + i * j + j * k + k * i
if v < N:
ans[v] += 1
for i in range(1,... | import math
N = int(input())
ans = [0] * (N + 1)
for i in range(1, int(math.sqrt(N)) + 1):
for j in range(1, int(math.sqrt(N)) + 1):
for k in range(1, int(math.sqrt(N)) + 1):
v = i * i + j * j + k * k + i * j + j * k + k * i
if v <= N:
ans[v] += 1
for i in range(1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 325,706 | 325,707 | u606374450 | python |
p02608 | N = int(input())
from collections import defaultdict
ans = defaultdict(int)
for a in range(101):
for b in range(101):
for c in range(101):
ans[a**2 + b**2 + c**2 + a*b + a*c + b*c] += 1
for n in range(1,N+1):
print(ans[n]) | N = int(input())
from collections import defaultdict
ans = defaultdict(int)
for a in range(1,101):
for b in range(1,101):
for c in range(1,101):
ans[a**2 + b**2 + c**2 + a*b + a*c + b*c] += 1
for n in range(1,N+1):
print(ans[n])
| [
"call.arguments.add"
] | 325,722 | 325,723 | u255943004 | python |
p02608 | import sys
import collections
n = int(sys.stdin.readline().rstrip("\n"))
l = []
for a in range(1,43):
for b in range(1,43):
for c in range(1,43):
l.append(a**2+b**2+c**2+a*b+b*c+c*a)
c = collections.Counter(l)
for i in range(1,n+1):
print(c[i]) | import sys
import collections
n = int(sys.stdin.readline().rstrip("\n"))
l = []
for a in range(1,100):
for b in range(1,100):
for c in range(1,100):
l.append(a**2+b**2+c**2+a*b+b*c+c*a)
c = collections.Counter(l)
for i in range(1,n+1):
print(c[i]) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 325,753 | 325,754 | u393224521 | python |
p02608 | import sys
import collections
n = int(sys.stdin.readline().rstrip("\n"))
l = []
for a in range(1,42):
for b in range(1,42):
for c in range(1,42):
l.append(a**2+b**2+c**2+a*b+b*c+c*a)
c = collections.Counter(l)
for i in range(1,n+1):
print(c[i]) | import sys
import collections
n = int(sys.stdin.readline().rstrip("\n"))
l = []
for a in range(1,100):
for b in range(1,100):
for c in range(1,100):
l.append(a**2+b**2+c**2+a*b+b*c+c*a)
c = collections.Counter(l)
for i in range(1,n+1):
print(c[i]) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 325,755 | 325,754 | u393224521 | python |
p02608 | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(input())
ans = [0] * (1000 + 1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
if x * x + y * y + z * z + x * y + y * z + z * x >= 1001:
... | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(input())
ans = [0] * (10000 + 1)
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
if x * x + y * y + z * z + x * y + y * z + z * x >= 10001:
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 325,761 | 325,762 | u098012509 | python |
p02608 | import math
n = int(input())
ans = [0 for _ in range(10001)]
for i in range(1,math.ceil(math.sqrt(n))):
for j in range(1,math.ceil(math.sqrt(n))):
for k in range(1,math.ceil(math.sqrt(n))):
v = i**2 + j**2 + k**2 + i*j + j*k + k*i
if(v < 10001):
ans[v] += 1
for i ... | import math
n = int(input())
ans = [0 for _ in range(10001)]
for i in range(1,math.ceil(math.sqrt(n))):
for j in range(1,math.ceil(math.sqrt(n))):
for k in range(1,math.ceil(math.sqrt(n))):
v = i**2 + j**2 + k**2 + i*j + j*k + k*i
if(v < 10001):
ans[v] += 1
for i ... | [
"expression.operation.binary.add"
] | 325,767 | 325,768 | u946475383 | python |
p02608 | n = int(input())
ans = [0 for i in range(1001)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
if x*x + y*y + z*z + x*y + x*z + y*z < n:
ans[x*x + y*y + z*z + x*y + x*z + y*z] += 1
else:
break
for i in range(1,n+1):
print(ans[i]... | n = int(input())
ans = [0 for i in range(10001)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
if x*x + y*y + z*z + x*y + x*z + y*z <= 10000:
ans[x*x + y*y + z*z + x*y + x*z + y*z] += 1
else:
break
for i in range(1,n+1):
print(... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.for.condition.change"
] | 325,770 | 325,771 | u244416763 | python |
p02608 | import itertools
N = int(input())
lst = [0]*N
for x,y,z in itertools.product(list(range(1,int(N**0.5)+1)),repeat=3):
val = x*x + y*y + z*z + x*y + y*z + z*x
if val <= N-1:
lst[val-1] += 1
print(*lst,sep="\n")
| import itertools
N = int(input())
lst = [0]*N
for x,y,z in itertools.product(list(range(1,int(N**0.5))),repeat=3):
val = x*x + y*y + z*z + x*y + y*z + z*x
if val <= N:
lst[val-1] += 1
print(*lst,sep="\n") | [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 325,774 | 325,775 | u757117214 | python |
p02608 | import itertools
N = int(input())
lst = [0]*N
for x,y,z in itertools.product(list(range(1,int(N**0.5))),repeat=3):
val = x*x + y*y +z*z + x*y + y*z + z*x
if val <= N-1:
lst[val-1] += 1
print(*lst,sep="\n")
| import itertools
N = int(input())
lst = [0]*N
for x,y,z in itertools.product(list(range(1,int(N**0.5))),repeat=3):
val = x*x + y*y + z*z + x*y + y*z + z*x
if val <= N:
lst[val-1] += 1
print(*lst,sep="\n") | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 325,776 | 325,775 | u757117214 | python |
p02608 | n = int(input())
memo = [0]*1010
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
z = i**2+j**2+k**2+i*j+j*k+k*i
if z <= n:
memo[z] += 1
for i in range(1, n+1):
print(memo[i]) | n = int(input())
memo = [0]*10010
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
z = i**2+j**2+k**2+i*j+j*k+k*i
if z <= n:
memo[z] += 1
for i in range(1, n+1):
print(memo[i]) | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 325,779 | 325,780 | u672475305 | python |
p02615 | n = int(input())
a = list(map(int, input().split()))
a=sorted(a,reverse=True)
ans=0
for i in range(n-1):
if i<n//2+1:
ans+=a[i]
else:
ans+=a[i-n//2]
print(ans)
| n = int(input())
a = list(map(int, input().split()))
a=sorted(a,reverse=True)
ans=0
for i in range(n-1):
if i<n//2:
ans+=a[i]
else:
ans+=a[i-n//2+1]
print(ans) | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 325,783 | 325,784 | u260216890 | python |
p02615 | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)... | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 325,785 | 325,786 | u726872801 | python |
p02615 | import heapq
n = int(input())
data = list(map(int, input().split()))
data.sort(reverse=True)
q = []
heapq.heappush(q, data[1])
heapq.heappush(q, data[1])
result = data[0]
for i in range(2, n):
result += heapq.heappop(q)
heapq.heappush(q, data[i])
heapq.heappush(q, data[i])
print(result) | import heapq
n = int(input())
data = list(map(int, input().split()))
data.sort(reverse=True)
q = []
heapq.heappush(q, -data[1])
heapq.heappush(q, -data[1])
result = data[0]
for i in range(2, n):
result += -heapq.heappop(q)
heapq.heappush(q, -data[i])
heapq.heappush(q, -data[i])
print(result) | [
"expression.operation.unary.add",
"call.arguments.change"
] | 325,808 | 325,809 | u957796755 | python |
p02615 | import heapq
n = int(input())
data = list(map(int, input().split()))
data.sort(reverse=True)
q = []
heapq.heappush(q, data[0])
heapq.heappush(q, data[1])
result = data[0]
for i in range(2, n):
result += heapq.heappop(q)
heapq.heappush(q, data[i])
heapq.heappush(q, data[i])
print(result) | import heapq
n = int(input())
data = list(map(int, input().split()))
data.sort(reverse=True)
q = []
heapq.heappush(q, -data[1])
heapq.heappush(q, -data[1])
result = data[0]
for i in range(2, n):
result += -heapq.heappop(q)
heapq.heappush(q, -data[i])
heapq.heappush(q, -data[i])
print(result) | [
"expression.operation.unary.add",
"call.arguments.change",
"literal.number.integer.change",
"variable_access.subscript.index.change"
] | 325,810 | 325,809 | u957796755 | python |
p02615 | n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
if n%2==0:
print(a[0]+2*sum(a[1:n//2]))
else:
temp=n//2+1
print(a[0]+2*sum(a[1:temp-1])+a[temp]) | n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
if n%2==0:
print(a[0]+2*sum(a[1:n//2]))
else:
temp=n//2+1
print(a[0]+2*sum(a[1:temp-1])+a[temp-1]) | [
"expression.operation.binary.add"
] | 325,835 | 325,836 | u131881594 | python |
p02615 | n=int(input())
l=list(map(int,input().split()))
l.sort()
ct = 0
j=n-1
a=0
for i in range(n-1):
if((j==n-1 and ct==1) or (ct==2)):
j-=1
a+=l[j]
ct+=1
print(a) | n=int(input())
l=list(map(int,input().split()))
l.sort()
ct = 0
j=n-1
a=0
for i in range(n-1):
if((j==n-1 and ct==1) or (ct==2)):
j-=1
ct=0
a+=l[j]
ct+=1
print(a) | [
"assignment.add"
] | 325,839 | 325,840 | u251899209 | python |
p02615 | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
result = 0
for i in range(N):
result += A[(i + 1) // 2]
print(result)
| N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
result = 0
for i in range(N - 1):
result += A[(i + 1) // 2]
print(result)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 325,849 | 325,850 | u347640436 | python |
p02615 | from math import ceil
from collections import defaultdict as dd
import sys
input=sys.stdin.readline
#t=int(input())
#while t:
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
ans=l[0]
ii=1
cou=0
for i in range(2,n):
if(cou==2):
ii+=1
cou=0
ans+=l[ii]
print(ans)
| from math import ceil
from collections import defaultdict as dd
import sys
input=sys.stdin.readline
#t=int(input())
#while t:
n=int(input())
l=list(map(int,input().split()))
l.sort(reverse=True)
ans=l[0]
ii=1
cou=0
for i in range(2,n):
if(cou==2):
ii+=1
cou=0
ans+=l[ii]
cou+=1
print(ans)
| [] | 325,859 | 325,860 | u575045134 | python |
p02615 | from math import ceil
N = int(input())
A = [int(i) for i in input().split()]
A.sort(reverse=True)
c = 0
for i in range((N+1)//2):
c += A[i]*2
print(c - A[0] - A[(N+1)//2]*(N&1)) | from math import ceil
N = int(input())
A = [int(i) for i in input().split()]
A.sort(reverse=True)
c = 0
for i in range((N+1)//2):
c += A[i]*2
print(c - A[0] - A[(N-1)//2]*((N)&1)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 325,873 | 325,874 | u452269253 | python |
p02616 | import sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
import random
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7
def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
... | import sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
import random
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7
def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 325,893 | 325,894 | u067983636 | python |
p02616 | import sys
input = sys.stdin.readline
n_k = list(map(int, input().split()))
n = n_k[0]
k = n_k[1]
a = list(map(int, input().split()))
a_pos = list(filter(lambda v: v >= 0, a))
a_neg = list(filter(lambda v: v < 0, a))
a_pos.sort(reverse=True)
a_neg.sort()
mod = 10**9+7
ans = 1
if n == k:
for a_i in a:
a... | import sys
input = sys.stdin.readline
n_k = list(map(int, input().split()))
n = n_k[0]
k = n_k[1]
a = list(map(int, input().split()))
a_pos = list(filter(lambda v: v >= 0, a))
a_neg = list(filter(lambda v: v < 0, a))
a_pos.sort(reverse=True)
a_neg.sort()
mod = 10**9+7
ans = 1
if n == k:
for a_i in a:
a... | [
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 325,899 | 325,900 | u670469727 | python |
p02616 | n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
mod=10**9+7
ans=1
i=0
j=-1
k_1=k
while k_1>1:
if a[i]*a[i+1]>a[j]*a[j-1]:
ans=ans*a[i]*a[i+1]%mod
i+=2
k_1-=2
else:
ans=ans*a[j]%mod
j-=1
k_1-=1
if k_1==1:
ans=ans*a[j]%mod
if a[-1]<0 and k%2==1:
for i in a[n-k:]:
... | n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
mod=10**9+7
ans=1
i=0
j=-1
k_1=k
while k_1>1:
if a[i]*a[i+1]>a[j]*a[j-1]:
ans=ans*a[i]*a[i+1]%mod
i+=2
k_1-=2
else:
ans=ans*a[j]%mod
j-=1
k_1-=1
if k_1==1:
ans=ans*a[j]%mod
if a[-1]<0 and k%2==1:
ans=1
for i in a[n-... | [
"assignment.add"
] | 325,959 | 325,960 | u414050834 | python |
p02616 | #n,k,*a=map(int,open(0).read().split())
n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.sort()
print(a)
mod=10**9+7
ans=1
i=0
j=-1
kk=k
while kk>1:
if a[i]*a[i+1]>a[j]*a[j-1]:
ans=ans*a[i]*a[i+1]%mod
i+=2
kk-=2
else:
ans=ans*a[j]%mod
j... | #n,k,*a=map(int,open(0).read().split())
n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a.sort()
mod=10**9+7
ans=1
i=0
j=-1
kk=k
while kk>1:
if a[i]*a[i+1]>a[j]*a[j-1]:
ans=ans*a[i]*a[i+1]%mod
i+=2
kk-=2
else:
ans=ans*a[j]%mod
j-=1
... | [
"call.remove"
] | 326,059 | 326,060 | u669812251 | python |
p02616 | n,k=map(int,input().split())
arr=list(map(int,input().split()))
arr.sort(reverse=True)
n=len(arr)
l=0
r=n-1
ans=1
if k%2==1:
ans=arr[0]
l=1
m=10**9+7
if ans<0:
for i in range(k):
ans*=arr[i]
ans%=m
print(ans)
quit()
for i in range(k//2):
po=arr[l]*arr[l+1]
ne=arr[r]*arr[r-1]
... | n,k=map(int,input().split())
arr=list(map(int,input().split()))
arr.sort(reverse=True)
n=len(arr)
l=0
r=n-1
ans=1
if k%2==1:
ans=arr[0]
l=1
m=10**9+7
if ans<0:
ans=1
for i in range(k):
ans*=arr[i]
ans%=m
print(ans)
quit()
for i in range(k//2):
po=arr[l]*arr[l+1]
ne=arr[r]... | [
"assignment.add"
] | 326,158 | 326,159 | u567225946 | python |
p02616 | import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
s = []; t = [];
for a in A:
if a < 0:
t.append(a)
else:
s.append(a)
P = 10 ** 9 + 7
# 非負にできるか判定
S = len(s)
T = len(t)
ok = False
if S > 0:
if N == K:
ok = (T % 2 =... | import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
s = []; t = [];
for a in A:
if a < 0:
t.append(a)
else:
s.append(a)
P = 10 ** 9 + 7
# 非負にできるか判定
S = len(s)
T = len(t)
ok = False
if S > 0:
if N == K:
ok = (T % 2 =... | [
"expression.operation.binary.remove"
] | 326,168 | 326,169 | u197955752 | python |
p02616 | import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
s = []; t = [];
for a in A:
if a < 0:
t.append(a)
else:
s.append(a)
P = 10 ** 9 + 7
# 非負にできるか判定
S = len(s)
T = len(t)
ok = False
if S > 0:
if N == K:
ok = (T % 2 =... | import sys
input = sys.stdin.readline
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
s = []; t = [];
for a in A:
if a < 0:
t.append(a)
else:
s.append(a)
P = 10 ** 9 + 7
# 非負にできるか判定
S = len(s)
T = len(t)
ok = False
if S > 0:
if N == K:
ok = (T % 2 =... | [
"expression.operation.binary.remove"
] | 326,170 | 326,169 | u197955752 | python |
p02616 | n, k = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
AA = sorted(A, key=lambda x: -abs(x))
nega1 = []
posi1 = []
for a in AA[:k]:
if a < 0:
nega1.append(a)
else:
posi1.append(a)
nega2 = []
posi2 = []
for a in AA[k:]:
if a < 0:
nega2.append(a)
else:
posi2.app... | n, k = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
AA = sorted(A, key=lambda x: -abs(x))
nega1 = []
posi1 = []
for a in AA[:k]:
if a < 0:
nega1.append(a)
else:
posi1.append(a)
nega2 = []
posi2 = []
for a in AA[k:]:
if a < 0:
nega2.append(a)
else:
posi2.app... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 326,273 | 326,274 | u802963389 | python |
p02616 | from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
... | from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
... | [
"call.remove",
"control_flow.branch.if.condition.change"
] | 326,370 | 326,371 | u788260274 | python |
p02616 | N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
X = sorted([a for a in A if a > 0])
Y = sorted([a for a in A if a < 0], key=lambda x: abs(x))
if 2 * (min(K, len(Y)) // 2) + len(X) >= K:
ans = 1
if K % 2 == 1:
ans *= X.pop()
K -= 1
XX = [(x1 * x2) for... | N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
X = sorted([a for a in A if a >= 0])
Y = sorted([a for a in A if a < 0], key=lambda x: abs(x))
if 2 * (min(K, len(Y)) // 2) + len(X) >= K:
ans = 1
if K % 2 == 1:
ans *= X.pop()
K -= 1
XX = [(x1 * x2) fo... | [
"expression.operator.compare.change",
"assignment.value.change",
"call.arguments.change"
] | 326,380 | 326,381 | u075012704 | python |
p02616 | import operator
from functools import reduce
N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
positives = [a for a in A if a > 0]
negatives = [a for a in A if a < 0]
positive_cnt = len(positives)
negative_cnt = len(negatives)
zero_cnt = A.count(0)
if 2 * min(K // 2, negative_cnt... | import operator
from functools import reduce
N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
positives = [a for a in A if a > 0]
negatives = [a for a in A if a < 0]
positive_cnt = len(positives)
negative_cnt = len(negatives)
zero_cnt = A.count(0)
if 2 * min(K // 2, negative_cnt... | [
"expression.operation.binary.add"
] | 326,382 | 326,383 | u075012704 | python |
p02616 | n,k=map(int, input().split())
A=sorted(list(map(int, input().split())))
mod=10**9+7
if A[-1]<0 and k%2==1:
now=1
for i in range(k):
now*=A[-i-1]%mod
now%=mod
# print(now)
exit()
l=0
r=n-1
ans=1
if k%2==1:
ans=A[-1]
# print(ans)
r-=1
for i in range(k//2):
mi=A[l]*A[l+1]
... | n,k=map(int,input().split())
A=sorted(list(map(int, input().split())))
mod=10**9+7
if A[-1]<0 and k%2==1:
now=1
for i in range(k):
now*=A[-i-1]%mod
now%=mod
print(now)
exit()
l=0
r=n-1
ans=1
if k%2==1:
ans=A[-1]
# print(ans)
r-=1
for i in range(k//2):
mi=A[l]*A[l+1]
#... | [
"call.add"
] | 326,388 | 326,389 | u844590940 | python |
p02616 | n,k = map(int,input().split())
a = list(map(int,input().split()))
s = sorted(a,reverse=True)
mod = 10**9 + 7
ans = 1
if k % 2 == 1 and s[0] < 0:
for i in range(k):
ans = ans * s[i] % mod
print(ans)
exit()
l = 0
r = n - 1
if k % 2 == 1:
ans = ans * s[r]
r -= 1
for _ in range(k... | n,k = map(int,input().split())
a = list(map(int,input().split()))
s = sorted(a,reverse=True)
mod = 10**9 + 7
ans = 1
if k % 2 == 1 and s[0] < 0:
for i in range(k):
ans = ans * s[i] % mod
print(ans)
exit()
l = 0
r = n - 1
if k % 2 == 1:
ans = ans * s[l]
l += 1
for _ in range(k... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 326,410 | 326,411 | u570155187 | python |
p02616 | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
def solve():
N, K = mapint()
As = list(mapint())
mod = 10**9+7
pos = []
neg = []
for a in As:
if a>=0:
pos.append(a)
else:
... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
def solve():
N, K = mapint()
As = list(mapint())
mod = 10**9+7
pos = []
neg = []
for a in As:
if a>=0:
pos.append(a)
else:
... | [
"expression.operation.binary.add"
] | 326,426 | 326,427 | u054514819 | python |
p02616 | # AFTER EDITORIAL, WIP
def solve(ls, k, debug=0):
modulo = 10 ** 9 + 7
n = len(ls)
n_neg = 0
for i in range(n):
n_neg += ls[i] < 0
n_pos = n - n_neg
# Sort by abs
ls_abs = [abs(x) for x in ls]
ls_abs_argsort = sorted(list(range(n)), key=lambda i: -ls_abs[i])
# Check if pos... | # AFTER EDITORIAL, WIP
def solve(ls, k, debug=0):
modulo = 10 ** 9 + 7
n = len(ls)
n_neg = 0
for i in range(n):
n_neg += ls[i] < 0
n_pos = n - n_neg
# Sort by abs
ls_abs = [abs(x) for x in ls]
ls_abs_argsort = sorted(list(range(n)), key=lambda i: -ls_abs[i])
# Check if pos... | [] | 326,433 | 326,434 | u330912904 | python |
p02616 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
ans = 1
if k == n:
for i in range(n):
ans *= a[i]
ans %= mod
print(ans)
exit()
if max(a) < 0 and k%2 == 1:
a.sort(reverse=True)
for i in range(k):
ans *= a[i]
ans %= mod
print(an... | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
ans = 1
if k == n:
for i in range(n):
ans *= a[i]
ans %= mod
print(ans)
exit()
if max(a) < 0 and k%2 == 1:
a.sort(reverse=True)
for i in range(k):
ans *= a[i]
ans %= mod
print(an... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 326,452 | 326,453 | u287132915 | python |
p02616 | import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss = lambda... | import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss = lambda... | [] | 326,454 | 326,455 | u324314500 | python |
p02616 | N,K=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort(key=lambda x:abs(x),reverse=True)
mod=10**9+7
p=[]
m=[]
zero=False
cntm=0
cntp=0
for aa in a:
if aa>0:
p.append(aa)
if cntp+cntm<K:
cntp+=1
elif aa<0:
m.append(-aa)
if cntp+cntm<K:
... | N,K=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort(key=lambda x:abs(x),reverse=True)
mod=10**9+7
p=[]
m=[]
zero=False
cntm=0
cntp=0
for aa in a:
if aa>=0:
p.append(aa)
if cntp+cntm<K:
cntp+=1
elif aa<0:
m.append(-aa)
if cntp+cntm<K:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 326,526 | 326,527 | u860829879 | python |
p02616 | N,K=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort(key=lambda x:abs(x),reverse=True)
mod=10**9+7
p=[]
m=[]
zero=False
cntm=0
cntp=0
for aa in a:
if aa>0:
p.append(aa)
if cntp+cntm<K:
cntp+=1
elif aa<0:
m.append(-aa)
if cntp+cntm<K:
... | N,K=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort(key=lambda x:abs(x),reverse=True)
mod=10**9+7
p=[]
m=[]
zero=False
cntm=0
cntp=0
for aa in a:
if aa>=0:
p.append(aa)
if cntp+cntm<K:
cntp+=1
elif aa<0:
m.append(-aa)
if cntp+cntm<K:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 326,528 | 326,527 | u860829879 | python |
p02616 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n, k = map(int, input().split())
a = list( map(int, input().split()))
p = 10**9+7
a.sort()
from bisect import bisect_left, bisect_right
zerostart = bisect_left(a, 0)
posstart = bisect_right(a, 0)
aneg = a[:zerostart]
cntzero = posstart - zerosta... |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
n, k = map(int, input().split())
a = list( map(int, input().split()))
p = 10**9+7
a.sort()
from bisect import bisect_left, bisect_right
zerostart = bisect_left(a, 0)
posstart = bisect_right(a, 0)
aneg = a[:zerostart]
cntzero = posstart - zerostar... | [
"assignment.variable.change",
"identifier.change"
] | 326,532 | 326,533 | u952467214 | python |
p02616 | # coding: utf-8
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
B = sorted(A, key=lambda x: abs(x), reverse=True)
Bp = [x for x in B if x > 0]
Bm = [x for x in B if x < 0]
Bpm = [x for x in B if x != 0]
Bmm = []
for i in range(0, len(Bm)-1, 2):
... | # coding: utf-8
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
B = sorted(A, key=lambda x: abs(x), reverse=True)
Bp = [x for x in B if x > 0]
Bm = [x for x in B if x < 0]
Bpm = [x for x in B if x != 0]
Bmm = []
for i in range(0, len(Bm)-1, 2):
... | [
"control_flow.branch.if.condition.change"
] | 326,539 | 326,540 | u063896676 | python |
p02616 | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7
def inp():
'''
一つの... | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7
def inp():
'''
一つの... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 326,559 | 326,560 | u802977614 | python |
p02616 | #!/usr/bin/env python
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9+7
a.sort()
ret = 1
if k % 2 == 0 or a[-1] >= 0:
l = 0
r = -1
mlt1 = a[0] * a[1]
mlt2 = a[-2] * a[-1]
for _ in range(k//2):
if m... | #!/usr/bin/env python
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9+7
a.sort()
ret = 1
if k % 2 == 0 or a[-1] >= 0:
l = 0
r = -1
mlt1 = a[0] * a[1]
mlt2 = a[-2] * a[-1]
for _ in range(k//2):
if m... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 326,593 | 326,592 | u399155892 | python |
p02616 | n, k = map(int, input().split())
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
negs = [-x for x in A if x < 0]
non_negs = [x for x in A if x >= 0]
def inv(a):
return pow(a, mod - 2, mod)
# 負の数を選ばざるを得ない数を考える
# 選べる負の数の個数の最小
n_min = k - (max(n - len(negs), 0))
# 選べる負の数の個数の最大
n_max = min(n, k)
# この2数が一致して... | n, k = map(int, input().split())
A = list(map(int, input().split()))
mod = 10 ** 9 + 7
negs = [-x for x in A if x < 0]
non_negs = [x for x in A if x >= 0]
def inv(a):
return pow(a, mod - 2, mod)
# 負の数を選ばざるを得ない数を考える
# 選べる負の数の個数の最小
n_min = k - (max(n - len(negs), 0))
# 選べる負の数の個数の最大
n_max = min(n, k)
# この2数が一致し... | [] | 326,634 | 326,635 | u994521204 | python |
p02616 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia = sorted([i for i in a if i < 0], reverse=True)
pla = sorted([i for i in a if i >= 0])
ans, num = 1, []
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
ans = ans * i % mod
print(ans)
exit()
for _ in rang... | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia = sorted([i for i in a if i < 0], reverse=True)
pla = sorted([i for i in a if i >= 0])
ans, num = 1, []
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
ans = ans * i % mod
print(ans); exit()
for _ in range(k... | [
"control_flow.branch.if.condition.change"
] | 326,641 | 326,642 | u222668979 | python |
p02616 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia = sorted([i for i in a if i < 0], reverse=True)
pla = sorted([i for i in a if i >= 0])
ans, num = 1, []
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
ans = ans * i % mod
print(ans)
exit()
for _ in rang... | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia = sorted([i for i in a if i < 0], reverse=True)
pla = sorted([i for i in a if i >= 0])
ans, num = 1, []
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
ans = ans * i % mod
print(ans)
exit()
for _ in rang... | [
"control_flow.branch.if.condition.change"
] | 326,641 | 326,643 | u222668979 | python |
p02616 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia = sorted([i for i in a if i < 0], reverse=True)
pla = sorted([i for i in a if i >= 0])
cnt = 1
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
cnt *= i
else:
while k > 0:
if k == 1 or len(mia) <= 1:
... | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia = sorted([i for i in a if i < 0], reverse=True)
pla = sorted([i for i in a if i >= 0])
cnt = 1
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
cnt = cnt * i % mod
else:
while k > 0:
if k == 1 or len(m... | [
"assignment.value.change"
] | 326,644 | 326,645 | u222668979 | python |
p02616 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia, pla = [], []
for ai in a:
if ai < 0:
mia.append(ai)
elif ai >= 0:
pla.append(ai)
mia.sort(reverse=True)
pla.sort()
cnt = 1
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
cnt = cnt * i
el... | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia, pla = [], []
for ai in a:
if ai < 0:
mia.append(ai)
elif ai >= 0:
pla.append(ai)
mia.sort(reverse=True)
pla.sort()
cnt = 1
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
cnt = cnt * i % ... | [
"assignment.change"
] | 326,646 | 326,647 | u222668979 | python |
p02616 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
print(n,k)
mia, pla = [], []
for ai in a:
if ai < 0:
mia.append(ai)
elif ai >= 0:
pla.append(ai)
mia.sort(reverse=True)
pla.sort()
cnt = 1
if len(pla) == 0 and k % 2 == 1:
for i in mia[:k]:
cnt =... | #with open('random_pm00.txt') as f:
#n, k = map(int, f.readline().split())
#a = list(map(int, f.readline().split()))
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
mia, pla = [], []
for ai in a:
if ai < 0:
mia.append(ai)
elif ai >= 0:
pla.append(a... | [
"call.remove"
] | 326,648 | 326,649 | u222668979 | python |
p02616 | import numpy as np
import sys
n,k = map(int,input().split())
a_list = sorted(map(int,input().split()))
mod = 10**9+7
if n-k < a_list.count(0):
print(0)
exit()
if (sum([1 for a in a_list if np.sign(a)!=-1])==0 and k%2==1) or (k==n and len([1 for a in a_list if np.sign(a)==-1])%2==1):
a_list.sort(key = abs)
... | import numpy as np
import sys
n,k = map(int,input().split())
a_list = sorted(map(int,input().split()))
mod = 10**9+7
if n-k < a_list.count(0):
print(0)
exit()
if (sum([1 for a in a_list if np.sign(a)!=-1])==0 and k%2==1) or (k==n and len([1 for a in a_list if np.sign(a)==-1])%2==1):
a_list.sort(key = abs)
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 326,698 | 326,699 | u180172332 | python |
p02616 | import numpy as np
import sys
n,k = map(int,input().split())
a_list = sorted(map(int,input().split()))
mod = 10**9+7
if n-k < a_list.count(0):
print(0)
exit()
if (sum([1 for a in a_list if np.sign(a)!=-1])==0 and k%2==1) or (k==n and len([1 for a in a_list if np.sign(a)==-1])%2==1):
a_list.sort(key = abs)
... | import numpy as np
import sys
n,k = map(int,input().split())
a_list = sorted(map(int,input().split()))
mod = 10**9+7
if n-k < a_list.count(0):
print(0)
exit()
if (sum([1 for a in a_list if np.sign(a)!=-1])==0 and k%2==1) or (k==n and len([1 for a in a_list if np.sign(a)==-1])%2==1):
a_list.sort(key = abs)
... | [] | 326,700 | 326,699 | u180172332 | python |
p02616 | M=10**9+7
n,k,*a=map(int,open(y:=0).read().split())
a.sort()
x=s=1
r=k
while r>0:
if(t:=a[y]*a[y+1])>a[-x]*a[~x]:s=s*t%M;y+=2;r-=2
else:s=s*a[-x]%M;x+=1;r-=1
if r:s*=a[-x]
if a[-1]<0<k%2:
s=1
for i in a[-k:]:s=s*i%M
print(s%M) | M=10**9+7
n,k,*a=map(int,open(y:=0).read().split())
a.sort()
x=s=1
r=k
while r>1:
if(t:=a[y]*a[y+1])>a[-x]*a[~x]:s=s*t%M;y+=2;r-=2
else:s=s*a[-x]%M;x+=1;r-=1
if r:s*=a[-x]
if a[-1]<0<k%2:
s=1
for i in a[-k:]:s=s*i%M
print(s%M) | [
"literal.number.integer.change",
"control_flow.loop.condition.change"
] | 326,709 | 326,710 | u729133443 | python |
p02616 | def main():
M=10**9+7
n,k,*a=map(int,open(0).read().split())
x,y=[],[]
for i in a:
if i>0:x+=i,
if i<0:y+=i,
if len(x)+len(y)<k or k%2 and not x and len(y)<n:
print(0)
return
if n==k or k%2 and not x:
c=1
for i in sorted(y)[-k:]:
c=c*i%... | def main():
M=10**9+7
n,k,*a=map(int,open(0).read().split())
x,y=[],[]
for i in a:
if i>0:x+=i,
if i<0:y+=i,
if len(x)+len(y)<k or k%2 and not x and len(y)<n:
print(0)
return
if n==k or k%2 and not x:
c=1
for i in sorted(x+y)[-k:]:
c=c*... | [
"expression.operation.binary.add"
] | 326,711 | 326,712 | u729133443 | python |
p02616 | import numpy as np
N,K = map(int,input().split())
import math
A = list(map(int,input().split()))
flag = 0
if 0 in A:
flag = 1
A.sort()
plus = list(filter(lambda x:x>0, A))[::-1]
plus = list(map(lambda x:np.longdouble(math.log(x,10000000)),plus))
from itertools import accumulate
acc_plu = [0] + list(accumulate(plu... | import numpy as np
N,K = map(int,input().split())
import math
A = list(map(int,input().split()))
flag = 0
if 0 in A:
flag = 1
A.sort()
plus = list(filter(lambda x:x>0, A))[::-1]
plus = list(map(lambda x:np.longdouble(math.log(x,10000000)),plus))
from itertools import accumulate
acc_plu = [0] + list(accumulate(plu... | [
"call.remove"
] | 326,735 | 326,736 | u020604402 | python |
p02616 | import numpy as np
N,K = map(int,input().split())
import math
A = list(map(int,input().split()))
flag = 0
if 0 in A:
flag = 1
A.sort()
plus = list(filter(lambda x:x>0, A))[::-1]
plus = list(map(lambda x:np.longdouble(math.log(x,10000000)),plus))
from itertools import accumulate
acc_plu = [0] + list(accumulate(plu... | import numpy as np
N,K = map(int,input().split())
import math
A = list(map(int,input().split()))
flag = 0
if 0 in A:
flag = 1
A.sort()
plus = list(filter(lambda x:x>0, A))[::-1]
plus = list(map(lambda x:np.longdouble(math.log(x,10000000)),plus))
from itertools import accumulate
acc_plu = [0] + list(accumulate(plu... | [
"call.add",
"call.arguments.change"
] | 326,737 | 326,736 | u020604402 | python |
p02616 | def main():
import sys
N,K=list(map(int,sys.stdin.readline().split()))
A=list(map(int,sys.stdin.readline().split()))
Ap=[x for x in A if x>=0 ]
Am=[abs(x) for x in A if x<0]
if K==N:
out=1
for a in A:
out*=a
out%=10**9+7
print(out)
return... | def main():
import sys
N,K=list(map(int,sys.stdin.readline().split()))
A=list(map(int,sys.stdin.readline().split()))
Ap=[x for x in A if x>=0 ]
Am=[abs(x) for x in A if x<0]
if K==N:
out=1
for a in A:
out*=a
out%=10**9+7
print(out)
return... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 326,862 | 326,861 | u129019798 | python |
p02616 | def main():
import sys
N,K=list(map(int,sys.stdin.readline().split()))
A=list(map(int,sys.stdin.readline().split()))
Ap=[x for x in A if x>=0 ]
Am=[abs(x) for x in A if x<0]
if K==N:
out=1
for a in A:
out*=a
out%=10**9+7
print(out)
return... | def main():
import sys
N,K=list(map(int,sys.stdin.readline().split()))
A=list(map(int,sys.stdin.readline().split()))
Ap=[x for x in A if x>=0 ]
Am=[abs(x) for x in A if x<0]
if K==N:
out=1
for a in A:
out*=a
out%=10**9+7
print(out)
return... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 326,863 | 326,861 | u129019798 | python |
p02616 | from collections import deque
div = 10 ** 9 + 7
n, k = map(int, input().split())
A = deque(sorted([int(x) for x in input().split()]))
maxA = A[-1]
ans = 1
for i in range(k // 2):
l1 = A[0]
l2 = A[1]
r1 = A[-1]
r2 = A[-2]
l = l1 * l2
r = r1 * r2
if k % 2 == 1 and maxA < 0:
ans *= r
... | from collections import deque
div = 10 ** 9 + 7
n, k = map(int, input().split())
A = deque(sorted([int(x) for x in input().split()]))
maxA = A[-1]
ans = 1
for i in range(k // 2):
l1 = A[0]
l2 = A[1]
r1 = A[-1]
r2 = A[-2]
l = l1 * l2
r = r1 * r2
if k % 2 == 1 and maxA < 0:
ans *= r
... | [] | 326,872 | 326,873 | u655110382 | python |
p02616 | mod = 10**9 + 7
n, k = map(int, input().split())
a = list(map(int, input().split()))
if n == k:
ans = 1
for i in a:
ans *= i
ans %= mod
print(ans)
m = []
p = []
zero = 0
for i in a:
if i < 0:
m.append(-i)
elif i > 0:
p.append(i)
else:
zero += 1
if n - k... | mod = 10**9 + 7
n, k = map(int, input().split())
a = list(map(int, input().split()))
if n == k:
ans = 1
for i in a:
ans *= i
ans %= mod
print(ans)
exit()
m = []
p = []
zero = 0
for i in a:
if i < 0:
m.append(-i)
elif i > 0:
p.append(i)
else:
zero += ... | [
"call.add"
] | 326,904 | 326,905 | u070201429 | python |
p02616 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
import math
n,k = map(int, input().split())
a = list(map(int, input().split()))
a1 = [item for item in a if item>0]
a2 = [item for item in a if item<0]
n1 = sum(item>0 for item ... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
import math
n,k = map(int, input().split())
a = list(map(int, input().split()))
a1 = [item for item in a if item>0]
a2 = [item for item in a if item<0]
n1 = sum(item>0 for item ... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 326,944 | 326,943 | u535803878 | python |
p02616 | n,k=map(int,input().split())
a = list(map(int, input().split()))
b = [(abs(i), 1 if i >= 0 else -1) for i in a]
b = sorted(b)
b = list(reversed(b))
mod = int(1e9 + 7)
def fp(x,y):
res=1
while y > 0:
if y % 2 == 1:
res *= x
x *= x
y //= 2
x %= mod
res %= mod
return res
def inv(x):
return fp(x,mod-2)... | n,k=map(int,input().split())
a = list(map(int, input().split()))
b = [(abs(i), 1 if i >= 0 else -1) for i in a]
b = sorted(b)
b = list(reversed(b))
mod = int(1e9 + 7)
def fp(x,y):
res=1
while y > 0:
if y % 2 == 1:
res *= x
x *= x
y //= 2
x %= mod
res %= mod
return res
def inv(x):
return fp(x,mod-2)... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 326,962 | 326,963 | u325340669 | python |
p02616 | import sys
input = sys.stdin.readline
mod = 10**9+7
N, K = map(int, input().split())
A = list(map(int, input().split()))
Mi = []
for a in A:
if a != 0:
Mi.append((abs(a), a//abs(a)))
Mi.sort(reverse=True)
if len(Mi) < K:
ans = 0
else:
ans = 1
seg = 1
lastinv = -1
lastpu = -1
for ... | import sys
input = sys.stdin.readline
mod = 10**9+7
N, K = map(int, input().split())
A = list(map(int, input().split()))
Mi = []
for a in A:
if a != 0:
Mi.append((abs(a), a//abs(a)))
Mi.sort(reverse=True)
if len(Mi) < K:
ans = 0
else:
ans = 1
seg = 1
lastinv = -1
lastpu = -1
for ... | [] | 326,978 | 326,979 | u677523557 | python |
p02616 | import sys
input = sys.stdin.readline
mod = 10**9+7
N, K = map(int, input().split())
A = list(map(int, input().split()))
Mi = []
for a in A:
if a != 0:
Mi.append((abs(a), a//abs(a)))
Mi.sort(reverse=True)
if len(Mi) < K:
ans = 0
else:
ans = 1
seg = 1
lastinv = -1
lastpu = -1
for ... | import sys
input = sys.stdin.readline
mod = 10**9+7
N, K = map(int, input().split())
A = list(map(int, input().split()))
Mi = []
for a in A:
if a != 0:
Mi.append((abs(a), a//abs(a)))
Mi.sort(reverse=True)
if len(Mi) < K:
ans = 0
else:
ans = 1
seg = 1
lastinv = -1
lastpu = -1
for ... | [] | 326,980 | 326,979 | u677523557 | python |
p02616 | import sys
input = sys.stdin.readline
mod = 10**9+7
N, K = map(int, input().split())
A = list(map(int, input().split()))
Mi = []
for a in A:
if a != 0:
Mi.append((abs(a), a//abs(a)))
Mi.sort(reverse=True)
if len(Mi) < K:
ans = 0
else:
ans = 1
seg = 1
lastinv = -1
lastpu = -1
for ... | import sys
input = sys.stdin.readline
mod = 10**9+7
N, K = map(int, input().split())
A = list(map(int, input().split()))
Mi = []
for a in A:
if a != 0:
Mi.append((abs(a), a//abs(a)))
Mi.sort(reverse=True)
if len(Mi) < K:
ans = 0
else:
ans = 1
seg = 1
lastinv = -1
lastpu = -1
for ... | [] | 326,981 | 326,979 | u677523557 | python |
p02616 | from math import log2
from itertools import accumulate
epsilon = 10 ** -5
MOD = 10 ** 9 + 7
N, K = map(int, input().split())
As = list(map(int, input().split()))
negs = []
poss = []
for A in As:
if A > 0:
poss.append(A)
elif A < 0:
negs.append(-A)
poss.sort(reverse = True)
negs.sort(reverse... | from math import log2
from itertools import accumulate
epsilon = 10 ** -5
MOD = 10 ** 9 + 7
N, K = map(int, input().split())
As = list(map(int, input().split()))
negs = []
poss = []
for A in As:
if A > 0:
poss.append(A)
elif A < 0:
negs.append(-A)
poss.sort(reverse = True)
negs.sort(reverse... | [
"call.add"
] | 327,025 | 327,026 | u034128150 | python |
p02617 | def main():
n = int(input())
ans = n * (n + 1) * (n + 2) // 6
for i in range(n):
x, y = map(int, input().split())
if x > y:
y, x = x, y
ans -= x * (n - y + 1)
print(ans)
main() | def main():
n = int(input())
ans = n * (n + 1) * (n + 2) // 6
for i in range(n-1):
x, y = map(int, input().split())
if x > y:
y, x = x, y
ans -= x * (n - y + 1)
print(ans)
main()
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 327,081 | 327,082 | u532966492 | python |
p02617 | N = int(input())
es = [[] for _ in range(N)]
H = []
for i in range(N-1):
a,b = map(int,input().split())
if a > b:
a,b = b,a
a-=1;b-=1
#es[a].append(b)
#es[b].append(a)
H.append([a,b])
print(es)
ten = N*(N+1)*(N+2)//6
hen = 0
for i in range(N-1):
p,q = H[i]
hen += (p+1)*(N-1-q+1)
ans = ten -hen
prin... | N = int(input())
es = [[] for _ in range(N)]
H = []
for i in range(N-1):
a,b = map(int,input().split())
if a > b:
a,b = b,a
a-=1;b-=1
#es[a].append(b)
#es[b].append(a)
H.append([a,b])
ten = N*(N+1)*(N+2)//6
hen = 0
for i in range(N-1):
p,q = H[i]
hen += (p+1)*(N-1-q+1)
ans = ten -hen
print(ans) | [
"call.remove"
] | 327,270 | 327,271 | u197457087 | python |
p02618 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
D = int(input())
c = list(map(int, input().split()))
s = [None]*D
for i in range(D):
s[i] = list(map(int, input().split()))
current = [0]*26
ans = [None]*D
def greedy()... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
D = int(input())
c = list(map(int, input().split()))
s = [None]*D
for i in range(D):
s[i] = list(map(int, input().split()))
current = [0]*26
ans = [None]*D
def greedy()... | [
"assignment.change"
] | 327,690 | 327,691 | u535803878 | python |
p02618 | import sys
input = sys.stdin.readline
D = int(input())
cost = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(D)]
last_held = [0 for i in range(26)]
ans = []
for date, line in enumerate(S):
max_score = line[0] - cost[0]*last_held[0]
max_index = 0
for i, score in enumera... | import sys
input = sys.stdin.readline
D = int(input())
cost = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(D)]
last_held = [-1 for i in range(26)]
ans = []
for date, line in enumerate(S):
max_score = line[0] - cost[0]*last_held[0]
max_index = 0
for i, score in enumer... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 327,703 | 327,704 | u237362582 | python |
p02618 | D = int(input())
C = [int(c) for c in input().split()]
S = [[int(s) for s in input().split()] for _ in range(D)]
T = [0]*26
for i in range(D):
temp = -1
for j in range(26):
if temp < S[i][j]:
temp = S[i][j]
idx = j+1
T[i] = idx
for t in T:
print(t) | D = int(input())
C = [int(c) for c in input().split()]
S = [[int(s) for s in input().split()] for _ in range(D)]
T = [0]*D
for i in range(D):
temp = -1
for j in range(26):
if temp < S[i][j]:
temp = S[i][j]
idx = j+1
T[i] = idx
for t in T:
print(t) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 327,742 | 327,743 | u504836877 | python |
p02618 | import numpy as np
D = int(input())
s = [input() for i in range(D+1)]
for i in range(0,D+1):
s[i] = s[i].split()
s[i] = [int(p) for p in s[i]]
a = []
b = [0]*len(s[0])
S = 0
for i in range (1,D+1):
mx = np.argmax(s[i])
for j in range(0,len(s[0])):
if j == mx:
b[j] = 0
else:
... | import numpy as np
D = int(input())
s = [input() for i in range(D+1)]
for i in range(0,D+1):
s[i] = s[i].split()
s[i] = [int(p) for p in s[i]]
a = []
b = [0]*len(s[0])
S = 0
for i in range (1,D+1):
mx = np.argmax(s[i])
for j in range(0,len(s[0])):
if j == mx:
b[j] = 0
else:
... | [
"call.arguments.change"
] | 327,747 | 327,748 | u909359131 | python |
p02618 | D,*CS = map(int, open(0).read().split())
C = CS[:26]
S = [CS[26*i:26*(i+1)] for i in range(1, D+1)]
def imax(xs):
m = -1
i = 0
for j, x in enumerate(xs):
if x > m:
i = j
m = x
return i
for d in range(D):
i = imax(S[d])
print(i)
| D,*CS = map(int, open(0).read().split())
C = CS[:26]
S = [CS[26*i:26*(i+1)] for i in range(1, D+1)]
def imax(xs):
m = -1
i = 0
for j, x in enumerate(xs):
if x > m:
i = j
m = x
return i
for d in range(D):
i = imax(S[d])
print(i + 1)
| [
"expression.operation.binary.add"
] | 327,783 | 327,784 | u200916944 | python |
p02618 | import sys
import copy
import time
import random
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
D = None
C = None
S = None
def cnt_score(t):
global D, C, S
score = 0
cnt = [-1] * 26
for i in range(D):
score += S[i][t[i] - 1]
minusscore = 0
cnt[t[i] - 1] = i
... | import sys
import copy
import time
import random
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
D = None
C = None
S = None
def cnt_score(t):
global D, C, S
score = 0
cnt = [-1] * 26
for i in range(D):
score += S[i][t[i] - 1]
minusscore = 0
cnt[t[i] - 1] = i
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.remove"
] | 327,789 | 327,790 | u098012509 | python |
p02618 | import sys
import copy
import time
import random
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
D = None
C = None
S = None
def cnt_score(t):
global D, C, S
score = 0
cnt = [-1] * 26
for i in range(D):
score += S[i][t[i] - 1]
minusscore = 0
cnt[t[i] - 1] = i
... | import sys
import copy
import time
import random
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
D = None
C = None
S = None
def cnt_score(t):
global D, C, S
score = 0
cnt = [-1] * 26
for i in range(D):
score += S[i][t[i] - 1]
minusscore = 0
cnt[t[i] - 1] = i
... | [
"call.remove"
] | 327,789 | 327,792 | u098012509 | python |
p02618 | d = int(input())
c = list(map(int,input().split()))
cmax = max(c)
for al in range(26):
if c[al] == cmax:
maxc = al
up = []
for _ in range(d):
up.append(list(map(int,input().split())))
ans = [[-1] for _ in range(26)]
for i in range(d):
ans[maxc].append(i)
task = [maxc for i in range(d)]
#print(task)
#ans[0].ap... | d = int(input())
c = list(map(int,input().split()))
cmax = max(c)
for al in range(26):
if c[al] == cmax:
maxc = al
up = []
for _ in range(d):
up.append(list(map(int,input().split())))
ans = [[-1] for _ in range(26)]
for i in range(d):
ans[maxc].append(i)
task = [maxc for i in range(d)]
#print(task)
#ans[0].ap... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.remove"
] | 327,797 | 327,798 | u111365362 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.