Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a, b, c, x = map(int, [input() for i in range(4)])
ans = 0
for i in range(a+1):
    for j in range(b+1):
        for k in range(c+1):
            in i * 500 + j * 100 + k * 50 == x:
                ans += 1
print(ans)

Fixed submission:
a, b, c, x = map(int, [input() for i in range(4)])
ans = 0
for i in range(a+1):
    for j in range(b+1):
        for k in range(c+1):
            if i * 500 + j * 100 + k * 50 == x:
                ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
a, b, c, x = map(int, [input() for i in range(4)])
ans = 0
for i in range(a+1):
    for j in range(b+1):
        for k in range(c+1):
            in i * 500 + j * 100 + k * 50 == x:
                ans += 1
print(ans)

Fixed submission:
a, b, c, x = map(int, [input() for i in range(4)])
ans = 0
for i in range(a+1):
    for j in range(b+1):
        for k in range(c+1):
            if i * 500 + j * 100 + k * 50 == x:
                ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
# 全体の長さから右から数えて最初に出た1の箇所のインデックスを引く
# 後ろに続く0の数が2で割れる回数にあたる
# 例　全：6 インデックス 2 -1 
ans = float("inf")
for i in A:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") -1 )
print(ans)

Fixed submission:
s = input()
print(s.count('1'))
Buggy python submission (verdict: Runtime Error):
n = int(input())
print len(set(map(int,[input() for i in range(n)])))

Fixed submission:
n = int(input())
print(len(set(map(int,[input() for i in range(n)]))))
Buggy python submission (verdict: Runtime Error):
n, a, b = map(int, input().split)
ans = 0
for i in range(n+1):
  if a<= sum(list(map(int, list(str(i))))) <= b:
    ans += i
print(ans)

Fixed submission:
n, a, b = map(int, input().split())
ans = 0
for i in range(n+1):
  if a<= sum(list(map(int, list(str(i))))) <= b:
    ans += i
print(ans)

Buggy python submission (verdict: Runtime Error):
n, a, b = map(int, input().split)
ans = 0
for i in range(n+1):
  if a<= sum(list(map(int, list(str(i))))) <= b:
    ans += 1
print(ans)

Fixed submission:
n, a, b = map(int, input().split())
ans = 0
for i in range(n+1):
  if a<= sum(list(map(int, list(str(i))))) <= b:
    ans += i
print(ans)
Buggy python submission (verdict: Runtime Error):
h,w = map(int,input().split())
for i in range(h):
  s=str(input())
  print(s)
  print(s)

Fixed submission:
s = input()
b = ['a','e','i','o','u']
for i in b:
  if s == i:
    print('vowel')
    exit()
print('consonant')

Buggy python submission (verdict: Runtime Error):
s = input()
b = ['a','e','i','o','u']
for i in b:
  if s == b[i]:
    print('vowel')
    exit()
print('consonant')


Fixed submission:
s = input()
b = ['a','e','i','o','u']
for i in b:
  if s == i:
    print('vowel')
    exit()
print('consonant')

Buggy python submission (verdict: Runtime Error):
s = input()
b = ['a','e','i','o','u']
for i in b:
  if s.find(b[i]):
    print('vowel')
    exit()
print('consonant')

Fixed submission:
s = input()
b = ['a','e','i','o','u']
for i in b:
  if s == i:
    print('vowel')
    exit()
print('consonant')
Buggy python submission (verdict: Runtime Error):
a = input()
b = 0
if a[0] == 1:
    b++
if a[1] == 1:
    b++
if a[2] == 1:
    b++
print(b)

Fixed submission:
a = int(input())
b = 0
for i in range(3):
    if a % 2 == 0:
        a = a / 10
    else:
        b = b + 1
        a = (a-1)/10
print(b)

Buggy python submission (verdict: Runtime Error):
a = input()
b = 0
if a[0] == 1:
    b++
if a[1] == 1:
    b++
if a[2] == 1:
    b++
print(b)

Fixed submission:
a = int(input())
b = 0
for i in range(3):
    if a % 2 == 0:
        a = a / 10
    else:
        b = b + 1
        a = (a-1)/10
print(b)
Buggy python submission (verdict: Runtime Error):
n = int(input())
list1 = []
list2 = []
for i in range(0,n):
    list1.append(int(input()))

for i in range(0,len(list1)):
    if not(list1[1] in list2):
        list2.append(list1[i])
print(len(list2))

Fixed submission:
n = int(input())
list1 = []
list2 = []
for i in range(0,n):
    list1.append(int(input()))

for i in range(0,len(list1)):
    if not(list1[i] in list2):
        list2.append(list1[i])
print(len(list2))

Buggy python submission (verdict: Runtime Error):
n = int(input())
list1 = []
list2 = []
for i in range(0,n):
    list1.append(int(input()))

for i in range(0,len(list1)):
    if not(list1[1] in list2):
        list2.append(list1.pop(i))
print(len(list2))

Fixed submission:
n = int(input())
list1 = []
list2 = []
for i in range(0,n):
    list1.append(int(input()))

for i in range(0,len(list1)):
    if not(list1[i] in list2):
        list2.append(list1[i])
print(len(list2))
Buggy python submission (verdict: Runtime Error):
s_n = [0, 0, 0]
s_l = [10000, 5000, 1000]
error = '-1 -1 -1'

for i, s in enumerate(s_l):
    if n > -1:
        s_n[i] = int(y/s)
        n = n - s_n[i]
        y = y - s * s_n[i]
    else:
        ans = error
 
if n > -1:
    if y == 0:
        ans = ' '.join(map(str, s_n))
    elif list(set(s_n)) == [0]:
        ans = error
    else:
        ans = error
else:
    ans = error

print(ans)

Fixed submission:
N, Y = map(int, input().split(' '))
res10000 = -1
res5000 = -1
res1000 = -1

for a in range(N+1):
    for b in range(N-a+1):
        c = N - a - b
        total = 10000*a + 5000*b + 1000*c
        if total == Y:
            res10000 = a
            res5000 = b
            res1000 = c

print(str(' '.join(map(str, [res10000, res5000, res1000]))))
Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
flg = True
break_flg = False
total = 0
while True:
  for i, b in enumerate(a):
    if b%2 == 0:
      a[i] = b/2
    else:
      break_flg = True
      break
  if break_flg :
    break
  else:
    total += 1
print(total)


Fixed submission:
a = input()
total = 0
for b in a:
  if b ==  '1':
    total += 1

print(total)
Buggy python submission (verdict: Runtime Error):
n = input()
a = list(map(int, input().split()))
flg = True
break_flg = False
total = 0
while True:
  for i, b in enumerate(a):
    if b%2 == 0:
      a[i] = b/2
    else:
      break_flg = True
      breake
  if break_flg :
    break
  else:
    total += 1
print(total)


Fixed submission:
n = input()
a = list(map(int, input().split()))
flg = True
break_flg = False
total = 0
while True:
  for i, b in enumerate(a):
    if b%2 == 0:
      a[i] = b/2
    else:
      break_flg = True
  if break_flg :
    break
  else:
    total += 1
print(total)
Buggy python submission (verdict: Runtime Error):
n = int(input())
num_list = list(map(int, input().split()))

Alice = 0
Bob = 0

for i in range(n):
    current_max = max(num_list)
    if i % 2 == 0:
        Alice += current_max
    else:
        Bob += current_max
    a_list.remove(current_max)

print(Alice - Bob)


Fixed submission:
n = int(input())
num_list = list(map(int, input().split()))

Alice = 0
Bob = 0

for i in range(n):
    current_max = max(num_list)
    if i % 2 == 0:
        Alice += current_max
    else:
        Bob += current_max
    num_list.remove(current_max)

print(Alice - Bob)
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())

if (a % 2 == 0) || (b % 2 == 0):
  print('Even')
else:
  print('Odd')

Fixed submission:
a, b = map(int, input().split())

if (a % 2 == 0 or b % 2 == 0):
  print('Even')
else:
  print('Odd')

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a % 2 == 0 || b % 2 == 0):
  print('Even')
else:
  print('Odd')

Fixed submission:
a, b = map(int, input().split())

if (a % 2 == 0 or b % 2 == 0):
  print('Even')
else:
  print('Odd')
Buggy python submission (verdict: Runtime Error):
n = int(input())
num_list = [input() for i in range(n)]

bucket = {}
for i in range(1,100):
    bucket[i] = 0
for i in range(n):
    bucket[int(num_list[i])] += 1
res = 0
for i in range(1,100):
    if bucket[i] > 0:
        res += 1

print(res)


Fixed submission:
n = int(input())
d_list = [input() for i in range(n)]

unique_num_dict = {}
for i in range(n):
    if d_list[i] in unique_num_dict.keys():
        unique_num_dict[d_list[i]] += 1
    else:
        unique_num_dict[d_list[i]] = 1

print(len(unique_num_dict))

Buggy python submission (verdict: Runtime Error):
n = int(input())
num_list = [input() for i in range(n)]

bucket = {}
for i in range(100):
    bucket[i] = 0
for i in range(n):
    bucket[int(num_list[i])] += 1
res = 0
for i in range(100):
    if bucket[i] > 0:
        res += 1

print(res)


Fixed submission:
n = int(input())
d_list = [input() for i in range(n)]

unique_num_dict = {}
for i in range(n):
    if d_list[i] in unique_num_dict.keys():
        unique_num_dict[d_list[i]] += 1
    else:
        unique_num_dict[d_list[i]] = 1

print(len(unique_num_dict))
Buggy python submission (verdict: Time Limit Exceeded):
n, y = map(int, input().split())

is_possible = False
for i in range(n+1):
    for j in range(n-i+1):
        for k in range(n-i-j+1):
            if (i + j + k) != n:
                continue
            total = i*10000 + j*5000 + k*1000
            if total == y:
                is_possible = True
                print("{} {} {}".format(i, j, k))
                break
        else:
            continue
        break
    else:
        continue
    break

if is_possible is False:
    print("-1 -1 -1")


Fixed submission:
n, y = map(int, input().split())

is_possible = False

for i in range(n+1):
    for j in range(n-i+1):
        k = n - i - j
        total = i*10000 + j*5000 + k*1000
        if total == y:
            is_possible = True
            print("{} {} {}".format(i, j, k))
            break
    if is_possible:
        break

if is_possible is False:
    print("-1 -1 -1")
Buggy python submission (verdict: Runtime Error):
n = input()
int_list = [int(input()) for i in range(n)]
count = 0
while True:
    isOdd = False
    for i in range(n):
        if(int_list[i] % 2 != 0):
            isOdd = True
    if isOdd:
        break
    for i in range(n):
        int_list[i] = int_list[i]/2
    count = count + 1

print(count)


Fixed submission:
n = int(input())
int_list = list(map(int, input().split()))
count = 0
while True:
    isOdd = False
    for i in range(n):
        if(int_list[i] % 2 != 0):
            isOdd = True
    if isOdd:
        break
    for i in range(n):
        int_list[i] = int_list[i]/2
    count = count + 1
print(count)
Buggy python submission (verdict: Runtime Error):
x, y = map(int, input().split())
if (x+Y)%2 == 0:
  print("Even")
else:
  print("Odd")

Fixed submission:
x, y = map(int, input().split())
if (x*y)%2 == 0:
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
import numpy as np
A = input()
B = input()
C = input()
X = input()
count = 0
coin = np.array([500,100,50])
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if a + b + c == 0:
        continue
      else:
        if X == coin.dot(np.array([a,b,c])):
            count += 1
print(count)

Fixed submission:
import numpy as np
A = int(input())
B = int(input())
C = int(input())
X = int(input())
count = 0
coin = np.array([500,100,50])
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if a + b + c == 0:
        continue
      else:
        if X == coin.dot(np.array([a,b,c])):
            count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
import numpy as np
A = input()
B = input()
C = input()
X = input()
count = 0
c = np.array([500,100,50])
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if (a == 0 and b == 0 and c == 0):
        break
      else:
        if (np.array([a,b,c]) * c).sum() == X:
          count += 1
print(count)


Fixed submission:
import numpy as np
A = int(input())
B = int(input())
C = int(input())
X = int(input())
count = 0
coin = np.array([500,100,50])
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if a + b + c == 0:
        continue
      else:
        if X == coin.dot(np.array([a,b,c])):
            count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
C = input()
X = input()
count = 0
c = np.array([500,100,50])
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if (a == 0 and b == 0 and c == 0) or (a+b+c)>50:
        break
      else:
        if (np.array([a,b,c]) * c).sum() == X:
          count += 1
print(count)

Fixed submission:
import numpy as np
A = int(input())
B = int(input())
C = int(input())
X = int(input())
count = 0
coin = np.array([500,100,50])
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if a + b + c == 0:
        continue
      else:
        if X == coin.dot(np.array([a,b,c])):
            count += 1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N, Y = list(map(int, input().split()))
flag=0
s = np.array([10000, 5000, 1000])
try:
  for x in range(N+1):
    for y in range(N+1-x):
      z = N - x- y
      #if x*10000 + y*5000 + z*1000 == Y:
      if s.dot(np.array([x,y,z])) == Y:
        print(x, y, z)
        flag = 1
        raise Exception
except Exception:
  pass
if flag == 0:
  print('-1 -1 -1')


Fixed submission:
N, Y = list(map(int, input().split()))
flag=0
try:
  for x in range(N+1):
    for y in range(N+1-x):
      z = N - x- y
      if x*10000 + y*5000 + z*1000 == Y:
        print(x, y, z)
        flag = 1
        raise Exception
except Exception:
  pass
if flag == 0:
  print('-1 -1 -1')

Buggy python submission (verdict: Time Limit Exceeded):
N, Y = list(map(int, input().split()))
flag=0
try:
  for x in range(N+1):
    #if flag != 0:break
    for y in range(N+1-x):
      #if flag != 0:break
      for z in range(N+1-x-y):
        if x+y+z == N:
          if x*10000 + y*5000 + z*1000 == Y:
            print(x, y, z)
            flag = 1
            raise Exception
except Exception:
  pass
if flag == 0:
  print('-1 -1 -1')


Fixed submission:
N, Y = list(map(int, input().split()))
flag=0
try:
  for x in range(N+1):
    for y in range(N+1-x):
      z = N - x- y
      if x*10000 + y*5000 + z*1000 == Y:
        print(x, y, z)
        flag = 1
        raise Exception
except Exception:
  pass
if flag == 0:
  print('-1 -1 -1')

Buggy python submission (verdict: Runtime Error):
N, Y = list(map(int, input().split()))
flag=0
try:
  for x in range(N+1):
    #if flag != 0:break
    for y in range(N+1-x):
      #if flag != 0:break
      for z in range(N+1-x-y):
        if x+y+z == N:
          if x*10000 + y*5000 + z*1000 == Y:
			print(x, y, z)
            flag = 1
            raise Exception
except Exception:
  pass
if flag == 0:
  print('-1 -1 -1')


Fixed submission:
N, Y = list(map(int, input().split()))
flag=0
try:
  for x in range(N+1):
    for y in range(N+1-x):
      z = N - x- y
      if x*10000 + y*5000 + z*1000 == Y:
        print(x, y, z)
        flag = 1
        raise Exception
except Exception:
  pass
if flag == 0:
  print('-1 -1 -1')
Buggy python submission (verdict: Time Limit Exceeded):
n, money = map(int, input().split())

x = 0 #10000yen
y = 0 #5000yen
z = 0 #1000yen
check = 0

for x in range (n + 1) :
  for y in range (n + 1 - x) :
    for z in range (n + 1 - x - y ) :
      if check == 1 :
        check = 1
      elif x + y + z == n :
        if 10000 * x + 5000 * y + 1000 * z == money :
          check += 1
          print(x,y,z)

if check == 0 :
  print ("-1 -1 -1")

Fixed submission:
n, money = map(int, input().split())

x = 0 #10000yen
y = 0 #5000yen
z = 0 #1000yen
check = 0

for x in range (n + 1) :
  for y in range (n + 1 - x) :
    z = n - x - y
    if check == 1 :
      check = 1
    elif 10000 * x + 5000 * y + 1000 * z == money :
      check += 1
      print(x,y,z)

if check == 0 :
  print ("-1 -1 -1")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
answer = []

for i in range (n) :
    number = 0
    odd = a[i] %% 2
    a[i] = a[i] / 2    
    while odd <= 0 :
        number += 1
        odd = a[i] %% 2
        a[i] = a[i] / 2
    answer.append(number)

#print(answer)
print(min(answer))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
answer = []

for i in range (n) :
    number = 0
    odd = a[i] % 2
    a[i] = a[i] // 2    
    while odd <= 0 :
        number += 1
        odd = a[i] % 2
        a[i] = a[i] // 2
    answer.append(number)

print(min(answer))
Buggy python submission (verdict: Runtime Error):
if __name__ == '__main__':
    n, a, b = map(int, input().split())

    count = 0
    for i in range(n+1):
        x = sum(map(int, str(i)))
        if a <= x <= b:
            count = count + i

    print(count)

Fixed submission:
if __name__ == '__main__':
    a, b, c, d = map(int, input().split())

    if a+b == c+d:
        print('Balanced')
    elif a+b > c+d:
        print('Left')
    else:
        print('Right')
Buggy python submission (verdict: Runtime Error):
if __name__ == '__main__':
    a = int(input())
    b = int(input())
    c = int(input())
    x = int(input())

    count = 0
    for ia in range(a+1):
        for ib in range(b+1):
            for ic in range(c+1):
                if 500*ia+100*ib+50*ic == x:
                    count = count+1

    print(count)


Fixed submission:
if __name__ == '__main__':
    n, a, b = map(int, input().split())

    count = 0
    for i in range(n+1):
        x = sum(map(int, str(i)))
        if a <= x <= b:
            count = count + i

    print(count)
Buggy python submission (verdict: Runtime Error):
n = input()
nums = list(map(int, input().split())).sort(reverse=True)
result = 0
for i, v in enumerate(nums):
    result += (1 if i % 2 == 0 else -1) * v
print(result)

Fixed submission:
n = input()
nums = sorted(list(map(int, input().split())), reverse=True)
result = 0
for i, v in enumerate(nums):
    result += (1 if i % 2 == 0 else -1) * v
print(result)
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
x = input()
count = 0
for i in range(min(x // 500, a) + 1):
    for j in range(min((x - i * 500) // 100, b) + 1):
        if (x - i * 500 - j * 100) // 50 <= c:
            count += 1
print(count)


Fixed submission:
a, b, c, x = map(int, [input() for i in range(4)])
count = 0
for i in range(min(x // 500, a) + 1):
    for j in range(min((x - i * 500) // 100, b) + 1):
        if x - i * 500 - j * 100 <= c * 50:
            count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
x = input()
count = 0
for i in range(min(x // 500, a) + 1):
    for j in range(min((x - i * 500) // 100, b) + 1):
        if (x - i * 500 - j * 100) // 50 <= c:
            count += 1
print(count)

Fixed submission:
a, b, c, x = map(int, [input() for i in range(4)])
count = 0
for i in range(min(x // 500, a) + 1):
    for j in range(min((x - i * 500) // 100, b) + 1):
        if x - i * 500 - j * 100 <= c * 50:
            count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
x = input()
count = 0
for i in range(min(x // 500 + 1, a)):
    for j in range(min((x - i * 500) // 100 + 1, b)):
        if (x - i * 500 - j * 100) // 50 <= c:
            count += 1
print(count)

Fixed submission:
a, b, c, x = map(int, [input() for i in range(4)])
count = 0
for i in range(min(x // 500, a) + 1):
    for j in range(min((x - i * 500) // 100, b) + 1):
        if x - i * 500 - j * 100 <= c * 50:
            count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()
x = input()
count = 0
for i in range(min(x / 500, a)):
    for j in range(min((x - i * 500) / 200, b)):
        if (x - i * 500 - j * 100) / 50 <= c:
            count += 1
print(count)

Fixed submission:
a, b, c, x = map(int, [input() for i in range(4)])
count = 0
for i in range(min(x // 500, a) + 1):
    for j in range(min((x - i * 500) // 100, b) + 1):
        if x - i * 500 - j * 100 <= c * 50:
            count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
import math
num = int(input().replace(" ", ""))
squreRoot = math.sqrt(num)
return 'Yes' if squreRoot == int(squreRoot) else 'No'

Fixed submission:
import math
num = int(input().replace(" ", ""))
squreRoot = math.sqrt(num)
print('Yes' if squreRoot == int(squreRoot) else 'No')

Buggy python submission (verdict: Runtime Error):
import math
num = int(input().replace(" ", ""))
squreRoot = math.sqrt(num)
return squreRoot == int(squreRoot)

Fixed submission:
import math
num = int(input().replace(" ", ""))
squreRoot = math.sqrt(num)
print('Yes' if squreRoot == int(squreRoot) else 'No')
Buggy python submission (verdict: Runtime Error):
n = int(input(), 2)
count  = 0
while n > 0:
    n = n && (n - 1)
    count += 1
print(count)

Fixed submission:
n = int(input(), 2)
count  = 0
while n > 0:
    n = n & (n - 1)
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
inp = input()
A, B = map(int, inp.split)

def fu(a, b):
    if a * b % 2 == 1: return'Odd'
    return 'Even'

print(fu(A, B))a

Fixed submission:
inp = input()
A, B = map(int, inp.split())

def fu(a, b):
    if a * b % 2 == 1: return'Odd'
    return 'Even'

print(fu(A, B))
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
n, y = np.array(list(input().split()), dtype=int)

vals = np.array([10000, 5000, 1000])

def get_tuple(n, y):
    for c in range(n + 1):
        for b in range(n + 1 - c):
            a = n - c - b
            nums = np.array([a, b, c])
            yield nums

for nums in get_tuple(n, y):
    if (nums * vals).sum() == y:
        print("{} {} {}".format(*nums))
        break
else:
    print("-1 -1 -1")

Fixed submission:
import numpy as np
n, y = np.array(list(input().split()), dtype=int)

vals = np.array([10000, 5000, 1000])

table = []
for c in range(n + 1):
    part = np.zeros((n + 1 - c, 3), dtype=int)
    part[:, 0] = c
    part[:, 1] = np.arange(n + 1 - c)
    table += [part]
table = np.concatenate(table)
table[:, 2] = n - table[:, 0:2].sum(axis=1)

accum = (table * vals).sum(axis=1)
flags = np.where(accum == y)[0]

if len(flags) == 0:
    print("-1 -1 -1")
else:
    nums = table[flags[0]]
    print("{} {} {}".format(*nums))

Buggy python submission (verdict: Runtime Error):
import numpy as np
n, y = np.array(list(input().split()), dtype=int)

vals = np.array([10000, 5000, 1000])

def get_tuple(n, y):
    for c in range(n + 1):
        for b in range(n + 1 - c):
            a = n - c - b
            nums = np.array([a, b, c])
            yield nums

for nums in get_tuple(n, y):
    if nums @ vals == y:
        print("{} {} {}".format(*nums))
        break
else:
    print("-1 -1 -1")

Fixed submission:
import numpy as np
n, y = np.array(list(input().split()), dtype=int)

vals = np.array([10000, 5000, 1000])

table = []
for c in range(n + 1):
    part = np.zeros((n + 1 - c, 3), dtype=int)
    part[:, 0] = c
    part[:, 1] = np.arange(n + 1 - c)
    table += [part]
table = np.concatenate(table)
table[:, 2] = n - table[:, 0:2].sum(axis=1)

accum = (table * vals).sum(axis=1)
flags = np.where(accum == y)[0]

if len(flags) == 0:
    print("-1 -1 -1")
else:
    nums = table[flags[0]]
    print("{} {} {}".format(*nums))
Buggy python submission (verdict: Runtime Error):
n = int(input())
dat = []
for i in range(n):
  a = int(input())
  if (a in dat)!:
    dat.append(a)
print(len(dat))

Fixed submission:
n = int(input())
dat = []
for i in range(n):
  a = int(input())
  if dat.count(a)==0:
    dat.append(a)
print(len(dat))
Buggy python submission (verdict: Runtime Error):
dat=input()
print(dat.count('1')

Fixed submission:
dat = input()
print(dat.count('1'),end="")

Buggy python submission (verdict: Runtime Error):
dat=str(input().split())
print(dat.count('1')

Fixed submission:
dat = input()
print(dat.count('1'),end="")
Buggy python submission (verdict: Runtime Error):
times = int(input())
ans = 0
type = 1
num = map(int,input().split(" "))
num.sort(reverse=Ture)
for i in num:
    if type % 2:
        ans += i
    else:
        ans -= i
    type += 1
    
print(ans)

Fixed submission:
times = int(input())
ans = 0
type = 1
num = list(map(int,input().split(" ")))
num.sort(reverse=True)
for i in num:
    if type % 2:
        ans += i
    else:
        ans -= i
    type += 1
    
print(ans)