Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#! python3
# card_game.py

n = int(input())
turns = [input() for i in range(n)]

taro, hanako = 0, 0
for turn in turns:
    t, h = turn.split(' ')
    min_len = len(t) if len(t) <= len(h) else len(h)

    win_flag = 0 # -1: taro, 1: hanako, 0: draw
    for i in range(min_len):
        if ord[t] < ord[h]:
            win_flag = 1
        elif ord[h] < ord[t]:
            win_flag = -1

    if win_flag == 0:
        if len(t) < len(h):
            win_flag = 1
        elif len(h) < len(t):
            win_flag = -1

    if win_flag == -1:
        taro += 3
    elif win_flag == 1:
        hanako += 3
    else:
        taro += 1
        hanako += 1

print(taro, hanako)


Fixed submission:
#! python3
# card_game.py

n = int(input())
turns = [input() for i in range(n)]

taro, hanako = 0, 0
for turn in turns:
    t, h = turn.split(' ')
    min_len = len(t) if len(t) <= len(h) else len(h)

    win_flag = 0 # -1: taro, 1: hanako, 0: draw
    for i in range(min_len):
        if ord(t[i]) < ord(h[i]):
            win_flag = 1
            break
        elif ord(h[i]) < ord(t[i]):
            win_flag = -1
            break

    if win_flag == 0:
        if len(t) < len(h):
            win_flag = 1
        elif len(h) < len(t):
            win_flag = -1

    if win_flag == -1:
        taro += 3
    elif win_flag == 1:
        hanako += 3
    else:
        taro += 1
        hanako += 1

print(taro, hanako)
Buggy python submission (verdict: Runtime Error):
n, q = list(map(int, input().split(' ')))
stacks = [[] for i in range(n)]

for i in range(q):
    op = list(map(int, input().split(' ')))
    if op[0] == 0:
        stacks[op[1]].append(op[2])
    elif op[0] == 1:
        if len(stacks[op[1]]) != 0:
            print(stacks[op[1]][-1])
    elif op[0] == 2:
        stacks[op[1]].pop()


Fixed submission:
n, q = list(map(int, input().split(' ')))
stacks = [[] for i in range(n)]

for i in range(q):
    op = list(map(int, input().split(' ')))
    if op[0] == 0:
        stacks[op[1]].append(op[2])
    elif op[0] == 1:
        if len(stacks[op[1]]) != 0:
            print(stacks[op[1]][-1])
    elif op[0] == 2:
        if len(stacks[op[1]]) != 0:
            stacks[op[1]].pop()
Buggy python submission (verdict: Runtime Error):
nums = list(map(int, input().split(' ')))

max = -float('inf')
min = flaot('inf')
for num in nums:
    if num > max: max = num
    if num < min: min = num

print(min, max)



Fixed submission:
nums = list(map(int, input().split(' ')))

max = -float('inf')
min = float('inf')
for num in nums:
    if num > max: max = num
    if num < min: min = num

print(min, max)
Buggy python submission (verdict: Runtime Error):
n = int(input())
nums = list(map(int, input().split(' ')))

q = int(input())
for i in range(q):
    op =  list(map(int, input().split(' ')))
    if op[0] == 0:
        min = float('inf')
        for num in nums[op[1], op[2]]:
            if num < min: min = num
        print(min)
    elif op[0] == 1:
        max = -float('inf')
        for num in nums[op[1], op[2]]:
            if num < max: max = num
        print(max)


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

q = int(input())
for i in range(q):
    op =  list(map(int, input().split(' ')))
    if op[0] == 0:
        min = float('inf')
        for num in nums[op[1]: op[2]]:
            if num < min: min = num
        print(min)
    elif op[0] == 1:
        max = -float('inf')
        for num in nums[op[1]: op[2]]:
            if num > max: max = num
        print(max)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split(' ')))

def binary_search(val):
    left, right = 0, n-1
    while right - left >= 1:
        mid = (right+left)//2
        if a[mid] == val: return 1
        if a[mid] < val:
            left = mid
        elif val < a[mid]:
            right = mid
    return 0

q = int(input())
for i in range(q):
    k = int(input())
    print(binary_search(k))



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

def binary_search(val):
    left, right = 0, n-1
    while right - left >= 0:
        mid = int((right+left)/2)
        if a[mid] == val: return 1
        if a[mid] < val:
            left = mid+1
        elif val < a[mid]:
            right = mid-1
    return 0

q = int(input())
for i in range(q):
    k = int(input())
    print(binary_search(k))
Buggy python submission (verdict: Runtime Error):
numset = set([])
q = int(input())
for i in range(q):
    query, x = list(map(int, input().split(' ')))
    if query == 0:
        numset.add(x)
        print(len(numset))
    elif query == 1:
        if set([x]).issubset(numset):
            print(1)
        else:
            print(0)
    else:
        numset.remove(x)


Fixed submission:
numset = set([])
q = int(input())
for i in range(q):
    query, x = list(map(int, input().split(' ')))
    if query == 0:
        numset.add(x)
        print(len(numset))
    elif query == 1:
        if set([x]).issubset(numset):
            print(1)
        else:
            print(0)
    else:
        if set([x]).issubset(numset):
            numset.remove(x)
Buggy python submission (verdict: Runtime Error):
dict = {}
q = int(input())
for i in range(q):
    query, *val = input().split(' ')
    if query == '0':
        dict[val[0]] = int(val[1])
    elif query == '1':
        print(dict.get(val[0], 0))
    else:
        dict.pop(val[0])


Fixed submission:
dict = {}
q = int(input())
for i in range(q):
    query, *val = input().split(' ')
    if query == '0':
        dict[val[0]] = int(val[1])
    elif query == '1':
        print(dict.get(val[0], 0))
    else:
        if val[0] in dict:
            dict.pop(val[0])
Buggy python submission (verdict: Runtime Error):
def simple_prime_factrize(x):
    pfs = []
    for y in range(2, math.ceil(math.sqrt(x))):
        if x == 1: break
        while True:
            if x%y == 0:
                pfs.append(y)
                x = x/y
            else:
                break
    if len(pfs) == 0:
        pfs.append(x)
    return pfs
    
n = int(input())
print(str(n) + ': ' + ' '.join([str(x) for x in simple_prime_factrize(n)]))


Fixed submission:
import math

def simple_prime_factrize(x):
    pfs = []
    s = math.sqrt(x)
    for y in range(2, math.ceil(s)):
        if x == 1: break
        while True:
            if x%y == 0:
                pfs.append(y)
                x = x/y
            else:
                break
    if len(pfs) == 0:
        pfs.append(x)
    elif x > s:
        pfs.append(int(x))
    return pfs
    
n = int(input())
print(str(n) + ': ' + ' '.join([str(x) for x in simple_prime_factrize(n)]))
Buggy python submission (verdict: Time Limit Exceeded):
MAX = 1000000007

m, n = [int(x) for x in input().split(' ')]
bi_n = bin(n)

ans = 1
dig = m
for i in range(len(bi_n)-1, 1, -1):
    if bi_n[i] == '1':
        ans *= dig
    dig *= dig
    if ans >= MAX:
        ans %= MAX

print(ans)


Fixed submission:
MAX = 1000000007

m, n = [int(x) for x in input().split(' ')]
bi_n = bin(n)

ans = 1
dig = m
for i in range(len(bi_n)-1, 1, -1):
    if bi_n[i] == '1': ans *= dig
    if ans >= MAX: ans %= MAX
    dig *= dig
    if dig >= MAX: dig %= MAX

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
def gcd(a, b):
    x, y = [a, b] if a > b else [b, a]
    while y:
        x, y = y, x%y
    return x

a, b = list(map(int, input().split(' ')))
c = gcd(a, b)
a, b = a//c, b//c

x = 0
y = None
while True:
    tmp = (1-a*x)/b
    if tmp == int(tmp):
        y = int(tmp)
        break
        
    x *= -1
    tmp = (1-a*x)/b
    if tmp == int(tmp):
        y = int(tmp)
        break
    x *= -1
    x += 1

print(x, y)


Fixed submission:
def gcd(a, b):
    x, y = [a, b] if a > b else [b, a]
    while y:
        x, y = y, x%y
    return x

def solve(a, b):
    if b == 1:
        return 0, 1
    elif a == 1:
        return 1, 0

    A, B, Q, R = [a], [b], [b//a], [b%a]
    i = 0
    while R[i] != 0:
        B.append(A[i])
        A.append(R[i])
        Q.append(B[i+1]//A[i+1])
        R.append(B[i+1]%A[i+1])
        i += 1

    x, y = -1*Q[len(Q)-2], 1
    for i in range(len(A)-3, -1, -1):
        x, y = y - x*Q[i], x

    return x, y

a, b = list(map(int, input().split(' ')))
c = gcd(a, b)
a, b = a//c, b//c

x, y = solve(a,b)
print(x, y)
Buggy python submission (verdict: Runtime Error):
print(x**3)


Fixed submission:
number = int(input())
print(number**3)

Buggy python submission (verdict: Runtime Error):
number = input(int())
print(number**3)


Fixed submission:
number = int(input())
print(number**3)
Buggy python submission (verdict: Runtime Error):
n = input()
a, b = n.split()
x = a * b
y = 2 * (a + b)
print(x, y)


Fixed submission:
n = input()
a, b = n.split()
a = int(a)
b = int(b)
x = a * b
y = 2 * (a + b)
print(x, y)

Buggy python submission (verdict: Runtime Error):
n = input()
a, b = int(n.split())
x = a * b
y = 2 * (a + b)
print(x, y)


Fixed submission:
n = input()
a, b = n.split()
a = int(a)
b = int(b)
x = a * b
y = 2 * (a + b)
print(x, y)
Buggy python submission (verdict: Runtime Error):
S = int(input())
h = S // 3600
m = (S % 3600) // 60
s = (S % 3600) % 60
print(':'.join[h, m, s])


Fixed submission:
S = int(input())
h = S // 3600
m = (S % 3600) // 60
s = (S % 3600) % 60
print(str(h) + ':' + str(m) + ':' + str(s))
Buggy python submission (verdict: Runtime Error):
x = [int(x) for x in input().split()]
print('{} {} {}'.format(sorted(x)))


Fixed submission:
x = [int(x) for x in input().split()]
a, b, c = sorted(x)
print('{} {} {}'.format(a, b, c))
Buggy python submission (verdict: Runtime Error):
i = 0
While True:
    x = int(input())
    if x == 0:
        break
    else:
        i += 1
        print('Case {}: {}'.format(i, x))


Fixed submission:
i = 0
while True:
    x = int(input())
    if x == 0:
        break
    else:
        i += 1
        print('Case {}: {}'.format(i, x))
Buggy python submission (verdict: Runtime Error):
r= int(input())
print(r**2*math.pi, r*2*math.pi)


Fixed submission:
import math
r = float(input())
print('{} {}'.format(r**2*math.pi, r*2*math.pi))

Buggy python submission (verdict: Runtime Error):
import math
r= int(input())
print(r**2*math.pi, r*2*math.pi)


Fixed submission:
import math
r = float(input())
print('{} {}'.format(r**2*math.pi, r*2*math.pi))

Buggy python submission (verdict: Runtime Error):
import math
r= int(input())
print(r**2*math.pi, r*2*math.pi)


Fixed submission:
import math
r = float(input())
print('{} {}'.format(r**2*math.pi, r*2*math.pi))

Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
print(r**2*math.pi, r*2*math.pi)


Fixed submission:
import math
r = float(input())
print('{} {}'.format(r**2*math.pi, r*2*math.pi))
Buggy python submission (verdict: Runtime Error):
a, b = input().split('\n')
x = [int(i) for i in b.split()]
print(min(x), max(x), sum(x))


Fixed submission:
n = int(input())
x = [int(v) for v in input().split()]
print(min(x), max(x), sum(x))

Buggy python submission (verdict: Runtime Error):
a, b = input().split()
x = [int(i) for i in b.split()]
print(min(x), max(x), sum(x))


Fixed submission:
n = int(input())
x = [int(v) for v in input().split()]
print(min(x), max(x), sum(x))

Buggy python submission (verdict: Runtime Error):
x = [int(v) for v in input().split()]
del x[0]
print(min(x), max(x), sum(x))


Fixed submission:
n = int(input())
x = [int(v) for v in input().split()]
print(min(x), max(x), sum(x))

Buggy python submission (verdict: Runtime Error):
x = [int(v) for v in input().split()]
del x[0]
print(min(x), max(x), sum(x))


Fixed submission:
n = int(input())
x = [int(v) for v in input().split()]
print(min(x), max(x), sum(x))
Buggy python submission (verdict: Runtime Error):
all_set = ['S ' + str(i) for i in range(1, 14)]　+ ['H ' + str(i) for i in range(1, 14)] + ['C ' + str(i) for i in range(1, 14)] + ['D ' + str(i) for i in range(1, 14)]
r = int(input())

for _ in range(r):
    x = input()
    if x in all_set:
        del all_set[all_set.index(x)]
        
for i in all_set:
    print(i)


Fixed submission:
all_set = ['S ' + str(i) for i in range(1, 14)] + ['H ' + str(i) for i in range(1, 14)] + ['C ' + str(i) for i in range(1, 14)] + ['D ' + str(i) for i in range(1, 14)]
r = int(input())

for _ in range(r):
    x = input()
    if x in all_set:
        del all_set[all_set.index(x)]
        
for i in all_set:
    print(i)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
n_l = []
ans = [0, 0, 0]

for _ in range(n):
    l = list(map(int, input().split()))
    n_l.append(l)
for x in range(m):
    p = int(input())
    n_l[:,0] * p
for i in n_l:
    print(sum(i))


Fixed submission:
n, m = map(int, input().split())
n_l = []
ans = [0, 0, 0]

for _ in range(n):
    l = list(map(int, input().split()))
    n_l.append(l)
for x in range(m):
    p = int(input())
    for o in range(n):
        n_l[o][x] *= p
for i in n_l:
    print(sum(i))

Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
n_l = []
ans = [0, 0, 0]

for _ in range(n):
    l = list(map(int, input().split()))
    n_l.append(l)
for x in range(m):
    p = int(input())
    n_l[0:][x]
for i in n_l:
    print(sum(i))


Fixed submission:
n, m = map(int, input().split())
n_l = []
ans = [0, 0, 0]

for _ in range(n):
    l = list(map(int, input().split()))
    n_l.append(l)
for x in range(m):
    p = int(input())
    for o in range(n):
        n_l[o][x] *= p
for i in n_l:
    print(sum(i))

Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
n_l = []
ans = [0, 0, 0]

for _ in range(n):
    l = list(map(int, input().split()))
    n_l.append(l)
for x in range(m):
    p = int(input())
    n_l[:][:][x]
for i in n_l:
    print(sum(i))


Fixed submission:
n, m = map(int, input().split())
n_l = []
ans = [0, 0, 0]

for _ in range(n):
    l = list(map(int, input().split()))
    n_l.append(l)
for x in range(m):
    p = int(input())
    for o in range(n):
        n_l[o][x] *= p
for i in n_l:
    print(sum(i))

Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
n_l = []
ans = [0, 0, 0]

for _ in range(n):
    l = list(map(int, input().split()))
    n_l.append(l)
for x in range(m):
    p = int(input())
    for o in n:
        n_l[o] *= p
for i in n_l:
    print(sum(i))


Fixed submission:
n, m = map(int, input().split())
n_l = []
ans = [0, 0, 0]

for _ in range(n):
    l = list(map(int, input().split()))
    n_l.append(l)
for x in range(m):
    p = int(input())
    for o in range(n):
        n_l[o][x] *= p
for i in n_l:
    print(sum(i))
Buggy python submission (verdict: Runtime Error):
n = 0
while 1:
    a, b = map(int, input().split())
    if a == 0 and b == 0:
        break
    else:
        for i in range(1, a+1):
            for j in range(1, i):
                for k in range(1, j):
                    if i + j + k = b:
                        n += 1
        print(n)
        


Fixed submission:
while True:
  n, x = map(int, input().split())
  if n==0 and x==0:
    break
  ans = 0
  for i in range(1, n-1):
      for j in range(i+1, n):
          for k in range(j+1, n+1):
              if i+j+k==x:
                  ans+=1
  print(ans)
Buggy python submission (verdict: Runtime Error):
a=input()
b=a.split()
plint(b)


Fixed submission:
a=input()
b=a.split()
c=list()
for d in b:
    c.append(int(d))
d=sorted(c)
print(d[0],d[1],d[2])

Buggy python submission (verdict: Runtime Error):
a=input()
b=a.split()
plint(sorted.b)


Fixed submission:
a=input()
b=a.split()
c=list()
for d in b:
    c.append(int(d))
d=sorted(c)
print(d[0],d[1],d[2])

Buggy python submission (verdict: Runtime Error):
a=input()
b=a.split()
c=sorted(b)
print(c[0,1,2])



Fixed submission:
a=input()
b=a.split()
c=list()
for d in b:
    c.append(int(d))
d=sorted(c)
print(d[0],d[1],d[2])

Buggy python submission (verdict: Runtime Error):
a=input()
    b=a.split()
    c=list()
    for d in b:
        c.append(int(d))
    d=sorted(c)
    print(d[0],d[1],d[2])



Fixed submission:
a=input()
b=a.split()
c=list()
for d in b:
    c.append(int(d))
d=sorted(c)
print(d[0],d[1],d[2])
Buggy python submission (verdict: Runtime Error):
count=0
while true:
    count+=1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case",count+":",a)


Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count=count+1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case",count,":",a)


Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count=count+1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case",count,":",a)



Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count=count+1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case "+count+": "+a)



Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count=count+1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case "+str(count)+": "+str*(a))



Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count=count+1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))



Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count=count+1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))



Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count=count+1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))



Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count=count+1
    a=input()
    b=len(a)
    if b==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))



Fixed submission:
count=0
while True:
    count=count+1
    a=input()
    if int(a)==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))
Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
print(math.pi*r*r, 2*math.pi*r)

Fixed submission:
import math
r = float(input())
print(math.pi*r*r, 2*math.pi*r)
Buggy python submission (verdict: Runtime Error):
def solve(n,x):
    count = 0
    for i in range(1,n+1):
        for j in range(i+1,n+1):
            k = x - i -j
            if j < b and b <= n:
                count += 1
    return count//6

while True:
    n,x = map(int,input().split())
    if n == x == 0:
        break;
    print(solve(n,x))

Fixed submission:
def solve(n,x):
    count = 0
    for i in range(1,n+1):
        for j in range(i+1,n+1):
            k = x - i - j
            if j < k and k <= n:
                count += 1
    return count

while True:
    n,x = map(int,input().split())
    if n == x == 0:
        break;
    print(solve(n,x))
Buggy python submission (verdict: Runtime Error):
r,c = map(int,input().split())
mat = [[i for i in map(int,input().split())] for _ in range(4)]
c_sum = [0 for _ in range(c+1)]
for i in mat :
    i.append(sum(i))
    for j in range(len(i)) :
        c_sum[j] += i[j]
    
mat.append(c_sum)
for i in mat :
    print(" ".join(list(map(str,i))))
    
    

Fixed submission:
r,c = map(int,input().split())
mat = [[i for i in map(int,input().split())] for _ in range(r)]
c_sum = [0 for _ in range(c+1)]
for i in mat :
    i.append(sum(i))
    for j in range(len(i)) :
        c_sum[j] += i[j]
    
mat.append(c_sum)
for i in mat :
    print(" ".join(list(map(str,i))))
Buggy python submission (verdict: Runtime Error):
n,m,l = map(int,input().split())
a = []
b = []
for _ in range(n):
    a.append(list(map(int,input().split())))
for _ in range(m):
    b.append(list(map(int,input().split())))
c = [[0 for _ in range(n)] for _ in range(l)]

for i in range(n):
    for j in range(m):
        for k in range(l):
            c[i][k] += a[i][j]*b[j][k]

for i in c:
    print(" ".join(list(map(str,i))))

Fixed submission:
n,m,l = map(int,input().split())
a = []
b = []
for _ in range(n):
    a.append(list(map(int,input().split())))
for _ in range(m):
    b.append(list(map(int,input().split())))
c = [[0 for _ in range(l)] for _ in range(n)]

for i in range(n):
    for j in range(m):
        for k in range(l):
            c[i][k] += a[i][j]*b[j][k]

for i in c:
    print(" ".join(list(map(str,i))))
Buggy python submission (verdict: Runtime Error):
alpha = "abcdefghijklmnopqrstuvwxyz"
counts = {key:0 for key in alpha} 
while True:
    t = input()
    if t == "":
        break
    for s in t:
        c = s.lower()
        if c in alpha :
            counts[c] += 1

for key in sorted(counts):
    print(key+" : "+str(counts[key]))

Fixed submission:
import sys
alpha = "abcdefghijklmnopqrstuvwxyz"
dic = {c:0 for c in alpha}

t = sys.stdin.read()
for s in t:
    s = s.lower()
    if s in alpha :
        dic[s] += 1

for key in sorted(dic):
    print("{} : {}".format(key,dic[key]))
Buggy python submission (verdict: Runtime Error):
a = raw_input()
x = int(a[0])
y = int(a[2])
s = x * y
l = 2 * x + 2 * y
print s,l

Fixed submission:
b = raw_input()
a = b.split()
#print a[1]
x = int(a[0])
y = int(a[1])
s = x * y
l = 2 * x + 2 * y
print s,l
Buggy python submission (verdict: Runtime Error):
x**3


Fixed submission:
n =int( input())
print(n**3)

Buggy python submission (verdict: Runtime Error):
x = input()
print(x ** 3)

Fixed submission:
print(int(input())**3)
Buggy python submission (verdict: Runtime Error):
x, y = map(int, read().split())
print(x*y, 2*(x+y))

Fixed submission:
a, b = map(int, input().split())
print("{} {}".format(a*b, (a+b)*2))