Problem p02683 (python)

Fixed submission:
N, M, X = map(int,input().split())

CAM = list([list(map(int,input().split())) for i in range(N)])
# print(CAM)
minn = 10**18
b = False

for i in range(2 ** N):
  s = 0
  am = []

  for j in range(N):  # このループが一番のポイント
      if ((i >> j) & 1):  # 順に右にシフトさせ最下位bitのチェックを行う
        am.append(CAM[j])

  j = False
  sss = [0] * (M+1)
  for kk in range(len(am)):
    s += am[kk][0]
    for m in range(0, M):
      sss[m+1] += am[kk][m+1]
  
  if len([i for i in sss[1:] if i >= X] ) == len(sss[1:]):
    b = True
    minn = min(s,minn)
  
  # print(sss)
  # if x >= X and y >= X and z >= X:
  #   minn = min(s,minn)
  #   b = True

print(minn if b == True else -1)

Buggy submission (verdict: Runtime Error):
N, M, X = map(int,input().split())

CAM = list([list(map(int,input().split())) for i in range(N)])
# print(CAM)
minn = 10**18
b = False

for i in range(2 ** N):
  s = 0
  x = 0
  y =0
  z=0
  for j in range(N):  # このループが一番のポイント
      if ((i >> j) & 1):  # 順に右にシフトさせ最下位bitのチェックを行う
        s += CAM[j][0]
        x += CAM[j][1]
        y += CAM[j][2]
        z += CAM[j][3]

  if x >= X and y >= X and z >= X:
    minn = min(s,minn)
    b = True

print(minn if b == True else -1)

Buggy submission (verdict: Runtime Error):
N, M, X = map(int,input().split())

CAM = list([list(map(int,input().split())) for i in range(N)])
# print(CAM)
minn = 10**6
b = False

for i in range(2 ** N):
  s = 0
  x=0
  y=0
  z=0
  for j in range(N):  # このループが一番のポイント
      if ((i >> j) & 1):  # 順に右にシフトさせ最下位bitのチェックを行う
        s += CAM[j][0]
        x += CAM[j][1]
        y += CAM[j][2]
        z += CAM[j][3]
  if x >= X and y >= X and z >= X:
    minn = min(s,minn)
    b = True

print(minn if b == True else -1)

Buggy submission (verdict: Runtime Error):
N, M, X = map(int,input().split())

CAM = list([list(map(int,input().split())) for i in range(N)])
# print(CAM)
minn = 10**6
b = False

for i in range(2 ** N):
    bag = []
    s = 0
    x=0
    y=0
    z=0
    for j in range(N):  # このループが一番のポイント
        if ((i >> j) & 1):  # 順に右にシフトさせ最下位bitのチェックを行う
          s += CAM[j][0]
          x += CAM[j][1]
          y += CAM[j][2]
          z += CAM[j][3]
    if x >= X and y >= X and z >= X:
      minn = min(s,minn)
      b = True

print(minn if b == True else -1)

Buggy submission (verdict: Runtime Error):
N, M, X = map(int,input().split())

CAM = list([list(map(int,input().split())) for i in range(N)])
# print(CAM)
minn = 10**6
b = False

for i in range(2 ** N):
    bag = []
    for j in range(N):  # このループが一番のポイント
        if ((i >> j) & 1):  # 順に右にシフトさせ最下位bitのチェックを行う
            bag.append(CAM[j])  # フラグが立っていたら bag に果物を詰める

    s = 0
    x=0
    y=0
    z=0
    for ij in range(len(bag)):
      s += bag[ij][0]
      x += bag[ij][1]
      y += bag[ij][2]
      z += bag[ij][3]

    if x >= X and y >= X and z >= X:
      minn = min(s,minn)
      b = True

print(minn if b == True else -1)

Buggy submission (verdict: Runtime Error):
N, M, X = map(int,input().split())

CAM = list([list(map(int,input().split())) for i in range(N)])
# print(CAM)
minn = 10**9
b = False
for i in range(2 ** N):
    bag = []
    for j in range(N):  # このループが一番のポイント
        if ((i >> j) & 1):  # 順に右にシフトさせ最下位bitのチェックを行う
            bag.append(CAM[j])  # フラグが立っていたら bag に果物を詰める

    s = 0
    x=0
    y=0
    z=0
    for i in range(len(bag)):
      s += bag[i][0]
      x += bag[i][1]
      y += bag[i][2]
      z += bag[i][3]
    if x >= X and y >= X and z >= X:
      minn = min(s,minn)
      b = True

print(minn if b == True else -1)