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 |
|---|---|---|---|---|---|---|---|
p02682 | a,b,c,k = map(int,input().split())
if a>=k:
print(a)
else:
if a+b>=k:
print(a)
else:
print(2*a+b-k) | a,b,c,k = map(int,input().split())
if a>=k:
print(k)
else:
if a+b>=k:
print(a)
else:
print(2*a+b-k)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,227 | 410,228 | u665369939 | python |
p02682 | A,B,C,K=map(int,input().split())
if A>=K:
print(K)
if A<K<=A+B:
print(A)
else:
print(A-(K-A-B)) | A,B,C,K=map(int,input().split())
if A>=K:
print(K)
if A<K<=A+B:
print(A)
if K>A+B:
print(A-(K-A-B)) | [
"control_flow.branch.if.condition.change"
] | 410,237 | 410,238 | u627600101 | python |
p02682 | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
a,b,c,k = mi()
ima = k
if a >= k:
print(a)
exit()
ima = k - a
if b >= ima:
print(a)
exit()
ima = ima - b
nokori = min(c,ima)
print(a-nokori)
| ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
a,b,c,k = mi()
ima = k
if a >= k:
print(k)
exit()
ima = k - a
if b >= ima:
print(a)
exit()
ima = ima - b
nokori = min(c,ima)
print(a-nokori)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,239 | 410,240 | u872887731 | python |
p02682 | A,B,C,K=map(int,input().split())
diff=K-(A+B)
if diff>0:
print(A-diff)
else:
print(A) | A,B,C,K=map(int,input().split())
diff=K-(A+B)
if diff>0:
print(A-diff)
else:
print(min(K,A)) | [
"call.add",
"call.arguments.change"
] | 410,269 | 410,270 | u547608423 | python |
p02682 | a, b, c, k = list(map(int, input().split()))
if k <= a + b:
print(a)
else:
print(a - (k - a - b))
| a, b, c, k = list(map(int, input().split()))
if k <= a + b:
print(min(k, a))
else:
print(a - (k - a - b))
| [
"call.add",
"call.arguments.change"
] | 410,277 | 410,278 | u653807637 | python |
p02682 | a, b, c, k = list(map(int, input().split()))
print(a - max((k - (a + b), 0)))
| a, b, c, k = list(map(int, input().split()))
print(min(a, k) - max((k - (a + b), 0)))
| [
"call.add",
"call.arguments.add"
] | 410,279 | 410,280 | u922233913 | python |
p02682 | A,B,C,K= list(map(int, input().split()))
if A >= K:
print(A)
elif A+B >= K:
print(A)
else:
print(A-(K-(A+B))) | A,B,C,K= list(map(int, input().split()))
if A >= K:
print(K)
elif A+B >= K:
print(A)
else:
print(A-(K-(A+B))) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,311 | 410,312 | u231189826 | python |
p02682 | a,b,c,k = map(int, input().split())
t = min(k,a)
k -= min(k,a)
if k:
k -= b
if k > 0:
t -= min(k)
print(t) | a,b,c,k = map(int, input().split())
t = min(k,a)
k -= min(k,a)
if k:
k -= b
if k > 0:
t -= k
print(t)
| [
"call.remove",
"call.arguments.change"
] | 410,322 | 410,323 | u298297089 | python |
p02682 | A, B, C, K = map(int, input().split())
if K <= A:
print(A)
elif K <= A+B:
print(A)
elif K > A+B:
print(A-(K-(A+B))) | A, B, C, K = map(int, input().split())
if K <= A:
print(K)
elif K <= A+B:
print(A)
elif K > A+B:
print(A-(K-(A+B))) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,328 | 410,329 | u581603131 | python |
p02682 | def main():
a, b, c, k = map(int, input().split())
if k <= a:
print(a)
elif k <= a+b:
print(a)
else:
print(a - (k-a-b))
if __name__ == "__main__":
main() | def main():
a, b, c, k = map(int, input().split())
if k <= a:
print(k)
elif k <= a+b:
print(a)
else:
print(a - (k-a-b))
if __name__ == "__main__":
main() | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,332 | 410,333 | u670961163 | python |
p02682 | def main():
import sys
input = sys.stdin.readline
A, B, C, K = map(int, input().split())
if K <= A+B:
print(A)
else:
print(A-(K-A-B))
if __name__ == '__main__':
main() | def main():
import sys
input = sys.stdin.readline
A, B, C, K = map(int, input().split())
if K <= A+B:
print(min(A,K))
else:
print(A-(K-A-B))
if __name__ == '__main__':
main() | [
"call.add",
"call.arguments.add"
] | 410,342 | 410,343 | u219417113 | python |
p02682 | def main():
a,b,c,k = map(int,input().split())
if a>=k:
print(a)
else:
k = k-a
if b>=k:
print(a)
else:
k = k-b
print(a-k)
if __name__ == "__main__":
main()
| def main():
a,b,c,k = map(int,input().split())
if a>=k:
print(k)
else:
k = k-a
if b>=k:
print(a)
else:
k = k-b
print(a-k)
if __name__ == "__main__":
main()
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,360 | 410,361 | u546338822 | python |
p02682 | A,B,C,K = map(int,input().split(' '))
cnt=0
if K < A :
cnt=A*K
elif K < A+B:
cnt=A
else:
cnt=A-(K-(A+B))
print(cnt) | A,B,C,K = map(int,input().split(' '))
cnt=0
if K < A :
cnt=K
elif K < A+B:
cnt=A
else:
cnt=A-(K-(A+B))
print(cnt) | [
"expression.operation.binary.remove"
] | 410,362 | 410,363 | u590211278 | python |
p02682 | a, b, c, k = map(int,input().split())
score = 0
if a >= k:
score = k
if a + b >= k:
score = a
if a + b < k:
score = a - (k - (a + b))
print(score) | a, b, c, k = map(int,input().split())
score = 0
if a >= k:
score = k
elif a + b >= k:
score = a
elif a + b < k:
score = a - (k - (a + b))
print(score) | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 410,368 | 410,369 | u867848444 | python |
p02682 | A, B, C, K = map(int, input().split())
if(K <= A):
print(A)
elif(K <= A+B):
print(A)
else:
print(A-(K-A-B)) | A, B, C, K = map(int, input().split())
if(K <= A):
print(K)
elif(K <= A+B):
print(A)
else:
print(A-(K-A-B)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,374 | 410,375 | u198257719 | python |
p02682 | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return lis... | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return lis... | [
"assignment.value.change",
"identifier.change"
] | 410,386 | 410,387 | u225084815 | python |
p02682 | #B
a,b,c,k = map(int,input().split())
cnt = 0
if a <= k:
cnt += a
k -= a
if b <= k:
k -= b
if k > 0:
cnt -= k
else:
cnt += a
print(cnt) | #B
a,b,c,k = map(int,input().split())
cnt = 0
if a <= k:
cnt += a
k -= a
if b <= k:
k -= b
if k > 0:
cnt -= k
else:
cnt += k
print(cnt) | [
"identifier.change"
] | 410,392 | 410,393 | u771007149 | python |
p02682 | a,b,c,k=(int(i) for i in input().split())
if k<=a+b:
print(a)
else:
print(a-(k-a-b)) | a,b,c,k=(int(i) for i in input().split())
if k<=a+b:
print(min(a,k))
else:
print(a-(k-a-b)) | [
"call.add",
"call.arguments.add"
] | 410,408 | 410,409 | u907223098 | python |
p02682 | a, b, c, k = map(int, input().split())
if a >= k:
print(a)
else:
if a + b >= k:
print(a)
else:
t = k - (a + b)
print(a - t) | a, b, c, k = map(int, input().split())
if a >= k:
print(k)
else:
if a + b >= k:
print(a)
else:
t = k - (a + b)
print(a - t) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,410 | 410,411 | u016302627 | python |
p02682 | a, b, c, k = map(int,input().split())
if k <= a:
print(k)
elif k <= a + b:
print(a)
else:
print(a-(c-(k-a-b))) | a, b, c, k = map(int,input().split())
if k <= a:
print(k)
elif k <= a + b:
print(a)
else:
print(a-(k-a-b)) | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 410,418 | 410,419 | u371763408 | python |
p02682 | a,b,c,d=map(int,input().split())
if a>=d:
print(a)
elif a+b>=d:
print(a)
else:
print(a-(d-a-b)) | a,b,c,d=map(int,input().split())
if a>=d:
print(d)
elif a+b>=d:
print(a)
else:
print(a-(d-a-b)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,431 | 410,432 | u156383602 | python |
p02682 | a,b,c,k= map(int, input().split())
if a>=k:
print(a)
elif (a+b)>=k>a:
print(a)
else:
print(a-(k-a-b))
| a,b,c,k= map(int, input().split())
if a>=k:
print(k)
elif (a+b)>=k>a:
print(a)
else:
print(a-(k-a-b)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,439 | 410,440 | u137912513 | python |
p02682 | A, B, C, K = map(int, input().split())
if A >= K:
print(A)
elif B >= K-A:
print(A)
else:
print(A-(K-A-B)) | A, B, C, K = map(int, input().split())
if A >= K:
print(K)
elif B >= K-A:
print(A)
else:
print(A-(K-A-B)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,466 | 410,467 | u595375942 | python |
p02682 | def ma():
return map(int,input().split())
y="Yes"
t="No"
a,b,c,k=ma()
if a+b<=k:
print(min(a,k))
else:
print(a-(k-a-b)) | def ma():
return map(int,input().split())
y="Yes"
t="No"
a,b,c,k=ma()
if a+b>=k:
print(min(a,k))
else:
print(a-(k-a-b)) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 410,468 | 410,469 | u106778233 | python |
p02682 | A,B,C,K=map(int,input().split())
print(A if A+B>=K else A-(K-A-B)) | A,B,C,K=map(int,input().split())
print(min(A,K) if A+B>=K else A-(K-A-B)) | [
"call.add",
"call.arguments.add"
] | 410,476 | 410,477 | u509368316 | python |
p02682 | 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... | [
"call.add",
"call.arguments.add"
] | 410,484 | 410,485 | u834120237 | python |
p02682 | import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
def main():
A, B, C, K = map(int, input().split())
answer = 0
if K >= A:
answer += A
K -= A
if K >= B:
K -= B
if K > 0:
answer -= K
else:
... | import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
def main():
A, B, C, K = map(int, input().split())
answer = 0
if K >= A:
answer += A
K -= A
if K >= B:
K -= B
if K > 0:
answer -= K
else:
... | [
"identifier.change"
] | 410,490 | 410,491 | u977193988 | python |
p02682 | from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def main():
A, B, C, K = map(int, input().split())
if K <= A:
print(A)
elif K <= A + B:
print(A)
else:
print(A - (K - (A + B)))
return
if... | from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def main():
A, B, C, K = map(int, input().split())
if K <= A:
print(K)
elif K <= A + B:
print(A)
else:
print(A - (K - (A + B)))
return
if... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,500 | 410,501 | u968166680 | python |
p02682 | A,B,C,K=map(int,input().split())
if A>=K:
print(A)
elif A+B>=K:
print(A)
else:
CC=K-A-B
print(A-CC) | A,B,C,K=map(int,input().split())
if A>=K:
print(K)
elif A+B>=K:
print(A)
else:
CC=K-A-B
print(A-CC) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,516 | 410,517 | u203843959 | python |
p02682 | A,B,C,K = map(int,input().split())
S = 0
S+=1*min(A,K)
K-=A
K-=B
S-=1*min(C,K)
print(S) | A,B,C,K = map(int,input().split())
S = 0
S+=1*min(A,K)
K-=A
K-=B
S-=1*min(C,max(K,0))
print(S) | [
"call.add",
"call.arguments.add"
] | 410,522 | 410,523 | u350997995 | python |
p02682 | a, b, c, k = map(int, input().split())
ans = 0
if k >= a:
k -= a
ans += a
if k >= b:
k -= b
if k >= c:
k -= c
ans -= c
print(ans)
else:
print(ans - k)
else:
print(ans)
else:
print(a) | a, b, c, k = map(int, input().split())
ans = 0
if k >= a:
k -= a
ans += a
if k >= b:
k -= b
if k >= c:
k -= c
ans -= c
print(ans)
else:
print(ans - k)
else:
print(ans)
else:
print(k) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,526 | 410,527 | u224762261 | python |
p02682 | a, b, c, k = map(int, input().split())
ans = 0
if k >= a:
k -= a
ans += a
if k >= b:
k -= b
if k >= c:
k -= c
ans -= c
else:
print(ans - k)
else:
print(ans)
else:
print(a) | a, b, c, k = map(int, input().split())
ans = 0
if k >= a:
k -= a
ans += a
if k >= b:
k -= b
if k >= c:
k -= c
ans -= c
print(ans)
else:
print(ans - k)
else:
print(ans)
else:
print(k) | [
"call.add",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,528 | 410,527 | u224762261 | python |
p02682 | a, b, c, k = map(int, input().split())
ans = a - max(0, k - a - b)
print(ans) | a, b, c, k = map(int, input().split())
ans = min(a, k) - max(0, k - a - b)
print(ans) | [
"call.add",
"call.arguments.add"
] | 410,529 | 410,530 | u139112865 | python |
p02682 | a, b, c, k = map(int, input().split())
b, c = a + b, a + b + c
if k <= a:
print(a)
elif a <= k <= b:
print(a)
else:
print(a - (k - b))
| a, b, c, k = map(int, input().split())
b, c = a + b, a + b + c
if k <= a:
print(k)
elif a <= k <= b:
print(a)
else:
print(a - (k - b))
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,531 | 410,532 | u143509139 | python |
p02682 | a,b,c,k = map(int,input().split())
if a >= k:
print(a)
elif a + b >= k:
print(a)
else:
print(a - (k - a - b)) | a,b,c,k = map(int,input().split())
if a >= k:
print(k)
elif a + b >= k:
print(a)
else:
print(a - (k - a - b)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,533 | 410,534 | u370429695 | python |
p02682 | def printend(t):
print(t)
exit()
A,B,C,K = [int(hoge) for hoge in input().split()]
if A>K:
printend(A)
elif A+B>K:
printend(A)
else:
printend(A - (K-A-B)) | def printend(t):
print(t)
exit()
A,B,C,K = [int(hoge) for hoge in input().split()]
if A>K:
printend(K)
elif A+B>K:
printend(A)
else:
printend(A - (K-A-B)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 410,543 | 410,544 | u268516119 | python |
p02682 | a,b,c,d=map(int,input().split())
if a+1+b>d:
print(a)
else:
print(a-(d-a-b))
| a,b,c,d=map(int,input().split())
if a+1+b>d:
print(min(a,d))
else:
print(a-(d-a-b))
| [
"call.add",
"call.arguments.add"
] | 410,549 | 410,550 | u769870836 | python |
p02682 | a, b, c, k = [int(i) for i in input().split(' ')]
if k <= a:
print(1 * k)
elif k <= a + b:
print(1 * a)
else:
print(1 * a + k * -1) | a, b, c, k = [int(i) for i in input().split(' ')]
if k <= a:
print(1 * k)
elif k <= a + b:
print(1 * a)
else:
print(1 * a + (k - a - b) * -1) | [
"call.arguments.change"
] | 410,553 | 410,554 | u147665268 | python |
p02683 | n, m, x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
# 購買する全パターンを回す
most_row_price = 10**10
for i in range(2**n):
comb = str(bin(i)[2:]).zfill(n)
# 購買パターン毎の購入金額と理解度を算出する
money_per_pattern = [0] * n # 購買パターン毎の金額の初期化
total_money = 0 # 合計購入金額の初期化
for j in r... | n, m, x = map(int, input().split())
ca = [list(map(int, input().split())) for _ in range(n)]
# 購買する全パターンを回す
most_row_price = 10**10
for i in range(2**n):
comb = str(bin(i)[2:]).zfill(n)
# 購買パターン毎の購入金額と理解度を算出する
understanding = [0] * m # 理解度の初期化
total_money = 0 # 合計購入金額の初期化
for j in range(n):
... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 410,579 | 410,580 | u108072608 | python |
p02683 | N,M,X=map(int,input().split())
C=[list(map(int,input().split())) for _ in range(N)]
ans=inf=float('inf')
def dfs(idx,tt,l):
global ans
for i in range(idx,N):
ntt=tt+C[i][0]
nl=[l[j]+C[i][j+1] for j in range(M)]
ok=False
for x in nl:
if x<X:
ok=True
... | N,M,X=map(int,input().split())
C=[list(map(int,input().split())) for _ in range(N)]
ans=inf=float('inf')
def dfs(idx,tt,l):
global ans
for i in range(idx,N):
ntt=tt+C[i][0]
nl=[l[j]+C[i][j+1] for j in range(M)]
ok=True
for x in nl:
if x<X:
ok=False
... | [
"misc.opposites",
"assignment.value.change"
] | 410,581 | 410,582 | u218834617 | python |
p02683 | n, m, x = map(int, input().split())
numlist = []
minimum = -1
for i in range(n):
numlist.append(list(map(int, input().split())))
for i in range(1<<n):
result = [0] * (m+1)
for j in range(n):
if(i>>j & 1 == 1):
for k in range(m+1):
result[k] += numlist[j][k]
for k in r... | n, m, x = map(int, input().split())
numlist = []
minimum = -1
for i in range(n):
numlist.append(list(map(int, input().split())))
for i in range(1<<n):
result = [0] * (m+1)
for j in range(n):
if(i>>j & 1 == 1):
for k in range(m+1):
result[k] += numlist[j][k]
for k in r... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 410,587 | 410,588 | u177370876 | python |
p02683 | N,M,X=map(int,input().split())
A=[0]*N
for j in range(N):
A[j]=[int(x) for x in input().split()]
money=10**7
for i in range(2**N):
read=[0]*N #その本を読むか否か
for h in range(N):
if i%2==1:
read[h]=1
i//=2
understanding=[0]*M
kouho=0
for k in range(N):
if read[k]==1... | N,M,X=map(int,input().split())
A=[0]*N
for j in range(N):
A[j]=[int(x) for x in input().split()]
money=10**7
for i in range(2**N):
read=[0]*N #その本を読むか否か
for h in range(N):
if i%2==1:
read[h]=1
i//=2
understanding=[0]*M
kouho=0
for k in range(N):
if read[k]==1... | [
"expression.operation.binary.remove"
] | 410,597 | 410,598 | u065079240 | python |
p02683 | import itertools
def main():
n, m, x = map(int, input().split())
lst = []
for _ in range(n):
lst.append(list(map(int, input().split())))
flag1 = True
max_lst = []
for i in range(m):
understanding = 0
for j in range(n):
understanding += lst[j][i+1]
m... | import itertools
def main():
n, m, x = map(int, input().split())
lst = []
for _ in range(n):
lst.append(list(map(int, input().split())))
flag1 = True
max_lst = []
for i in range(m):
understanding = 0
for j in range(n):
understanding += lst[j][i+1]
m... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 410,599 | 410,600 | u672316981 | python |
p02683 | n, m, x = map(int, input().split())
bk = [list(map(int, input().split())) for _ in range(n)]
pr = 10 ** 7
for i in range(2 ** n):
ef = [0] * (m + 1)
for j in range(n):
if i >> j & 1:
ef = [p + q for (p, q) in zip(ef, bk[j])]
for k in range(1, m + 1):
if ef[k] < x:
bre... | n, m, x = map(int, input().split())
bk = [list(map(int, input().split())) for _ in range(n)]
pr = 10 ** 7
for i in range(2 ** n):
ef = [0] * (m + 1)
for j in range(n):
if i >> j & 1:
ef = [p + q for (p, q) in zip(ef, bk[j])]
for k in range(1, m + 1):
if ef[k] < x:
bre... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 410,601 | 410,602 | u537976628 | python |
p02683 | from itertools import product
import numpy as np
n, _, x = map(int, input().split())
arr1 = np.array([list(map(int, input().split())) for _ in range(n)])
ans = 120000
if np.all(arr1.sum(0)[1:] >= x):
for i in product((0, 1), repeat=n):
arr2 = ((i * arr1.T).T).sum(0)
if np.all(arr2[1:] >= x):
... | from itertools import product
import numpy as np
n, _, x = map(int, input().split())
arr1 = np.array([list(map(int, input().split())) for _ in range(n)])
ans = 1200000
if np.all(arr1.sum(0)[1:] >= x):
for i in product((0, 1), repeat=n):
arr2 = (i * arr1.T).sum(1)
if np.all(arr2[1:] >= x):
... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 410,608 | 410,609 | u040298438 | python |
p02683 | from itertools import combinations
N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for i in range(N)]
flug = True
for j in range(1, M + 1):
sum_test = 0
for i in range(N):
sum_test += A[i][j]
if sum_test < X:
flug = False
break
N_idx = [n for n in range(N)]
r... | from itertools import combinations
N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for i in range(N)]
flug = True
for j in range(1, M + 1):
sum_test = 0
for i in range(N):
sum_test += A[i][j]
if sum_test < X:
flug = False
break
N_idx = [n for n in range(N)]
r... | [
"control_flow.loop.for.condition.change"
] | 410,610 | 410,611 | u882323840 | python |
p02683 | from itertools import combinations
N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for i in range(N)]
flug = True
for j in range(1, M + 1):
sum_test = 0
for i in range(N):
sum_test += A[i][j]
if sum_test < X:
flug = False
break
N_idx = [n for n in range(N)]
r... | from itertools import combinations
N, M, X = map(int, input().split())
A = [list(map(int, input().split())) for i in range(N)]
flug = True
for j in range(1, M + 1):
sum_test = 0
for i in range(N):
sum_test += A[i][j]
if sum_test < X:
flug = False
break
N_idx = [n for n in range(N)]
r... | [
"control_flow.loop.for.condition.change"
] | 410,612 | 410,611 | u882323840 | python |
p02683 | n,m,x=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(n)]
ans=[]
for i in range(2**n):
bag=[0 for _ in range(m)]
total=0
res=True
for j in range(n):
if ((i>>j)&1):
total+=a[j][0]
for k in range(m):
bag[k]+=a[j][k-1]
for l in r... | n,m,x=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(n)]
ans=[]
for i in range(2**n):
bag=[0 for _ in range(m)]
total=0
res=True
for j in range(n):
if ((i>>j)&1):
total+=a[j][0]
for k in range(m):
bag[k]+=a[j][k+1]
for l in r... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 410,613 | 410,614 | u876742094 | python |
p02683 | n,m,x = map(int,input().split())
a = [0]*n
for i in range(n):
a[i] = list(map(int,input().split()))
ans = float("Inf")
for i in range(2**n):
c = 0
L = [0]*m
for j in range(n):
if (i>>j)&1:
c += a[j][0]
for k in range(m):
L[k] += a[j][k]
sw = 1
... | n,m,x = map(int,input().split())
a = [0]*n
for i in range(n):
a[i] = list(map(int,input().split()))
ans = float("Inf")
for i in range(2**n):
c = 0
L = [0]*m
for j in range(n):
if (i>>j)&1:
c += a[j][0]
for k in range(m):
L[k] += a[j][k+1]
sw = 1
... | [
"expression.operation.binary.add"
] | 410,619 | 410,620 | u614181788 | python |
p02683 | n,m,x = map(int,input().split())
ca = [0]*n
for i in range(n):
ca[i] = list(map(int,input().split()))
ans = 10**10
for i in range(n**2):
s = [0]*m
c = 0
for j in range(n):
if (i>>j)&1:
c += ca[j][0]
for k in range(1,m+1):
s[k-1] += ca[j][k]
s = sorted(... | n,m,x = map(int,input().split())
ca = [0]*n
for i in range(n):
ca[i] = list(map(int,input().split()))
ans = 10**10
for i in range(2**n):
s = [0]*m
c = 0
for j in range(n):
if (i>>j)&1:
c += ca[j][0]
for k in range(1,m+1):
s[k-1] += ca[j][k]
s = sorted(... | [
"expression.operation.binary.remove"
] | 410,621 | 410,622 | u614181788 | python |
p02683 | def main():
n,m,x = map(int,input().split())
c = []
a = []
for _ in range(n):
ca = [int(v) for v in input().split()]
c.append(ca[0])
a.append(ca[1:])
INTHIGH = 1<<15
pricemin = INTHIGH
for i in range(1<<n):
sm = [0]*m
sc = 0
for j in range... | def main():
n,m,x = map(int,input().split())
c = []
a = []
for _ in range(n):
ca = [int(v) for v in input().split()]
c.append(ca[0])
a.append(ca[1:])
INTHIGH = 1<<32
pricemin = INTHIGH
for i in range(1<<n):
sm = [0]*m
sc = 0
for j in range... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 410,623 | 410,624 | u528181687 | python |
p02683 | #!/usr/bin/env python3
def main():
import sys
input = sys.stdin.readline
N, M, X = map(int, input().split())
A = []
for i in range(N):
a = [int(x) for x in input().split()]
A.append(a)
ans = 10 ** 7
for bit in range(1 << N):
res = [0 for _ in [0] * M]
for i... | #!/usr/bin/env python3
def main():
import sys
input = sys.stdin.readline
N, M, X = map(int, input().split())
A = []
for i in range(N):
a = [int(x) for x in input().split()]
A.append(a)
ans = 10 ** 7
for bit in range(1 << N):
res = [0 for _ in [0] * (M + 1)]
... | [] | 410,625 | 410,626 | u216015528 | python |
p02683 | N,M,X = map(int,input().split())
C = []
A = []
for i in range(N):
L = list(map(int,input().split()))
C.append(L[0])
A.append(L[1:M+1])
import itertools
L = []
Num = [i for i in range(N)]
for i in range(1,N+1):
for j in itertools.combinations(Num,i):
L.append(list(j))
c = 20000000
for i in range(... | N,M,X = map(int,input().split())
C = []
A = []
for i in range(N):
L = list(map(int,input().split()))
C.append(L[0])
A.append(L[1:M+1])
import itertools
L = []
Num = [i for i in range(N)]
for i in range(1,N+1):
for j in itertools.combinations(Num,i):
L.append(list(j))
c = 20000000
for i in range(... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 410,627 | 410,628 | u349724238 | python |
p02683 | N,M,X = map(int,input().split())
C = []
A = []
for i in range(N):
L = list(map(int,input().split()))
C.append(L[0])
A.append(L[1:M+1])
import itertools
L = []
Num = [i for i in range(N)]
for i in range(1,N+1):
for j in itertools.combinations(Num,i):
L.append(list(j))
c = 200000
for i in range(le... | N,M,X = map(int,input().split())
C = []
A = []
for i in range(N):
L = list(map(int,input().split()))
C.append(L[0])
A.append(L[1:M+1])
import itertools
L = []
Num = [i for i in range(N)]
for i in range(1,N+1):
for j in itertools.combinations(Num,i):
L.append(list(j))
c = 20000000
for i in range(... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 410,629 | 410,628 | u349724238 | python |
p02683 | n,m,x = map(int, input().split())
N=[]
NI=[]
for i in range(n) :
N = list(map(str, input().split()))
NI.append(N)
ans=-1
for i in range(1<<n) :
A=[0]*(m+1)
for j in range(n) :
# print(NI[j])
if (1<<j)&i :
A=[x+int(y) for(x,y)in zip(A,NI[j])]
print(A)
a = A[0]
d... | n,m,x = map(int, input().split())
N=[]
NI=[]
for i in range(n) :
N = list(map(str, input().split()))
NI.append(N)
ans=-1
for i in range(1<<n) :
A=[0]*(m+1)
for j in range(n) :
# print(NI[j])
if (1<<j)&i :
A=[x+int(y) for(x,y)in zip(A,NI[j])]
# print(A)
a = A[0]
... | [
"call.remove"
] | 410,632 | 410,633 | u707030679 | python |
p02683 | N,M,X=map(int,input().split())
CA=[list(map(int,input().split())) for _ in range(N)]
print(CA)
max_=10**16
ans=max_
for bit in range(2**N):
check=[0]*M
ans_=0
for i in range(N):
if bit>>i&1:
ans_+=CA[i][0]
for j in range(M):
check[j]+=CA[i][j+1]
if all([k>=X for k in check]):
ans=min... | N,M,X=map(int,input().split())
CA=[list(map(int,input().split())) for _ in range(N)]
max_=10**16
ans=max_
for bit in range(2**N):
check=[0]*M
ans_=0
for i in range(N):
if bit>>i&1:
ans_+=CA[i][0]
for j in range(M):
check[j]+=CA[i][j+1]
if all([k>=X for k in check]):
ans=min(ans,ans_)... | [
"call.remove"
] | 410,636 | 410,637 | u500376440 | python |
p02683 | n,m,x = list(map(int,input().split()))
cList = []
for i in range(n):
cList.append(list(map(int,input().split())))
#buyList = [0 for i in range(n)]
priceList = []
for i in range(1,2**n):
price = 0
check = 1
skilList = [0 for i in range(m)]
bit = i
for j in range(1,n+1):
if bit % 2 ==... | n,m,x = list(map(int,input().split()))
cList = []
for i in range(n):
cList.append(list(map(int,input().split())))
priceList = []
for i in range(1,2**n):
price = 0
check = 1
skilList = [0 for i in range(m)]
bit = i
for j in range(1,n+1):
if bit % 2 == 1:
price += cList[j-1... | [
"assignment.change"
] | 410,643 | 410,644 | u002663801 | python |
p02683 | n, m, x = map(int, input().split())
A = [list(map(int, input().split())) for j in range(n)]
ans = 10 ** 7
for i in range(1 << n):
s = [0] * (m + 1)
for j in range(n):
if i >> j & 1:
for k in range(m+1):
s[k] += A[j][k]
if min(s[1:]) >= x:
ans = min(ans, s[0])
pri... | n, m, x = map(int, input().split())
A = [list(map(int, input().split())) for j in range(n)]
ans = 10 ** 7
for i in range(1 << n):
s = [0] * (m + 1)
for j in range(n):
if i >> j & 1:
for k in range(m+1):
s[k] += A[j][k]
if min(s[1:]) >= x:
ans = min(ans, s[0])
pri... | [
"literal.number.integer.change",
"expression.operation.binary.change"
] | 410,647 | 410,648 | u658915215 | python |
p02683 | import math
n, m, x = map(int, input().split())
books = []
for i in range(n):
books.append(list(map(int, input().split())))
n_bin = '1'*n
_n = (int(n_bin, 2))
ans = 10**9
for i in range(_n):
target = bin(i).replace('0b', '').zfill(n)
tmp_skill = [0 for i in range(len(books[0])-1)]
tmp_price = 0
for... | import math
n, m, x = map(int, input().split())
books = []
for i in range(n):
books.append(list(map(int, input().split())))
n_bin = '1'*n
_n = (int(n_bin, 2))+1
ans = 10**9
for i in range(_n):
target = bin(i).replace('0b', '').zfill(n)
tmp_skill = [0 for i in range(len(books[0])-1)]
tmp_price = 0
... | [
"assignment.change"
] | 410,655 | 410,656 | u763249708 | python |
p02683 | from itertools import product
N, M, X = map(int, input().split())
inp = [list(map(int, input().split())) for _ in range(N)]
C, A = [], []
for i in range(N):
C.append(inp[i][0])
A.append(inp[i][1:])
#判定
z_A = list(zip(*A))
for i in range(N):
if sum(z_A[i]) < X:
print(-1)
exit()
ans = sum(... | from itertools import product
N, M, X = map(int, input().split())
inp = [list(map(int, input().split())) for _ in range(N)]
C, A = [], []
for i in range(N):
C.append(inp[i][0])
A.append(inp[i][1:])
#判定
z_A = list(zip(*A))
for i in range(M):
if sum(z_A[i]) < X:
print(-1)
exit()
ans = sum(... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 410,659 | 410,660 | u452337391 | python |
p02683 | n, m, x = map(int, input().split())
c = [0] * n
a = [0] * n
for i in range(n):
xs = list(map(int, input().split()))
c[i] = xs[0]
a[i] = xs[1:]
ans = 10 ** 9
for i in range(2 ** n):
csum = 0
asum = [0] * n
for j in range(n):
if (i >> j) & 1:
csum += c[j]
for k in r... | n, m, x = map(int, input().split())
c = [0] * n
a = [0] * n
for i in range(n):
xs = list(map(int, input().split()))
c[i] = xs[0]
a[i] = xs[1:]
ans = 10 ** 9
for i in range(2 ** n):
csum = 0
asum = [0] * m
for j in range(n):
if (i >> j) & 1:
csum += c[j]
for k in r... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 410,661 | 410,662 | u461993794 | python |
p02683 | n, m, x = map(int, input().split())
a = [[0] * m for j in range(n)]
c = [0] * n
ans = 10**10
for i in range(n):
arr = list(map(int, input().split()))
c[i] = arr[0]
a[i] = arr[1:]
# bit全探索
import itertools
for bit in itertools.product([0,1], repeat=10):
arr = [0] * m
cost = 0
for i in range(n... | n, m, x = map(int, input().split())
a = [[0] * m for j in range(n)]
c = [0] * n
ans = 10**10
for i in range(n):
arr = list(map(int, input().split()))
c[i] = arr[0]
a[i] = arr[1:]
# bit全探索
import itertools
for bit in itertools.product([0,1], repeat=n):
arr = [0] * m
cost = 0
for i in range(n)... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 410,663 | 410,664 | u106342872 | python |
p02683 | import itertools
import numpy as np
n,m,x = map(int, input().split())
A = np.array([[int(x) for x in input().split()] for i in range(n)])
lis, min_ = range(n), 13000000
full = []
for r in range(n):
comb = list(itertools.combinations(lis,r))
full.extend(comb)
for i in full:
sum_ = np.zeros(m+1)
for k in i:... | import itertools
import numpy as np
n,m,x = map(int, input().split())
A = np.array([[int(x) for x in input().split()] for i in range(n)])
lis, min_ = range(n), 1200001
full = []
#組み合わせの列挙
for r in range(1,n+1):
comb = list(itertools.combinations(lis,r))
full.extend(comb)
#print(full)
for i in full:
#配列の準備
su... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.add",
"control_flow.branch.if.condition.change"
] | 410,681 | 410,680 | u891422384 | python |
p02683 | M,N,X=map(int,input().split())
C=[list(map(int,input().split())) for i in range(N)]
INF=float("inf")
ans=INF
for i in range(1,2**N):
skills=[0]*M
total_cost=0
for j in range(N):
if ((i>>j)&1):
total_cost+=C[j][0]
for k in range(M):
skills[k]+=C[j][k+1]
if... | N,M,X=map(int,input().split())
C=[list(map(int,input().split())) for i in range(N)]
INF=float("inf")
ans=INF
for i in range(1,2**N):
skills=[0]*M
total_cost=0
for j in range(N):
if ((i>>j)&1):
total_cost+=C[j][0]
for k in range(M):
skills[k]+=C[j][k+1]
if... | [] | 410,682 | 410,683 | u580404776 | python |
p02683 | n, m, x = map(int, input().split())
#n,m,x,i,j,l,money,k,o
books = []
for i in range(n):
books.append(list(map(int, input().split())))
books = sorted(books, reverse=False)
#print(books)#
ans = 10 ** 10000
import itertools
for i in range(n+1):
for j in itertools.combinations(books, i):#j:組み合わせ
# print(j)... | n, m, x = map(int, input().split())
#n,m,x,i,j,l,money,k,o
books = []
for i in range(n):
books.append(list(map(int, input().split())))
books = sorted(books, reverse=False)
#print(books)#
ans = 10 ** 10000
import itertools
for i in range(n+1):
for j in itertools.combinations(books, i):#j:組み合わせ
# print(j)... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 410,684 | 410,685 | u620238824 | python |
p02683 | N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
ans = float('inf')
for i in range(pow(2, N)-1):
cost = 0
x_array = [0]*M
for j in range(N):
if (i>>j & 1) == 1:
cost += CA[j][0]
for m in range(M):
x_array[m] += CA[j... | N, M, X = map(int, input().split())
CA = [list(map(int, input().split())) for _ in range(N)]
ans = float('inf')
for i in range(pow(2, N)):
cost = 0
x_array = [0]*M
for j in range(N):
if (i>>j & 1) == 1:
cost += CA[j][0]
for m in range(M):
x_array[m] += CA[j][... | [
"expression.operation.binary.remove"
] | 410,688 | 410,689 | u161164709 | python |
p02683 | import itertools
n, m, x = map(int, input().split())
books = []
for _ in range(n):
c = list(map(int, input().split()))
books.append(c)
patern = []
for i in range(1, n+1):
patern += itertools.combinations(range(n), i)
cost = 10**6
for j in patern:
total = 0
flag = 1
for k in range(1,m+1):... | import itertools
n, m, x = map(int, input().split())
books = []
for _ in range(n):
c = list(map(int, input().split()))
books.append(c)
patern = []
for i in range(1, n+1):
patern += itertools.combinations(range(n), i)
cost = 10**7
for j in patern:
total = 0
flag = 1
for k in range(1,m+1):... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 410,690 | 410,691 | u135389999 | python |
p02683 | #!/usr/bin/env python3
import bisect
import heapq
import itertools
import math
import numpy as np
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 i... | #!/usr/bin/env python3
import bisect
import heapq
import itertools
import math
import numpy as np
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 i... | [
"expression.operation.binary.add"
] | 410,693 | 410,694 | u319589470 | python |
p02683 | #import time
def main():
N, M, X = map(int, input().split())
Cs = [list(map(int, input().split())) for _ in range(N)]
mi = 100000000000000000000 #->float("inf")
for i in range(1<<N):
lis = [0] * (M+1)
for j in range(N):
if i & (1<<j) == 0:
continue
... | #import time
def main():
N, M, X = map(int, input().split())
Cs = [list(map(int, input().split())) for _ in range(N)]
mi = 100000000000000000000 #->float("inf")
for i in range(1<<N):
lis = [0] * (M+1)
for j in range(N):
if i & (1<<j) == 0:
continue
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 410,699 | 410,700 | u756607246 | python |
p02683 | n, m, x = map(int, input().split())
c = []
ans = pow(10, 9)
for i in range(n):
c.append(list(map(int, input().split())))
for mask in range((1 << n) - 1):
sum = 0
li = [0] * m
for i in range(n):
if (mask >> i) & 1 == 0:
sum += c[i][0]
for j in range(m):
l... | n, m, x = map(int, input().split())
c = []
ans = pow(10, 9)
for i in range(n):
c.append(list(map(int, input().split())))
for mask in range((1 << n) - 1):
sum = 0
li = [0] * m
for i in range(n):
if (mask >> i) & 1 == 0:
sum += c[i][0]
for j in range(m):
l... | [
"control_flow.break.add"
] | 410,705 | 410,706 | u196291054 | python |
p02683 | n, m, x = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
min = float('inf')
for i in range(1<<n): # 1<<n == 2**n
study = [0 for _ in range(m)]
cost = 0
for j in range(n):
if i&(1<<j):
cost += a[j][0]
study = [study[k]+a[j][k] for k in ran... | n, m, x = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
min = float('inf')
for i in range(1<<n): # 1<<n == 2**n
study = [0 for _ in range(m)]
cost = 0
for j in range(n):
if i&(1<<j):
cost += a[j][0]
study = [study[k]+a[j][k+1] for k in r... | [
"assignment.change"
] | 410,718 | 410,719 | u235027735 | python |
p02683 | n,m,x=map(int,input().split())
a=[list(map(int,input().split())) for i in range(n)]
# print(a)
ans=10**18
for i in range(1<<n):
t_money=0
t_rikai=[0]*m
ok=True
for j in range(n):
if i&(1<<j):
t_money+=a[j][0]
for k in range(m):
t_rikai[k]+=a[j][k]
for y,r in enumerate(t_rikai):
if... | n,m,x=map(int,input().split())
a=[list(map(int,input().split())) for i in range(n)]
# print(a)
ans=10**18
for i in range(1<<n):
t_money=0
t_rikai=[0]*m
ok=True
for j in range(n):
if i&(1<<j):
t_money+=a[j][0]
for k in range(m):
t_rikai[k]+=a[j][k+1]
for y,r in enumerate(t_rikai):
... | [
"expression.operation.binary.add"
] | 410,720 | 410,721 | u970197315 | python |
p02683 | n,m,x = map(int,input().split())
c = [0]*n
a = [[]]*n
for i in range(n) :
d = list(map(int,input().split()))
c[i] = d[0]
a[i] = d[1:m+1]
max = 2**n
ans = 10**18
for i in range(max) :
num = i
cost = 0
r = [0]*m
check = 0
for j in range(n) :
f = num%2
num = num//2
... | import itertools
n,m,x = map(int,input().split())
c = [0]*n
a = [[]]*n
for i in range(n) :
d = list(map(int,input().split()))
c[i] = d[0]
a[i] = d[1:m+1]
max = 2**n
ans = 10**18
for i in range(max) :
num = i
cost = 0
r = [0]*m
check = 0
for j in range(n) :
f = num%2
nu... | [
"control_flow.break.remove"
] | 410,736 | 410,737 | u454557108 | python |
p02683 | N,M,X = map(int,input().split())
A = []
cost = []
for i in range(N):
a = list(map(int,input().split()))
A.append(a[1:])
cost.append(a[0])
ans = float('inf')
for i in range(2**N):
I = bin(i)[2:]
I = I.zfill(M)
tmp = [0]*M
buy = 0
for j in range(len(I)):
if I[j]=='1':
f... | N,M,X = map(int,input().split())
A = []
cost = []
for i in range(N):
a = list(map(int,input().split()))
A.append(a[1:])
cost.append(a[0])
ans = float('inf')
for i in range(2**N):
I = bin(i)[2:]
I = I.zfill(N)
tmp = [0]*M
buy = 0
for j in range(len(I)):
if I[j]=='1':
f... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 410,750 | 410,751 | u800396927 | python |
p02683 | n,m,x=map(int,input().split())
a=[]
e=10**8
for i in range(n):
b=list(map(int,input().split()))
a.append(b)
for i in range(2**n):
c=[0]*(m+1)
s=0
for j in range(n):
if i>=2**(n-j-1):
i-=2**(n-j-1)
c=[x+y for (x,y) in zip(a[j],c)]
for j in range(m):
if c[1+... | n,m,x=map(int,input().split())
a=[]
e=10**8
for i in range(n):
b=list(map(int,input().split()))
a.append(b)
for i in range(2**n):
c=[0]*(m+1)
s=0
for j in range(n):
if i>=2**(n-j-1):
i-=2**(n-j-1)
c=[x+y for (x,y) in zip(a[j],c)]
for j in range(m):
if c[1+... | [
"call.remove"
] | 410,754 | 410,755 | u271210469 | python |
p02683 | import sys
import numpy as np
def Ii():return int(sys.stdin.buffer.read())
def Mi():return map(int,sys.stdin.buffer.readline().split())
def Li():return list(map(int,sys.stdin.buffer.readline().split()))
n,m,x = Mi()
a = []
b=[0]*m
b = np.array(b)
for i in range(n):
a.append(Li())
ans = 10**5+1
def DFS(cost,star... | import sys
import numpy as np
def Ii():return int(sys.stdin.buffer.read())
def Mi():return map(int,sys.stdin.buffer.readline().split())
def Li():return list(map(int,sys.stdin.buffer.readline().split()))
n,m,x = Mi()
a = []
b=[0]*m
b = np.array(b)
for i in range(n):
a.append(Li())
ans = 10**7
def DFS(cost,start,... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 410,762 | 410,761 | u726823037 | python |
p02683 | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n,m,x=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(n)]
ans=10**10
for i in range(2 ** n):
skill=[0]*m
cost=0
for j in range(n): # こ... | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n, m, x = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(n)]
ans = 10**10
for i in range(2 ** n):
skill = [0]*m
cost = 0
for j in r... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 410,766 | 410,767 | u992910889 | python |
p02683 | #!/usr/bin/env python3
from itertools import combinations
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N, M, X = map(int, input().split())
CA = [[] for _ in range(N)]
for n... | #!/usr/bin/env python3
from itertools import combinations
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N, M, X = map(int, input().split())
CA = [[] for _ in range(N)]
fo... | [
"expression.operation.binary.add"
] | 410,768 | 410,769 | u884692162 | python |
p02683 | #!/usr/bin/env python3
from itertools import combinations
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N, M, X = map(int, input().split())
CA = [[] for _ in range(N)]
for n... | #!/usr/bin/env python3
from itertools import combinations
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N, M, X = map(int, input().split())
CA = [[] for _ in range(N)]
for n... | [
"expression.operation.binary.add"
] | 410,768 | 410,770 | u884692162 | python |
p02683 | n,m,x = map(int,input().split())
c=[]
for i in range(n):
a=[int(i) for i in input().split()]
c.append(a)
import numpy as np
c=np.array(c)
ans=float('inf')
for i in range(1,2**n):
p=[0]*m
cost=0
for j in range(n):
if(i>>j)&1==1:
cost+=c[j][0]
p+=c[j][1:]
if min(p)>=x:
print(min(ans,co... | n,m,x = map(int,input().split())
c=[]
for i in range(n):
a=[int(i) for i in input().split()]
c.append(a)
import numpy as np
c=np.array(c)
ans=float('inf')
for i in range(1,2**n):
p=[0]*m
cost=0
for j in range(n):
if(i>>j)&1==1:
cost+=c[j][0]
p+=c[j][1:]
if min(p)>=x:
ans=min(ans,cost... | [
"call.arguments.change",
"call.remove"
] | 410,773 | 410,774 | u285436211 | python |
p02683 | import itertools
N, M, X = map(int, input().split())
a = [list(map(int, input().split())) for l in range(N)]
ans = 10**8
for i in range(2**N):
score = [0] * M
total = 0
for j in range(1,N+1):
if ((i >> j) & 1):
total += a[j][0]
for k in range(M):
score[k] +... | import itertools
N, M, X = map(int, input().split())
a = [list(map(int, input().split())) for l in range(N)]
ans = 10**8
for i in range(2**N):
score = [0] * M
total = 0
for j in range(N):
if ((i >> j) & 1):
total += a[j][0]
for k in range(M):
score[k] += a[... | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 410,775 | 410,776 | u141419468 | python |
p02683 | N, M, X = list(map(int, input().split()))
ca_list = [list(map(int, input().split())) for _ in range(N)]
c = [ca_list[i][0] for i in range(N)]
a = [ca_list[i][1:] for i in range(N)]
ans = sum(c)
check = False
for i in range(2**N):
total = 0
skills = [0] * M
for j in range(M):
if (i >> j) & 1:
... | N, M, X = list(map(int, input().split()))
ca_list = [list(map(int, input().split())) for _ in range(N)]
c = [ca_list[i][0] for i in range(N)]
a = [ca_list[i][1:] for i in range(N)]
ans = sum(c)
check = False
for i in range(2**N):
total = 0
skills = [0] * M
for j in range(N):
if (i >> j) & 1:
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 410,787 | 410,788 | u434609232 | python |
p02683 | import itertools
import numpy as np
N, M, X = map(int, input().split())
A = []
C = []
for _ in range(N):
temp_list = list(map(int, input().split()))
A.append(temp_list[1:])
C.append(temp_list[0])
A = np.array(A)
C = np.array(C)
answer = 10**6
for comb in itertools.product([0, 1], repeat= N):
cost = ... | import itertools
import numpy as np
N, M, X = map(int, input().split())
A = []
C = []
for _ in range(N):
temp_list = list(map(int, input().split()))
A.append(temp_list[1:])
C.append(temp_list[0])
A = np.array(A)
C = np.array(C)
answer = 10**9
for comb in itertools.product([0, 1], repeat= N):
cost = ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 410,797 | 410,796 | u523087093 | python |
p02683 | import itertools
import numpy as np
N, M, X = map(int, input().split())
A = []
C = []
for _ in range(N):
temp_list = list(map(int, input().split()))
A.append(temp_list[1:])
C.append(temp_list[0])
A = np.array(A)
C = np.array(C)
answer = 10**5 + 1
for comb in itertools.product([0, 1], repeat= N):
cos... | import itertools
import numpy as np
N, M, X = map(int, input().split())
A = []
C = []
for _ in range(N):
temp_list = list(map(int, input().split()))
A.append(temp_list[1:])
C.append(temp_list[0])
A = np.array(A)
C = np.array(C)
answer = 10**9
for comb in itertools.product([0, 1], repeat= N):
cost = ... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 410,798 | 410,796 | u523087093 | python |
p02683 | import numpy as np
import sys
n,m,x = map(int,input().split())
input_list = [np.array(list(map(int,input().split()))) for _ in range(n)]
temp_fee = sys.maxsize
for i in range(n**2):
list2 = [np.array([0]*(m+1))]
for j in range(n):
if (i >> j) &1 == 1:
list2.append(input_list[j])
list3 =... | import numpy as np
import sys
n,m,x = map(int,input().split())
input_list = [np.array(list(map(int,input().split()))) for _ in range(n)]
temp_fee = sys.maxsize
for i in range(2**n):
list2 = [np.array([0]*(m+1))]
for j in range(n):
if (i >> j) &1 == 1:
list2.append(input_list[j])
list3 = ... | [
"expression.operation.binary.remove"
] | 410,812 | 410,813 | u180172332 | python |
p02683 | from sys import stdin
input = stdin.readline
N, M, X = map(int, input().split())
pricelist = [0] * N
matrix = [[0] * M for _ in range(N)]
for i in range(N):
row = list(map(int, input().split()))
pricelist[i] = row.pop(0)
matrix[i] = row
mintotalprice = 10**5 * 12 + 1
for bit in range(N**2):
flag = Tru... | from sys import stdin
input = stdin.readline
N, M, X = map(int, input().split())
pricelist = [0] * N
matrix = [[0] * M for _ in range(N)]
for i in range(N):
row = list(map(int, input().split()))
pricelist[i] = row.pop(0)
matrix[i] = row
mintotalprice = 10**5 * 12 + 1
for bit in range(2**N):
flag = Tru... | [
"expression.operation.binary.remove"
] | 410,825 | 410,826 | u618251217 | python |
p02683 | from sys import stdin
input = stdin.readline
N, M, X = map(int, input().split())
pricelist = [0] * N
matrix = [[0] * M for _ in range(N)]
for i in range(N):
row = list(map(int, input().split()))
pricelist[i] = row.pop(0)
matrix[i] = row
mintotalprice = 10**5 * 12
for bit in range(N**2):
flag = True
... | from sys import stdin
input = stdin.readline
N, M, X = map(int, input().split())
pricelist = [0] * N
matrix = [[0] * M for _ in range(N)]
for i in range(N):
row = list(map(int, input().split()))
pricelist[i] = row.pop(0)
matrix[i] = row
mintotalprice = 10**5 * 12 + 1
for bit in range(2**N):
flag = Tru... | [
"expression.operation.binary.remove"
] | 410,827 | 410,826 | u618251217 | python |
p02683 | import numpy as np
N, M, X = list(map(int, input().split()))
array = np.array([list(map(int, input().split())) for _ in range(N)])
min_C = np.inf
conbi = None
m = 2**N
for i in range(m):
tmp = []
for _ in range(N):
tmp.append(i%2)
i //= 2
sum_array = np.sum(array[np.where(tmp)], axis=0)
#print(tmp... | import numpy as np
N, M, X = list(map(int, input().split()))
array = np.array([list(map(int, input().split())) for _ in range(N)])
min_C = np.inf
conbi = None
m = 2**N
for i in range(m):
tmp = []
for _ in range(N):
tmp.append(i%2)
i //= 2
sum_array = np.sum(array[np.where(tmp)], axis=0)
#print(tmp... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 410,828 | 410,829 | u439063038 | python |
p02683 | def check(idxs_):
rikaido = [0 for i in range(m)]
cost_ = 0
for i in idxs_:
for j in range(m):
rikaido[j] += a[i][j]
cost_ += c[i]
for i in range(m):
if rikaido[i] < x:
cost_ = 9999999
return cost_
n, m, x = map(int, input().split())
c = []
a = []
fo... | def check(idxs_):
rikaido = [0 for i in range(m)]
cost_ = 0
for i in idxs_:
for j in range(m):
rikaido[j] += a[i][j]
cost_ += c[i]
for i in range(m):
if rikaido[i] < x:
cost_ = 9999999
return cost_
n, m, x = map(int, input().split())
c = []
a = []
fo... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 410,834 | 410,835 | u763534217 | python |
p02683 | N,M,X=map(int,input().split())
CA=[list(map(int,input().split())) for i in range(N)]
ans=float("inf")
for i in range(N**2):
ruikei=[0]*M
onedan=0
for j in range(N):
if ((i>>j)&1):
onedan+=CA[j][0]
for k in range(1,M+1):
ruikei[k-1]+=CA[j][k]
#print(onedan)... | N,M,X=map(int,input().split())
CA=[list(map(int,input().split())) for i in range(N)]
ans=float("inf")
for i in range(2**N):
ruikei=[0]*M
onedan=0
for j in range(N):
if ((i>>j)&1):
onedan+=CA[j][0]
for k in range(1,M+1):
ruikei[k-1]+=CA[j][k]
#print(onedan)... | [
"expression.operation.binary.remove"
] | 410,843 | 410,844 | u671211357 | python |
p02683 | n,m,x=map(int,input().split())
c=[]
a=[]
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp[0])
a.append(tmp[1:])
result = -1
for i in range(2**n):
skill = [0]*m
cost = 0
for j in range(m):
if (i >> j) & 1 == 0:
continue
cost += c[j]
for s in range(m):
skill[s] ... | n,m,x=map(int,input().split())
c=[]
a=[]
for i in range(n):
tmp = list(map(int, input().split()))
c.append(tmp[0])
a.append(tmp[1:])
result = -1
for i in range(2**n):
skill = [0]*m
cost = 0
for j in range(n):
if (i >> j) & 1 == 0:
continue
cost += c[j]
for s in range(m):
skill[s] +... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 410,845 | 410,846 | u145145077 | python |
p02683 | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
a,b,c=ml()
cost=[]
for i in range(a):
cost.append(ll())
ans=1e18
flag=1
f... | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
a,b,c=ml()
cost=[]
for i in range(a):
cost.append(ll())
ans=1e18
flag=1
f... | [] | 410,847 | 410,848 | u706984643 | python |
p02683 | n,m,x = map(int,input().split())
a = [list(map(int,input().split())) for x in range(n)]
total = [0]*(m+1)
flg = False
mflg = True
min_num = 10**5+1
for i in range(1,2**n):
for j in range(n):
if ((i >> j) & 1):
total = [x + y for (x, y) in zip(a[j], total)]
for k in range(m):
if total... | n,m,x = map(int,input().split())
a = [list(map(int,input().split())) for x in range(n)]
total = [0]*(m+1)
flg = False
mflg = True
min_num = 100100100100100
for i in range(1,2**n):
for j in range(n):
if ((i >> j) & 1):
total = [x + y for (x, y) in zip(a[j], total)]
for k in range(m):
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 410,855 | 410,856 | u143051858 | python |
p02683 | N,M,X = map(int,input().split())
li = []
import numpy as np
C = []
for _ in range(M):
c,*a = map(int,input().split())
li.append(np.array(a))
C.append(c)
counter = []
for i in range(1<<N):
skill_li = np.zeros(M)
sum_price = 0
for k in range(N):
if (i>>k) & 1:
skill_li += li... | N,M,X = map(int,input().split())
li = []
import numpy as np
C = []
for _ in range(N):
c,*a = map(int,input().split())
li.append(np.array(a))
C.append(c)
counter = []
for i in range(1<<N):
skill_li = np.zeros(M).astype(int)
sum_price = 0
for k in range(N):
if (i>>k) & 1:
sk... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.add"
] | 410,857 | 410,858 | u772029934 | python |
p02683 | n,m,x=[int(i) for i in input().split()]
c=[]
arr=[[] for i in range(n)]
for i in range(n):
l=[int(i) for i in input().split()]
c.append(l[0])
arr[i]=l[1:]
inf=10**18
ans=inf
limit=2**n
for bit in range(1,limit):
sum=[0 for i in range(n)]
cost=0
for i in range(n):
if (1<<i & bit):
... | n,m,x=[int(i) for i in input().split()]
c=[]
arr=[[] for i in range(n)]
for i in range(n):
l=[int(i) for i in input().split()]
c.append(l[0])
arr[i]=l[1:]
inf=10**18
ans=inf
limit=2**n
for bit in range(1,limit):
sum=[0 for i in range(m)]
cost=0
for i in range(n):
if (1<<i & bit):
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 410,876 | 410,877 | u223355055 | python |
p02683 | n, m, x = map(int, input().split())
keep = []
ans = 10**10
for i in range(n):
c = list(map(int, input().split()))
keep.append(c)
for j in range(2**n):
bag = [0] * n
total = 0
check = 1
for k in range(n):
if ((j >> k) & 1):
for l in range(m):
bag[l] += keep[k]... | n, m, x = map(int, input().split())
keep = []
ans = 10**10
for i in range(n):
c = list(map(int, input().split()))
keep.append(c)
for j in range(2**n):
bag = [0] * m
total = 0
check = 1
for k in range(n):
if ((j >> k) & 1):
for l in range(m):
bag[l] += keep[k][... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 410,880 | 410,881 | u419963262 | python |
p02683 | #ABC167
N,M,X=map(int,input().split())
c = [] #参考書の値段
a = [] #各参考書に入る理解度
for i in range(N):
c_temp, *a_temp = list(map(int, input().split())) # こうすると、2つ目以降をリストで受け取れる
c.append(c_temp)
a.append(a_temp)
price_min = 10000000
for i in range(2**N):
price_total = 0 #値段の合計
learn_total = [0] * M #理解度の合計
... | #ABC167
N,M,X=map(int,input().split())
c = [] #参考書の値段
a = [] #各参考書に入る理解度
for i in range(N):
c_temp, *a_temp = list(map(int, input().split())) # こうすると、2つ目以降をリストで受け取れる
c.append(c_temp)
a.append(a_temp)
price_min = 10000000
for i in range(2**N):
price_total = 0 #値段の合計
learn_total = [0] * M #理解度の合計
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 410,883 | 410,884 | u592601397 | python |
p02683 | N, M, X = [int(i) for i in input().split()]
CA = []
for i in range(N):
CA.append([int(j) for j in input().split()])
#print(CA)
mcost = 10**10
for i in range(2**N):
learn = [0]*M
cost = 0
bn = str(bin(i))[2:].zfill(M)
#print(bn)
for j,b in enumerate(bn):
if b == "1":
cost +=... | N, M, X = [int(i) for i in input().split()]
CA = []
for i in range(N):
CA.append([int(j) for j in input().split()])
#print(CA)
mcost = 10**10
for i in range(2**N):
learn = [0]*M
cost = 0
bn = str(bin(i))[2:].zfill(N)
#print(bn)
for j,b in enumerate(bn):
if b == "1":
cost +=... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 410,895 | 410,896 | u344276999 | python |
p02683 | n,m,x = map(int,input().split())
book = [list(map(int,input().split())) for _ in range(n)]
ans = 12 * (10**5) + 1
for i in range(2**n):
kingaku = 0
rikaido = [0] * m
for j in range(n):
if (i >> j) & 1:
kingaku += book[j][0]
for k in range(m):
rikaido[k] += boo... | n,m,x = map(int,input().split())
books = [list(map(int,input().split())) for _ in range(n)]
ans = 12 * (10**5) + 1
for i in range(2**n):
kingaku = 0
rikaido = [0] * m
for j in range(n):
if (i >> j) & 1:
kingaku += books[j][0]
for k in range(m):
rikaido[k] += b... | [
"assignment.variable.change",
"identifier.change"
] | 410,901 | 410,900 | u931394483 | python |
p02683 | if __name__ == '__main__':
n,m,a = map(int,input().split())
A = []
for i in range(n):
cmd = list(map(int,input().split()))
A.append(cmd)
print(A)
#bit全探索 買う・買わないを判断する
INF = 10**19
ans = INF
for x in range(2**n):
ALG = [0]*m
gokei = 0
for y in ra... | if __name__ == '__main__':
n,m,a = map(int,input().split())
A = []
for i in range(n):
cmd = list(map(int,input().split()))
A.append(cmd)
#bit全探索 買う・買わないを判断する
INF = 10**19
ans = INF
for x in range(2**n):
ALG = [0]*m
gokei = 0
for y in range(n):
... | [
"call.remove"
] | 410,908 | 410,909 | u517797706 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.