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 |
|---|---|---|---|---|---|---|---|
p02683 | n,m,x = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(n)]
c = [ca[i][0] for i in range(n)]
a = [ca[i][1:] for i in range(n)]
price = sum(c)
l =0
for i in range(2**n):
kari = 0
skill = [0]*m
for j in range(m):
if (i>>j) & 1:
skill = [x + y for(x,y) in zip(... | n,m,x = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(n)]
c = [ca[i][0] for i in range(n)]
a = [ca[i][1:] for i in range(n)]
price = sum(c)
l =0
for i in range(2**n):
kari = 0
skill = [0]*m
for j in range(n):
if (i>>j) & 1:
skill = [x + y for(x,y) in zip(... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,405 | 411,406 | u689890477 | python |
p02683 | n,m,x = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(n)]
c = [ca[i][0] for i in range(n)]
a = [ca[i][1:] for i in range(n)]
price = sum(c)
l =0
for i in range(2**m):
kari = 0
skill = [0]*m
for j in range(m):
if (i>>j) & 1:
skill = [x + y for(x,y) in zip(... | n,m,x = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(n)]
c = [ca[i][0] for i in range(n)]
a = [ca[i][1:] for i in range(n)]
price = sum(c)
l =0
for i in range(2**n):
kari = 0
skill = [0]*m
for j in range(n):
if (i>>j) & 1:
skill = [x + y for(x,y) in zip(... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,407 | 411,406 | u689890477 | python |
p02683 | n,m,x = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(n)]
c = [ca[i][0] for i in range(n)]
a = [ca[i][1:] for i in range(n)]
ans = 0
cost = sum(c)
for i in range(2**n):
kari = 0
skill = [0] * m
for j in range(n):
if (i >> j) & 1:
kari += c[j]
s... | n,m,x = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(n)]
c = [ca[i][0] for i in range(n)]
a = [ca[i][1:] for i in range(n)]
ans = 0
cost = sum(c)
for i in range(2**n):
kari = 0
skill = [0] * m
for j in range(n):
if (i >> j) & 1:
kari += c[j]
s... | [
"call.arguments.change"
] | 411,408 | 411,409 | u689890477 | python |
p02683 | #!/usr/bin/python3
import copy
(n, m, x) = map(int, input().split())
b = []
for i in range(n):
b.append(tuple(map(int, input().split())))
bss = [[ 0 for i in range(m + 1)]]
mc = -1
for i in range(n):
nbss = copy.copy(bss)
for bs in bss:
#print(bs, b[i])
nbs = list(map(lambda x, y: x + y... | #!/usr/bin/python3
import copy
(n, m, x) = map(int, input().split())
b = []
for i in range(n):
b.append(tuple(map(int, input().split())))
bss = [[ 0 for i in range(m + 1)]]
mc = -1
for i in range(n):
nbss = copy.copy(bss)
for bs in bss:
#print(bs, b[i])
nbs = list(map(lambda x, y: x + y... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 411,415 | 411,416 | u383015480 | python |
p02683 | n,m,x=map(int,input().split())
a=[]
ans=-1
t=[0]*(m+1)
for i in range(n):
a.append(list(map(int,input().split())))
for i in range(2 ** n):
for j in range(n):
if (i >> j) & 1:
for lnd,l in enumerate(a[j]):
t[lnd]+=l
if ans==-1 or ans > t[0]:
if min(t[1:m]) >= x:
... | n,m,x=map(int,input().split())
a=[]
ans=-1
t=[0]*(m+1)
for i in range(n):
a.append(list(map(int,input().split())))
for i in range(2 ** n):
for j in range(n):
if (i >> j) & 1:
for lnd,l in enumerate(a[j]):
t[lnd]+=l
if ans==-1 or ans > t[0]:
if min(t[1:m+1]) >= x:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 411,417 | 411,418 | u497326082 | python |
p02683 | from sys import stdin
input = stdin.readline
ans = 10 ** 10
N, M, X = map(int, input().strip().split())
C = []
A = [[]] * N
for i in range(N):
tmp = list(map(int, input().strip().split()))
C.append(tmp[0])
A[i] = tmp[1:]
for i in range(2 ** N - 1):
tans = 0
tA = [0] * M
for j in range(N):
... | from sys import stdin
input = stdin.readline
ans = 10 ** 10
N, M, X = map(int, input().strip().split())
C = []
A = [[]] * N
for i in range(N):
tmp = list(map(int, input().strip().split()))
C.append(tmp[0])
A[i] = tmp[1:]
for i in range(2 ** N):
tans = 0
tA = [0] * M
for j in range(N):
... | [
"expression.operation.binary.remove"
] | 411,419 | 411,420 | u007637377 | python |
p02683 | from sys import stdin
input = stdin.readline
ans = 10 ** 10
N, M, X = map(int, input().strip().split())
C = []
A = [[]] * N
for n in range(N):
tmp = list(map(int, input().strip().split()))
C.append(tmp[0])
A[n] = tmp[1:]
for i in range(2 ** N - 1):
tans = 0
tA = [0] * M
for j in range(N):
... | from sys import stdin
input = stdin.readline
ans = 10 ** 10
N, M, X = map(int, input().strip().split())
C = []
A = [[]] * N
for i in range(N):
tmp = list(map(int, input().strip().split()))
C.append(tmp[0])
A[i] = tmp[1:]
for i in range(2 ** N):
tans = 0
tA = [0] * M
for j in range(N):
... | [
"identifier.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 411,422 | 411,420 | u007637377 | python |
p02683 | import itertools
n, m, x = list(map(int, input().split()))
result=[]
books=[]
tmp=[]
for i in range(n):
books.append(list(map(int, input().split())))
tmp.append(i)
# 参考書の選択パターン作成
patterns=[]
for i in range(n):
patterns.append(itertools.combinations(tmp,i+1))
# 全ての参考書を購入しても条件を満たせないときは-1
for arg in range(m... | import itertools
n, m, x = list(map(int, input().split()))
result=[]
books=[]
tmp=[]
for i in range(n):
books.append(list(map(int, input().split())))
tmp.append(i)
# 参考書の選択パターン作成
patterns=[]
for i in range(n):
patterns.append(itertools.combinations(tmp,i+1))
# 全ての参考書を購入しても条件を満たせないときは-1
for arg in range(m)... | [
"assignment.remove",
"assignment.add"
] | 411,430 | 411,431 | u299791633 | python |
p02683 | import itertools
N, M, X = map(int, input().split())
book_lists = [list(map(int, input().split())) for i in range(N)]
no_skill_flg = True
for i in range(1, N+1):
for j in itertools.combinations(book_lists,i):
sum_list = [0 for _ in range(M+1)]
for book_date in j:
for k, l in enumerate(bo... | import itertools
N, M, X = map(int, input().split())
book_lists = [list(map(int, input().split())) for i in range(N)]
no_skill_flg = True
for i in range(1, N+1):
for j in itertools.combinations(book_lists,i):
sum_list = [0 for _ in range(M+1)]
for book_date in j:
for k, l in enumerate(bo... | [
"call.remove"
] | 411,432 | 411,433 | u268822556 | python |
p02683 | line = input()
N, M, X = [int(v) for v in line.split(" ")]
Ci, Aij = [], []
for i in range(N):
line = input().split(" ")
line = [int(v) for v in line]
Ci.append(line[0])
Aij.append(line[1:])
ans = []
def dfs(candidate):
if len(candidate) == M:
X_ = [0 for _ in range(M)]
cost = 0
... | line = input()
N, M, X = [int(v) for v in line.split(" ")]
Ci, Aij = [], []
for i in range(N):
line = input().split(" ")
line = [int(v) for v in line]
Ci.append(line[0])
Aij.append(line[1:])
ans = []
def dfs(candidate):
if len(candidate) == N:
X_ = [0 for _ in range(M)]
cost = 0
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 411,454 | 411,455 | u364099990 | python |
p02683 | import numpy as np
import sys
from itertools import product
n, m, x = map(int, input().split())
c = []
A = []
ans = 10**9
products = list(product([0,1], repeat=n))
for _ in range(n):
c_a = list(map(int, input().split()))
c.append(c_a[0])
A.append(c_a[1:])
min_price = 10**9
for p in products:
sum_a... | import numpy as np
import sys
from itertools import product
n, m, x = map(int, input().split())
c = []
A = []
ans = 10**9
products = list(product([0,1], repeat=n))
for _ in range(n):
c_a = list(map(int, input().split()))
c.append(c_a[0])
A.append(c_a[1:])
min_price = 10**9
for p in products:
sum_a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 411,459 | 411,460 | u527379148 | python |
p02683 | n,m,x = map(int,input().split())
ca = [list(map(int,input().split())) for i in range(n)]
mincost = 10**111
count = 0
for i in range(2**n):
li = [0]*m
cost = 0
count = 0
for j in range(n):
if (i >> j) & 1:
cost += ca[j][0]
for k in range(m):
li[k] += ca[j][k]
for l in range(m):
if ... | n,m,x = map(int,input().split())
ca = [list(map(int,input().split())) for i in range(n)]
mincost = 10**111
for i in range(2**n):
li = [0]*m
cost = 0
count = 0
for j in range(n):
if (i >> j) & 1:
cost += ca[j][0]
for k in range(m):
li[k] += ca[j][1+k]
for l in range(m):
if li[l] >=... | [
"assignment.remove",
"expression.operation.binary.add"
] | 411,461 | 411,462 | u294385082 | python |
p02683 | import itertools
import numpy as np
N,M,X = map(int, input().split())
lista = [list(map(int,input().split())) for i in range(N)]
lista = np.array(lista)
judge = [X]*M
cost = 1200001
data = [a for a in range(1,N+1)] # [1,2,3,...,N]
for i in range(1,N+1):
j = list(itertools.combinations(data, i))
for k in j:
r... | import itertools
import numpy as np
N,M,X = map(int, input().split())
lista = [list(map(int,input().split())) for i in range(N)]
lista = np.array(lista)
judge = [X]*M
cost = 120000000000
data = [a for a in range(1,N+1)] # [1,2,3,...,N]
for i in range(1,N+1):
j = list(itertools.combinations(data, i))
for k in... | [
"literal.number.integer.change",
"assignment.value.change"
] | 411,463 | 411,464 | u923662841 | python |
p02683 | import itertools
import numpy as np
N,M,X = map(int, input().split())
lista = [list(map(int,input().split())) for i in range(N)]
lista = np.array(lista)
judge = [X]*M
cost = 1200001
data = [a for a in range(1,N+1)] # [1,2,3,...,N]
for i in range(1,N+1):
j = list(itertools.combinations(data, i))
for k in j:
r... | import itertools
import numpy as np
N,M,X = map(int, input().split())
lista = [list(map(int,input().split())) for i in range(N)]
lista = np.array(lista)
judge = [X]*M
cost = 120000000000
data = [a for a in range(1,N+1)] # [1,2,3,...,N]
for i in range(1,N+1):
j = list(itertools.combinations(data, i))
for k in... | [
"literal.number.integer.change",
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 411,465 | 411,464 | u923662841 | python |
p02683 | import sys
from itertools import combinations
from collections import Counter
ct = Counter()
Ass = []
ans = []
N, M, X = map(int, input().split())
for i in range(N):
Ass.append(list(map(int, input().split())))
for z in range(M):
B = []
for i in range(N):
B.append(Ass[i][z])
D = []
for i in range(1, N+1):
for... | import sys
from itertools import combinations
from collections import Counter
ct = Counter()
Ass = []
ans = []
N, M, X = map(int, input().split())
for i in range(N):
Ass.append(list(map(int, input().split())))
for z in range(M):
B = []
for i in range(N):
B.append(Ass[i][z])
D = []
for i in range(1, N+1):
for... | [
"call.arguments.add"
] | 411,468 | 411,469 | u350412774 | python |
p02683 | import numpy as np
N, M, X = map(int, input().split())
C = np.zeros(N)
A = np.zeros((N, M))
for n in range(N):
s = list(map(int, input().split()))
C[n] = s[0]
A[n] = s[1:]
C_MIN = -1
for i in range(2 ** N):
C_SUM = 0
A_SUM = np.zeros(M)
for j in range(N):
if ((i >> j) & 1):
... | import numpy as np
N, M, X = map(int, input().split())
C = np.zeros(N)
A = np.zeros((N, M))
for n in range(N):
s = list(map(int, input().split()))
C[n] = s[0]
A[n] = s[1:]
C_MIN = -1
for i in range(2 ** N):
C_SUM = 0
A_SUM = np.zeros(M)
for j in range(N):
if ((i >> j) & 1):
... | [
"control_flow.branch.if.condition.change"
] | 411,480 | 411,481 | u163783894 | python |
p02683 | from itertools import product
n, m, x = map(int, input().split())
costs = []
gets = []
for i in range(n):
cost, *argo = map(int, input().split())
costs.append(cost)
gets.append(argo)
bits_list = list(product([0,1], repeat=n))
min_cost = float('inf')
cnt = 0
for bits in bits_list:
tmp_cost = 0
... | from itertools import product
n, m, x = map(int, input().split())
costs = []
gets = []
for i in range(n):
cost, *argo = map(int, input().split())
costs.append(cost)
gets.append(argo)
bits_list = list(product([0,1], repeat=n))
min_cost = float('inf')
cnt = 0
for bits in bits_list:
tmp_cost = 0
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 411,487 | 411,488 | u466143662 | python |
p02683 | n,m,x = map(int,input().split())
B=[list(map(int,input().split())) for i in range(n)]
ANS = 1 << 100
for i in range(1 << n):
SCORE = [0] * m
MONEY = 0
for j in range(n):
if (1 << j) & i != 0:
MONEY+=B[j][0]
for k in range(m):
SCORE[k] += B[j][k]
if min(SCO... | n,m,x = map(int,input().split())
B=[list(map(int,input().split())) for i in range(n)]
ANS = 1 << 100
for i in range(1 << n):
SCORE = [0] * m
MONEY = 0
for j in range(n):
if (1 << j) & i != 0:
MONEY+=B[j][0]
for k in range(m):
SCORE[k] += B[j][k+1]
if min(S... | [
"expression.operation.binary.add"
] | 411,489 | 411,490 | u455957070 | python |
p02683 | def main():
N,M,X=map(int, input().split())
A=[list(map(int, input().split())) for _ in range(N)]
ans=10**10
for i in range(2**N):
b=i+2**N
c=0
l=[0]*M
ok=True
for j in range(N):
if b>>j&1 == 1:
c+=A[j][0]
for k in range... | def main():
N,M,X=map(int, input().split())
A=[list(map(int, input().split())) for _ in range(N)]
ans=10**10
for i in range(2**N):
b=i+2**N
c=0
l=[0]*M
ok=True
for j in range(N):
if b>>j&1 == 1:
c+=A[j][0]
for k in range... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 411,491 | 411,492 | u273345915 | python |
p02683 | N,M,X = map(int,input().split())
A = []
S = [0 for _ in range(N)]
min_value = 0
score=[0 for _ in range(N)]
for x in range(N):
A.append(list(map(int,input().split())))
for x in range(N):
min_value += A[x][0]
sucess = 0
for bit in range(2**N):
for i in range(N):
if (bit >> i) & 1:
S.append(A[i... | N,M,X = map(int,input().split())
A = []
S = [0 for _ in range(N)]
min_value = 0
score=[0 for _ in range(M)]
for x in range(N):
A.append(list(map(int,input().split())))
for x in range(N):
min_value += A[x][0]
sucess = 0
for bit in range(2**N):
for i in range(N):
if (bit >> i) & 1:
S.append(A[i]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 411,515 | 411,516 | u608454345 | python |
p02683 | N, M, X = map(int, input().split())
books = [input() for i in range(N)]
result = 12 * 10**5 + 1
for i in range(1, 1 << N):
cost = 0
skill = [0 for i in range(N)]
for j in range(N):
if (i >> j) & 1:
book = books[j].split()
cost += int(book[0])
for k in range(M):
skill[k] += int(book[k... | N, M, X = map(int, input().split())
books = [input() for i in range(N)]
result = 12 * 10**5 + 1
for i in range(1, 1 << N):
cost = 0
skill = [0 for i in range(M)]
for j in range(N):
if (i >> j) & 1:
book = books[j].split()
cost += int(book[0])
for k in range(M):
skill[k] += int(book[k... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,524 | 411,525 | u536034761 | python |
p02683 | N, M, X = map(int, input().split())
books = [input() for i in range(N)]
result = 12 * 10**5 + 1
for i in range(1, 1 << N):
skill = [0 for i in range(N)]
for j in range(N):
if (i >> j) & 1:
book = books[j].split()
cost += int(book[0])
for k in range(M):
skill[k] += int(book[k + 1])
if... | N, M, X = map(int, input().split())
books = [input() for i in range(N)]
result = 12 * 10**5 + 1
for i in range(1, 1 << N):
cost = 0
skill = [0 for i in range(M)]
for j in range(N):
if (i >> j) & 1:
book = books[j].split()
cost += int(book[0])
for k in range(M):
skill[k] += int(book[k... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,526 | 411,525 | u536034761 | python |
p02683 | n, m, x = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
ans = float('Inf')
for i in range(2 ** n):
sum_ = [0] * m
cost = 0
for j in range(n):
#sum_ = [0] * m
if ((i >> j) & 1):
cost += a[j][0]
for k in range(m):
sum_... | n, m, x = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
ans = float('Inf')
for i in range(2 ** n):
sum_ = [0] * m
cost = 0
for j in range(n):
#sum_ = [0] * m
if ((i >> j) & 1):
cost += a[j][0]
for k in range(m):
sum_... | [
"expression.operation.binary.add"
] | 411,544 | 411,545 | u038408819 | python |
p02683 | from itertools import combinations
import numpy as np
n,m,x = map(int,input().split())
a_list = []
price_list = []
for _ in range(n):
tmp = list(map(int,input().split()))
price_list.append(tmp.pop(0))
a_list.append(tmp)
all_list = [x for x in range(len(a_list))]
prices = []
for i in range(1,len(a_list)... | from itertools import combinations
import numpy as np
n,m,x = map(int,input().split())
a_list = []
price_list = []
for _ in range(n):
tmp = list(map(int,input().split()))
price_list.append(tmp.pop(0))
a_list.append(tmp)
all_list = [x for x in range(len(a_list))]
prices = []
for i in range(1,len(a_list)... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 411,550 | 411,551 | u500944229 | python |
p02683 | def function():
N,M,X = map(int, input().split())
maxCost=0
Aij = []
for n in range(0,N):
Aj = list(map(int, input().split()))
maxCost += Aj[0]
Aij.append(Aj)
minCost = maxCost
total = pow(2, N)
for n in range(1,total):
x = [0]*M
cost = 0
i = ... | def function():
N,M,X = map(int, input().split())
maxCost=0
Aij = []
for n in range(0,N):
Aj = list(map(int, input().split()))
maxCost += Aj[0]
Aij.append(Aj)
maxCost += 1
minCost = maxCost
total = pow(2, N)
for n in range(1,total):
x = [0]*M
cost... | [] | 411,568 | 411,569 | u696499790 | python |
p02683 | N, M, X = map(int, input().split())
books = [list(map(int, input().split())) for _ in range(N)]
p = []
for i in range(1, 2**N):
buff = [0] * M
for j in range(N):
if i >> j & 1:
buff = [a + b for a, b in zip(buff, books[j])]
for a in buff[1:]:
if a < X:
break
e... | N, M, X = map(int, input().split())
books = [list(map(int, input().split())) for _ in range(N)]
p = []
for i in range(1, 2**N):
buff = [0] * (M + 1)
for j in range(N):
if i >> j & 1:
buff = [a + b for a, b in zip(buff, books[j])]
for a in buff[1:]:
if a < X:
break... | [] | 411,574 | 411,575 | u811967730 | python |
p02683 | def task(n, m, x, c, a):
mx = [0] * n
for i in range(0, n):
for j in range(0, m):
mx[j] += a[i][j]
for j in range(0, m):
if mx[j] < x:
print(-1)
return
states = [0] * m
best = 1000000
for i in range(1, (2**n) + 1):
price = 0
... | def task(n, m, x, c, a):
mx = [0] * m
for i in range(0, n):
for j in range(0, m):
mx[j] += a[i][j]
for j in range(0, m):
if mx[j] < x:
print(-1)
return
states = [0] * m
best = 100000000
for i in range(1, 2**n):
price = 0
for... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"call.arguments.change"
] | 411,582 | 411,581 | u569101309 | python |
p02683 | import itertools
n,m,x=map(int,input().split())
c=[0]*n
a=[[0 for i in range(m)] for j in range(n)]
print(a)
current_skill=[0]*m
INF=9999999
min_money=INF
for i in range(n):
tmp=list(map(int,input().split()))
c[i]=tmp[0]
a[i]=tmp[1:]
current_money=0
for i in range(1 << n):
bug=[]
#print('curren... | import itertools
n,m,x=map(int,input().split())
c=[0]*n
a=[[0 for i in range(m)] for j in range(n)]
current_skill=[0]*m
INF=9999999
min_money=INF
for i in range(n):
tmp=list(map(int,input().split()))
c[i]=tmp[0]
a[i]=tmp[1:]
current_money=0
for i in range(1 << n):
bug=[]
for j in range(n):
... | [
"call.remove"
] | 411,597 | 411,598 | u760446276 | python |
p02683 | n,m,x=map(int,input().split())
c=[list(map(int,input().split())) for _ in range(n)]
result=-1
for i in range(2**n):
t=[0]*m
money=0
for j in range(n):
if (i>>j)&1==0:
continue
money+=c[j][0]
for k in range(1,m):
t[k]+=c[j][k]
if all(xx>=x for xx in t):
if result==-1:
result=mon... | n,m,x=map(int,input().split())
c=[list(map(int,input().split())) for _ in range(n)]
result=-1
for i in range(2**n):
t=[0]*m
money=0
for j in range(n):
if (i>>j)&1==0:
continue
money+=c[j][0]
for k in range(1,m+1):
t[k-1]+=c[j][k]
if all(xx>=x for xx in t):
if result==-1:
result... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 411,603 | 411,604 | u182898140 | python |
p02683 | n,m,x=map(int,input().split())
c=[list(map(int,input().split())) for _ in range(n)]
result=-1
for i in range(2**n):
t=[0]*m
money=0
for j in range(n):
if (i>>j)&1==0:
continue
money+=c[j][0]
for k in range(m):
t[k]+=c[j][k]
if all(xx>=x for xx in t):
if result==-1:
result=money... | n,m,x=map(int,input().split())
c=[list(map(int,input().split())) for _ in range(n)]
result=-1
for i in range(2**n):
t=[0]*m
money=0
for j in range(n):
if (i>>j)&1==0:
continue
money+=c[j][0]
for k in range(1,m+1):
t[k-1]+=c[j][k]
if all(xx>=x for xx in t):
if result==-1:
result... | [
"call.arguments.add"
] | 411,605 | 411,604 | u182898140 | python |
p02683 | from itertools import product
N,M,X = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(N)]
for i in range(1,M+1):
count=0
for j in range(N):
count+=ca[j][i]
if count<X:
print(-1)
exit()
ans = 10**9
for z in product((0, 1), repeat=N):#bit全探索のくみあわせを勝手に作ってく... | from itertools import product
N,M,X = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(N)]
for i in range(1,M+1):
count=0
for j in range(N):
count+=ca[j][i]
if count<X:
print(-1)
exit()
ans = 10**9
for z in product((0, 1), repeat=N):#bit全探索のくみあわせを勝手に作ってく... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 411,612 | 411,613 | u551109821 | python |
p02683 | nmx=list(map(int, input().split()))
N=nmx[0]
M=nmx[1]
X=nmx[2]
mylist=[]
for i in range(N):
mylist.append(list(map(int, input().split())))
Ans=100000*12+1
for i in range(2**N):
A=[0]*M
C=0
for j in range(N):
if (i>>j) & 1:
C=C+mylist[j][0]
for k in range(M):
... | nmx=list(map(int, input().split()))
N=nmx[0]
M=nmx[1]
X=nmx[2]
mylist=[]
for i in range(N):
mylist.append(list(map(int, input().split())))
Ans=100000*12+1
for i in range(2**N):
A=[0]*M
C=0
for j in range(N):
if (i>>j) & 1:
C=C+mylist[j][0]
for k in range(M):
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 411,622 | 411,623 | u196629968 | python |
p02683 | nmx=list(map(int, input().split()))
N=nmx[0]
M=nmx[1]
X=nmx[2]
mylist=[]
for i in range(N):
mylist.append(list(map(int, input().split())))
Ans=10000*12+1
for i in range(2**N):
A=[0]*M
C=0
for j in range(N):
if (i>>j) & 1:
C+=mylist[j][0]
for k in range(M):
... | nmx=list(map(int, input().split()))
N=nmx[0]
M=nmx[1]
X=nmx[2]
mylist=[]
for i in range(N):
mylist.append(list(map(int, input().split())))
Ans=100000*12+1
for i in range(2**N):
A=[0]*M
C=0
for j in range(N):
if (i>>j) & 1:
C=C+mylist[j][0]
for k in range(M):
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 411,624 | 411,623 | u196629968 | python |
p02683 | n,m,x =map(int,input().split())
a = []
c = []
for _ in range(n):
a.append(list(map(int,input().split())))
c.append(a[-1].pop(0))
#print(a,c)
ans = 10 ** 8
for i in range(1 << n):
cost = 0
check = True
d = [0 for i in range(n)]
for j in range(n):
if i >> j & 1:
cost += c[j... | n,m,x =map(int,input().split())
a = []
c = []
for _ in range(n):
a.append(list(map(int,input().split())))
c.append(a[-1].pop(0))
#print(a,c)
ans = 10 ** 8
for i in range(1 << n):
cost = 0
check = True
d = [0 for i in range(m)]
for j in range(n):
if i >> j & 1:
cost += c[j... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,634 | 411,635 | u593019570 | python |
p02683 | from itertools import product
n, m, x = map(int, input().split())
c = [0] * n
a = [0] * n
for i in range(n):
inp = [int(_) for _ in input().split()]
c[i] = inp[0]
a[i] = inp[1:]
INIT = 10**10
ans = INIT
pat = list(product([0, 1], repeat=n))
for p in pat:
a_val = [0] * n
c_yen = 0
for i in ra... | from itertools import product
n, m, x = map(int, input().split())
c = [0] * n
a = [0] * n
for i in range(n):
inp = [int(_) for _ in input().split()]
c[i] = inp[0]
a[i] = inp[1:]
INIT = 10**10
ans = INIT
pat = list(product([0, 1], repeat=n))
for p in pat:
a_val = [0] * m
c_yen = 0
for i in ra... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 411,643 | 411,644 | u428132025 | python |
p02683 | import numpy as np
# dfsで全探索
n, m, x = map(int, input().split())
c = []
a = np.zeros((n, m))
for i in range(n):
ll = list(map(int, input().split()))
c.append(ll[0])
a[i] += np.array(ll[1:])
ans = float("INF")
# 0: Not Buy 1: Buy
s = []
def dfs(s):
global ans
if len(s) == n:
r = np.zer... | import numpy as np
# dfsで全探索
n, m, x = map(int, input().split())
c = []
a = np.zeros((n, m))
for i in range(n):
ll = list(map(int, input().split()))
c.append(ll[0])
a[i] += np.array(ll[1:])
ans = float("INF")
# 0: Not Buy 1: Buy
s = []
def dfs(s):
global ans
if len(s) == n:
r = np.zer... | [
"control_flow.branch.if.condition.change"
] | 411,645 | 411,646 | u950825280 | python |
p02683 | N, M, X = map(int, input().split())
C = [0] * N
A = [[0 for _ in range(M)] for _ in range(N)]
for i in range(N):
A[i] = list(map(int, input().split()))
C[i] = A[i][0]
A[i] = A[i][1:]
ans = sum(C) + 1
Y = [0] * M
for p in range(2 ** N):
for i in range(M):
Y[i] = 0
cnt = 0
_p = p
for i, c in enumerate(C... | N, M, X = map(int, input().split())
C = [0] * N
A = [[0 for _ in range(M)] for _ in range(N)]
for i in range(N):
A[i] = list(map(int, input().split()))
C[i] = A[i][0]
A[i] = A[i][1:]
ans = sum(C) + 1
Y = [0] * M
for p in range(2 ** N):
for i in range(M):
Y[i] = 0
cnt = 0
_p = p
for i, c in enumerate(C... | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 411,658 | 411,659 | u415905784 | python |
p02683 | n, m, x = map(int, input().split())
b = 10**18
tm = []
for i in range(m):
tm.append(list(map(int, input().split())))
for i in range(2**n):
c = [0 for i in range(m)]
sum = 0
for j in range(n):
if (i >> j) & 1:
sum += tm[j][0]
for k in range(m):
c[k] += tm[j... | n, m, x = map(int, input().split())
b = 10**18
tm = []
for i in range(n):
tm.append(list(map(int, input().split())))
for i in range(2**n):
c = [0 for i in range(m)]
sum = 0
for j in range(n):
if (i >> j) & 1:
sum += tm[j][0]
for k in range(m):
c[k] += tm[j... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 411,662 | 411,663 | u596979123 | python |
p02683 | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
price=0
ans=100000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
if l < X:... | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans=100000000000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
if l < X:
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 411,669 | 411,670 | u632360669 | python |
p02683 | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
price=0
ans=100000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
if l < X:... | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans=100000000000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
if l < X:
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 411,671 | 411,670 | u632360669 | python |
p02683 | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
price=0
ans=100000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
... | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans=100000000000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
if l < X:
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 411,672 | 411,670 | u632360669 | python |
p02683 | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
price=0
ans=100000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
if l < X:... | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans=100000000000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 411,669 | 411,673 | u632360669 | python |
p02683 | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
price=0
ans=100000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
if l < X:... | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans=100000000000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 411,671 | 411,673 | u632360669 | python |
p02683 | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
price=0
ans=100000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
... | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans=100000000000
for i in range(1, 2**N):
price=0
rikaido = [0]*M
for j in range(N):
if i>>j & 1:
price += int(CAAA[j][0])
for k in range(M):
rikaido[k] += int(CAAA[j][k+1])
for l in rikaido:
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 411,672 | 411,673 | u632360669 | python |
p02683 | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans = 1000000000
for k in range(2**N):
price = 0
rikaido=[0]*M
for l in range(N):
if k>>l & 1:
#if CAAA[m][1] < price:
price += int(CAAA[l][0])
for t in range(M):
rikaido[t] += int(CAAA[l][t])
for... | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans = 1000000000
for k in range(1, 2**N):
price = 0
rikaido=[0]*M
for l in range(N):
if k>>l & 1:
#if CAAA[m][1] < price:
price += int(CAAA[l][0])
for t in range(M):
rikaido[t] += int(CAAA[l][t+1])
... | [
"call.arguments.add"
] | 411,674 | 411,675 | u632360669 | python |
p02683 | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans = 1000000000
for k in range(2**N):
price = 0
rikaido=[0]*M
for l in range(N):
if k>>l & 1:
#if CAAA[m][1] < price:
price += int(CAAA[l][0])
for t in range(M):
rikaido[t] += int(CAAA[l][t])
for... | N, M, X = map(int, input().split())
CAAA = [input().split() for i in range(N)]
ans = 1000000000
for k in range(1, 2**N):
price = 0
rikaido=[0]*M
for l in range(N):
if k>>l & 1:
#if CAAA[m][1] < price:
price += int(CAAA[l][0])
for t in range(M):
rikaido[t] += int(CAAA[l][t+1])
... | [
"call.arguments.add"
] | 411,674 | 411,676 | u632360669 | python |
p02683 | n, m, x = map(int, input().split())
prace = []
know = []
for i in range(n):
acc = list(map(int, input().split()))
prace.append(acc[0])
know.append(acc[1:])
ans = 10**10
for i in range(2**n):
und = [0 for i in range(m)]
f = "{:b}".format(i)
s = f.zfill(n)
mm = 0
print(s)
for j in ran... | n, m, x = map(int, input().split())
prace = []
know = []
for i in range(n):
acc = list(map(int, input().split()))
prace.append(acc[0])
know.append(acc[1:])
ans = 10**10
for i in range(2**n):
und = [0 for i in range(m)]
f = "{:b}".format(i)
s = f.zfill(n)
mm = 0
for j in range(len(s)):
... | [
"call.remove"
] | 411,677 | 411,678 | u933129390 | python |
p02683 | n, m, x = map(int, input().split())
prace = []
know = []
for i in range(n):
acc = list(map(int, input().split()))
prace.append(acc[0])
know.append(acc[1:])
ans = 10**10
for i in range(2**n):
und = [0 for i in range(m)]
f = "{:b}".format(i)
s = f.zfill(m)
mm = 0
for j in range(len(s)):
... | n, m, x = map(int, input().split())
prace = []
know = []
for i in range(n):
acc = list(map(int, input().split()))
prace.append(acc[0])
know.append(acc[1:])
ans = 10**10
for i in range(2**n):
und = [0 for i in range(m)]
f = "{:b}".format(i)
s = f.zfill(n)
mm = 0
for j in range(len(s)):
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 411,679 | 411,678 | u933129390 | python |
p02683 | import itertools
def m():
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
ans = float('inf')
for i in itertools.product([True, False], repeat=N):
tmp = [0] * (M + 1)
for j, v in enumerate(i):
if j:
for k in range(... | import itertools
def m():
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
ans = float('inf')
for i in itertools.product([True, False], repeat=N):
tmp = [0] * (M + 1)
for j, v in enumerate(i):
if v:
for k in range(... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 411,680 | 411,681 | u480847874 | python |
p02683 | def m():
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
ans = float('inf')
for i in range(2 ** N):
b = bin(i)[2:]
b = b.zfill(N)
tmp = [0] * (M + 1)
for j, v in enumerate(b):
if v == '0':
continue
... | def m():
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
ans = float('inf')
for i in range(2 ** N):
b = bin(i)[2:]
b = b.zfill(N)
tmp = [0] * (M + 1)
for j, v in enumerate(b):
if v == '0':
continue
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 411,682 | 411,683 | u480847874 | python |
p02683 | n, m, x = map(int,input().split(' '))
a = [[] for i in range(n)]
p = 0
for i in range(n):
a[i] = list(map(int, input().split(' ')))
sc = 12 * 100001
for i in range(1, 2 ** n):
bi = '0' * n + bin(i)[2:]
bi = bi[len(bi) - n:]
cc = 0
e = [0] * m
for j in range(n):
if bi[j] == '1':
... | n, m, x = map(int,input().split(' '))
a = [[] for i in range(n)]
p = 0
for i in range(n):
a[i] = list(map(int, input().split(' ')))
sc = 12 * 100001
for i in range(1, 2 ** n):
bi = '0' * n + bin(i)[2:]
bi = bi[len(bi) - n:]
cc = 0
e = [0] * m
for j in range(n):
if bi[j] == '1':
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 411,690 | 411,691 | u319311571 | python |
p02683 | n, m, x = map(int,input().split(' '))
a = [[] for i in range(n)]
p = 0
for i in range(n):
a[i] = list(map(int, input().split(' ')))
sc = 999999
for i in range(1, 2 ** n):
bi = '0' * n + bin(i)[2:]
bi = bi[len(bi) - n:]
cc = 0
e = [0] * m
for j in range(n):
if bi[j] == '1':
fo... | n, m, x = map(int,input().split(' '))
a = [[] for i in range(n)]
p = 0
for i in range(n):
a[i] = list(map(int, input().split(' ')))
sc = 12 * 100001
for i in range(1, 2 ** n):
bi = '0' * n + bin(i)[2:]
bi = bi[len(bi) - n:]
cc = 0
e = [0] * m
for j in range(n):
if bi[j] == '1':
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 411,693 | 411,691 | u319311571 | python |
p02683 | n,m,x = map(int,input().split())
c_ = [list(map(int,input().split())) for i in range(n)]
# print(c_)
cc_ = []
for i in range(n):
cc_.append(c_[i][0])
# print(cc_)
import numpy as np
import itertools
l_ = np.arange(n).tolist()
res_ = []
resList = []
flag = False
flag3 = True
if n == 1:
for i in range(m):
... | n,m,x = map(int,input().split())
c_ = [list(map(int,input().split())) for i in range(n)]
# print(c_)
cc_ = []
for i in range(n):
cc_.append(c_[i][0])
# print(cc_)
import numpy as np
import itertools
l_ = np.arange(n).tolist()
res_ = []
resList = []
flag = False
flag3 = True
if n == 1:
for i in range(m):
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 411,700 | 411,701 | u815304751 | python |
p02683 | import numpy as np
#%%
N, M, X = [int(i) for i in input().split()]
CA = [[] for i in range(N)]
for i in range(N):
k = list(map(int, input().split()))
CA[i] = k[:]
CA = np.array(CA)
#%%
cnt = (10 ** 5) * N + 1
for i in range(2 ** N):
score = np.zeros(N + 1)
for j in range(N):
if (i >> j) & 1:
... | import numpy as np
#%%
N, M, X = [int(i) for i in input().split()]
CA = [[] for i in range(N)]
for i in range(N):
k = list(map(int, input().split()))
CA[i] = k[:]
CA = np.array(CA)
#%%
cnt = (10 ** 5) * N + 1
for i in range(2 ** N):
score = np.zeros(M + 1)
for j in range(N):
if (i >> j) & 1:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,712 | 411,713 | u840310460 | python |
p02683 | import numpy as np
#%%
N, M, X = [int(i) for i in input().split()]
CA = [[] for i in range(N)]
for i in range(M):
k = list(map(int, input().split()))
CA[i] = k[:]
CA = np.array(CA)
#%%
cnt = (10 ** 5) * N + 1
for i in range(2 ** N):
score = np.zeros(N + 1)
for j in range(N):
if (i >> j) & 1:
... | import numpy as np
#%%
N, M, X = [int(i) for i in input().split()]
CA = [[] for i in range(N)]
for i in range(N):
k = list(map(int, input().split()))
CA[i] = k[:]
CA = np.array(CA)
#%%
cnt = (10 ** 5) * N + 1
for i in range(2 ** N):
score = np.zeros(M + 1)
for j in range(N):
if (i >> j) & 1:
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 411,714 | 411,713 | u840310460 | python |
p02683 | n,m,x = map(int, input().split())
costs = [list(map(int, input().split())) for _ in range(n)]
'''
n,m,x = [int(i) for i in input().split()]
costs =[]
for i in range(n):
a = [int(i) for i in input().split()]
costs.append(a)
'''
INF = 1000000000000000000000000000
ans = INF
for i in range(1<<n): #n bits all ... | n,m,x = map(int, input().split())
costs = [list(map(int, input().split())) for _ in range(n)]
'''
n,m,x = [int(i) for i in input().split()]
costs =[]
for i in range(n):
a = [int(i) for i in input().split()]
costs.append(a)
'''
INF = 1000000000000000000000000000
ans = INF
for i in range(1<<n): #n bits all ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 411,717 | 411,718 | u693716675 | python |
p02683 | from sys import stdin
import itertools
n, m, x = [int(x) for x in stdin.readline().rstrip().split()]
c = [[int(y) for y in x.rstrip().split()] for x in stdin.readlines()]
c.sort()
mi = -1
r = 0
for j in range(1, m + 1):
li = [x[j] for x in c]
li.sort(reverse=True)
for i in range(len(li)):
if sum(l... | from sys import stdin
import itertools
n, m, x = [int(x) for x in stdin.readline().rstrip().split()]
c = [[int(y) for y in x.rstrip().split()] for x in stdin.readlines()]
c.sort()
mi = -1
r = 0
for j in range(1, m + 1):
li = [x[j] for x in c]
li.sort(reverse=True)
for i in range(1, len(li) + 1):
i... | [
"call.arguments.add"
] | 411,725 | 411,726 | u486074261 | python |
p02683 | import itertools
import numpy as np
N, M, X = map(int, input().split())
items = np.array([list(map(int, input().split())) for _ in range(N)], dtype=np.int32)
out = 10**18
for c in itertools.product([False, True], repeat=M):
tmp = np.sum(items[np.where(c)], axis=0)
if np.any(tmp):
if M == np.count_nonzer... | import itertools
import numpy as np
N, M, X = map(int, input().split())
items = np.array([list(map(int, input().split())) for _ in range(N)], dtype=np.int32)
out = 10**18
for c in itertools.product([False, True], repeat=N):
tmp = np.sum(items[np.where(c)], axis=0)
if np.any(tmp):
if M == np.count_nonzer... | [
"identifier.change",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 411,744 | 411,745 | u875541136 | python |
p02683 | import itertools
import numpy as np
N, M, X = map(int, input().split())
items = np.array([list(map(int, input().split())) for _ in range(N)], dtype=np.int32)
out = 10**18
for c in itertools.product([False, True], repeat=M):
tmp = np.sum(items[[np.where(c)]], axis=0)
if np.any(tmp):
if M == np.count_nonz... | import itertools
import numpy as np
N, M, X = map(int, input().split())
items = np.array([list(map(int, input().split())) for _ in range(N)], dtype=np.int32)
out = 10**18
for c in itertools.product([False, True], repeat=N):
tmp = np.sum(items[np.where(c)], axis=0)
if np.any(tmp):
if M == np.count_nonzer... | [
"identifier.change",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 411,746 | 411,745 | u875541136 | python |
p02683 | import numpy as np
N, M, X = map(int, input().split())
data = [list(map(int, input().split())) for _ in range(N)]
INF = float('int')
data_all = []
c_min = INF
for i in range(2**N):
data_tmp = [0]*M
c = 0
for j in range(N):
if((i>>j) & 1):
for k in range(M):
data_tmp[k... | import numpy as np
N, M, X = map(int, input().split())
data = [list(map(int, input().split())) for _ in range(N)]
INF = float('inf')
data_all = []
c_min = INF
for i in range(2**N):
data_tmp = [0]*M
c = 0
for j in range(N):
if((i>>j) & 1):
for k in range(M):
data_tmp[k... | [
"literal.string.change",
"assignment.value.change",
"call.arguments.change"
] | 411,748 | 411,749 | u110199424 | python |
p02683 | import numpy as np
N, M, X = map(int, input().split())
data = [list(map(int, input().split())) for _ in range(N)]
INF = float('inf')
data_all = []
c_min = INF
for i in range(N**2):
data_tmp = [0]*M
c = 0
for j in range(N):
if((i>>j) & 1):
for k in range(M):
data_tmp[k... | import numpy as np
N, M, X = map(int, input().split())
data = [list(map(int, input().split())) for _ in range(N)]
INF = float('inf')
data_all = []
c_min = INF
for i in range(2**N):
data_tmp = [0]*M
c = 0
for j in range(N):
if((i>>j) & 1):
for k in range(M):
data_tmp[k... | [
"expression.operation.binary.remove"
] | 411,750 | 411,749 | u110199424 | python |
p02683 | INF=100100100
n,m,x=map(int,input().split())
c=[]
a=[]
for i in range(n):
t=list(map(int,input().split()))
c.append(t[0])
a.append(t[1:])
cost=INF
for i in range(n**2):
ab=[0]*m
tmp=0
for j in range(n):
idx=i>>j & 1
if(idx):
tmp+=c[j]
for k in range(m):
... | INF=100100100
n,m,x=map(int,input().split())
c=[]
a=[]
for i in range(n):
t=list(map(int,input().split()))
c.append(t[0])
a.append(t[1:])
cost=INF
for i in range(2**n):
ab=[0]*m
tmp=0
for j in range(n):
idx=i>>j & 1
if(idx):
tmp+=c[j]
for k in range(m):
... | [
"expression.operation.binary.remove"
] | 411,760 | 411,761 | u614162316 | python |
p02683 | INF=100100100
n,m,x=map(int,input().split())
c=[]
a=[]
for i in range(n):
t=list(map(int,input().split()))
c.append(t[0])
a.append(t[1:])
cost=INF
for i in range(n**2-1):
ab=[0]*m
tmp=0
for j in range(n):
idx=i>>j & 1
if(idx):
tmp+=c[j]
for k in range(m):... | INF=100100100
n,m,x=map(int,input().split())
c=[]
a=[]
for i in range(n):
t=list(map(int,input().split()))
c.append(t[0])
a.append(t[1:])
cost=INF
for i in range(2**n):
ab=[0]*m
tmp=0
for j in range(n):
idx=i>>j & 1
if(idx):
tmp+=c[j]
for k in range(m):
... | [
"expression.operation.binary.remove"
] | 411,762 | 411,761 | u614162316 | python |
p02683 | import numpy as np
N, M, X = map(int, input().split())
C = []
A = [[] for i in range(M)]
resC = []
resA = list(A)
NEW = 0
def update(base):
#print(NEW,base)
if base==None:
return NEW
return base + NEW
def check(num):
return num>=X
def check2(*args):
res = True
for val in args:
buf = (val >= X)
... | import numpy as np
N, M, X = map(int, input().split())
C = []
A = [[] for i in range(M)]
resC = []
resA = list(A)
NEW = 0
def update(base):
#print(NEW,base)
if base==None:
return NEW
return base + NEW
def check(num):
return num>=X
def check2(*args):
res = True
for val in args:
buf = (val >= X)
... | [
"assignment.value.change",
"identifier.change"
] | 411,773 | 411,774 | u845573105 | python |
p02683 | from functools import reduce
n, m, x = map(int, input().split())
lb = []
for i in range(n):
lb.append(list(map(int, input().split())))
mincost = 10**8
for i in range(2**n):
case = [0] * (m+1)
for j in range(m+1):
if (i >> j) & 1:
case = list(map(sum, zip(case, lb[j])))
if reduce(lambda u, v: u and v, list... | from functools import reduce
n, m, x = map(int, input().split())
lb = []
for i in range(n):
lb.append(list(map(int, input().split())))
mincost = 10**8
for i in range(2**n):
case = [0] * (m+1)
for j in range(n):
if (i >> j) & 1:
case = list(map(sum, zip(case, lb[j])))
if reduce(lambda u, v: u and v, list(m... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 411,782 | 411,783 | u679439110 | python |
p02683 | N,M,X=map(int,input().split())
C=[]
A=[[] for _ in range(N)]
for i in range(N):
tmpA=list(map(int,input().split()))
C+=[tmpA[0]]
A[i]=tmpA[1:]
costmin=float('inf')
for k in range(2**N):
tansaku=k
koubai=[0 for i in range(N)]
rikaido=[0 for i in range(N)]
cost=0
for i in range(N-1):
koubai[i]=tans... | N,M,X=map(int,input().split())
C=[]
A=[[] for _ in range(N)]
for i in range(N):
tmpA=list(map(int,input().split()))
C+=[tmpA[0]]
A[i]=tmpA[1:]
costmin=float('inf')
for k in range(2**N):
tansaku=k
koubai=[0 for i in range(N)]
rikaido=[0 for i in range(M)]
cost=0
for i in range(N-1):
koubai[i]=tans... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,794 | 411,795 | u692311686 | python |
p02683 | import itertools
N, M, X = map(int, input().split())
A = []
for i in range(N):
A.append(list(map(int, input().split())))
saisyo = float("inf")
for i in intertools.product(range(2), N):
a = [0]*M
gokei = 0
for j in range(N):
if i[j] == 1:
gokei += A[j][0]
for k in range... | import itertools
N, M, X = map(int, input().split())
A = []
for i in range(N):
A.append(list(map(int, input().split())))
saisyo = float("inf")
for i in itertools.product(range(2), repeat=N):
a = [0]*M
gokei = 0
for j in range(N):
if i[j] == 1:
gokei += A[j][0]
for k in... | [
"identifier.change"
] | 411,810 | 411,811 | u686036872 | python |
p02683 | def main():
N, M, X = map(int, input().split())
books = [list(map(int, input().split())) for _ in range(N)]
min_total_cost = 10**9
for i in range(2**N):
total_cost = 0
learned = [0] * M
for j in range(N):
if (i >> j) & 1:
cost, points = books[j]
... | def main():
N, M, X = map(int, input().split())
books = [list(map(int, input().split())) for _ in range(N)]
min_total_cost = 10**9
for i in range(2**N):
total_cost = 0
learned = [0] * M
for j in range(N):
if (i >> j) & 1:
cost, *points = books[j]
... | [] | 411,814 | 411,815 | u764956288 | python |
p02683 | N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for i in range(N)]
final = 1000000000
for i in range(1, N ** 2):
ans = 0
rikai = [0]*M
for j in range(N):
if ((i >> j) & 1):
for k in range(1, M+1):
rikai[k-1] += A[j][k]
ans += A[j][0]... | N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for i in range(N)]
final = 1000000000
for i in range(1, 2**N):
ans = 0
rikai = [0]*M
for j in range(N):
if ((i >> j) & 1):
for k in range(1, M+1):
rikai[k-1] += A[j][k]
ans += A[j][0]
... | [
"expression.operation.binary.remove"
] | 411,823 | 411,824 | u526094365 | python |
p02683 | n,m,x=map(int,input().split())
C=[]
for i in range(n):
a=list(map(int,input().split()))
C.append(a)
pattern=[]
toBuy=[]
for i in range(2**n):
toBuy=[]
for j in range(n):
if ((i>>j)&1):
toBuy.append(C[j])
# print(toBuy)
pattern.append(toBuy)
#print(pattern)
X=[0]*m #mつのアルゴリズムそれ... | n,m,x=map(int,input().split())
C=[]
for i in range(n):
a=list(map(int,input().split()))
C.append(a)
pattern=[]
toBuy=[]
for i in range(2**n):
toBuy=[]
for j in range(n):
if ((i>>j)&1):
toBuy.append(C[j])
# print(toBuy)
pattern.append(toBuy)
#print(pattern)
X=[0]*m #mつのアルゴリズムそれ... | [
"assignment.add"
] | 411,827 | 411,826 | u196746947 | python |
p02683 | import itertools
n,m,x=map(int,input().split())
lis=tuple(tuple(map(int,input().split())) for _ in range(n))
ans=float("inf")
def dfs(progress,skills,nowcost):
global ans
if progress==n:
if all(v>=x for v in skills):
ans=min(ans,nowcost)
return ans
dfs(progress+1,skills,nowcost)... | import itertools
n,m,x=map(int,input().split())
lis=tuple(tuple(map(int,input().split())) for _ in range(n))
ans=float("inf")
def dfs(progress,skills,nowcost):
global ans
if progress==n:
if all(v>=x for v in skills):
ans=min(ans,nowcost)
return ans
dfs(progress+1,skills,nowcost)... | [
"control_flow.branch.if.add"
] | 411,828 | 411,829 | u204842730 | python |
p02683 | from itertools import product
N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
ans = float("inf")
for now in product(range(2), N):
res = 0
An = [0 for _ in range(M)]
for n in range(N):
if now[n] == 1:
res += A[n][0]
An = [An[j] + A... | from itertools import product
N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
ans = float("inf")
for now in product(range(2), repeat=N):
res = 0
An = [0 for _ in range(M)]
for n in range(N):
if now[n] == 1:
res += A[n][0]
An = [An... | [
"call.arguments.keyword_argument.add"
] | 411,832 | 411,833 | u767664985 | python |
p02683 | import logging
logging.basicConfig(level=logging.INFO, format="%(message)s")
#logging.disable(logging.CRITICAL)
def main():
N, M, X = map(int, input().split())
CA_list = [list(map(int,list(input().split(" ")))) for i in range(M)]
Ci_sum_list = []
for i in range(2 ** N):
sum_list = [0 for... | import logging
logging.basicConfig(level=logging.INFO, format="%(message)s")
#logging.disable(logging.CRITICAL)
def main():
N, M, X = map(int, input().split())
CA_list = [list(map(int,list(input().split(" ")))) for i in range(N)]
Ci_sum_list = []
for i in range(2 ** N):
sum_list = [0 for... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,839 | 411,840 | u623659526 | python |
p02683 | from itertools import product as pr
n,m,x=[int(i) for i in input().split()]
l=[[int(i) for i in input().split()]for j in range(n)]
p=list(pr([0,1],repeat=n))
suml=[[sum([l[j][k]*i[j] for j in range(n)])for k in range(m+1)]for i in p]
ans=[i[0] for i in suml if all([i[j] >=x for j in range(1,n+1)])]
if len(ans)==0:
pr... | from itertools import product as pr
n,m,x=[int(i) for i in input().split()]
l=[[int(i) for i in input().split()]for j in range(n)]
p=list(pr([0,1],repeat=n))
suml=[[sum([l[j][k]*i[j] for j in range(n)])for k in range(m+1)]for i in p]
ans=[i[0] for i in suml if all([i[j] >=x for j in range(1,m+1)])]
if len(ans)==0:
pr... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,841 | 411,842 | u443151804 | python |
p02683 | n,m,x=map(int,input().split())
cam = [list(map(int, input().split())) for i in range(n)]
ans=10000*12
for i in range(2**n):
a=[0]*m
cst=0
for j in range(n):
bag=[]
if (i>>j)&1:
cst+=cam[j][0]
for k in range(1,m+1):
a[k-1]+=cam[j][k]
if all(elem >=... | n,m,x=map(int,input().split())
cam = [list(map(int, input().split())) for i in range(n)]
ans=10000**12
for i in range(2**n):
a=[0]*m
cst=0
for j in range(n):
bag=[]
if (i>>j)&1:
cst+=cam[j][0]
for k in range(1,m+1):
a[k-1]+=cam[j][k]
if all(elem >... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 411,846 | 411,847 | u524534026 | python |
p02683 | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | [
"call.remove",
"identifier.change"
] | 411,850 | 411,851 | u408262366 | python |
p02683 | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | [
"identifier.change",
"expression.operation.binary.remove"
] | 411,852 | 411,851 | u408262366 | python |
p02683 | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | [
"call.arguments.change"
] | 411,853 | 411,851 | u408262366 | python |
p02683 | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | [
"identifier.change"
] | 411,852 | 411,855 | u408262366 | python |
p02683 | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | [
"call.arguments.change"
] | 411,853 | 411,855 | u408262366 | python |
p02683 | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | import numpy as np
from itertools import combinations_with_replacement
N,M,X = map(int,input().split())
CA = []
for i in range(N):
CA.append(list(map(int,input().split())))
OK = True
CA = np.array(CA)
sums = np.sum(CA,axis=0)
for i in range(1,M+1):
if sums[i] < X:
OK = False
break
if OK == False:
print... | [
"expression.operation.binary.add"
] | 411,856 | 411,857 | u408262366 | python |
p02683 |
if __name__=="__main__":
N, M, X = map(int, input().split(' '))
book_list = [None]*N
min_price = -1
for i in range(N):
book_list[i] = list(map(int, input().split(' ')))
for i in range(2 ** N):
comp_list = []
for j in range(N):
if ((i >> j) & 1):
... | if __name__=="__main__":
N, M, X = map(int, input().split(' '))
book_list = [None]*N
min_price = -1
for i in range(N):
book_list[i] = list(map(int, input().split(' ')))
for i in range(2 ** N):
comp_list = []
for j in range(N):
if ((i >> j) & 1):
i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operator.compare.change"
] | 411,860 | 411,861 | u701893485 | python |
p02683 | import sys
lines = sys.stdin.readlines()
N, M, X = map(int, lines[0].split())
A = []
C = []
for i in range(N):
line = list(map(int, lines[i+1].split()))
A.append(line[1:])
C.append(line[0])
# return []
def full_search():
costs = []
for i in range(2**N):
vals = [0] * M
cost = 0
... | import sys
lines = sys.stdin.readlines()
N, M, X = map(int, lines[0].split())
A = []
C = []
for i in range(N):
line = list(map(int, lines[i+1].split()))
A.append(line[1:])
C.append(line[0])
# return []
def full_search():
costs = []
for i in range(2**N):
vals = [0] * M
cost = 0
... | [
"call.add",
"call.arguments.change",
"io.output.change"
] | 411,864 | 411,865 | u564525445 | python |
p02683 | import itertools
import numpy as np
# = int(input())
N, M, X = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
CA = [list(map(int, input().split())) for i in range(N)]
cost = []
skill = list(zip(*CA))
for i in range(1, M+1):
if sum(skill[i]) < X:
print(... | import itertools
import numpy as np
# = int(input())
N, M, X = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
CA = [list(map(int, input().split())) for i in range(N)]
cost = []
skill = list(zip(*CA))
for i in range(1, M+1):
if sum(skill[i]) < X:
print(... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 411,868 | 411,869 | u511457539 | python |
p02683 | import itertools
import numpy as np
# = int(input())
N, M, X = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
CA = [list(map(int, input().split())) for i in range(N)]
cost = []
skill = list(zip(*CA))
for i in range(1, M+1):
if sum(skill[i]) < X:
print(... | import itertools
import numpy as np
# = int(input())
N, M, X = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
CA = [list(map(int, input().split())) for i in range(N)]
cost = []
skill = list(zip(*CA))
for i in range(1, M+1):
if sum(skill[i]) < X:
print(... | [
"call.arguments.add",
"assignment.value.change",
"identifier.change"
] | 411,870 | 411,869 | u511457539 | python |
p02683 | n,m,x = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]
ans = float('inf')
for i in range(2**n):
sum = [0]*(m+1)
# n桁について調査
for j in range(n):
# iのj桁目が1かどうかcheck
if ((i >> j) & 1):
for k in range(m+1):
sum[k] += l[j][k]
if su... | n,m,x = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]
ans = float('inf')
for i in range(2**n):
sum = [0]*(m+1)
# n桁について調査
for j in range(n):
# iのj桁目が1かどうかcheck
if (i >> j) & 1:
for k in range(m+1):
sum[k] += l[j][k]
if sum[... | [
"control_flow.branch.if.condition.change"
] | 411,874 | 411,875 | u975445930 | python |
p02683 | n,m,x = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]
ans = float('inf')
for i in range(2**n):
sum = [0]*(M+1)
# n桁について調査
for j in range(n):
# iのj桁目が1かどうかcheck
if ((i >> j) & 1):
for k in range(M+1):
sum[k] += l[j][k]
if su... | n,m,x = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]
ans = float('inf')
for i in range(2**n):
sum = [0]*(m+1)
# n桁について調査
for j in range(n):
# iのj桁目が1かどうかcheck
if (i >> j) & 1:
for k in range(m+1):
sum[k] += l[j][k]
if sum[... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,876 | 411,875 | u975445930 | python |
p02683 | from itertools import combinations
from collections import deque
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
row = [i for i in range(1, N+1)]
ans = float("INF")
for i in range(1, N):
for v in combinations(row, i):
q = deque(v)
cost = 0
Asum = [0]*M
wh... | from itertools import combinations
from collections import deque
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
row = [i for i in range(1, N+1)]
ans = float("INF")
for i in range(1, N+1):
for v in combinations(row, i):
q = deque(v)
cost = 0
Asum = [0]*M
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 411,893 | 411,894 | u078349616 | python |
p02683 | from itertools import combinations
from collections import deque
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
row = [i for i in range(1, N+1)]
ans = float("INF")
for i in range(1, M+1):
for v in combinations(row, i):
q = deque(v)
cost = 0
Asum = [0]*M
... | from itertools import combinations
from collections import deque
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
row = [i for i in range(1, N+1)]
ans = float("INF")
for i in range(1, N+1):
for v in combinations(row, i):
q = deque(v)
cost = 0
Asum = [0]*M
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,895 | 411,894 | u078349616 | python |
p02683 | import numpy as np
import itertools
Cmin = 10**10
N, M, X = map(int, input().split())
L = np.array([[int(j) for j in input().split()] for i in range(N)])
for i in range(N):
for idx in itertools.combinations(list(range(N)), i+1):
A = np.zeros(M+1, dtype=int)
for j in idx:
A = A + L[j]
print(A)
i... | import numpy as np
import itertools
Cmin = 10**10
N, M, X = map(int, input().split())
L = np.array([[int(j) for j in input().split()] for i in range(N)])
for i in range(N):
for idx in itertools.combinations(list(range(N)), i+1):
A = np.zeros(M+1, dtype=int)
for j in idx:
A = A + L[j]
if A[0] < Cmin... | [
"call.remove"
] | 411,913 | 411,914 | u886362575 | python |
p02683 | N,M,X = map(int,input().split())
C = []
for i in range(N):
C.append(list(map(int,input().split())))
cost = 100000000000000000000000
l = list(range(1,N+1))
import itertools
for i in range(1,N+1):
check_l = list(itertools.combinations(l,i))
for a in check_l:
sub_list = [0] * (M + 1)
for j in ... | N,M,X = map(int,input().split())
C = []
for i in range(N):
C.append(list(map(int,input().split())))
cost = 100000000000000000000000
l = list(range(1,N+1))
import itertools
for i in range(1,N+1):
check_l = list(itertools.combinations(l,i))
for a in check_l:
sub_list = [0] * (M + 1)
for j in ... | [
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 411,915 | 411,916 | u825541307 | python |
p02683 | N,M,X = map(int,input().split())
C = []
for i in range(N):
C.append(list(map(int,input().split())))
cost = 100000000000000000000000
l = list(range(1,N+1))
import itertools
for i in range(1,N+1):
check_l = list(itertools.combinations(l,i))
for a in check_l:
sub_list = [0] * (M + 1)
for j in ... | N,M,X = map(int,input().split())
C = []
for i in range(N):
C.append(list(map(int,input().split())))
cost = 100000000000000000000000
l = list(range(1,N+1))
import itertools
for i in range(1,N+1):
check_l = list(itertools.combinations(l,i))
for a in check_l:
sub_list = [0] * (M + 1)
for j in ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 411,917 | 411,916 | u825541307 | python |
p02683 | from itertools import product
n, m, x = list(map(int, input().split()))
cl = [0] * n
al = [[]*m for _ in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
cl[i] = tmp[0]
al[i] = tmp[1:]
def dfs(status, book):
for i in range(m):
status[i] += book[i]
return status
ans = 10... | from itertools import product
n, m, x = list(map(int, input().split()))
cl = [0] * n
al = [[]*m for _ in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
cl[i] = tmp[0]
al[i] = tmp[1:]
def dfs(status, book):
for i in range(m):
status[i] += book[i]
return status
ans = 10... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,921 | 411,922 | u540877546 | python |
p02683 | from itertools import product
n, m, x = list(map(int, input().split()))
cl = [0] * n
al = [[]*m for _ in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
cl[i] = tmp[0]
al[i] = tmp[1:]
def dfs(status, book):
for i in range(m):
status[i] += book[i]
return status
ans = 10... | from itertools import product
n, m, x = list(map(int, input().split()))
cl = [0] * n
al = [[]*m for _ in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
cl[i] = tmp[0]
al[i] = tmp[1:]
def dfs(status, book):
for i in range(m):
status[i] += book[i]
return status
ans = 10... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 411,924 | 411,922 | u540877546 | python |
p02683 | n, m, x = map(int,input().split())
l = [list(map(int,input().split())) for i in range(n)]
def generate_n_bit(n):
bins= []
for i in range(2**n):
bins.append(list(str(format(i,'b').zfill(n))))
return bins
min_price = 10**9
bins = generate_n_bit(10)
bins = bins[1:]
for bin in bins:
a = [0 f... | n, m, x = map(int,input().split())
l = [list(map(int,input().split())) for i in range(n)]
def generate_n_bit(n):
bins= []
for i in range(2**n):
bins.append(list(str(format(i,'b').zfill(n))))
return bins
min_price = 10**9
bins = generate_n_bit(n)
bins = bins[1:]
for bin in bins:
a = [0 fo... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 411,931 | 411,932 | u797550216 | python |
p02683 | n, m, x = map(int, input().split())
bag = {}
for i in range(n):
bag[i]=list(map(int, input().split()))
min_ = 10**10
for bit in range(1<<n):
understanding = [0 for j in range(m)]
c = 0
for i in range(n):
if bit & (1<<i):
for k in range(m):
understanding[k] += bag[i][... | n, m, x = map(int, input().split())
bag = {}
for i in range(n):
bag[i]=list(map(int, input().split()))
min_ = 10**10
for bit in range(1<<n):
understanding = [0 for j in range(m)]
c = 0
for i in range(n):
if bit & (1<<i):
for k in range(m):
understanding[k] += bag[i][... | [
"control_flow.branch.if.condition.change"
] | 411,937 | 411,938 | u771167374 | python |
p02683 | n, m, x = list(map(int, input().split()))
c_list = []
a_matrix = []
for i in range(n):
items = list(map(int, input().split()))
c_list.append(items[0])
a_matrix.append(items[1:])
min_cost = 1000000 * (n+1)
for i in range(2^n):
cost = 0
skill_sum = [0 for _ in range(m)]
bit_pattern = format(i,... | n, m, x = list(map(int, input().split()))
c_list = []
a_matrix = []
for i in range(n):
items = list(map(int, input().split()))
c_list.append(items[0])
a_matrix.append(items[1:])
min_cost = 1000000 * (n+1)
for i in range(2**n):
cost = 0
skill_sum = [0 for _ in range(m)]
bit_pattern = format(i... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,941 | 411,942 | u752500421 | python |
p02683 | import itertools
import numpy as np
n, m, x = map(int, input().split())
san = []
for i in range(n):
san.append(list(map(int, input().split())))
result = []
adds = []
for j in range(1,n+1):
for conb in itertools.combinations(san, j):
result.append(list(conb)) #タプルをリスト型に変換
for i in result:
t = np.... | import itertools
import numpy as np
n, m, x = map(int, input().split())
san = []
for i in range(n):
san.append(list(map(int, input().split())))
result = []
adds = []
for j in range(1,n+1):
for conb in itertools.combinations(san, j):
result.append(list(conb)) #タプルをリスト型に変換
for i in result:
t = np.... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 411,945 | 411,946 | u125365353 | python |
p02683 | import itertools
import numpy as np
n, m, x = map(int, input().split())
san = []
for i in range(n):
san.append(list(map(int, input().split())))
result = []
adds = []
for j in range(1,n+1):
for conb in itertools.combinations(san, j):
result.append(list(conb)) #タプルをリスト型に変換
for i in result:
t = np.... | import itertools
import numpy as np
n, m, x = map(int, input().split())
san = []
for i in range(n):
san.append(list(map(int, input().split())))
result = []
adds = []
for j in range(1,n+1):
for conb in itertools.combinations(san, j):
result.append(list(conb)) #タプルをリスト型に変換
for i in result:
t = np.... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 411,947 | 411,946 | u125365353 | python |
p02683 | import itertools
import numpy as np
n, m, x = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(n)]
l = np.array(l)
ans = np.sum(l, 0)[0]
ans_s = np.sum(l, 0)
if np.any(ans_s[1:] < x):
print(-1)
exit()
for i in range(1, m + 1):
for j in itertools.combinations(l, i):
tot =... | import itertools
import numpy as np
n, m, x = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(n)]
l = np.array(l)
ans = np.sum(l, 0)[0]
ans_s = np.sum(l, 0)
if np.any(ans_s[1:] < x):
print(-1)
exit()
for i in range(1, n + 1):
for j in itertools.combinations(l, i):
tot =... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,952 | 411,953 | u279266699 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.