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())
cl = list(list(map(int, input().split())) for _ in range(n))
ans = float('inf')
for i in range(2**n):
tmp = [0]*(m-1)
cost = 0
for j in range(n):
if (i >> j) & 1:
for k in range(m-1):
tmp[k] += cl[j][k+1]
cost += cl[j][0]
... | n, m, x = map(int, input().split())
cl = list(list(map(int, input().split())) for _ in range(n))
ans = float('inf')
for i in range(2**n):
tmp = [0]*m
cost = 0
for j in range(n):
if (i >> j) & 1:
for k in range(m):
tmp[k] += cl[j][k+1]
cost += cl[j][0]
for... | [
"expression.operation.binary.remove"
] | 410,912 | 410,913 | u080364835 | python |
p02683 | from itertools import combinations
import numpy as np
n,m,x = map(int, input().split())
costs = []
understnding = []
ans = 10 ** 20
for _ in range(n):
tmp = list(map(int, input().split()))
costs.append(tmp[0])
understnding.append(tmp[1:])
costs = np.array(costs)
understnding = np.array(understnding)
... | from itertools import combinations
import numpy as np
n,m,x = map(int, input().split())
costs = []
understnding = []
ans = 10 ** 20
for _ in range(n):
tmp = list(map(int, input().split()))
costs.append(tmp[0])
understnding.append(tmp[1:])
costs = np.array(costs)
understnding = np.array(understnding)
... | [
"call.arguments.add",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 410,922 | 410,923 | u729938879 | python |
p02683 | from itertools import product
def main():
n, m, x = map(int, input().split())
books = []
for _ in range(n):
books.append(tuple(map(int, input().split())))
books_set_all = []
books_pattern = product((0, 1), repeat=n)
for each_pattern in books_pattern:
print(each_pattern)
... | from itertools import product
def main():
n, m, x = map(int, input().split())
books = []
for _ in range(n):
books.append(tuple(map(int, input().split())))
books_set_all = []
books_pattern = product((0, 1), repeat=n)
for each_pattern in books_pattern:
books_set = [0] * (m + 1)
... | [
"call.remove"
] | 410,950 | 410,951 | u072717685 | python |
p02683 | import numpy as np
N, M, X = map(int, input().split())
C = [list(map(int, input().split())) for _ in range(N)]
cost = float("inf")
for i in range(2**N):
tmp = np.array([0 for _ in range(M+1)])
for j in range(N):
if (i>>j) & 1:
tmp += np.array(C[j])
if min(tmp[1:]) >= 10:
cost = min(cost, tmp[0])
... | import numpy as np
N, M, X = map(int, input().split())
C = [list(map(int, input().split())) for _ in range(N)]
cost = float("inf")
for i in range(2**N):
tmp = np.array([0 for _ in range(M+1)])
for j in range(N):
if (i>>j) & 1:
tmp += np.array(C[j])
if min(tmp[1:]) >= X:
cost = min(cost, tmp[0])
p... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 410,952 | 410,953 | u974918235 | python |
p02683 | N, M, X = map(int, input().split())
C = []
A = []
for _ in range(N):
l = list(map(int, input().split()))
C.append(l[0])
A.append(l[1:])
ans = -1
for i in range((1<<N)-1):
u = [0] * M
p = 0
for j in range(N):
if i & (1 << j):
p += C[j]
for k in range(M):
... | N, M, X = map(int, input().split())
C = []
A = []
for _ in range(N):
l = list(map(int, input().split()))
C.append(l[0])
A.append(l[1:])
ans = -1
for i in range((1<<N)):
u = [0] * M
p = 0
for j in range(N):
if i & (1 << j):
p += C[j]
for k in range(M):
... | [
"expression.operation.binary.remove"
] | 410,958 | 410,959 | u899782392 | python |
p02683 | import itertools as it
N, M, X = map(int, input().split())
book = [[int(_) for _ in input().split()] for i in range(N)]
combs = it.product([0, 1], repeat=N)
prices = []
for comb in combs:
# print(comb)
bag = [0] * M+1
for i in range(N):
if comb[i] == 0:
continue
else:
... | import itertools as it
N, M, X = map(int, input().split())
book = [[int(_) for _ in input().split()] for i in range(N)]
combs = it.product([0, 1], repeat=N)
prices = []
for comb in combs:
# print(comb)
bag = [0] * (M+1)
for i in range(N):
if comb[i] == 0:
continue
else:
... | [] | 410,960 | 410,961 | u635621124 | python |
p02683 | import itertools as it
N, M, X = map(int,input().split())
book = [[int(_) for _ in input().split()] for i in range(N)]
combs = it.product([0,1], repeat=N)
prices = []
for comb in combs:
# print(comb)
bag = [0]*M
for i in range(N):
if comb[i] == 0:
continue
else:
for ... | import itertools as it
N, M, X = map(int, input().split())
book = [[int(_) for _ in input().split()] for i in range(N)]
combs = it.product([0, 1], repeat=N)
prices = []
for comb in combs:
# print(comb)
bag = [0] * (M+1)
for i in range(N):
if comb[i] == 0:
continue
else:
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 410,962 | 410,961 | u635621124 | python |
p02683 | import itertools as it
N,M,X=map(int,input().split())
book = [[int(_) for _ in input().split()] for i in range(N)]
combs = it.product([0, 1], repeat=N)
prices = []
for comb in combs:
bag = [0] * M
for i in range(N):
if comb[i] == 0:
continue
else:
for j in range(M):
bag[j]+=book[i][j]
if min(bag[1:])... | import itertools as it
N,M,X=map(int,input().split())
book = [[int(_) for _ in input().split()] for i in range(N)]
combs = it.product([0, 1], repeat=N)
prices = []
for comb in combs:
bag = [0] * (M+1)
for i in range(N):
if comb[i] == 0:
continue
else:
for j in range(M+1):
bag[j]+=book[i][j]
if min(ba... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 410,963 | 410,964 | u343523393 | python |
p02683 | from itertools import combinations
n,m,x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
ans = 10**9
for i in range(1, n+1):
for j in combinations(ca,i):
t = [0]*(m+1)
for k in j:
for l in range(m+1):
t[l] += k[l]
if all(t[num] >= x for num in range(1,m)... | from itertools import combinations
n,m,x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
ans = 10**9
for i in range(1,n+1):
for j in combinations(ca, i):
t = [0]*(m+1)
for k in j:
for l in range(m+1):
t[l] += k[l]
if all(t[a] >= x for a in range(1,m... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 410,969 | 410,970 | u188827677 | python |
p02683 | N,M,X = map(int, input().split())
A = []
C = []
for i in range(N) :
I = list(map(int,input().split()))
C.append(I[0])
A.append(I[1:])
ans = 10**12
for iv in range(1 << N) :
r = [0] * M
c = 0
isOk = True
for i in range(N) :
if(not iv >> i & 1) :
continue
c += C[i]... | N,M,X = map(int, input().split())
A = []
C = []
for i in range(N) :
I = list(map(int,input().split()))
C.append(I[0])
A.append(I[1:])
ans = 10**12
for iv in range(1 << N) :
r = [0] * M
c = 0
isOk = True
for i in range(N) :
if(not iv >> i & 1) :
continue
c += C[i]... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 410,971 | 410,972 | u038676814 | python |
p02683 | import numpy as np
N,M,X=map(int,input().split())
allList=[]
for _ in range(N):
allList.append(np.array(list(map(int,input().split()))))
minnum=10**7
for i in range(2**N):
skill=[0]*(M+1)
flag=True
for row in range(N):
if i&(2**row)>0:
skill+=allList[row]
for i in range(M):
... | import numpy as np
N,M,X=map(int,input().split())
allList=[]
for _ in range(N):
allList.append(np.array(list(map(int,input().split()))))
minnum=10**7
for i in range(2**N):
skill=[0]*(M+1)
flag=True
for row in range(N):
if i&(2**row)>0:
skill+=allList[row]
for j in range(M):
... | [
"identifier.change"
] | 410,974 | 410,975 | u190167135 | python |
p02683 | import sys
input = sys.stdin.readline
def find_good( list , x ):
#if ok : return 1 , not ok : return 0
flag = 1
for i in list:
if i < x:
flag = 0
break
return flag
def main():
n,m,x = map( int , input().split() )
a = []
c = []
for i in range(n):
... | import sys
input = sys.stdin.readline
def find_good( list , x ):
#if ok : return 1 , not ok : return 0
flag = 1
for i in list:
if i < x:
flag = 0
break
return flag
def main():
n,m,x = map( int , input().split() )
a = []
c = []
for i in range(n):
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 410,980 | 410,981 | u804800128 | python |
p02683 | N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
ans = 10**9 + 10
for i in range(N**2):
money = 0
L = [0] * M
for j in range(N):
if (i >> j) & 1:
money += A[j][0]
for k in range(M):
L[k] += A[j][k+1]
if min(L) >... | N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
ans = 10**9 + 10
for i in range(1, 2**N):
money = 0
L = [0] * M
for j in range(N):
if (i >> j) & 1:
money += A[j][0]
for k in range(M):
L[k] += A[j][k+1]
if min(L... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 410,991 | 410,992 | u993622994 | python |
p02683 | N, M, X = map(int, input().split())
INF = 30
ans = 1 << INF
data = []
for i in range(N):
c = list(map(int, input().split()))
data.append(c)
for i in range(1, 2**N):
tmp = 0
skill = [0] * M
for j in range(N):
if i >> j & 1:
tmp += data[j][0]
for k in range(M):
... | N, M, X = map(int, input().split())
INF = 30
ans = 1 << INF
data = []
for i in range(N):
c = list(map(int, input().split()))
data.append(c)
for i in range(1, 2**N):
tmp = 0
skill = [0] * M
for j in range(N):
if i >> j & 1:
tmp += data[j][0]
for k in range(M):
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 410,996 | 410,997 | u331105860 | python |
p02683 | n,m,x=map(int,input().split())
a=[]
c=[]
inf=10**9
result=inf
for i in range(n):
b=list(map(int,input().split()))
c.append(b[0])
a.append(b[1:])
for i in range(1<<n):
cnt=0
rikaido=[0]*m
for j in range(n):
if (i>>j)&1:
for k in range(m):
rikaido[k]+=a[j][k]
cnt+=c[j]
... | n,m,x=map(int,input().split())
a=[]
c=[]
inf=10**9
result=inf
for _ in range(n):
books=list(map(int,input().split()))
c.append(books[0])
a.append(books[1:])
for i in range(1<<n):
cnt=0
rikaido=[0]*m
for j in range(n):
if (i>>j)&1:
for k in range(m):
rikaido[k]+=a[j][k]
cnt... | [
"identifier.change",
"assignment.variable.change",
"call.arguments.change"
] | 411,000 | 411,001 | u460386402 | python |
p02683 | N, M, X = map(int, input().split())
C = [(list(map(int, input().split()))) for _ in range(N)]
# bit全探索を行い、参考書に関する全ての組みについて、値段と理解度を求める
ans = 10**10
for i in range(2**N):
U = [0]*(M+1)
for j in range(N):
if ((i >> j) & 1):
for k in range(M+1):
U[k] += C[j][k]
# ある組みが条件を満たすなら、その値段をvalに追加
if ... | N, M, X = map(int, input().split())
C = [(list(map(int, input().split()))) for _ in range(N)]
# bit全探索を行い、参考書に関する全ての組みについて、値段と理解度を求める
ans = 10**10
for i in range(2**N):
U = [0]*(M+1)
for j in range(N):
if ((i >> j) & 1):
for k in range(M+1):
U[k] += C[j][k]
# ある組みが条件を満たし、その値段が現時点で最小なら、更新する
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 411,004 | 411,003 | u309120194 | python |
p02683 | N, M, X = map(int, input().split())
C = [(list(map(int, input().split()))) for _ in range(N)]
# bit全探索を行い、参考書に関する全ての組みについて、値段と理解度を求める
ans = 10**10
for i in range(2**N):
U = [0]*(M+1)
for j in range(N):
if ((i >> j) & 1):
for k in range(M+1):
U[k] += C[j][k]
# ある組みが条件を満たすなら、その値段をvalに追加
if ... | N, M, X = map(int, input().split())
C = [(list(map(int, input().split()))) for _ in range(N)]
# bit全探索を行い、参考書に関する全ての組みについて、値段と理解度を求める
ans = 10**10
for i in range(2**N):
U = [0]*(M+1)
for j in range(N):
if ((i >> j) & 1):
for k in range(M+1):
U[k] += C[j][k]
# ある組みが条件を満たすなら、その値段をvalに追加
if ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 411,004 | 411,005 | u309120194 | python |
p02683 | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(M)], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if ... | N, M, X = map(int, input().split(' '))
price, exp = [], [ [] for i in range(N) ]
rst = -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.variable.change"
] | 411,006 | 411,007 | u418149936 | python |
p02683 | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(N) ], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << M):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(M):
if... | N, M, X = map(int, input().split(' '))
price, exp = [], [ [] for i in range(N) ]
rst = -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,008 | 411,007 | u418149936 | python |
p02683 | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(M)], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if ... | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(N) ], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,006 | 411,009 | u418149936 | python |
p02683 | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(N) ], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << M):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(M):
if... | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(N) ], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,008 | 411,009 | u418149936 | python |
p02683 | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(M)], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if ... | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(N) ], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,006 | 411,010 | u418149936 | python |
p02683 | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(N) ], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << M):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(M):
if... | N, M, X = map(int, input().split(' '))
price, exp, rst = [], [ [] for i in range(N) ], -1
for i in range(N):
ls = list(map(int, input().split(' ')))
price.append(ls[0])
exp[i] = ls[1:]
for i in range(1 << N):
price_combi, exp_combi, exp_sum, cnt_ls = [], [], [0] * M, []
for j in range(N):
if... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,008 | 411,010 | u418149936 | python |
p02683 | N, M, X = map(int, input().split())
C = []
A = []
for i in range(N):
c = list(map(int, input().split()))
C.append(c[0])
A.append(c[1:])
ans = sum(C)
for n in range(1 << N):
p = [0 for j in range(M)]
q = 0
for i in range(N):
t = (n >> i) & 1
q += t * C[i]
for j in range(M):
p[j] += t * A[i]... | N, M, X = map(int, input().split())
C = []
A = []
for i in range(N):
c = list(map(int, input().split()))
C.append(c[0])
A.append(c[1:])
ans = sum(C) + 1
for n in range(1 << N):
p = [0 for j in range(M)]
q = 0
for i in range(N):
t = (n >> i) & 1
q += t * C[i]
for j in range(M):
p[j] += t * ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 411,020 | 411,021 | u666550725 | python |
p02683 | N, M, X = map(int, input().split())
C = []
A = []
for i in range(N):
c = list(map(int, input().split()))
C.append(c[0])
A.append(c[1:])
ans = sum(C)
for n in range(2 << N):
p = [0 for j in range(M)]
q = 0
for i in range(N):
t = (n >> i) & 1
q += t * C[i]
for j in range(M):
p[j] += t * A[i]... | N, M, X = map(int, input().split())
C = []
A = []
for i in range(N):
c = list(map(int, input().split()))
C.append(c[0])
A.append(c[1:])
ans = sum(C) + 1
for n in range(1 << N):
p = [0 for j in range(M)]
q = 0
for i in range(N):
t = (n >> i) & 1
q += t * C[i]
for j in range(M):
p[j] += t * ... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 411,022 | 411,021 | u666550725 | python |
p02683 | import itertools
def abc167c_skill_up():
n, m, x = map(int, input().split())
c = []
a = []
for _ in range(n):
v = list(map(int, input().split()))
c.append(v[0])
a.append(v[1:])
pattern = itertools.product([0,1], repeat=n)
best = float('inf')
for p in pattern:
... | import itertools
def abc167c_skill_up():
n, m, x = map(int, input().split())
c = []
a = []
for _ in range(n):
v = list(map(int, input().split()))
c.append(v[0])
a.append(v[1:])
pattern = itertools.product([0,1], repeat=n)
best = float('inf')
for p in pattern:
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 411,034 | 411,035 | u252405453 | python |
p02683 | import numpy as np
N, M, X = map(int, input().split())
C = []
A = []
for _ in range(N):
inp = list(map(int, input().split()))
C.append(inp[0])
A.append(inp[1:])
A = np.array(A)
for i in range(M):
if np.sum(A, axis=0)[i] < X:
print(-1)
exit()
min_c = 999999999999999
for i in range(2**... | import numpy as np
N, M, X = map(int, input().split())
C = []
A = []
for _ in range(N):
inp = list(map(int, input().split()))
C.append(inp[0])
A.append(inp[1:])
A = np.array(A)
for i in range(M):
if np.sum(A, axis=0)[i] < X:
print(-1)
exit()
min_c = 999999999999999
for i in range(2**... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 411,036 | 411,037 | u636290142 | python |
p02683 | N, M, X= map(int, input().split())
arr=[list(map(int, input().split())) for _ in range(N)]
ans=float('inf')
for paint_h in range(2**N):
temp_arr=[0]*M
for i in range(N):
if (paint_h>>i)&1==1:
temp_arr=[a+b for (a, b) in zip(temp_arr, arr[i])]
if all(i>=X for i in temp_arr[1:]):
ans=min(ans, temp_arr[0])
prin... | N, M, X= map(int, input().split())
arr=[list(map(int, input().split())) for _ in range(N)]
ans=float('inf')
for paint_h in range(2**N):
temp_arr=[0]*(M+1)
for i in range(N):
if (paint_h>>i)&1==1:
temp_arr=[a+b for (a, b) in zip(temp_arr, arr[i])]
if all(i>=X for i in temp_arr[1:]):
ans=min(ans, temp_arr[0])
... | [] | 411,038 | 411,039 | u378691508 | python |
p02683 | N, M, X = map(int, input().split())
Ca = [list(map(int, input().split())) for _ in range(N)]
pattern = []
for i in range(2**N):
lis = []
for j in range(N):
if ((i>>j)&1):
lis.append(Ca[j])
pattern.append(lis)
cnt = []
for i in range(2**N):
g = [0] * (M+1)
for j in range(len(patt... | N, M, X = map(int, input().split())
Ca = [list(map(int, input().split())) for _ in range(N)]
pattern = []
for i in range(2**N):
lis = []
for j in range(N):
if ((i>>j)&1):
lis.append(Ca[j])
pattern.append(lis)
cnt = []
for i in range(2**N):
g = [0] * (M+1)
for j in range(len(patt... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 411,040 | 411,041 | u966207392 | python |
p02683 | N, M, X = map(int, input().split())
Ca = [list(map(int, input().split())) for _ in range(N)]
pattern = []
for i in range(2**N):
lis = []
for j in range(N):
if ((i>>j)&1):
lis.append(Ca[j])
pattern.append(lis)
cnt = []
for i in range(2**N):
g = [0] * (M+1)
for j in range(len(patt... | N, M, X = map(int, input().split())
Ca = [list(map(int, input().split())) for _ in range(N)]
pattern = []
for i in range(2**N):
lis = []
for j in range(N):
if ((i>>j)&1):
lis.append(Ca[j])
pattern.append(lis)
cnt = []
for i in range(2**N):
g = [0] * (M+1)
for j in range(len(patt... | [
"control_flow.loop.for.condition.change",
"call.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 411,042 | 411,041 | u966207392 | python |
p02683 | import sys
n,m,x=map(int,input().split())
A=[]
for i in range(n):
ca=list(map(int,input().split()))
A.append(ca)
ans=10**7
for i in range(2**n):#n冊をそれぞれ選ぶか選ばないか
tmp=[0]*m
cost=0
for j in range(n):#ある選び方
if (1<<j)&i:
cost+=A[j][0]
for k in range(m):
tm... | import sys
n,m,x=map(int,input().split())
A=[]
for i in range(n):
ca=list(map(int,input().split()))
A.append(ca)
ans=10**7
for i in range(2**n):#n冊をそれぞれ選ぶか選ばないか
tmp=[0]*m
cost=0
for j in range(n):#ある選び方
if (1<<j)&i:
cost+=A[j][0]
for k in range(m):
tm... | [] | 411,062 | 411,063 | u723583932 | python |
p02683 | import sys
n,m,x=map(int,input().split())
A=[]
for i in range(n):
ca=list(map(int,input().split()))
A.append(ca)
ans=10**20
for i in range(2**n):#n冊をそれぞれ選ぶか選ばないか
tmp=[0]*m
cost=0
for j in range(n):#ある選び方
if (1<<j)&i:
cost+=A[j][0]
for k in range(m):
t... | import sys
n,m,x=map(int,input().split())
A=[]
for i in range(n):
ca=list(map(int,input().split()))
A.append(ca)
ans=10**7
for i in range(2**n):#n冊をそれぞれ選ぶか選ばないか
tmp=[0]*m
cost=0
for j in range(n):#ある選び方
if (1<<j)&i:
cost+=A[j][0]
for k in range(m):
tm... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 411,064 | 411,063 | u723583932 | python |
p02683 | import sys
n,m,x=map(int,input().split())
A=[]
for i in range(n):
ca=list(map(int,input().split()))
A.append(ca)
ans=10*20
for i in range(2**n):#n冊をそれぞれ選ぶか選ばないか
tmp=[0]*m
cost=0
for j in range(n):#ある選び方
if (1<<j)&i:
cost+=A[j][0]
for k in range(m):
tm... | import sys
n,m,x=map(int,input().split())
A=[]
for i in range(n):
ca=list(map(int,input().split()))
A.append(ca)
ans=10**7
for i in range(2**n):#n冊をそれぞれ選ぶか選ばないか
tmp=[0]*m
cost=0
for j in range(n):#ある選び方
if (1<<j)&i:
cost+=A[j][0]
for k in range(m):
tm... | [] | 411,065 | 411,063 | u723583932 | python |
p02683 | import sys
n,m,x=map(int,input().split())
A=[]
for i in range(n):
ca=list(map(int,input().split()))
A.append(ca)
ans=10**7
for i in range(2**n):#n冊をそれぞれ選ぶか選ばないか
tmp=[0]*m
cost=0
for j in range(n):#ある選び方
if (1<<j)&i:
cost+=A[j][0]
for k in range(m):
tm... | import sys
n,m,x=map(int,input().split())
A=[]
for i in range(n):
ca=list(map(int,input().split()))
A.append(ca)
ans=10**7
for i in range(2**n):#n冊をそれぞれ選ぶか選ばないか
tmp=[0]*m
cost=0
for j in range(n):#ある選び方
if (1<<j)&i:
cost+=A[j][0]
for k in range(m):
tm... | [] | 411,066 | 411,063 | u723583932 | python |
p02683 | import numpy as np
N,M,X = map(int,input().split())
clist=[]
for i in range(N):
clist.append(list(map(int,input().split())))
#print(clist)
total_all=[]
for i in range(2**N):
total=np.zeros(M+1)
for j in range(N):
# iを2進数表記した場合の下から数えてj番目が1ならtrue
if ((i >> j) & 1):
tota... | import numpy as np
N,M,X = map(int,input().split())
clist=[]
for i in range(N):
clist.append(list(map(int,input().split())))
#print(clist)
total_all=[]
for i in range(2**N):
total=np.zeros(M+1)
for j in range(N):
# iを2進数表記した場合の下から数えてj番目が1ならtrue
if ((i >> j) & 1):
tota... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 411,067 | 411,068 | u538537141 | python |
p02683 | import numpy as np
N,M,X = map(int,input().split())
clist=[]
for i in range(N):
clist.append(list(map(int,input().split())))
#print(clist)
total_all=[]
for i in range(2**N):
total=np.zeros(M+1)
for j in range(N):
# iを2進数表記した場合の下から数えてj番目が1ならtrue
if ((i >> j) & 1):
tota... | import numpy as np
N,M,X = map(int,input().split())
clist=[]
for i in range(N):
clist.append(list(map(int,input().split())))
#print(clist)
total_all=[]
for i in range(2**N):
total=np.zeros(M+1)
for j in range(N):
# iを2進数表記した場合の下から数えてj番目が1ならtrue
if ((i >> j) & 1):
tota... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.replace.add",
"literal.replace.remove"
] | 411,069 | 411,068 | u538537141 | python |
p02683 | import itertools
n, m, x = list(map(int,input().split()))
c = []
for i in range(n):
c.append(list(map(int,input().split())))
mn = 0
for bn in itertools.product([0,1], repeat=n):
money = 0
skills = [0]*m
for j in range(n):
if bn[j] == 1:
money += c[j][0]
for k in range(m):... | import itertools
n, m, x = list(map(int,input().split()))
c = []
for i in range(n):
c.append(list(map(int,input().split())))
mn = -1
for bn in itertools.product([0,1], repeat=n):
money = 0
skills = [0]*m
for j in range(n):
if bn[j] == 1:
money += c[j][0]
for k in range(m)... | [
"assignment.value.change",
"expression.operation.unary.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 411,070 | 411,071 | u449822557 | python |
p02683 | N,M,X = map(int,input().split())
d=[]
ans = []
for i in range(N):
l=list(map(int,input().split()))
d.append(l)
print(d)
for i in range(2**N):
u=[0]*M
price=0
for j in range(N):
if ((i>>j) & 1):
price+=d[j][0]
for k in range(M):
u[k]+=d[j... | N,M,X = map(int,input().split())
d=[]
ans = []
for i in range(N):
l=list(map(int,input().split()))
d.append(l)
for i in range(2**N):
u=[0]*M
price=0
for j in range(N):
if ((i>>j) & 1):
price+=d[j][0]
for k in range(M):
u[k]+=d[j][k+1]
... | [
"call.remove"
] | 411,072 | 411,073 | u625495026 | python |
p02683 | import itertools
n, m, x = list(map(int, input().split()))
c = []
a = []
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp.pop(0))
a.append(tmp)
min_cost = 10 ** 5 + 1
for i in range(1, n + 1):
for j in list(itertools.combinations(range(n), i)):
recog = [0] * m
cost... | import itertools
n, m, x = list(map(int, input().split()))
c = []
a = []
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp.pop(0))
a.append(tmp)
min_cost = 10 ** 5 * 12 + 1
for i in range(1, n + 1):
for j in list(itertools.combinations(range(n), i)):
recog = [0] * m
... | [
"control_flow.branch.if.condition.change"
] | 411,082 | 411,083 | u856775981 | python |
p02683 | import numpy as np
N, M, X = list(map(int, input().split()))
a = np.zeros((N, M))
C = np.zeros(N)
for i in range(N):
tmp = list(map(int, input().split()))
C[i] += tmp[0]
a[i] += tmp[1:]
answer_price = 2**10
for i in range(1 << N):
tmp = np.zeros(M)
cost = 0
for j in range(N):
if i... | import numpy as np
N, M, X = list(map(int, input().split()))
a = np.zeros((N, M))
C = np.zeros(N)
for i in range(N):
tmp = list(map(int, input().split()))
C[i] += tmp[0]
a[i] += tmp[1:]
answer_price = 10**10
for i in range(1 << N):
tmp = np.zeros(M)
cost = 0
for j in range(N):
if ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 411,084 | 411,085 | u324090406 | python |
p02683 | import numpy as np
N, M, X = list(map(int, input().split()))
a = np.zeros((N, M))
C = np.zeros(N)
for i in range(N):
tmp = list(map(int, input().split()))
C[i] += tmp[0]
a[i] += tmp[1:]
answer_price = 2**10
for i in range(1 << N):
tmp = np.zeros(M)
cost = 0
for j in range(N):
if i... | import numpy as np
N, M, X = list(map(int, input().split()))
a = np.zeros((N, M))
C = np.zeros(N)
for i in range(N):
tmp = list(map(int, input().split()))
C[i] += tmp[0]
a[i] += tmp[1:]
answer_price = 10**10
for i in range(1 << N):
tmp = np.zeros(M)
cost = 0
for j in range(N):
if ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 411,086 | 411,085 | u324090406 | python |
p02683 | import numpy as np
N, M, X = list(map(int, input().split()))
a = np.zeros((N, M))
C = np.zeros(N)
for i in range(N):
tmp = list(map(int, input().split()))
C[i] += tmp[0]
a[i] += tmp[1:]
answer_price = 2**10
for i in range(1 << N):
tmp = np.zeros(M)
cost = 0
for j in range(N):
if i % 2... | import numpy as np
N, M, X = list(map(int, input().split()))
a = np.zeros((N, M))
C = np.zeros(N)
for i in range(N):
tmp = list(map(int, input().split()))
C[i] += tmp[0]
a[i] += tmp[1:]
answer_price = 10**10
for i in range(1 << N):
tmp = np.zeros(M)
cost = 0
for j in range(N):
if ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 411,087 | 411,085 | u324090406 | python |
p02683 | n,m,x=map(int,input().split())
ans=999999999999999999
a=[0]*m
for i in range(n):
a[i]=list(map(int,input().split()))
for i in range(2**n):
t=[0]*m
temp=0
for j in range(n):
if (i>>j)&1:
temp=temp+a[j][0]
for k in range(m):
t[k]=t[k]+a[j][k+1]
if min(t)>=x:
ans=min(ans,temp)
if ans=... | n,m,x=map(int,input().split())
ans=999999999999999999
a=[0]*n
for i in range(n):
a[i]=list(map(int,input().split()))
for i in range(2**n):
t=[0]*m
temp=0
for j in range(n):
if (i>>j)&1:
temp=temp+a[j][0]
for k in range(m):
t[k]=t[k]+a[j][k+1]
if min(t)>=x:
ans=min(ans,temp)
if ans=... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 411,088 | 411,089 | u629350026 | python |
p02683 | def cos_per_find(count, cost, skills):
if count == N:
if min(skills) >= X:
return cost
else:
return INF
improved_skills = [a+b for a, b in zip(skills, contents[count])]
return min(cos_per_find(count+1, cost, skills), cos_per_find(count+1, cost+price[count], improved_s... | def cos_per_find(count, cost, skills):
if count == N:
if min(skills) >= X:
return cost
else:
return INF
improved_skills = [a+b for a, b in zip(skills, contents[count])]
return min(cos_per_find(count+1, cost, skills), cos_per_find(count+1, cost+price[count], improved_s... | [
"call.arguments.change"
] | 411,092 | 411,091 | u531599639 | python |
p02683 | from itertools import combinations
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)
all_book= [i for i in range(N)]
out = 10**18
#for c in itertools.product([False, True], repeat=N):
for num in range(1,N+1): #1冊から... | from itertools import combinations
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)
all_book= [i for i in range(N)]
out = 10**18
flag =False
#for c in itertools.product([False, True], repeat=N):
for num i... | [
"assignment.add"
] | 411,098 | 411,099 | u116038906 | python |
p02683 | N, M , X = list(map(int,input().split()))
c = [[]]*N
a = [[[]]*M]*N
for n in range(N):
temp = list(map(int,input().split()))
c[n] = temp[0]
a[n] = temp[1:N+1]
ans = 10**7
for i in range(2 ** N):
price = 0
intelligence = [0 for _ in range(M)]
for j in range(N):
if ((i >> j) & 1):
... | N, M , X = list(map(int,input().split()))
c = [[]]*N
a = [[[]]*M]*N
for n in range(N):
temp = list(map(int,input().split()))
c[n] = temp[0]
a[n] = temp[1:M+1]
ans = 10**7
for i in range(2 ** N):
price = 0
intelligence = [0 for _ in range(M)]
for j in range(N):
if ((i >> j) & 1):
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 411,132 | 411,133 | u444732068 | python |
p02683 | import numpy as np
from numpy import array
n, m, x = list(map(int, input().split()))
a = []
for i in range(n):
a.append(list(map(int, input().split())))
a = array(a)
c_min = 0
flag = False
for i in range(1, n ** 2 + 1):
b = np.zeros(m+1)
for k in range(n):
if ((i >> k) & 1):
b += a... | import numpy as np
from numpy import array
n, m, x = list(map(int, input().split()))
a = []
for i in range(n):
a.append(list(map(int, input().split())))
a = array(a)
c_min = 0
flag = False
for i in range(1, 2 ** n ):
b = np.zeros(m+1)
for k in range(n):
if ((i >> k) & 1):
b += a[k]... | [
"expression.operation.binary.remove"
] | 411,134 | 411,135 | u123872895 | python |
p02683 | N,M,X = map(int,input().split())
books = []
for _ in range(N):
info = list(map(int,input().split()))
books.append(info)
res = float('inf')
for i in range(1<<N):
scores = [0] * M
cost = 0
for j in range(N):
if (i>>j)&1:
for k,p in enumerate(books[j][1:]):
scores[k] += p
cost += books[... | N,M,X = map(int,input().split())
books = []
for _ in range(N):
info = list(map(int,input().split()))
books.append(info)
res = float('inf')
for i in range(1<<N):
scores = [0] * M
cost = 0
for j in range(N):
if (i>>j)&1:
for k,p in enumerate(books[j][1:]):
scores[k] += p
cost += books[... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 411,136 | 411,137 | u723711163 | python |
p02683 | import sys
def calcSum(N, BuyingList_bool, Books):
Price = 0
for Num in range(N):
if(BuyingList_bool[Num]):
Price += Books[Num][0]
return Price
def search(N, M, X, Books, BuyingList_bool, Prices = [], BranchPos =0):
if(BranchPos == N):
Complehensives = [0] * M
for m... | import sys
def calcSum(N, BuyingList_bool, Books):
Price = 0
for Num in range(N):
if(BuyingList_bool[Num]):
Price += Books[Num][0]
return Price
def search(N, M, X, Books, BuyingList_bool, Prices = [], BranchPos =0):
if(BranchPos == N):
Complehensives = [0] * M
for ... | [
"assignment.remove"
] | 411,138 | 411,139 | u597553490 | python |
p02683 | n, m, x = map(int, input().split())
cas = [list(map(int, input().split())) for i in range(n)]
# 合否判定のためのフラグ
Flag = False
cost_min = 0
for i in range(n):
cost_min += cas[i][0]
# 全ての組み合わせについてチェック
for i in range(2**n):
bag = [0]*(m+1)
# バッグに荷物を詰める
for j in range(n):
if ((i>>j) & 1):
for k in range(m+1... | n, m, x = map(int, input().split())
cas = [list(map(int, input().split())) for i in range(n)]
# 合否判定のためのフラグ
Flag = False
cost_min = 0
for i in range(n):
cost_min += cas[i][0]
# 全ての組み合わせについてチェック
for i in range(2**n):
bag = [0]*(m+1)
# バッグに荷物を詰める
for j in range(n):
if ((i>>j) & 1):
for k in range(m+1... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 411,152 | 411,153 | u039355749 | python |
p02683 | N,M,X=map(int,input().split())
l=[list(map(int,input().split())) for i in range(n)]
cmin=12*10**5+1
for bit in range(2**N):
A=[0]*M
c=0
for j in range(N):
if (bit>>j)&1:
c+=l[j][0]
A=[x+y for (x,y) in zip(A, l[j][1:])]
if min(A) >= X:
cmin=min(cmin,c)
if cmin!=... | N,M,X=map(int,input().split())
l=[list(map(int,input().split())) for i in range(N)]
cmin=12*10**5+1
for bit in range(2**N):
A=[0]*M
c=0
for j in range(N):
if (bit>>j)&1:
c+=l[j][0]
A=[x+y for (x,y) in zip(A, l[j][1:])]
if min(A) >= X:
cmin=min(cmin,c)
if cmin!=... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,154 | 411,155 | u847923740 | python |
p02683 | n,m,x=map(int,input().split())
a=[list(map(int,input().split()))for i in range(n)]
ans=[]
for bit in range(1>>n):
total=0
skill=[0]*m
for i in range(n):
if bit & (1>>i):
total+=a[i][0]
for j in range(m):
skill[j]+=a[i][j]
if all([k>=x for k in skill]):
ans.append(total)
print(min(ans... | n,m,x=map(int,input().split())
a=[list(map(int,input().split()))for i in range(n)]
ans=[]
for bit in range(1<<n):
total=0
skill=[0]*m
for i in range(n):
if bit & (1<<i):
total+=a[i][0]
for j in range(m):
skill[j]+=a[i][j+1]
if all([k>=x for k in skill]):
ans.append(total)
print(min(a... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 411,156 | 411,157 | u257265865 | python |
p02683 | import numpy as np
N, M, X = map(int, input().split())
ca = []
for _ in range(N):
ca.append( list(map(int, input().split())))
ca.sort(key=lambda x:-x[0])
ca = np.array(ca)
#
ans = 10000000
skill = [0]*(M+1)
def DFS(n,skill):
global ans
if skill[0] >= ans:
return
if min(skill[1:]) >= X:
ans = min(ans... | import numpy as np
N, M, X = map(int, input().split())
ca = []
for _ in range(N):
ca.append( list(map(int, input().split())))
ca.sort(key=lambda x:-x[0])
ca = np.array(ca)
#
ans = 10000000
skill = [0]*(M+1)
def DFS(n,skill):
global ans
if skill[0] >= ans:
return
if min(skill[1:]) >= X:
ans = min(ans... | [
"identifier.change",
"call.arguments.change"
] | 411,161 | 411,162 | u537142137 | python |
p02683 | def nextg(x, place):
if x[place] == 1:
x[place] = 0
if place == 0:
return x
return nextg(x, place-1)
if x[place] == 0:
x[place] = 1
return x
n, m, t = map(int,input().split())
generator = [0]*n
books = []
for i in range(0, n):
books.append(list(map(int,inp... | def nextg(x, place):
if x[place] == 1:
x[place] = 0
if place == 0:
return x
return nextg(x, place-1)
if x[place] == 0:
x[place] = 1
return x
n, m, t = map(int,input().split())
generator = [0]*n
books = []
for i in range(0, n):
books.append(list(map(int,inp... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 411,165 | 411,166 | u201514991 | python |
p02683 | n,m,x = map(int,input().split())
c = [list(map(int,input().split())) for i in range(n)]
ans = float('inf')
print(c)
for i in range(2**n):#行数回す。(１０進数)
hold = [0] * (m+1)
for j in range(n):#行数回す（２進数）。flagを立てる。
if (i >> j) & 1:# i(二進数)をj個右に動かす。
for k in range(m+1):
hold[k] +=... | n,m,x = map(int,input().split())
c = [list(map(int,input().split())) for i in range(n)]
ans = float('inf')
for i in range(2**n):#行数回す。(１０進数)
hold = [0] * (m+1)
for j in range(n):#行数回す（２進数）。flagを立てる。
if (i >> j) & 1:# i(二進数)をj個右に動かす。
for k in range(m+1):
hold[k] += c[j][k]
... | [
"call.remove"
] | 411,170 | 411,171 | u725993280 | python |
p02683 | n,m,x = map(int,input().split())
c = [list(map(int,input().split())) for i in range(n)]
ans = float('inf')
print(c)
for i in range(2**n):#行数回す。(１０進数)
hold = [0] * (m+1)
for j in range(n):#行数回す（２進数）。flagを立てる。
if(i >> j) and 1:# i(二進数)をj個右に動かす。
for k in range(m+1):
hold[k] +... | n,m,x = map(int,input().split())
c = [list(map(int,input().split())) for i in range(n)]
ans = float('inf')
for i in range(2**n):#行数回す。(１０進数)
hold = [0] * (m+1)
for j in range(n):#行数回す（２進数）。flagを立てる。
if (i >> j) & 1:# i(二進数)をj個右に動かす。
for k in range(m+1):
hold[k] += c[j][k]
... | [
"call.remove",
"control_flow.branch.if.condition.change"
] | 411,172 | 411,171 | u725993280 | python |
p02683 | N,M,X = map(int,input().split())
books = [list(map(int,input().split())) for i in range(N)]
bag = []
for i in range(2**N):
temp = []
job = [0] * M
for s in range(N):
if (i>>s)&1:
temp.append(s)
for j in range(M):
job[j] += item[s][j+1]
for s in range(len(job)):
if job[s]<X:
br... | # coding: utf-8
N,M,X = map(int,input().split())
item = [list(map(int,input().split())) for i in range(N)]
bag = []
for i in range(2**N):
temp = []
job = [0] * M
for s in range(N):
if (i>>s)&1:
temp.append(s)
for j in range(M):
job[j] += item[s][j+1]
for s in range(len(job)):
if job... | [
"assignment.variable.change",
"identifier.change"
] | 411,184 | 411,185 | u773440446 | python |
p02683 | INF=100050
N,M,X=map(int,input().split())
A=[]
C=[]
for i in range(N):
array=list(map(int,input().split()))
C.append(array[0])
A.append(array[1:])
combination=[i for i in range(2**N)]
min_price=INF
for i in range(2**N):
price=0
knowledge=[0 for i in range(M)]
for j in range(N):
if c... | INF=10000050
N,M,X=map(int,input().split())
A=[]
C=[]
for i in range(N):
array=list(map(int,input().split()))
C.append(array[0])
A.append(array[1:])
combination=[i for i in range(2**N)]
min_price=INF
for i in range(2**N):
price=0
knowledge=[0 for i in range(M)]
for j in range(N):
if... | [
"literal.number.integer.change",
"assignment.value.change"
] | 411,213 | 411,214 | u970598682 | python |
p02683 | #Cbit全探索
n, m, x = map(int, input().split())
books = [list(map(int, input().split())) for i in range(n)]
ans = [0]*(m+1); ans[0] = 10**7
for i in range(2**n):
state = [0]*(m+1)
for j in range(n):
if (i >> j) & 1:
for k in range(m+1):
state[k] += books[m-1-j][k]
for j i... | #Cbit全探索
n, m, x = map(int, input().split())
books = [list(map(int, input().split())) for i in range(n)]
ans = [0]*(m+1); ans[0] = 10**7
for i in range(2**n):
state = [0]*(m+1)
for j in range(n):
if (i >> j) & 1:
for k in range(m+1):
state[k] += books[n-1-j][k]
for j i... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 411,215 | 411,216 | u297667660 | python |
p02683 | # bit全探索問題
N,M,X = map(int,input().split())
items = [list(map(int,input().split())) for _ in range(N)]
ans = -1
for i in range(1 << N):
total = [0]*(M+1)
for j in range(N):
if ((i >> j) & 1): # 順に右にシフトさせ最下位bitのチェックを行う
h = [x + y for (x, y) in zip(total, items[j])]
# print(total)
... | # bit全探索問題
N,M,X = map(int,input().split())
items = [list(map(int,input().split())) for _ in range(N)]
ans = -1
for i in range(1 << N):
total = [0]*(M+1)
for j in range(N):
if ((i >> j) & 1): # 順に右にシフトさせ最下位bitのチェックを行う
total = [x + y for (x, y) in zip(total, items[j])]
# print(total)
... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 411,230 | 411,231 | u048800107 | python |
p02683 | # bit全探索問題
N,M,X = map(int,input().split())
items = [list(map(int,input().split())) for _ in range(N)]
ans = -1
for i in range(1 << N):
total = [0]*(M+1)
for j in range(N):
if ((i >> j) & 1): # 順に右にシフトさせ最下位bitのチェックを行う
total = [x + y for (x, y) in zip(total, items[j])]
# print(total)
... | # bit全探索問題
N,M,X = map(int,input().split())
items = [list(map(int,input().split())) for _ in range(N)]
ans = -1
for i in range(1 << N):
total = [0]*(M+1)
for j in range(N):
if ((i >> j) & 1): # 順に右にシフトさせ最下位bitのチェックを行う
total = [x + y for (x, y) in zip(total, items[j])]
# print(total)
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 411,232 | 411,231 | u048800107 | python |
p02683 | import numpy as np
n, M, X = list(map(int, input().split()))
CA = []
A = []
for _ in range(N):
L = list(map(int, input().split()))
CA.append(L[:])
ans = np.zeros(M+1)
S = [0]*n
ANS = list()
def makeCombination():
for i in range(0, n-1):
S[i] = 0
rec(0, ans)
def rec(i,ans):
if i == n:
... | import numpy as np
n, M, X = list(map(int, input().split()))
CA = []
A = []
for _ in range(n):
L = list(map(int, input().split()))
CA.append(L[:])
ans = np.zeros(M+1)
S = [0]*n
ANS = list()
def makeCombination():
for i in range(0, n-1):
S[i] = 0
rec(0, ans)
def rec(i,ans):
if i == n:
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.add"
] | 411,235 | 411,234 | u382639013 | python |
p02683 | n,m,x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
anytassei = False
# bit = [0 for _ in range(n)]
mincost = 0
cost = 0
learn = [0 for _ in range(n)]
for i in range(n):
mincost += ca[i][0]
for cnt in range(2**n):
cost = 0
learn = [0 for _ in range(n)]
# bit膳探索
for i in ra... | n,m,x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
anytassei = False
# bit = [0 for _ in range(n)]
mincost = 0
cost = 0
learn = [0 for _ in range(n)]
for i in range(n):
mincost += ca[i][0]
for cnt in range(2**n):
cost = 0
learn = [0 for _ in range(m)]
# bit膳探索
for i in ra... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,246 | 411,247 | u630281418 | python |
p02683 | n,m,x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
anytassei = False
# bit = [0 for _ in range(n)]
mincost = 0
cost = 0
learn = [0 for _ in range(n)]
for i in range(n):
mincost += ca[i][0]
for cnt in range(2**n):
cost = 0
learn = [0 for _ in range(n)]
for i in range(n):
... | n,m,x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
anytassei = False
# bit = [0 for _ in range(n)]
mincost = 0
cost = 0
learn = [0 for _ in range(n)]
for i in range(n):
mincost += ca[i][0]
for cnt in range(2**n):
cost = 0
learn = [0 for _ in range(m)]
# bit膳探索
for i in ra... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,248 | 411,247 | u630281418 | python |
p02683 | import numpy as np
n , m , x = map(int,input().split())
understand_list = [list(map(int,input().split()))]
for _ in range(n-1):
understand_list.append(list(map(int,input().split())))
money_list = []
for i in range(1,2 ** n):
buy_list = []
money = 0
for j in range(n):
if ((i >> j) & 1):
... | import numpy as np
n , m , x = map(int,input().split())
understand_list = [list(map(int,input().split()))]
for _ in range(n-1):
understand_list.append(list(map(int,input().split())))
money_list = []
for i in range(1,2 ** n):
buy_list = []
money = 0
for j in range(n):
if ((i >> j) & 1):
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 411,249 | 411,250 | u893269127 | python |
p02683 | #c
n,m,x=map(int, input().split())
sp = [list(map(int, input().split())) for _ in range(n)]
import copy
result = []
def test(i,i_sum,cost):
flag = 0
if i <= n:
for j in range(m):
if i_sum[j] < x:
flag = 1
break
if flag == 1:
test... | #c
n,m,x=map(int, input().split())
sp = [list(map(int, input().split())) for _ in range(n)]
import copy
result = []
def test(i,i_sum,cost):
flag = 0
if i <= n:
for j in range(m):
if i_sum[j] < x:
flag = 1
break
if flag == 1:
test... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 411,255 | 411,256 | u941645670 | python |
p02683 | #c
n,m,x=map(int, input().split())
sp = [list(map(int, input().split())) for _ in range(m)]
import copy
result = []
def test(i,i_sum,cost):
flag = 0
if i <= n:
for j in range(m):
if i_sum[j] < x:
flag = 1
break
if flag == 1:
test... | #c
n,m,x=map(int, input().split())
sp = [list(map(int, input().split())) for _ in range(n)]
import copy
result = []
def test(i,i_sum,cost):
flag = 0
if i <= n:
for j in range(m):
if i_sum[j] < x:
flag = 1
break
if flag == 1:
test... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.change"
] | 411,258 | 411,256 | u941645670 | python |
p02683 | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1)
for j in range(N):
if((i>>j)&1)==1:
l=[l[k]+A[j][k] for k in range(M+1)]
for k in range(M):
if l[k+1]<X:
... | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1) #Initialize Check list
for j in range(N):
if((i>>j)&1): #delete ==1
l=[l[k]+A[j][k] for k in range(M+1)]
fo... | [
"control_flow.loop.for.condition.change"
] | 411,263 | 411,264 | u640603056 | python |
p02683 | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1)
for j in range(N):
if((i>>j)&1)==1:
l=[l[k]+A[j][k] for k in range(M+1)]
for k in range(M):
if l[k+1]<X:bre... | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1) #Initialize Check list
for j in range(N):
if((i>>j)&1): #delete ==1
l=[l[k]+A[j][k] for k in range(M+1)]
fo... | [
"control_flow.loop.for.condition.change"
] | 411,265 | 411,264 | u640603056 | python |
p02683 | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(N**2): #Bit All Search
l=[0]*(M+1)
for j in range(N):
if((i>>j)&1):
l=[l[k]+A[j][k] for k in range(M+1)]
for k in range(M):
if l[k+1]<X:brea... | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1) #Initialize Check list
for j in range(N):
if((i>>j)&1): #delete ==1
l=[l[k]+A[j][k] for k in range(M+1)]
fo... | [
"expression.operation.binary.remove"
] | 411,266 | 411,264 | u640603056 | python |
p02683 | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1)
for j in range(N):
if((i>>j)&1):
l=[l[k]+A[j][k] for k in range(M+1)]
for k in range(M):
if l[k+1]<X:
... | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1)
for j in range(N):
if((i>>j)&1)==1:
l=[l[k]+A[j][k] for k in range(M+1)]
for k in range(M):
if l[k+1]<X:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 411,267 | 411,268 | u640603056 | python |
p02683 | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1)
for j in range(N):
if((i>>j)&1):
l=[l[k]+A[j][k] for k in range(M+1)]
for k in range(M):
if l[k+1]<X:
... | import sys
N, M, X=map(int, sys.stdin.readline().rstrip().split())
A = [list(map(int, sys.stdin.readline().rstrip().split())) for i in range(N)]
cost=[]
for i in range(1<<N): #Bit All Search
l=[0]*(M+1)
for j in range(N):
if((i>>j)&1)==1:
l=[l[k]+A[j][k] for k in range(M+1)]
for k in range(M):
if l[k+1]<X:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 411,267 | 411,269 | u640603056 | python |
p02683 | import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7... | import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 411,279 | 411,280 | u047023156 | python |
p02683 | n, m, x = map(int, input().split())
C = [0] * n
A = [[] for i in range(n)]
for i in range(n):
c = list(map(int, input().split()))
C[i], A[i] = c[0], c[1:]
INF = 10 ** 9
ans = INF
for bit in range(0, 1 << n):
cost = 0
flag = True
tmp = [0] * m
for i in range(n):
if bit & 1 << i:
... | n, m, x = map(int, input().split())
C = [0] * n
A = [[] for i in range(n)]
for i in range(n):
c = list(map(int, input().split()))
C[i], A[i] = c[0], c[1:]
INF = 10 ** 9
ans = INF
for bit in range(0, 1 << n):
cost = 0
flag = True
tmp = [0] * m
for i in range(n):
if bit & 1 << i:
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 411,287 | 411,288 | u960080897 | python |
p02683 | import sys,itertools
N,M,X=map(int,input().split())
ALL=[]
cost=0
for i in range(N):
listA=list(map(int,input().split()))
ALL+=[listA]
cost+=listA[0]
for i in range(1,M+1):
SUM=0
for k in range(N):
SUM+=ALL[k][i]
if SUM<X:
print(-1)
sys.exit()
cost2=10**9
for take in range(1,N+1):
takeL=li... | import sys,itertools
N,M,X=map(int,input().split())
ALL=[]
cost=0
for i in range(N):
listA=list(map(int,input().split()))
ALL+=[listA]
cost+=listA[0]
for i in range(1,M+1):
SUM=0
for k in range(N):
SUM+=ALL[k][i]
if SUM<X:
print(-1)
sys.exit()
cost2=10**9
for take in range(1,N+1):
takeL=li... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 411,289 | 411,290 | u829249049 | python |
p02683 | import sys,itertools
N,M,X=map(int,input().split())
ALL=[]
cost=0
for i in range(N):
listA=list(map(int,input().split()))
ALL+=[listA]
cost+=listA[0]
for i in range(1,M+1):
SUM=0
for k in range(N):
SUM+=ALL[k][i]
if SUM<X:
print(-1)
sys.exit()
cost2=10**7
for take in range(1,N+1):
takeL=li... | import sys,itertools
N,M,X=map(int,input().split())
ALL=[]
cost=0
for i in range(N):
listA=list(map(int,input().split()))
ALL+=[listA]
cost+=listA[0]
for i in range(1,M+1):
SUM=0
for k in range(N):
SUM+=ALL[k][i]
if SUM<X:
print(-1)
sys.exit()
cost2=10**9
for take in range(1,N+1):
takeL=li... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 411,291 | 411,290 | u829249049 | python |
p02683 | import math
def main():
N,M,X = map(int, input().split())
C = [0 for j in range(N)]
A = [[0 for j in range(M)] for i in range(N)]
for i in range(0, N):
l = list(map(int, input().split()))
C[i] = l[0]
A[i] = l[1:]
res = max(C)*N
possible = False
for i in rang... | import math
def main():
N,M,X = map(int, input().split())
C = [0 for j in range(N)]
A = [[0 for j in range(M)] for i in range(N)]
for i in range(0, N):
l = list(map(int, input().split()))
C[i] = l[0]
A[i] = l[1:]
res = max(C)*N
possible = False
for i in rang... | [
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 411,295 | 411,296 | u561113780 | python |
p02683 | n,m,x = map(int, input().split())
ca = []
for i in range(m):
ca.append(list(map(int, input().split())))
c = []
a = []
for i in range(len(ca)):
c.append(ca[i][0])
a.append(ca[i])
del a[i][0]
ans = 12345678
for i in range(2 ** n):
cost = 0
level = [0] * m
for j in range(n):
if(i>>j&1... | n,m,x = map(int, input().split())
ca = []
for i in range(n):
ca.append(list(map(int, input().split())))
c = []
a = []
for i in range(len(ca)):
c.append(ca[i][0])
a.append(ca[i])
del a[i][0]
ans = 12345678
for i in range(2 ** n):
cost = 0
level = [0] * m
for j in range(n):
if((i>>j)... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 411,302 | 411,303 | u752414478 | python |
p02683 | n,m,x=map(int,input().split())
a=[]
for c in range(n):
a.append([int(x) for x in input().split()])
s=10**5+1
for d in range(2**n):
p=0
q=[0]*m
for e in range(n):
if (d%(2**(e+1)))//(2**e)==1:
p+=a[e][0]
for f in range(m):
q[f]+=a[e][f+1]
if s<p:
... | n,m,x=map(int,input().split())
a=[]
for c in range(n):
a.append([int(x) for x in input().split()])
s=10**7
for d in range(2**n):
p=0
q=[0]*m
for e in range(n):
if (d%(2**(e+1)))//(2**e)==1:
p+=a[e][0]
for f in range(m):
q[f]+=a[e][f+1]
if s<p:
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 411,304 | 411,305 | u631299617 | python |
p02683 | from itertools import combinations
n, m, x = list(map(int, input().split()))
c = []
a = []
# c, aにデータを用意
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp[0])
a.append([])
for j in range(m):
a[i].append(tmp[j])
money_min = -1
comb = []
# 組み合わせを用意
for l in range(n):
... | from itertools import combinations
n, m, x = list(map(int, input().split()))
c = []
a = []
# c, aにデータを用意
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp[0])
a.append([])
for j in range(1, m + 1):
a[i].append(tmp[j])
money_min = -1
comb = []
# 組み合わせを用意
for l in range... | [
"call.arguments.add",
"expression.operator.compare.change",
"call.arguments.change"
] | 411,323 | 411,324 | u387870994 | python |
p02683 | from itertools import combinations
n, m, x = list(map(int, input().split()))
c = []
a = []
# c, aにデータを用意
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp[0])
a.append([])
for j in range(m):
a[i].append(tmp[j])
money_min = -1
comb = []
# 組み合わせの数 1 - n
for l in range(n... | from itertools import combinations
n, m, x = list(map(int, input().split()))
c = []
a = []
# c, aにデータを用意
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp[0])
a.append([])
for j in range(1, m + 1):
a[i].append(tmp[j])
money_min = -1
comb = []
# 組み合わせを用意
for l in range... | [
"call.arguments.add"
] | 411,325 | 411,324 | u387870994 | python |
p02683 | #bit全探索
n,m,x=map(int,input().split())
a=[]
for i in range(n):
ai=list(map(int,input().split()))
a.append(ai)
#可能判定
maxi=[0 for i in range(m)]
for i in range(n):
for j in range(m):
maxi[j]+=a[i][j+1]
for i in range(m):
if maxi[i]<x:
print(-1)
exit()
mini=100000000
#全探索
for i in... | #bit全探索
n,m,x=map(int,input().split())
a=[]
for i in range(n):
ai=list(map(int,input().split()))
a.append(ai)
#可能判定
maxi=[0 for i in range(m)]
for i in range(n):
for j in range(m):
maxi[j]+=a[i][j+1]
for i in range(m):
if maxi[i]<x:
print(-1)
exit()
mini=100000000
#全探索
for i in... | [
"call.remove"
] | 411,330 | 411,331 | u919235786 | python |
p02683 | #bit全探索
n,m,x=map(int,input().split())
a=[]
for i in range(n):
ai=list(map(int,input().split()))
a.append(ai)
maxi=[0 for i in range(m)]
for i in range(n):
for j in range(m):
maxi[j]+=a[i][j+1]
for i in range(m):
if maxi[i]<x:
print(-1)
exit()
mini=100000000
#全探索
for i in range... | #bit全探索
n,m,x=map(int,input().split())
a=[]
for i in range(n):
ai=list(map(int,input().split()))
a.append(ai)
#可能判定
maxi=[0 for i in range(m)]
for i in range(n):
for j in range(m):
maxi[j]+=a[i][j+1]
for i in range(m):
if maxi[i]<x:
print(-1)
exit()
mini=100000000
#全探索
for i in... | [
"control_flow.branch.if.condition.change"
] | 411,332 | 411,331 | u919235786 | python |
p02683 | import numpy as np
N,M,X= map(int,input().split())
a = []
d = 0
e = False
f = []
z = 0
for i in range(N):
a.append([])
for i in range(N):
a[i]= [int(i) for i in input().split()]
for i in range(2 ** N):
b = np.array([0 for _ in range(M + 1)])
d = True
for j in range (N):
if ((i >> j) & 1):... | import numpy as np
N,M,X= map(int,input().split())
a = []
d = 0
e = False
f = []
z = 0
for i in range(N):
a.append([])
for i in range(N):
a[i]= [int(i) for i in input().split()]
for i in range(2 ** N):
b = np.array([0 for _ in range(M + 1)])
d = True
for j in range (N):
if ((i >> j) & 1):... | [
"call.remove"
] | 411,335 | 411,336 | u139940813 | python |
p02683 | def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
n,m,x=n1()
ca=n3(n)
ca
ans=9999999999
import itertools
book=list(itertools.product([0,1], repeat=n))
price=[]
for line... | def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
n,m,x=n1()
ca=n3(n)
ans=9999999999
import itertools
book=list(itertools.product([0,1], repeat=n))
price=[]
for line in... | [
"call.arguments.add"
] | 411,344 | 411,345 | u920103253 | python |
p02683 | n, m, x = map(int, input().split())
books = []
book_total_price = []
for _ in range(n):
book = list(map(int, input().split()))
books.append(book)
for i in range(n ** 2):
reference_book = []
book_price = 0
for j in range(n):
if (i >> j) & 1:
reference_book.append(books[j])
... | n, m, x = map(int, input().split())
books = []
book_total_price = []
for _ in range(n):
book = list(map(int, input().split()))
books.append(book)
for i in range(2**n):
reference_book = []
book_price = 0
for j in range(n):
if (i >> j) & 1:
reference_book.append(books[j])
... | [
"expression.operation.binary.remove"
] | 411,350 | 411,351 | u537550206 | python |
p02683 | n, m, x = map(int, input().split())
books = []
ans = float('inf')
for _ in range(n):
book = list(map(int, input().split()))
books.append(book)
for i in range(n**2):
count = [0] * m
book_price = 0
for j in range(n):
if (i >> j) & 1:
book_price += books[j][0]
for k in ... | n, m, x = map(int, input().split())
books = []
ans = float('inf')
for _ in range(n):
book = list(map(int, input().split()))
books.append(book)
for i in range(2**n):
count = [0] * m
book_price = 0
for j in range(n):
if (i >> j) & 1:
book_price += books[j][0]
for k in ... | [
"expression.operation.binary.remove"
] | 411,352 | 411,353 | u537550206 | python |
p02683 | import numpy as np,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M,X = LI()
CA = np.array([LI() for _ in range(N)])
ans = float('INF')
for i in range(N**2):
bit = np.array([[i>>j&1 for j in range(N)]]).T
temp = (CA*bit).sum(axis=0)
if (temp[1:]>=X).all():
ans = min(ans,... | import numpy as np,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M,X = LI()
CA = np.array([LI() for _ in range(N)])
ans = float('INF')
for i in range(2**N):
bit = np.array([[i>>j&1 for j in range(N)]]).T
temp = (CA*bit).sum(axis=0)
if (temp[1:]>=X).all():
ans = min(ans,... | [
"expression.operation.binary.remove"
] | 411,360 | 411,361 | u579699847 | python |
p02683 | import numpy as np,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M,X = LI()
CA = np.array([LI() for _ in range(N)])
ans = float('INF')
for i in range(2**N):
bit = np.array([[i>>j&1 for j in range(N)]]).T
temp = np.sum(CA*bit,axis=0).tolist()
temp2 = []
temp2.append(temp)
... | import numpy as np,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M,X = LI()
CA = np.array([LI() for _ in range(N)])
ans = float('INF')
for i in range(2**N):
bit = np.array([[i>>j&1 for j in range(N)]]).T
temp = np.sum(CA*bit,axis=0).tolist()
temp2 = []
temp2.append(temp)
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 411,362 | 411,363 | u579699847 | python |
p02683 | N,M,X=list(map(int,input().split()))
lines = []
for i in range(N):
lines.append(list(map(int,input().split())))
pricemin = 1500000
for i in range(2**N):
price = 0
count = 0
A = [0]*M
for j in range(N):
if ((i >> j) & 1):
for k in range(M):
A[k] += lines[j][k+1]
price += lines[j][0]
for j in range(M):... | N,M,X=list(map(int,input().split()))
lines = []
for i in range(N):
lines.append(list(map(int,input().split())))
pricemin = 1500000
for i in range(2**N):
price = 0
count = 0
A = [0]*M
for j in range(N):
if ((i >> j) & 1):
for k in range(M):
A[k] += lines[j][k+1]
price += lines[j][0]
for j in range(M):... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 411,366 | 411,367 | u591812989 | python |
p02683 | # coding: utf-8
N, M, X = map(int, input().split())
C = [list(map(int, input().split())) for _ in range(N)]
n = len(C)
m = -1
for i in range(2 ** n):
A = [0 for i in range(M+1)]
total = 0
for j in range(n):
if((i >> j) & 1):
A = [a + b for a, b in zip(A, C[j])]
B = [k for k i... | # coding: utf-8
N, M, X = map(int, input().split())
C = [list(map(int, input().split())) for _ in range(N)]
n = len(C)
m = -1
for i in range(2 ** n):
A = [0 for i in range(M+1)]
total = 0
for j in range(n):
if((i >> j) & 1):
A = [a + b for a, b in zip(A, C[j])]
B = [k for k i... | [
"call.arguments.add"
] | 411,369 | 411,370 | u102223485 | python |
p02683 | # coding: utf-8
N, M, X = map(int, input().split())
C = [list(map(int, input().split())) for _ in range(N)]
n = len(C)
m = -1
for i in range(2 ** n):
A = [0 for i in range(M)]
total = 0
for j in range(n):
if((i >> j) & 1):
A = [a + b for a, b in zip(A, C[j])]
B = [k for k in ... | # coding: utf-8
N, M, X = map(int, input().split())
C = [list(map(int, input().split())) for _ in range(N)]
n = len(C)
m = -1
for i in range(2 ** n):
A = [0 for i in range(M+1)]
total = 0
for j in range(n):
if((i >> j) & 1):
A = [a + b for a, b in zip(A, C[j])]
B = [k for k i... | [
"call.arguments.add"
] | 411,371 | 411,370 | u102223485 | python |
p02683 | from itertools import combinations
N,M,X=[int(x) for x in input().split()]
L=[]
for _ in range(N):
L.append([int(x) for x in input().split()])
Smin=-1
for i in range(N):
for t in combinations(L,i):
S=0
A=[0]*M
for l in t:
S+=l[0]
for x in range(M):
A[x]+=l[1+x]
ok=True
for x... | from itertools import combinations
N,M,X=[int(x) for x in input().split()]
L=[]
for _ in range(N):
L.append([int(x) for x in input().split()])
Smin=-1
for i in range(N):
for t in combinations(L,i+1):
S=0
A=[0]*M
for l in t:
S+=l[0]
for x in range(M):
A[x]+=l[1+x]
ok=True
for... | [
"expression.operation.binary.add"
] | 411,376 | 411,377 | u880035319 | python |
p02683 | import numpy as np
x,m,n = map(int, input().split())
acq2 = 0
cost = []
skill = []
for i in range(n):
ca = list(map(int, input().split()))
cost.append(ca[0])
skill.append(np.array(ca[1:]))
costmin = 0
for a in range(n):
costmin += cost[a]
def tworaw(num):
if (num % 2 == 0):
return 0
e... | import numpy as np
n,m,x = map(int, input().split())
acq2 = 0
cost = []
skill = []
for i in range(n):
ca = list(map(int, input().split()))
cost.append(ca[0])
skill.append(np.array(ca[1:]))
costmin = 0
for a in range(n):
costmin += cost[a]
def tworaw(num):
if (num % 2 == 0):
return 0
e... | [
"assignment.variable.change",
"identifier.change"
] | 411,385 | 411,386 | u749742659 | python |
p02683 | import numpy as np
x,m,n = map(int, input().split())
acq2 = 0
cost = []
skill = []
for i in range(n):
ca = list(map(int, input().split()))
cost.append(ca[0])
skill.append(np.array(ca[1:]))
costmin = 0
for a in range(n):
costmin += cost[a]
def tworaw(num):
if (num % 2 == 0):
return 0
e... | import numpy as np
n,m,x = map(int, input().split())
acq2 = 0
cost = []
skill = []
for i in range(n):
ca = list(map(int, input().split()))
cost.append(ca[0])
skill.append(np.array(ca[1:]))
costmin = 0
for a in range(n):
costmin += cost[a]
def tworaw(num):
if (num % 2 == 0):
return 0
e... | [
"assignment.variable.change",
"identifier.change",
"call.remove"
] | 411,387 | 411,386 | u749742659 | python |
p02683 | import numpy as np
from itertools import combinations
n,m,x = map(int, input().split())
n_num = [_ for _ in range(n)]
l = np.array([list(map(int, input().split())) for _ in range(n)])
ptns = []
for i in range(n):
ptns += list(combinations(n_num, i+1))
ans = float('inf')
for j in range(len(ptns)):
tmp = np.... | import numpy as np
from itertools import combinations
n,m,x = map(int, input().split())
n_num = [_ for _ in range(n)]
l = np.array([list(map(int, input().split())) for _ in range(n)])
ptns = []
for i in range(n):
ptns += list(combinations(n_num, i+1))
ans = float('inf')
for j in range(len(ptns)):
tmp = np.... | [
"control_flow.loop.for.condition.change"
] | 411,393 | 411,394 | u680851063 | python |
p02683 | # coding: utf-8
# Your code here!
n,m,k = map(int,input().split())
listA=[] #appendのために宣言が必要
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
#または、quit(),os.exit()をして止める。
x=[[0] * (m+1) for i in range(2**n)]
#print(listA)
for i in range(2 ** n):
for j i... | # coding: utf-8
# Your code here!
n,m,k = map(int,input().split())
listA=[] #appendのために宣言が必要
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
#または、quit(),os.exit()をして止める。
x=[[0] * (m+1) for i in range(2**n)]
#print(listA)
for i in range(2 ** n):
for j i... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 411,397 | 411,398 | u676091297 | python |
p02683 | # coding: utf-8
# Your code here!
n,m,k = map(int,input().split())
listA=[] #appendのために宣言が必要
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
#または、quit(),os.exit()をして止める。
x=[[0] * (m+1) for i in range(2**n)]
#print(listA)
for i in range(2 ** n):
for j i... | # coding: utf-8
# Your code here!
n,m,k = map(int,input().split())
listA=[] #appendのために宣言が必要
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
#または、quit(),os.exit()をして止める。
x=[[0] * (m+1) for i in range(2**n)]
#print(listA)
for i in range(2 ** n):
for j i... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 411,399 | 411,398 | u676091297 | python |
p02683 | # coding: utf-8
# Your code here!
n,m,k = map(int,input().split())
listA=[] #appendのために宣言が必要
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
#または、quit(),os.exit()をして止める。
x=[[0] * (m+1) for i in range(2**n)]
#print(listA)
for i in range(2 ** n):
for j i... | # coding: utf-8
# Your code here!
n,m,k = map(int,input().split())
listA=[] #appendのために宣言が必要
while True:
try:
listA.append(list(map(int,input().split())))
except:
break;
#または、quit(),os.exit()をして止める。
x=[[0] * (m+1) for i in range(2**n)]
#print(listA)
for i in range(2 ** n):
for j i... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 411,400 | 411,398 | u676091297 | python |
p02683 | N, M, X = map(int, input().split())
#N=参考書の冊数, 縦,M＝学びたいアルゴリズムの数, 横,X＝目標の理解度
S = [ input().split() for _ in range(N)]
mintotal = 10 ** 9
for i in range(2 ** N):
alg = [0 for _ in range(M)]
#bag = []
total = 0
#print("pattern {}:".format(i), end="")
for j in range(N):
if ((i >> j) & 1):
... | N, M, X = map(int, input().split())
#N=参考書の冊数, 縦,M＝学びたいアルゴリズムの数, 横,X＝目標の理解度
S = [ input().split() for _ in range(N)]
mintotal = 10 ** 9
for i in range(2 ** N):
alg = [0 for _ in range(M)]
#bag = []
total = 0
#print("pattern {}:".format(i), end="")
for j in range(N):
if ((i >> j) & 1):
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 411,401 | 411,402 | u008718882 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.