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 | import numpy as np
from itertools import product
if __name__ == '__main__':
T = input().split()
N = int(T[0])
M = int(T[1])
X = int(T[2])
price = np.zeros(N)
qual = np.zeros((N, M))
for n in range(N):
t = input().split()
price[n] = int(t[0])
qual[n, :] = np.array([in... | import numpy as np
from itertools import product
if __name__ == '__main__':
T = input().split()
N = int(T[0])
M = int(T[1])
X = int(T[2])
price = np.zeros(N)
qual = np.zeros((N, M))
for n in range(N):
t = input().split()
price[n] = int(t[0])
qual[n, :] = np.array([in... | [
"literal.number.float.change",
"control_flow.branch.if.condition.change"
] | 411,956 | 411,957 | u331369531 | python |
p02683 | import itertools
import numpy as np
N,M,X=map(int, input().split())
book = []
for _ in range(N):
book.append(list(map(int, input().split())))
book = np.array(book)
money=pow(10,7)
for i in itertools.product([0,1], repeat=N):
book2=book
dellist = []
for n,l in enumerate(i):
if l==0:
d... | import itertools
import numpy as np
N,M,X=map(int, input().split())
book = []
for _ in range(N):
book.append(list(map(int, input().split())))
book = np.array(book)
money=pow(10,7)
for i in itertools.product([0,1], repeat=N):
book2=book
dellist = []
for n,l in enumerate(i):
if l==0:
d... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 411,962 | 411,963 | u595905528 | python |
p02683 | import itertools
n, m, x = map(int, input().split())
T = [list(map(int, input().split())) for _ in range(n)]
flag1 = True
ans = -1
for i in range(1, n + 1):
if i == 1:
for j in range(n):
flag = True
for k in range(m):
if T[j][k + 1] < x:
flag = F... | import itertools
n, m, x = map(int, input().split())
T = [list(map(int, input().split())) for _ in range(n)]
flag1 = True
ans = -1
for i in range(1, n + 1):
if i == 1:
for j in range(n):
flag = True
for k in range(m):
if T[j][k + 1] < x:
flag = F... | [] | 411,971 | 411,972 | u886142147 | python |
p02683 | import numpy as np
from itertools import combinations
N, M, X = map(int, input().split())
row_list = []
C_list = []
for _ in range(N):
row = list(map(int, input().split()))
row = np.array(row)
C_list.append(row[0])
row_list.append(row[1:])
def check(subset, C_list, row_list, X):
if len(subset) == 0:
... | import numpy as np
from itertools import combinations
N, M, X = map(int, input().split())
row_list = []
C_list = []
for _ in range(N):
row = list(map(int, input().split()))
row = np.array(row)
C_list.append(row[0])
row_list.append(row[1:])
def check(subset, C_list, row_list, X):
if len(subset) == 0:
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 411,975 | 411,976 | u729083717 | python |
p02683 | n, m, x = map(int, input().split())
A = []
for i in range(n):
A.append(list(map(int, input().split())))
# print(A)
ans = float("inf")
for i in range(2 ** n):
skill = [0] * (m+1)
for j in range(n):
if ((i >> j) & 1):
for k in range(m):
skill[k] += A[j][k]
# print(... | n, m, x = map(int, input().split())
A = []
for i in range(n):
A.append(list(map(int, input().split())))
# print(A)
ans = float("inf")
for i in range(2 ** n):
skill = [0] * (m+1)
for j in range(n):
if ((i >> j) & 1):
for k in range(m+1):
skill[k] += A[j][k]
# prin... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 411,977 | 411,978 | u861141787 | python |
p02683 | N, M, X = input().split()
C, A = [], []
for _ in range(N):
tmp = [int(a) for a in input().split()]
C.append(tmp[0])
A.append(tmp[1:])
mi = 1 << 100
for binary in range(1 << N):
B = [0] * M
c = 0
for i in range(N):
if binary >> N & 1:
c += C[i]
for j in range(M):
... | N, M, X = map(int, input().split())
C, A = [], []
for _ in range(N):
tmp = [int(a) for a in input().split()]
C.append(tmp[0])
A.append(tmp[1:])
mi = 1 << 100
for binary in range(1 << N):
B = [0] * M
c = 0
for i in range(N):
if binary >> i & 1:
c += C[i]
for j in ... | [
"call.add",
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 411,979 | 411,980 | u722148122 | python |
p02683 | N, M, X = map(int, input().split())
A, C = [], []
for _ in range(N):
tmp = input().split()
C.append(int(tmp[0]))
A.append([int(i) for i in tmp[1:]])
is_clear = False
min_cost = 10**10
for flg_number in range(2 ** N - 1):
flgs = format(flg_number, '0'+str(N)+'b')
thr = [X] * M
cost = 0
for i ... | N, M, X = map(int, input().split())
A, C = [], []
for _ in range(N):
tmp = input().split()
C.append(int(tmp[0]))
A.append([int(i) for i in tmp[1:]])
is_clear = False
min_cost = 10**10
for flg_number in range(2 ** N):
flgs = format(flg_number, '0'+str(N)+'b')
thr = [X] * M
cost = 0
for i in r... | [
"expression.operation.binary.remove"
] | 411,981 | 411,982 | u722148122 | python |
p02683 | DEBUG = False
N, M, X = map(int, input().split())
A = []
C = []
for _ in range(N):
CA = list(map(int, input().split()))
C.append(CA[0])
A.append(CA[1::])
if DEBUG:
print(A)
print(C)
max_money = 10**5 * N
ans_money = max_money
# ans_algorythm = None
for i in range(2**N):
bit = bin(i)[2::]
... | DEBUG = False
N, M, X = map(int, input().split())
A = []
C = []
for _ in range(N):
CA = list(map(int, input().split()))
C.append(CA[0])
A.append(CA[1::])
if DEBUG:
print(A)
print(C)
max_money = 10**5 * N + 1
ans_money = max_money
# ans_algorythm = None
for i in range(2**N):
bit = bin(i)[2::]
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 411,985 | 411,984 | u357949405 | python |
p02683 | from itertools import combinations
def main():
N, M, X = [int(i) for i in input().split()]
C, A = [], []
for _ in range(N):
ca = [int(i) for i in input().split()]
C.append(ca[0])
A.append(ca[1:])
for m in range(M):
if sum(a[m] for a in A) < X:
print(-1)
... | from itertools import combinations
def main():
N, M, X = [int(i) for i in input().split()]
C, A = [], []
for _ in range(N):
ca = [int(i) for i in input().split()]
C.append(ca[0])
A.append(ca[1:])
for m in range(M):
if sum(a[m] for a in A) < X:
print(-1)
... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 411,988 | 411,989 | u165394332 | python |
p02683 | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from co... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from co... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 411,994 | 411,995 | u287500079 | python |
p02683 | import numpy as np
from itertools import product
INF = 10**9
N, M, X = map(int, input().split())
C = [None]*N
A = [None]*N
for i in range(N):
line = list(map(int, input().split()))
C[i] = line[0]
A[i] = np.array(line[1:])
choose = [True, False]
min_price = INF
for s in product([True, False], repeat=N):
... | import numpy as np
from itertools import product
INF = 10**9
N, M, X = map(int, input().split())
C = [None]*N
A = [None]*N
for i in range(N):
line = list(map(int, input().split()))
C[i] = line[0]
A[i] = np.array(line[1:])
choose = [True, False]
min_price = INF
for s in product([True, False], repeat=N):
... | [
"control_flow.branch.if.condition.change"
] | 411,996 | 411,997 | u479719434 | python |
p02683 | import numpy as np
import sys
from itertools import chain, combinations
N, M, X = [int(n) for n in input().split()]
matrix = np.zeros((N,M+1))
for i in range(N):
matrix[i] = np.array([int(n) for n in input().split()])
total = np.sum(matrix[:,1:],axis=0)
if not all(i >= X for i in total):
print(-1)
sys.ex... | import numpy as np
import sys
from itertools import chain, combinations
N, M, X = [int(n) for n in input().split()]
matrix = np.zeros((N,M+1))
for i in range(N):
matrix[i] = np.array([int(n) for n in input().split()])
total = np.sum(matrix[:,1:],axis=0)
if not all(i >= X for i in total):
print(-1)
sys.ex... | [
"call.arguments.add"
] | 412,000 | 412,001 | u433371341 | python |
p02683 | import numpy as np
import sys
from itertools import chain, combinations
N, M, X = [int(n) for n in input().split()]
matrix = np.zeros((N,M+1))
for i in range(N):
matrix[i] = np.array([int(n) for n in input().split()])
total = np.sum(matrix[:,1:],axis=0)
if not all(i >= X for i in total):
print(-1)
sys.ex... | import numpy as np
import sys
from itertools import chain, combinations
N, M, X = [int(n) for n in input().split()]
matrix = np.zeros((N,M+1))
for i in range(N):
matrix[i] = np.array([int(n) for n in input().split()])
total = np.sum(matrix[:,1:],axis=0)
if not all(i >= X for i in total):
print(-1)
sys.ex... | [
"assignment.change"
] | 412,002 | 412,001 | u433371341 | python |
p02683 | import numpy as np # NumPyモジュールをインポートする
import itertools
val = input()
val = val.split(" ")
val = [int(i) for i in val] # 全部intに変換
I = np.zeros((val[0], val[1]+1))
for i in range(val[0]):
val2 = input()
val2 = val2.split(" ")
val2 = [int(i) for i in val2] # 全部intに変換
I[i] = val2
seq = [i for i in ... | import numpy as np # NumPyモジュールをインポートする
import itertools
val = input()
val = val.split(" ")
val = [int(i) for i in val] # 全部intに変換
I = np.zeros((val[0], val[1]+1))
for i in range(val[0]):
val2 = input()
val2 = val2.split(" ")
val2 = [int(i) for i in val2] # 全部intに変換
I[i] = val2
seq = [i for i in ... | [
"call.remove"
] | 412,005 | 412,006 | u073589005 | python |
p02683 | n,k,x = (int(x) for x in input().split())
C = []
A = []
for i in range(n):
list = [int(i) for i in input().split()]
C.append(list[0])
A.append(list[1:])
i = 0
case = [0]*(2**n)
chk = []
for i in range(2**n):
chk.append([0]*m)
i = 0
for i in range(2 ** n):
for j in range(n): # このループが一番のポイント
... | n,m,x = (int(x) for x in input().split())
C = []
A = []
for i in range(n):
list = [int(i) for i in input().split()]
C.append(list[0])
A.append(list[1:])
i = 0
case = [0]*(2**n)
chk = []
for i in range(2**n):
chk.append([0]*m)
i = 0
for i in range(2 ** n):
for j in range(n):
if ((i >> j) & 1)... | [
"assignment.variable.change",
"identifier.change"
] | 412,008 | 412,009 | u970082363 | python |
p02683 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from itertools import product
n, m, x = map(int, readline().split())
ca = [list(map(int, readline().split())) for _ in range(n)]
ans = float('inf')
for bit in product([0, ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from itertools import product
n, m, x = map(int, readline().split())
ca = [list(map(int, readline().split())) for _ in range(n)]
ans = float('inf')
for bit in product([0, ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 412,010 | 412,011 | u691018832 | python |
p02683 | import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
bunshi=1
bunbo=1
for i in range(r):
bunbo = bunbo*(i+1)%mod
... | import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
bunshi=1
bunbo=1
for i in range(r):
bunbo = bunbo*(i+1)%mod
... | [
"control_flow.break.remove"
] | 412,013 | 412,014 | u943704029 | python |
p02683 | n, m, x = list(map(int, input().split()))
cas = []
for i in range(n):
ca = list(map(int, input().split()))
cas.append(ca)
kingakumin = 10000000000
for i in range(2 ** n):
now = []
inow = i
for j in range(n):
now.append(i % 2)
i = i // 2
syuutoku = []
for j in range(m):
... | n, m, x = list(map(int, input().split()))
cas = []
for i in range(n):
ca = list(map(int, input().split()))
cas.append(ca)
kingakumin = 10000000000
for i in range(2 ** n):
now = []
inow = i
for j in range(n):
now.append(i % 2)
i = i // 2
syuutoku = []
for j in range(m):
... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 412,048 | 412,049 | u044635590 | python |
p02683 | import itertools
N,M,X = map(int,input().split())
A = [list(map(int,input().split())) for i in range(N)]
z = [i for i in range(1, N)]
m = [1000000000000000000]
for i in range(N):
x = list(itertools.combinations(z,i+1))
for s in x:
for k in range(1,M+1):
C = sum(A[j-1][k] for j in s)
... | import itertools
N,M,X = map(int,input().split())
A = [list(map(int,input().split())) for i in range(N)]
z = [i for i in range(1, N+1)]
m = [1000000000000000000]
for i in range(N):
x = list(itertools.combinations(z,i+1))
for s in x:
for k in range(1,M+1):
C = sum(A[j-1][k] for j in s)
... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 412,067 | 412,068 | u234189749 | python |
p02683 | n, m, x = list(map(int, input().split()))
books = []
dp = [[0]*(m+1) for i in range(2**n)]
for i in range(n):
book = list(map(int, input().split()))
books.append(book)
min_cost = -1
for i in range(2**n):
if i == 0:
continue
refbook = 0
keta = 0
for j in range(12):
if (i >... | n, m, x = list(map(int, input().split()))
books = []
dp = [[0]*(m+1) for i in range(2**(n))]
for i in range(n):
book = list(map(int, input().split()))
books.append(book)
min_cost = -1
for i in range(2**(n)):
if i == 0:
continue
refbook = 0
keta = 0
for j in range(13):
if ... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change"
] | 412,085 | 412,086 | u917872021 | python |
p02683 | import itertools
import numpy as np
def resolve():
N, M, X = map(int, input().split())
C = []
Q = []
for i in range(N):
QQ = list(map(int, input().split()))
C.append(QQ[0])
Q.append(QQ[1:])
C = np.array(C)
Q = np.array(Q)
ok = False
NN = range(N)
ans = np... | import itertools
import numpy as np
def resolve():
N, M, X = map(int, input().split())
C = []
Q = []
for i in range(N):
QQ = list(map(int, input().split()))
C.append(QQ[0])
Q.append(QQ[1:])
C = np.array(C)
Q = np.array(Q)
ok = False
NN = range(N)
ans = np... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,101 | 412,102 | u586662847 | python |
p02683 | import itertools
N,M,X=map(int,input().split(' '))
book=[]
skil=[0]*M
for i in range(N):
line=list(map(int,input().split(' ')))
book.append(line)
skil=list(map(lambda x,y:x+y,skil,line[1:]))
min_p=100000
for n in range(1,N+1):
for conbo in itertools.combinations(book,n):
conbo_book=[0]*(1+M)
... | import itertools
N,M,X=map(int,input().split(' '))
book=[]
skil=[0]*M
for i in range(N):
line=list(map(int,input().split(' ')))
book.append(line)
skil=list(map(lambda x,y:x+y,skil,line[1:]))
min_p=12000000
for n in range(1,N+1):
for conbo in itertools.combinations(book,n):
conbo_book=[0]*(1+M... | [
"literal.number.integer.change",
"assignment.value.change"
] | 412,121 | 412,120 | u607569985 | python |
p02683 | import itertools
fi = list(map(int,input().split()))
n = fi[0]
m = fi[1]
x = fi[2]
c = []
cn = []
y = 1
for k in range(n):
cn.append(k)
for i in range(n):
a = list(map(int,input().split()))
c.append(a)
for j in range(m):
wa = 0
for s in range(n):
wa=wa+c[s][j+1]
if wa <= x:
y=y*0
money = []
if not ... | import itertools
fi = list(map(int,input().split()))
n = fi[0]
m = fi[1]
x = fi[2]
c = []
cn = []
y = 1
for k in range(n):
cn.append(k)
for i in range(n):
a = list(map(int,input().split()))
c.append(a)
for j in range(m):
wa = 0
for s in range(n):
wa=wa+c[s][j+1]
if wa < x:
y=y*0
money = []
if not y... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 412,122 | 412,123 | u526407267 | python |
p02683 | import itertools
n, m, x = map(int, input().split())
a = [0] * n
arr = []
ans = 10000
for i in range(n):
a[i] = list(map(int, input().split()))
for i in range(1, n+1):
for j in itertools.combinations(range(n), i):
b = [0] * m
c = 0
for k in list(j):
for l in range(m):
... | import itertools
n, m, x = map(int, input().split())
a = [0] * n
ans = 100000000
for i in range(n):
a[i] = list(map(int, input().split()))
for i in range(1, n+1):
for j in itertools.combinations(range(n), i):
b = [0] * m
c = 0
for k in list(j):
for l in range(m):
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 412,126 | 412,127 | u854992222 | python |
p02683 | import sys
n, m, x = map(int, input().split())
MAX = sys.maxsize
datas = []
for i in range(n):
datas.append(list(map(int, input().split())))
kingaku = 0
memos = [[0] * (m+2) for _ in range(n)]
def rec(i, rikaido, kingaku):
# print('i, rikaido, kingaku', i, rikaido, kingaku)
# print('終了条件', [i >= x ... | import sys
n, m, x = map(int, input().split())
MAX = sys.maxsize
datas = []
for i in range(n):
datas.append(list(map(int, input().split())))
kingaku = 0
memos = [[0] * (m+2) for _ in range(n)]
def rec(i, rikaido, kingaku):
#print('i, rikaido, kingaku', i, rikaido, kingaku)
#print('終了条件', [i >= x fo... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.unary.remove"
] | 412,132 | 412,133 | u548986948 | python |
p02683 | import itertools
n,m,x=map(int,input().split())
l=[[0]]*n
ln=[0]*m
kan=0
for i in range(n):
l[i]=list(map(int,input().split()))
for j in range(m+1):
if j==0:
kan+=l[i][j]
else:
ln[j-1]+=l[i][j]
if sorted(ln)[0]<x:
print(-1)
else:
mkan=-1
for i in range(n):
itr=itertools.combinations(ra... | import itertools
n,m,x=map(int,input().split())
l=[[0]]*n
ln=[0]*m
kan=0
for i in range(n):
l[i]=list(map(int,input().split()))
for j in range(m+1):
if j==0:
kan+=l[i][j]
else:
ln[j-1]+=l[i][j]
if sorted(ln)[0]<x:
print(-1)
else:
mkan=-1
for i in range(n+1):
itr=itertools.combinations(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 412,139 | 412,138 | u291988695 | python |
p02683 | import itertools
N,M,X = map(int, input().split())
S = []
N_list = list(range(1,N+1))
for _ in range(N):
c = list(map(int, input().split()))
S.append(c)
min = 100000
for i in range(1,N+1):
c = list(itertools.combinations(N_list, i))
for v in c:
A = [0]*M
money = 0
flag =0
... | import itertools
N,M,X = map(int, input().split())
S = []
N_list = list(range(1,N+1))
for _ in range(N):
c = list(map(int, input().split()))
S.append(c)
min = 1200001
for i in range(1,N+1):
c = list(itertools.combinations(N_list, i))
for v in c:
A = [0]*M
money = 0
flag =0
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 412,144 | 412,145 | u869917163 | python |
p02683 | import itertools
import numpy as np
n, m, x= map(int, input().split())
a = [input().split() for l in range(n)]
npa=np.array(a, dtype=int)
hon=-1
for i in range(1,n+1):
base = list(itertools.combinations(range(0,n),i))
# print (base)
for j in base:
totalv=np.sum(npa[j,], axis=0)
# print (totalv, min(tot... | import itertools
import numpy as np
n, m, x= map(int, input().split())
a = [input().split() for l in range(n)]
npa=np.array(a, dtype=int)
hon=-1
for i in range(1,n+1):
base = list(itertools.combinations(range(0,n),i))
# print (base)
for j in base:
totalv=np.sum(npa[j,], axis=0)
# print (totalv, min(tot... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 412,155 | 412,156 | u573536767 | python |
p02683 | import itertools
import numpy as np
n, m, x= map(int, input().split())
a = [input().split() for l in range(n)]
npa=np.array(a, dtype=int)
#print (npa)
hon=-1
for i in range(1,n+1):
base = list(itertools.combinations(range(0,n),i))
# print (base)
for j in base:
totalv=np.sum(npa[j,], axis=0)
# print (t... | import itertools
import numpy as np
n, m, x= map(int, input().split())
a = [input().split() for l in range(n)]
npa=np.array(a, dtype=int)
hon=-1
for i in range(1,n+1):
base = list(itertools.combinations(range(0,n),i))
# print (base)
for j in base:
totalv=np.sum(npa[j,], axis=0)
# print (totalv, min(tot... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.unary.add"
] | 412,157 | 412,156 | u573536767 | python |
p02683 | import math
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
N, M, X = read_ints()
A = []
for _ in range(N):
A.append(read_ints())
min_T = math.inf
for S in range(1, (1<<N)):
T = [0]*M
f... | import math
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
N, M, X = read_ints()
A = []
for _ in range(N):
A.append(read_ints())
min_T = math.inf
for S in range(1, (1<<N)):
T = [0]*(M+1)
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,166 | 412,167 | u309716323 | python |
p02683 | from itertools import combinations
N,M,X = map(int,input().split())
all_text = [list(map(int,input().split())) for i in range(N)]
array = [i for i in range(N)]
comb = []
for i in range(N-1):
r = list(map(list,list(combinations(array,i+1))))
comb.extend(r)
ans = []
for i in comb:
check = [0 for i in ra... | from itertools import combinations
N,M,X = map(int,input().split())
all_text = [list(map(int,input().split())) for i in range(N)]
array = [i for i in range(N)]
comb = []
for i in range(N):
r = list(map(list,list(combinations(array,i+1))))
comb.extend(r)
ans = []
for i in comb:
check = [0 for i in rang... | [
"expression.operation.binary.remove"
] | 412,185 | 412,186 | u491182585 | python |
p02683 | import numpy as np
n,m,x = map(int,input().split())
l = []
for i in range(n):
l.append(np.array(input().split(),dtype=int))
import itertools
num = [i for i in range(n)]
min = 1000000000000000000000000
k = 1
while k <n+1:
a = list(itertools.combinations(num, k))
for i in range(len(a)):
total =np.zer... | import numpy as np
n,m,x = map(int,input().split())
l = []
for i in range(n):
l.append(np.array(input().split(),dtype=int))
import itertools
num = [i for i in range(n)]
min = 1000000000000000000000000
k = 1
while k <n+1:
a = list(itertools.combinations(num, k))
for i in range(len(a)):
total =np.zer... | [
"assignment.remove"
] | 412,187 | 412,188 | u328179275 | python |
p02683 | import numpy as np
n,m,x = map(int,input().split())
l = []
for i in range(n):
l.append(np.array(input().split(),dtype=int))
import itertools
num = [i for i in range(n)]
min = 100000000000000
k = 1
while k <n+1:
a = list(itertools.combinations(num, k))
for i in range(len(a)):
total =np.zeros(m+1,dty... | import numpy as np
n,m,x = map(int,input().split())
l = []
for i in range(n):
l.append(np.array(input().split(),dtype=int))
import itertools
num = [i for i in range(n)]
min = 1000000000000000000000000
k = 1
while k <n+1:
a = list(itertools.combinations(num, k))
for i in range(len(a)):
total =np.zer... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 412,189 | 412,188 | u328179275 | python |
p02683 | import itertools
import numpy as np
N, M, X = map(int, input().split())
lis_all = [list(map(int, input().split())) for _ in range(N)]
lis_C = np.array(list(map(lambda x: x[0], lis_all)))
lis_A = np.array(list(map(lambda x: x[1:], lis_all)))
row_idx = []
bools = [True,False]
for boollis in itertools.product(bools, re... | import itertools
import numpy as np
N, M, X = map(int, input().split())
lis_all = [list(map(int, input().split())) for _ in range(N)]
lis_C = np.array(list(map(lambda x: x[0], lis_all)))
lis_A = np.array(list(map(lambda x: x[1:], lis_all)))
row_idx = []
bools = [True,False]
for boollis in itertools.product(bools, re... | [
"identifier.change",
"call.arguments.change",
"call.arguments.keyword_argument.change",
"control_flow.loop.range.bounds.upper.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 412,190 | 412,191 | u082978753 | python |
p02683 | import itertools
n, m, x = map(int, input().split())
C = []
A = []
for _ in range(n):
a = list(map(int, input().split()))
C.append(a[0])
A.append(a[1:])
ans = []
for i in range(n):
for combination in list(itertools.combinations(range(n), i)):
#print(combination)
total = 0
li =... | import itertools
n, m, x = map(int, input().split())
C = []
A = []
for _ in range(n):
a = list(map(int, input().split()))
C.append(a[0])
A.append(a[1:])
ans = []
for i in range(n):
for combination in list(itertools.combinations(range(n), i+1)):
# print(combination)
total = 0
l... | [
"expression.operation.binary.add"
] | 412,196 | 412,197 | u217547685 | python |
p02683 | import itertools
n,m,x=map(int,input().split())
ca=[0]*n
num=[]
ls=[]
last=[]
test=0
ng=0
money=0
for i in range(n):
ca[i]=input().split()
num.append(i)
for j in range(1,n+1):
ls=list(itertools.combinations(num,j))
for k in range(len(ls)):
test=0
money=0
ng=0
for l in range(m):
for ... | import itertools
n,m,x=map(int,input().split())
ca=[0]*n
num=[]
ls=[]
last=[]
test=0
ng=0
money=0
for i in range(n):
ca[i]=input().split()
num.append(i)
for j in range(1,n+1):
ls=list(itertools.combinations(num,j))
for k in range(len(ls)):
test=0
money=0
ng=0
for l in range(m):
test... | [
"assignment.add"
] | 412,198 | 412,199 | u478918022 | python |
p02683 |
#!/usr/bin/env python3
import sys
import pprint
import itertools
sys.setrecursionlimit(10 ** 6)
class Logger:
def __init__(self, debug):
self.debug = debug
def print(self, *args):
if self.debug:
pprint.pprint(args)
def main():
log = Logger(1)
n, m, x = map(int, sys.stdin.readline().split())
c = []
a ... |
#!/usr/bin/env python3
import sys
import pprint
import itertools
sys.setrecursionlimit(10 ** 6)
class Logger:
def __init__(self, debug):
self.debug = debug
def print(self, *args):
if self.debug:
pprint.pprint(args)
def main():
log = Logger(0)
n, m, x = map(int, sys.stdin.readline().split())
c = []
a ... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 412,200 | 412,201 | u620755587 | python |
p02683 | import itertools
import numpy
N, M, X = list(map(int, input().split()))
price = []
tmp = []
for i in range(N):
_ = list(map(int, input().split()))
price.append(_[0])
tmp.extend(_[1:])
price = numpy.array(price)
learn = numpy.array(tmp).reshape((N, M))
if min(numpy.sum(learn, axis=0)) < X:
print(-1)
else:
... | import itertools
import numpy
N, M, X = list(map(int, input().split()))
price = []
tmp = []
for i in range(N):
_ = list(map(int, input().split()))
price.append(_[0])
tmp.extend(_[1:])
price = numpy.array(price)
learn = numpy.array(tmp).reshape((N, M))
if min(numpy.sum(learn, axis=0)) < X:
print(-1)
else:
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,202 | 412,203 | u536781361 | python |
p02683 | import itertools
import numpy
N, M, X = list(map(int, input().split()))
price = []
tmp = []
for i in range(N):
_ = list(map(int, input().split()))
price.append(_[0])
tmp.extend(_[1:])
price = numpy.array(price)
learn = numpy.array(tmp).reshape((N, M))
if min(numpy.sum(learn, axis=0)) < X:
print(-1)
else:
... | import itertools
import numpy
N, M, X = list(map(int, input().split()))
price = []
tmp = []
for i in range(N):
_ = list(map(int, input().split()))
price.append(_[0])
tmp.extend(_[1:])
price = numpy.array(price)
learn = numpy.array(tmp).reshape((N, M))
if min(numpy.sum(learn, axis=0)) < X:
print(-1)
else:
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 412,204 | 412,203 | u536781361 | python |
p02683 | N,M,X=map(int,input().split())
cost=[0]*N
A=[]
for i in range(N):
CA=list(map(int,input().split()))
cost[i]=CA[0]
A.append(CA[1:])
ans=float("inf")
for i in range(N**2):
a=[0]*M
checked=[0]*M
money=0
cnt=0
for j in range(N):
if i%2==1:
for k in range(M):
... | N,M,X=map(int,input().split())
cost=[0]*N
A=[]
for i in range(N):
CA=list(map(int,input().split()))
cost[i]=CA[0]
A.append(CA[1:])
ans=float("inf")
for i in range(2**N):
a=[0]*M
checked=[0]*M
money=0
cnt=0
for j in range(N):
if i%2==1:
for k in range(M):
... | [
"expression.operation.binary.remove"
] | 412,221 | 412,222 | u338824669 | python |
p02683 | N,M,X=map(int,input().split())
cost=[0]*N
A=[]
for i in range(N):
CA=list(map(int,input().split()))
cost[i]=CA[0]
A.append(CA[1:])
ans=float("inf")
for i in range(N**2):
a=[0]*M
checked=[0]*M
money=0
cnt=0
for j in range(N):
if i%2==1:
for k in range(M):
... | N,M,X=map(int,input().split())
cost=[0]*N
A=[]
for i in range(N):
CA=list(map(int,input().split()))
cost[i]=CA[0]
A.append(CA[1:])
ans=float("inf")
for i in range(2**N):
a=[0]*M
checked=[0]*M
money=0
cnt=0
for j in range(N):
if i%2==1:
for k in range(M):
... | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 412,223 | 412,222 | u338824669 | python |
p02683 | from itertools import combinations
def skill(m, l, x):
ans = pow(10, 9)
rikai = [0 for _ in range(m)]
for i in range(m):
cl = combinations(range(n), i+1)
for c in cl:
cost = 0
rikai = [0 for _ in range(m)]
for j in c:
cost += l[j][0]
... | from itertools import combinations
def skill(m, l, x):
ans = pow(10, 9)
rikai = [0 for _ in range(m)]
for i in range(n):
cl = combinations(range(n), i+1)
for c in cl:
cost = 0
rikai = [0 for _ in range(m)]
for j in c:
cost += l[j][0]
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 412,226 | 412,227 | u378153116 | python |
p02683 | import sys
import numpy as np
from itertools import combinations
sys.setrecursionlimit(10 ** 6) # 再帰関数の再帰の深さを設定
to_index = lambda x: int(x) - 1 # 入力した数字に1を引いたものを返す
print_list_in_2D = lambda x: print(*x, sep="\n") # リストの要素を改行を挟んで表示する関数
# 入力を整数に変換して受け取る
def input_int():
return int(input())
def map_int_input():
... | import sys
import numpy as np
from itertools import combinations
sys.setrecursionlimit(10 ** 6) # 再帰関数の再帰の深さを設定
to_index = lambda x: int(x) - 1 # 入力した数字に1を引いたものを返す
print_list_in_2D = lambda x: print(*x, sep="\n") # リストの要素を改行を挟んで表示する関数
# 入力を整数に変換して受け取る
def input_int():
return int(input())
def map_int_input():
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 412,232 | 412,233 | u199830845 | python |
p02683 | import numpy as np
N,M,X=map(int,input().split())
CA=[]
for i in range(N):
CA.append(list(map(int,input().split())))
#print(CA)
m=[i+1 for i in range(N)]
from itertools import combinations
minmoney=float('inf')
for k in range(M):
for i in combinations(m,k+1):
#print(i)
money=0
r=[0]*M
fo... | import numpy as np
N,M,X=map(int,input().split())
CA=[]
for i in range(N):
CA.append(list(map(int,input().split())))
#print(CA)
m=[i+1 for i in range(N)]
from itertools import combinations
minmoney=float('inf')
for k in range(N):
for i in combinations(m,k+1):
#print(i)
money=0
r=[0]*M
fo... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 412,236 | 412,237 | u870736713 | python |
p02683 | from itertools import combinations
n , m ,x = map(int , input().split())
arr = [list(map(int , input().split())) for i in range(n)]
ans = 10**10
for i in range(1,n):
for k in combinations(arr , i):
#print(k,i,n)
a = [0]*m
#print(k)
f = 1
cost = 0
for ele in k:
#print(ele)
cost += ele[0]
for e in r... | from itertools import combinations
n , m ,x = map(int , input().split())
arr = [list(map(int , input().split())) for i in range(n)]
ans = 10**10
for i in range(1,n+1):
for k in combinations(arr , i):
#print(k,i,n)
a = [0]*m
#print(k)
f = 1
cost = 0
for ele in k:
#print(ele)
cost += ele[0]
for e in... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,247 | 412,248 | u733581231 | python |
p02683 | n,m,x = map(int, input().split())
data_list = []
for i in range(n):
data_list.append(list(map(int, input().split())))
base = 10000000
price = 12000000
for i in range(2 ** n):
value_list = [0]*(m+1)
value = []
for j in range(n): # このループが一番のポイント
if ((i >> j) & 1): # 順に右にシフトさせ最下位bitのチェックを行う... | n,m,x = map(int, input().split())
data_list = []
for i in range(n):
data_list.append(list(map(int, input().split())))
price = 12000000
for i in range(2 ** n):
value_list = [0]*(m+1)
value = []
for j in range(n): # このループが一番のポイント
if ((i >> j) & 1): # 順に右にシフトさせ最下位bitのチェックを行う
val... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 412,257 | 412,258 | u573234244 | python |
p02683 | n, m, x = map(int, input().split())
book = []
for i in range(n):
book.append(list(map(int, input().split())))
min_cost = 10**8
for i in range(2**n):
a = [0] * m
cost = 0
for j in range(n):
if (i >> j) & 1:
cost += book[j][0]
for k in range(m):
a[k] += b... | n, m, x = map(int, input().split())
book = []
for i in range(n):
book.append(list(map(int, input().split())))
min_cost = 10**8
for i in range(2**n):
a = [0] * m
cost = 0
for j in range(n):
if (i >> j) & 1:
cost += book[j][0]
for k in range(m):
a[k] += b... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 412,263 | 412,264 | u645855527 | python |
p02683 | import numpy as np
from itertools import combinations
n, m , x = map(int, input().split())
skill_dic = {}
for i in range(n):
tmp = list(map(int, input().split()))
skill_dic[i] = {'cost':tmp[0],'skills':tmp[1:]}
def calc_cost(skill_books, skill_dic,x):
skill_nums = len(skill_dic[0]['skills'])
skills = ... | import numpy as np
from itertools import combinations
n, m , x = map(int, input().split())
skill_dic = {}
for i in range(n):
tmp = list(map(int, input().split()))
skill_dic[i] = {'cost':tmp[0],'skills':tmp[1:]}
def calc_cost(skill_books, skill_dic,x):
skill_nums = len(skill_dic[0]['skills'])
skills = ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 412,265 | 412,266 | u460615319 | python |
p02683 | from itertools import product
n, m, x = map(int, input().split())
books = [list(map(int, input().split())) for _ in range(n)]
minimum_cost = float('inf')
buy_selections = product([1, 0], repeat=n)
for selection in buy_selections:
bought_books = [books[i] for i in range(n) if selection[i]]
total_each = [... | from itertools import product
n, m, x = map(int, input().split())
books = [list(map(int, input().split())) for _ in range(n)]
minimum_cost = float('inf')
buy_selections = product([1, 0], repeat=n)
for selection in buy_selections:
bought_books = [books[i] for i in range(n) if selection[i]]
total_each = [... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,269 | 412,270 | u505866450 | python |
p02683 | import numpy as np
n, m, x = list(map(int, input().split()))
a = [list(map(int,input().split())) for l in range(n)]
x_list = [x]*m
s = range(2**n)
ans = 10**5
count = 0
for i in s:
y = np.zeros(m+1)
for j in range(n):
if ((i>>j)&1):
y = y+np.array(a[j])
if np.all(np.array(y[1:])>=np.arr... | import numpy as np
n, m, x = list(map(int, input().split()))
a = [list(map(int,input().split())) for l in range(n)]
x_list = [x]*m
s = range(2**n)
ans = 10**10
count = 0
for i in s:
y = np.zeros(m+1)
for j in range(n):
if ((i>>j)&1):
y = y+np.array(a[j])
if np.all(np.array(y[1:])>=... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 412,271 | 412,272 | u183657342 | python |
p02683 | import itertools
N,M,X=map(int,input().split())
Money=0
lst=range(N)
combs = []
for i in range(1, len(lst)+1):
els = [list(x) for x in itertools.combinations(lst, i)]
combs.extend(els)
inList=[]
for i in range(N):
inList.append(list(map(int,input().split())))
Tmp=[0]*(len(combs))
for i in range(len(... | import itertools
N,M,X=map(int,input().split())
Money=0
lst=range(N)
combs = []
for i in range(1, len(lst)+1):
els = [list(x) for x in itertools.combinations(lst, i)]
combs.extend(els)
inList=[]
for i in range(N):
inList.append(list(map(int,input().split())))
Tmp=[0]*(len(combs))
for i in range(len(... | [
"expression.operation.binary.add"
] | 412,273 | 412,274 | u457460736 | python |
p02683 | import sys
import numpy as np
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,m,x=map(int,readline().split())
lst=[]
cnt=0
ans=100000000
for _ in range(n):
a=list(map(int,readline().split()))... | import sys
import numpy as np
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,m,x=map(int,readline().split())
lst=[]
cnt=0
ans=100000000
for _ in range(n):
a=list(map(int,readline().split()))... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 412,277 | 412,278 | u474925961 | python |
p02683 | import itertools
n, m, x = map(int, input().split())
c = [list(map(int, input().split())) for i in range(n)]
comb = []
for i in range(0, n+1):
comb.append(list(itertools.combinations(c, i)))
ans = []
for i in range(len(comb)):
for j in range(len(comb[i])):
flag = True
for l in range(1, m):
... | import itertools
n, m, x = map(int, input().split())
c = [list(map(int, input().split())) for i in range(n)]
comb = []
for i in range(1, n+1):
comb.append(list(itertools.combinations(c, i)))
ans = []
for i in range(len(comb)):
for j in range(len(comb[i])):
flag = True
for l in range(1, m+1):
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 412,279 | 412,280 | u054559808 | python |
p02683 | import itertools
n, m, x = map(int, input().split())
c = [list(map(int, input().split())) for i in range(n)]
comb = []
for i in range(1, n+1):
comb.append(list(itertools.combinations(c, i)))
ans = []
for i in range(len(comb)):
for j in range(len(comb[i])):
flag = True
for l in range(1, m):
... | import itertools
n, m, x = map(int, input().split())
c = [list(map(int, input().split())) for i in range(n)]
comb = []
for i in range(1, n+1):
comb.append(list(itertools.combinations(c, i)))
ans = []
for i in range(len(comb)):
for j in range(len(comb[i])):
flag = True
for l in range(1, m+1):
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,281 | 412,280 | u054559808 | python |
p02683 | n, m, x = map(int, input().split())
list_ca = [list(map(int, input().split())) for _ in range(n)]
num = pow(2, n)
min_cost = -1
for count in range(num):
a_list = [0] * m
cost = 0
for i in range(n):
bit = pow(2, i)
if (count // bit) % 2 == 1:
for j in range(m):
a_... | n, m, x = map(int, input().split())
list_ca = [list(map(int, input().split())) for _ in range(n)]
num = pow(2, n)
min_cost = -1
for count in range(num):
a_list = [0] * m
cost = 0
for i in range(n):
bit = pow(2, i)
if (count // bit) % 2 == 1:
for j in range(m):
a_... | [
"call.remove"
] | 412,284 | 412,285 | u668199686 | python |
p02683 | N, M, X = map(int, input().split())
S = []
for i in range(N):
S.append(list(map(int, input().split())))
lst = []
for i in range(2**N):
lst.append(str(bin(i)))
lst[i] = lst[i][2:]
lst[i] = lst[i].zfill(N)
lst_res = []
for j in lst:
res = [0]*(M+1)
for k in range(N):
if j[k] == "0":
... | N, M, X = map(int, input().split())
S = []
for i in range(N):
S.append(list(map(int, input().split())))
lst = []
for i in range(2**N):
lst.append(str(bin(i)))
lst[i] = lst[i][2:]
lst[i] = lst[i].zfill(N)
lst_res = []
for j in lst:
res = [0]*(M+1)
for k in range(N):
if j[k] == "0":
... | [] | 412,286 | 412,287 | u870518235 | python |
p02683 | import itertools
n, m, x = list(map(int, input().split()))
all_list = []
for i in range(n):
tmp = list(map(int, input().split()))
all_list.append(tmp)
ok = False
cur_price = (10 ** 5) * n + 1
for i in range(1, n + 1):
answers = list(itertools.combinations(range(n), i))
# print(answers)
for ans_lis... | import itertools
n, m, x = list(map(int, input().split()))
all_list = []
for i in range(n):
tmp = list(map(int, input().split()))
all_list.append(tmp)
ok = False
cur_price = (10 ** 5) * n + 1
for i in range(1, n + 1):
answers = list(itertools.combinations(range(n), i))
# print(answers)
for ans_lis... | [
"call.remove"
] | 412,294 | 412,295 | u233254147 | python |
p02683 | #from collections import defaultdict, deque
import itertools
import numpy as np
def main():
N, M, X = tuple(int(c) for c in input().split(' '))
C = []
A = []
for _ in range(N):
tmp = tuple(int(c) for c in input().split(' '))
C.append(tmp[0])
A.append(np.array(tmp[1:]))
# ma... | #from collections import defaultdict, deque
import itertools
import numpy as np
def main():
N, M, X = tuple(int(c) for c in input().split(' '))
C = []
A = []
for _ in range(N):
tmp = tuple(int(c) for c in input().split(' '))
C.append(tmp[0])
A.append(np.array(tmp[1:]))
# ma... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,306 | 412,307 | u808817704 | python |
p02683 | # -*- coding: utf-8 -*-
import itertools
# スペース区切りの整数の入力
N, M, X = map(int, input().split())
# 文字列の入力
#s = input()
#開業されたN個要素を受け付ける
input_list = [list(map(int, input().split())) for i in range(N)]
#print(input_list)
ans = -1
flg=1
for i in range(N):
if i ==0:
continue
c = list(itertools.combinations(... | # -*- coding: utf-8 -*-
import itertools
# スペース区切りの整数の入力
N, M, X = map(int, input().split())
# 文字列の入力
#s = input()
#開業されたN個要素を受け付ける
input_list = [list(map(int, input().split())) for i in range(N)]
#print(input_list)
ans = -1
flg=1
for i in range(N+1):
if i ==0:
continue
c = list(itertools.combination... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,324 | 412,325 | u449514925 | python |
p02683 |
n,m,x = map(int,input().split())
c = [[int(i) for i in input().split()] for _ in range(n)]
import itertools
max_=-1
for i in range(n):
c_list = list(itertools.combinations(c, i+1))
for j in c_list:
d=[0]*m
for k in j:
d = [x+y for (x,y) in zip(d,k)]
f=1
for l in rang... | n,m,x = map(int,input().split())
c = [[int(i) for i in input().split()] for _ in range(n)]
import itertools
max_=-1
for i in range(n):
c_list = list(itertools.combinations(c, i+1))
for j in c_list:
d=[0]*(m+1)
for k in j:
d = [x+y for (x,y) in zip(d,k)]
f=1
for l in ... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,326 | 412,327 | u306060982 | python |
p02683 | n,m,x = map(int,input().split())
c = [[int(i) for i in input().split()] for _ in range(n)]
import itertools
max_=-1
for i in range(n):
c_list = list(itertools.combinations(c, i+1))
for j in c_list:
d=[0]*m
for k in j:
d = [x+y for (x,y) in zip(d,k)]
f=1
for l in rang... | n,m,x = map(int,input().split())
c = [[int(i) for i in input().split()] for _ in range(n)]
import itertools
max_=-1
for i in range(n):
c_list = list(itertools.combinations(c, i+1))
for j in c_list:
d=[0]*(m+1)
for k in j:
d = [x+y for (x,y) in zip(d,k)]
f=1
for l in ... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,328 | 412,327 | u306060982 | python |
p02683 | # -*- coding: utf-8 -*-
"""
Created on Sun May 10 20:50:51 2020
"""
import sys
#import numpy as np
import itertools
sys.setrecursionlimit(10 ** 9)
#def input():
# return sys.stdin.readline()[:-1]
mod = 10**9+7
N,M,X = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(N)]
ans = 10 ** 9
... | # -*- coding: utf-8 -*-
"""
Created on Sun May 10 20:50:51 2020
"""
import sys
#import numpy as np
import itertools
sys.setrecursionlimit(10 ** 9)
#def input():
# return sys.stdin.readline()[:-1]
mod = 10**9+7
N,M,X = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(N)]
ans = 10 ** 9
... | [
"expression.operation.binary.remove"
] | 412,334 | 412,335 | u060938295 | python |
p02683 | # -*- coding: utf-8 -*-
"""
Created on Sun May 10 20:50:51 2020
"""
import sys
#import numpy as np
import itertools
sys.setrecursionlimit(10 ** 9)
#def input():
# return sys.stdin.readline()[:-1]
mod = 10**9+7
N,M,X = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(N)]
ans = 10 ** 9
... | # -*- coding: utf-8 -*-
"""
Created on Sun May 10 20:50:51 2020
"""
import sys
#import numpy as np
import itertools
sys.setrecursionlimit(10 ** 9)
#def input():
# return sys.stdin.readline()[:-1]
mod = 10**9+7
N,M,X = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(N)]
ans = 10 ** 9
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,336 | 412,335 | u060938295 | python |
p02683 | import itertools
import numpy as np
n, m, x = map(int, input().split())
books = [list(map(int, input().split())) for i in range(n)]
coin = []
for i in range(1, m+1):
for v in itertools.combinations(books, i):
comb = list(v)
result = np.sum(comb, axis = 0)
flag = True
for j in range(1,m+1):
if ... | import itertools
import numpy as np
n, m, x = map(int, input().split())
books = [list(map(int, input().split())) for i in range(n)]
coin = []
for i in range(1, n+1):
for v in itertools.combinations(books, i):
comb = list(v)
result = np.sum(comb, axis = 0)
flag = True
for j in range(1,m+1):
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 412,337 | 412,338 | u760130918 | python |
p02683 | import itertools
import numpy as np
n, m, x = map(int, input().split())
books = [list(map(int, input().split())) for i in range(n)]
coin = []
for i in range(1, m+1):
for v in itertools.combinations(books, i):
comb = list(v)
result = np.sum(comb, axis = 0)
flag = True
for j in range(1,m+1):
if ... | import itertools
import numpy as np
n, m, x = map(int, input().split())
books = [list(map(int, input().split())) for i in range(n)]
coin = []
for i in range(1, n+1):
for v in itertools.combinations(books, i):
comb = list(v)
result = np.sum(comb, axis = 0)
flag = True
for j in range(1,m+1):
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"call.remove",
"call.add"
] | 412,339 | 412,338 | u760130918 | python |
p02683 | import sys
from math import log2,floor,ceil,sqrt
# import bisect
sys.setrecursionlimit(10**5)
# from collections import deque
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b f... | import sys
from math import log2,floor,ceil,sqrt
# import bisect
sys.setrecursionlimit(10**5)
# from collections import deque
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b f... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 412,340 | 412,341 | u341175126 | python |
p02683 | import sys
from math import log2,floor,ceil,sqrt
# import bisect
sys.setrecursionlimit(10**4)
# from collections import deque
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b f... | import sys
from math import log2,floor,ceil,sqrt
# import bisect
sys.setrecursionlimit(10**5)
# from collections import deque
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b f... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 412,342 | 412,341 | u341175126 | python |
p02683 | import itertools
def get_target_list(source):
targets = []
for size in range(1, len(source) + 1):
for x in itertools.combinations(source, size):
targets.append(x)
return targets
paramN, paramM, paramX = list(map(lambda x: int(x), input().split(' ')))
targets = get_target_list([list(map... | import itertools
def get_target_list(source):
targets = []
for size in range(1, len(source) + 1):
for x in itertools.combinations(source, size):
targets.append(x)
return targets
paramN, paramM, paramX = list(map(lambda x: int(x), input().split(' ')))
targets = get_target_list([list(map... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"variable_access.subscript.index.change"
] | 412,352 | 412,353 | u689701565 | python |
p02683 | import itertools
def get_target_list(source):
targets = []
for size in range(1, len(source) + 1):
for x in itertools.combinations(source, size):
targets.append(x)
return targets
paramN, paramM, paramX = list(map(lambda x: int(x), input().split(' ')))
targets = get_target_list([list(map... | import itertools
def get_target_list(source):
targets = []
for size in range(1, len(source) + 1):
for x in itertools.combinations(source, size):
targets.append(x)
return targets
paramN, paramM, paramX = list(map(lambda x: int(x), input().split(' ')))
targets = get_target_list([list(map... | [
"literal.number.integer.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 412,354 | 412,353 | u689701565 | python |
p02683 | import numpy as np
n,m,x=list(map(int,input().split()))
lis=[]
for i in range(n):
l=list(map(int,input().split()))
lis.append(l)
min=-1
for nnn in range(2**n):
index=[]
a=nnn
for i in range(n):
index.append(a%2)
a//=2
money=0
xs=np.zeros(n)
for i in range(n):
... | import numpy as np
n,m,x=list(map(int,input().split()))
lis=[]
for i in range(n):
l=list(map(int,input().split()))
lis.append(l)
min=-1
for nnn in range(2**n):
index=[]
a=nnn
for i in range(n):
index.append(a%2)
a//=2
money=0
xs=np.zeros(m)
for i in range(n):
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 412,360 | 412,361 | u460229551 | python |
p02683 | from itertools import combinations
n,m,x = map(int,input().split())
cost_lists = [list(map(int,input().split())) for _ in range(n)]
# print(cost_lists)
min_cost = 10**9
unst_flag = False
for i in range(1, n+1):
combi_lists = list(combinations(range(n), i))
for combi_list in combi_lists:
tmp_list = ... | from itertools import combinations
n,m,x = map(int,input().split())
cost_lists = [list(map(int,input().split())) for _ in range(n)]
# print(cost_lists)
min_cost = 10**9
unst_flag = False
for i in range(1, n+1):
combi_lists = list(combinations(range(n), i))
for combi_list in combi_lists:
tmp_list = ... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,364 | 412,365 | u619084943 | python |
p02683 | import copy
import itertools
import sys
n, m, x = map(int, input().split())
us = [0 for _ in range(m)]
l = []
for i in range(n):
row = [int(i) for i in input().split()]
l.append(copy.deepcopy(row))
# 最初の一つをx以上にする組み合わせ
first = []
c = 0
for i in range(1, n+1):
c = itertools.combinations(range(n), i)
f... | import copy
import itertools
import sys
n, m, x = map(int, input().split())
us = [0 for _ in range(m)]
l = []
for i in range(n):
row = [int(i) for i in input().split()]
l.append(copy.deepcopy(row))
# 最初の一つをx以上にする組み合わせ
first = []
c = 0
for i in range(1, n+1):
c = itertools.combinations(range(n), i)
f... | [] | 412,366 | 412,367 | u693945629 | python |
p02683 | import itertools
def main(N, M, X, CA):
cand = []
for n in range(N): # n個選ぶ
for ca in itertools.combinations(CA, n):
s, price = f(ca)
if all(i >= X for i in s):
cand.append(price)
if len(cand) == 0:
print(-1)
else:
print(min(cand))
def ... | import itertools
def main(N, M, X, CA):
cand = []
for n in range(N): # n個選ぶ
for ca in itertools.combinations(CA, n+1):
s, price = f(ca)
if all(i >= X for i in s):
cand.append(price)
if len(cand) == 0:
print(-1)
else:
print(min(cand))
de... | [
"expression.operation.binary.add"
] | 412,373 | 412,374 | u894521144 | python |
p02683 | n, m, x = list(map(int, input().split()))
c = []
a = []
for i in range(n):
tmp = list(map(int, input().split()))
a.append(tmp[1:])
c.append(tmp[0])
goal = [x] * (m)
def infer(ans):
for i in range(m):
if goal[i] > ans[i]:
return False
return True
cost = 10 ** 5
flag = False
fo... | n, m, x = list(map(int, input().split()))
c = []
a = []
for i in range(n):
tmp = list(map(int, input().split()))
a.append(tmp[1:])
c.append(tmp[0])
goal = [x] * (m)
def infer(ans):
for i in range(m):
if goal[i] > ans[i]:
return False
return True
cost = 10 ** 12
flag = False
f... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 412,375 | 412,376 | u057993957 | python |
p02683 | import itertools
import sys
import numpy as np
N, M, X = map(int, input().split())
C = []
for n in range(N):
C.append(list(map(int, input().split())))
result = []
for n in range(2 ** N):
ii = [0] * N
for i in range(N):
if (n >> i) & 1:
ii[i] = 1
# print(ii)
tmp = [0] * (M + 1)
... | import itertools
import sys
import numpy as np
N, M, X = map(int, input().split())
C = []
for n in range(N):
C.append(list(map(int, input().split())))
result = []
for n in range(2 ** N):
ii = [0] * N
for i in range(N):
if (n >> i) & 1:
ii[i] = 1
# print(ii)
tmp = [0] * (M + 1)
... | [] | 412,377 | 412,378 | u186542450 | python |
p02683 | import itertools
def check(arr,t):
for i in arr:
if i < t:
return False
return True
N,M,X = list(map(int,input().split()))
l = []
for _ in range(N):
l.append(list(map(int,input().split())))
buy_bit = list(itertools.product([0,1], repeat=N))
mi = 99999999999999999
for pattern in buy_bit... | import itertools
def check(arr,t):
for i in arr:
if i < t:
return False
return True
N,M,X = list(map(int,input().split()))
l = []
for _ in range(N):
l.append(list(map(int,input().split())))
buy_bit = list(itertools.product([0,1], repeat=N))
mi = 990000000
for pattern in buy_bit:
l... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 412,397 | 412,398 | u156931988 | python |
p02683 | import itertools
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
kakaku = 100001
combinations = []
for n in range(1, N+1):
combinations += list(itertools.combinations(range(N), n))
for pair in combinations:
hantei = True
for m in range(M):
total = 0
... | import itertools
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
kakaku = 9999999
combinations = []
for n in range(1, N+1):
combinations += list(itertools.combinations(range(N), n))
for pair in combinations:
hantei = True
for m in range(M):
total = 0
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 412,399 | 412,400 | u885986895 | python |
p02683 | import itertools
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
kakaku = 100000
combinations = []
for n in range(N):
combinations += list(itertools.combinations(range(N), n))
for pair in combinations:
hantei = True
for m in range(M):
total = 0
... | import itertools
N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
kakaku = 9999999
combinations = []
for n in range(1, N+1):
combinations += list(itertools.combinations(range(N), n))
for pair in combinations:
hantei = True
for m in range(M):
total = 0
... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.add",
"control_flow.branch.if.condition.change"
] | 412,401 | 412,400 | u885986895 | python |
p02683 | import numpy as np
n,m,x = map(int, input().split())
s_list = list()
for i in range(n):
line = list(map(int, input().split()))
s_list.append([line[0], np.array(line[1:], dtype=int)])
cands = list()
# cost, value
cands.append([0, np.zeros(m, dtype=int)])
for l in s_list:
next_cands = list()
for... | import numpy as np
n,m,x = map(int, input().split())
s_list = list()
for i in range(n):
line = list(map(int, input().split()))
s_list.append([line[0], np.array(line[1:], dtype=int)])
cands = list()
# cost, value
cands.append([0, np.zeros(m, dtype=int)])
for l in s_list:
next_cands = list()
for... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 412,402 | 412,403 | u502776708 | python |
p02683 | def main():
IN1 = [int(_) for _ in input().split()]
N = IN1[0]
M = IN1[1]
X = IN1[2]
AC = [[int(_) for _ in input().split()] for i in range(N)]
minSum = 100001
for i in range(2 ** N):
tmpSum = 0
tmpA = [0] * M
for j in range(N):
if ((i >> j) & 1):
... | def main():
IN1 = [int(_) for _ in input().split()]
N = IN1[0]
M = IN1[1]
X = IN1[2]
AC = [[int(_) for _ in input().split()] for i in range(N)]
minSum = 1200001
for i in range(2 ** N):
tmpSum = 0
tmpA = [0] * M
for j in range(N):
if ((i >> j) & 1):
... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 412,406 | 412,407 | u455957433 | python |
p02683 | import itertools
n, m, x = map(int, input().split())
ca = [list(int(i) for i in input().split()) for i in range(n)]
cost_list = []
for choice in range(n):
for v in itertools.combinations(ca, choice):
cost = 0
us = [0] * m
for t in v:
cost += t[0]
for i in range(m):
us[i] += t[i+1]
... | import itertools
n, m, x = map(int, input().split())
ca = [list(int(i) for i in input().split()) for i in range(n)]
cost_list = []
for choice in range(n+1):
for v in itertools.combinations(ca, choice):
cost = 0
us = [0] * m
for t in v:
cost += t[0]
for i in range(m):
us[i] += t[i+1]
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,408 | 412,409 | u821989875 | python |
p02683 | import itertools
N, M, X = [int(_) for _ in input().split()]
B = []
for i in range(N):
B.append([int(_) for _ in input().split()])
l = [i for i in range(N)]
NUM = (10**5) * 12 + 1
ans = NUM
for i in range(1, M+1):
C = itertools.combinations(l, i)
for c in C:
amount = 0
U = [0 for i in range(... | import itertools
N, M, X = [int(_) for _ in input().split()]
B = []
for i in range(N):
B.append([int(_) for _ in input().split()])
l = [i for i in range(N)]
NUM = (10**5) * 12 + 1
ans = NUM
for i in range(1, N+1):
C = itertools.combinations(l, i)
for c in C:
amount = 0
U = [0 for i in range(... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 412,425 | 412,426 | u504562455 | python |
p02683 | # -*- coding: utf-8 -*-
N,M,X = list(map(int, input().rstrip().split()))
C_list = []
A_list = []
for i in range(N):
inp = list(map(int, input().rstrip().split()))
C_list.append(inp[0])
A_list.append(inp[1:])
#-----
bit = 1 << N
max_price = sum(C_list)
min_price = max_price
for b in range(bit):
pric... | # -*- coding: utf-8 -*-
N,M,X = list(map(int, input().rstrip().split()))
C_list = []
A_list = []
for i in range(N):
inp = list(map(int, input().rstrip().split()))
C_list.append(inp[0])
A_list.append(inp[1:])
#-----
bit = 1 << N
max_price = sum(C_list)*2
min_price = max_price
for b in range(bit):
pr... | [
"assignment.change"
] | 412,430 | 412,431 | u530383736 | python |
p02683 |
def process(tab, tour, current, result,skill, N, M, X):
finish = True
for i in skill:
if (i < X):
finish = False
break
if (finish):
if (result == -1):
return current
else:
return min(result, current)
if (tour == N or (curr... |
def process(tab, tour, current, result,skill, N, M, X):
finish = True
for i in skill:
if (i < X):
finish = False
break
if (finish):
if (result == -1):
return current
else:
return min(result, current)
if (tour == N or (curr... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,434 | 412,435 | u144540235 | python |
p02683 | import itertools
N, M, X = map(int, input().split())
a = [list(map(int, input().split())) for i in range(N)]
li = []
for i in range(N+1):
for j in itertools.combinations(range(N), i):
sm = [0] * (M+1)
for k in j:
for l in range(M+1):
sm[l] += a[k][l]
if all(y >= X... | import itertools
N, M, X = map(int, input().split())
a = [list(map(int, input().split())) for i in range(N)]
li = []
for i in range(N+1):
for j in itertools.combinations(range(N), i):
sm = [0] * (M+1)
for k in j:
for l in range(M+1):
sm[l] += a[k][l]
if all(y >= X... | [
"call.remove"
] | 412,436 | 412,437 | u306516971 | python |
p02683 | import itertools
N, M, X = map(int, input().split())
a = [list(map(int, input().split())) for i in range(N)]
li = []
for i in range(N):
for j in itertools.combinations(range(N), i):
sm = [0] * (M+1)
for k in j:
for l in range(M+1):
sm[l] += a[k][l]
if all(y >= X f... | import itertools
N, M, X = map(int, input().split())
a = [list(map(int, input().split())) for i in range(N)]
li = []
for i in range(N+1):
for j in itertools.combinations(range(N), i):
sm = [0] * (M+1)
for k in j:
for l in range(M+1):
sm[l] += a[k][l]
if all(y >= X... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 412,438 | 412,437 | u306516971 | python |
p02683 | import itertools
N,M,X = map(int,input().split())
book =[]
for x in range(N):
A_list = list(map(int, input().split()))
book.append(A_list)
conbination =[]
for i, _ in enumerate(book, 1):
for j in itertools.conbination(book, r=i): # rには1、2、3と渡される
conbination.append(j)
minn =100000000
for x in ... | import itertools
N,M,X = map(int,input().split())
book =[]
for x in range(N):
A_list = list(map(int, input().split()))
book.append(A_list)
conbination =[]
for i, _ in enumerate(book, 1):
for j in itertools.combinations(book, r=i): # rには1、2、3と渡される
conbination.append(j)
minn =100000000
for x in... | [
"identifier.change"
] | 412,451 | 412,452 | u948521599 | python |
p02683 | import itertools
p = list(map(int,input().split()))
N = p[0]
M = p[1]
X = p[2]
l = [[int(i) for i in input().split()] for j in range(N)]
hoge = []
kouho = list(range(1,N+1))
for i in itertools.combinations_with_replacement(kouho, N):
hoge.append(list(set(i)))
hoge = list(map(list, set(map(tuple, hoge))))
last_v... | import itertools
p = list(map(int,input().split()))
N = p[0]
M = p[1]
X = p[2]
l = [[int(i) for i in input().split()] for j in range(N)]
hoge = []
kouho = list(range(1,N+1))
for i in itertools.combinations_with_replacement(kouho, N):
hoge.append(list(set(i)))
hoge = list(map(list, set(map(tuple, hoge))))
last_v... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 412,457 | 412,458 | u107269063 | python |
p02683 | n, m, x = list(map(int, input().split()))
a = []
c = []
for _ in range(n):
list_ = list(map(int, input().split()))
c.append(list_[0])
list_.pop(0)
a.append(list_)
res = -1
bit = []
for i in range(2 ** n):
tmp = [False] * n
for j in range(n):
if i >> j & 1:
tmp[j] = True
b... | n, m, x = list(map(int, input().split()))
a = []
c = []
for _ in range(n):
list_ = list(map(int, input().split()))
c.append(list_[0])
list_.pop(0)
a.append(list_)
res = -1
bit = []
for i in range(2 ** n):
tmp = [False] * n
for j in range(n):
if i >> j & 1:
tmp[j] = True
b... | [
"control_flow.break.remove"
] | 412,459 | 412,460 | u133347536 | python |
p02683 | n,m,x=map(int,input().split())
lis=[list(map(int,(input().split()))) for i in range(n)]
c=float('inf')
p=0
for i in range(2**(n+1)):
al=[0]*m
cost=0
for j in range(n):
if (i>>j)&1:
for k in range(m):
al[k]+=lis[j][k]
cost+=lis[j][0]
if min(al)>=x:
... | n,m,x=map(int,input().split())
lis=[list(map(int,(input().split()))) for i in range(n)]
c=float('inf')
p=0
for i in range(2**(n+1)):
al=[0]*m
cost=0
for j in range(n):
if (i>>j)&1:
for k in range(1,m+1):
al[k-1]+=lis[j][k]
cost+=lis[j][0]
if min(al)>=x:
... | [
"call.arguments.add"
] | 412,463 | 412,464 | u755801379 | python |
p02683 | import numpy as np
n, m, x = list(map(lambda x: int(x), input().split(' ')))
sets = []
for i in range(n):
sets.append(list(map(lambda x: int(x), input().split(' '))))
sets = np.array(sets)
mincost = 10000000
maxnum = int(''.join(["1" for i in range(n)]), 2)
if not np.all((np.sum(sets[:, 1:], axis=0) > x)):
... | import numpy as np
n, m, x = list(map(lambda x: int(x), input().split(' ')))
sets = []
for i in range(n):
sets.append(list(map(lambda x: int(x), input().split(' '))))
sets = np.array(sets)
mincost = 10000000
maxnum = int(''.join(["1" for i in range(n)]), 2)
if not np.all((np.sum(sets[:, 1:], axis=0) >= x)):
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 412,467 | 412,468 | u025879810 | python |
p02683 | import itertools
N, M, X = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(N)]
list_N = [i for i in range(N)]
ans = []
for num_book in range(1, N + 1):
for i in itertools.combinations(list_N, num_book):
#print(i)
temp = 0
for j in range(1, M + 1):
... | import itertools
N, M, X = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(N)]
list_N = [i for i in range(N)]
ans = []
for num_book in range(1, N + 1):
for i in itertools.combinations(list_N, num_book):
#print(i)
temp = 0
for j in range(1, M + 1):
... | [
"call.remove"
] | 412,471 | 412,472 | u927282564 | python |
p02683 | N, M, X = list(map(int, input().split(" ")))
import numpy as np
vals = []
for i in range(N):
v = list(map(int, input().split(" ")))
vals.append(v)
vals = np.array(vals)
import itertools
prod = []
for i in range(1, N+1):
v = list(itertools.combinations(range(N), i))
prod.extend(v)
money = 1e8
... | N, M, X = list(map(int, input().split(" ")))
import numpy as np
vals = []
for i in range(N):
v = list(map(int, input().split(" ")))
vals.append(v)
vals = np.array(vals)
import itertools
prod = []
for i in range(1, N+1):
v = list(itertools.combinations(range(N), i))
prod.extend(v)
money = 1e10
... | [
"literal.number.float.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 412,475 | 412,476 | u881195671 | python |
p02683 | n,m,x = list(map(int,input().split()));
price = [0]*n;
rikai = [[0]*m for i in range(n)];
for i in range(n) :
ca = list(map(int,input().split()));
price[i] = ca[0];
for j in range(m) :
rikai[i][j] = ca[j+1];
ans = sum(price);
able = 0;
for i in range(2**n) :
allrikai = [0]*m;
nowprice = 0;... | n,m,x = list(map(int,input().split()));
price = [0]*n;
rikai = [[0]*m for i in range(n)];
for i in range(n) :
ca = list(map(int,input().split()));
price[i] = ca[0];
for j in range(m) :
rikai[i][j] = ca[j+1];
ans = sum(price);
able = 0;
for i in range(2**n) :
allrikai = [0]*m;
nowprice = 0;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 412,482 | 412,483 | u649326276 | python |
p02683 | from itertools import combinations
def main():
N, M, X = list(map(int, input().split()))
row = []
ans = 10 ** 10
for i in range(N):
row.append(list(map(int, input().split())))
for k in range(1, N+1):
co = list(combinations(row, k))
for t in co:
cost = 0
... | from itertools import combinations
def main():
N, M, X = list(map(int, input().split()))
row = []
ans = 10 ** 10
for i in range(N):
row.append(list(map(int, input().split())))
for k in range(1, N+1):
co = list(combinations(row, k))
for t in co:
cost = 0
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 412,484 | 412,485 | u393486651 | python |
p02683 | from itertools import combinations
def main():
N, M, X = list(map(int, input().split()))
row = []
ans = 10 ** 6
for i in range(N):
row.append(list(map(int, input().split())))
for k in range(1, N+1):
co = list(combinations(row, k))
for t in co:
cost = 0
... | from itertools import combinations
def main():
N, M, X = list(map(int, input().split()))
row = []
ans = 10 ** 10
for i in range(N):
row.append(list(map(int, input().split())))
for k in range(1, N+1):
co = list(combinations(row, k))
for t in co:
cost = 0
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 412,487 | 412,485 | u393486651 | python |
p02683 | #n=int(input())
n,m,x=map(int,input().split())
#a=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
def tas(l1,l2):
l3=[]
for i in range(m+1):
l3.append(l1[i]+l2[i])
return l3
ll=[[0 for i in range(m+1)]]
for i in range(n):
for j in range(len(ll)):
ll... | #n=int(input())
n,m,x=map(int,input().split())
#a=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
def tas(l1,l2):
l3=[]
for i in range(m+1):
l3.append(l1[i]+l2[i])
return l3
ll=[[0 for i in range(m+1)]]
for i in range(n):
for j in range(len(ll)):
ll... | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 412,491 | 412,492 | u563595438 | python |
p02683 | from itertools import combinations
import numpy as np
n,m,x=map(int, input().split())
S = []
for i in range(n):
A=list(map(int, input().split()))
S.append(A)
ans = 10**9
for i in range(2,n+1):
for comb in combinations(S,i):
tmp = np.array([0]*m)
cost = 0
for s in comb:
... | from itertools import combinations
import numpy as np
n,m,x=map(int, input().split())
S = []
for i in range(n):
A=list(map(int, input().split()))
S.append(A)
ans = 10**9
for i in range(1,n+1):
for comb in combinations(S,i):
#print(comb)
tmp = np.array([0]*m)
cost = 0
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 412,501 | 412,502 | u585348179 | python |
p02683 | #!/usr/bin/env python3
N, M, X = map(int, input().split())
li = [f'{i:012b}' for i in range(2**N)]
C = []
A = []
for i in range(N):
B = list(map(int, input().split()))
C.append(B[0])
A.append(B[1:])
d = []
for l in li:
b = l[::-1][:N]
rikai = [0]*M
pri = [0]*N
for i in range(len(b)):
... | #!/usr/bin/env python3
N, M, X = map(int, input().split())
li = [f'{i:012b}' for i in range(2**N)]
C = []
A = []
for i in range(N):
B = list(map(int, input().split()))
C.append(B[0])
A.append(B[1:])
d = []
for l in li:
b = l[::-1][:N]
rikai = [0]*M
pri = [0]*N
for i in range(len(b)):
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 412,503 | 412,504 | u998733244 | python |
p02683 | import itertools as t
n,m,z=map(int,input().split())
l=[]
answer=set([])
for i in range(n):
l.append(list(map(int, input().split())))
for k in range(n+1):
a=list(t.combinations(range(n),k))
for x in a:
w=0
A=[0 for _ in range(m)]
s=0
for y in x:
w+=l[y][0]
... | import itertools as t
n,m,z=map(int,input().split())
l=[]
answer=set([])
for i in range(n):
l.append(list(map(int, input().split())))
for k in range(n+1):
a=list(t.combinations(range(n),k))
for x in a:
w=0
A=[0 for _ in range(m)]
s=0
for y in x:
w+=l[y][0]
... | [
"expression.operation.binary.add"
] | 412,507 | 412,508 | u562662744 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.