Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys

n = int(input())
r0 = int(input())
r1 = int(input())
max = r1 - r0
min = min(r1, r0)

for i in map(int, sys.stdin.readlines(())):
    if max < i - min:
        max = i - min
        if 0 > i - min:
            min = i
    elif min > i:
        min = 1

Fixed submission:
import sys

n = int(input())
mx = -2000000000
mn = int(input())

for i in map(int, sys.stdin.readlines()):
    mx = max(mx, i - mn)
    mn = min(mn, i)

print(mx)

Buggy python submission (verdict: Runtime Error):
import sys

n = int(input())
r0 = int(input())
r1 = int(input())
max = r1 - r0
min = min(r1, r0)

for i in map(int, sys.stdin.readlines(())):
    if max < i - min:
        max = i - min
        if 0 > i - min:
            min = i
    elif min > i:
        min = 1

Fixed submission:
import sys

n = int(input())
mx = -2000000000
mn = int(input())

for i in map(int, sys.stdin.readlines()):
    mx = max(mx, i - mn)
    mn = min(mn, i)

print(mx)
Buggy python submission (verdict: Runtime Error):
while(1):
    e = int(input())
    if e == 0:
        break
    m = e
    for z in range(100):
        for y in range(1000):
            x = e - y * y - z * z * z
            if 0 > x:
                break
            if m > x + y + z:
                m = x + y + z
    print(m)


Fixed submission:
while(1):
    e = int(input())
    if e == 0:
        break
    m, z = 10 ** 15, 0
    while z**3 <= e:
        y = int((e - z**3) ** 0.5)
        x = e - z**3 - y ** 2
        m = min(m, x + y + z)
        z += 1
    print(m)
Buggy python submission (verdict: Runtime Error):
while(1):
    N, M = map(int, input().split())
    if N == 0 and M == 0:
        break
    H = [int(input()) for i in range(N)]
    HD = [0] * 1500 ** 2
    for i in range(N):
        for j in range(i + 1, N + 1):
            HD[sum(H[i:j])] += 1
    ans = 0
    W = [int(input()) for i in range(M)]
    for i in range(M):
        for j in range(i + 1, M + 1):
            ans += HD[sum(W[i:j])]
    print(ans)


Fixed submission:
while(1):
    N, M = map(int, input().split())
    if N == 0 and M == 0:
        break
    H = [int(input()) for i in range(N)]
    HD = [0] * 1500 ** 2
    for i in range(N):
        tmp = 0
        for j in range(i, N):
            tmp += H[j]
            HD[tmp] += 1
    ans = 0
    W = [int(input()) for i in range(M)]
    for i in range(M):
        tmp = 0
        for j in range(i, M):
            tmp += W[j]
            ans += HD[tmp]
    print(ans)
Buggy python submission (verdict: Runtime Error):
T = int(input())
for t in range(T):
    n, k = map(int, input().split())
    X = list(map(int, input().split()))
    mid = [X[i] - X[i - 1] for i in range(1, n)]
    mid.sort(reverse = True)
    ans = sum(mid)
    for i in range(k-1):
        ans -= mid[i]
        if ans == 0:
            break
    print(ans)


Fixed submission:
for t in range(int(input())):
    n, k = map(int, input().split())
    X = list(map(int, input().split()))
    mid = [X[i] - X[i - 1] for i in range(1, n)]
    mid.sort()
    ans = [0, sum(mid[:n-k])][k<n]
    print(ans)
Buggy python submission (verdict: Runtime Error):
n = input()

r = []
for i in range(n):
    r.append(input())

maxv =  int(-20000000)
minv = int r[0]

for i in ranfe(n)
    maxv = max(maxv, r[i]-minv)
    minv = min(minv, r[i])

print(maxv)



Fixed submission:
n = int(input())

maxv = -10**18
minv = 10**18

for i in range(n):
    r= int(input())
    maxv = max(maxv, r - minv)
    minv = min(minv, r)

print(maxv)

Buggy python submission (verdict: Runtime Error):
n = input()

r = []
for i in range(n):
    r.append(input())

maxv =  int(-20000000)
minv = int(r[0])

for i in ranfe(n):
    maxv = max(maxv, r[i]-minv)
    minv = min(minv, r[i])

print(maxv)



Fixed submission:
n = int(input())

maxv = -10**18
minv = 10**18

for i in range(n):
    r= int(input())
    maxv = max(maxv, r - minv)
    minv = min(minv, r)

print(maxv)

Buggy python submission (verdict: Runtime Error):
n = int(input())

maxv =  int(-20000000)
minv = int(input())

for i in range(n):
    r= int(input())
    maxv = max(maxv, r-minv)
    minv = min(minv, r)

print(maxv)



Fixed submission:
n = int(input())

maxv = -10**18
minv = 10**18

for i in range(n):
    r= int(input())
    maxv = max(maxv, r - minv)
    minv = min(minv, r)

print(maxv)

Buggy python submission (verdict: Runtime Error):
n = int(input())

maxv =  int(-20000000)
minv = int(input())

for i in range(n):
    r= int(input())
    maxv = max(maxv, r - minv)
    minv = min(minv, r)

print(maxv)



Fixed submission:
n = int(input())

maxv = -10**18
minv = 10**18

for i in range(n):
    r= int(input())
    maxv = max(maxv, r - minv)
    minv = min(minv, r)

print(maxv)
Buggy python submission (verdict: Runtime Error):
N,K=map(int, input().strip().split())
X=list(map(int, input().strip().split()))
X.sort(reverse=True)
print(X)
Y=[]
for i in range(len(X)-1):
    Y.append(X[i]-X[i+1])
Y.sort(reverse=True)
del Y[:K-1]
print(Y)
a=0
for i in range(len(Y)):
    a=a+Y[i]
print(a)


Fixed submission:
#カントリーロード
t=int(input())
for i in range(t):
    N,K=map(int, input().split())
    X=list(map(int,input().strip().split()))
    a=[0]
    for j in range(N-1):
        a.append(X[j+1]-X[j])
    b=sorted(a, reverse=True)
    if K>1:
        del b[0:K-1]

    print(sum(b))
Buggy python submission (verdict: Time Limit Exceeded):

class Solve:
    def __init__(self):
        self.N, self.K = [int(i) for i in input().split()]
        self.W = [int(input()) for i in range(self.N)]

        self.a = max(self.W)-1  # >= 0; False
        self.b = sum(self.W)  # <= 10**9; True

    def check(self, P):
        k, p, W = 1, P, [w for w in self.W]
        while W:
            if p >= W[0]:
                p -= W.pop(0)
            elif k < self.K:
                k, p = k+1, P
            else:
                return False
        return True

    def solve(self):
        while self.b - self.a > 1:
            m = (self.a + self.b) // 2
            if self.check(m):
                self.b = m
            else:
                self.a = m
        return self.b

print(Solve().solve())

Fixed submission:

class Solve:
    def __init__(self):
        self.N, self.K = [int(i) for i in input().split()]
        self.W = [int(input()) for i in range(self.N)]

        self.a = max(self.W)-1  # >= 0; False
        self.b = sum(self.W)  # <= 10**9; True

    def check(self, P):
        k, p, W = 1, P, [w for w in self.W]
        for w in W:
            if p >= w:
                p -= w
            elif P >= w and k < self.K:
                k, p = k+1, P-w
            else:
                return False
        return True

    def solve(self):
        while self.b - self.a > 1:
            m = (self.a + self.b) // 2
            if self.check(m):
                self.b = m
            else:
                self.a = m
        return self.b

print(Solve().solve())
Buggy python submission (verdict: Runtime Error):
print(x * x * x)


Fixed submission:
x = int(input())
x = x*x*x
print(x)

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


Fixed submission:
x = int(input())
x = x*x*x
print(x)

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


Fixed submission:
x = int(input())
x = x*x*x
print(x)

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


Fixed submission:
x = int(input())
x = x*x*x
print(x)

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


Fixed submission:
x = int(input())
x = x*x*x
print(x)

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


Fixed submission:
x = int(input())
x = x*x*x
print(x)
Buggy python submission (verdict: Runtime Error):
l = input().split()
x = int(l[0])
y = int(l[1])

print(x * y + " " + 2*x + 2*y)


Fixed submission:
a, b = map(int, input().split())
c=a*b
d=a*2+b*2
print(c, d)

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

print a*b, a*2 + b*2


Fixed submission:
a, b = map(int, input().split())
c=a*b
d=a*2+b*2
print(c, d)

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

print(a*b), (a*2+b*2)


Fixed submission:
a, b = map(int, input().split())
c=a*b
d=a*2+b*2
print(c, d)
Buggy python submission (verdict: Runtime Error):


a, b = map(int, input().split())

if a > b:
    print("a > b")
elif a == b:
    print("a == b")
else
    print("a < b")


Fixed submission:
s=input().split()
a=int(s[0])
b=int(s[1])

if a > b:
    print("a > b")
elif a == b:
    print("a == b")
else:
    print("a < b")

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

if a > b:
    print("a > b")
elif a == b:
    print("a == b")
else
    print("a < b")


Fixed submission:
s=input().split()
a=int(s[0])
b=int(s[1])

if a > b:
    print("a > b")
elif a == b:
    print("a == b")
else:
    print("a < b")

Buggy python submission (verdict: Runtime Error):
s=input().split()
a=s[0]
b=s[1]

if a > b:
    print("a > b")
elif a == b:
    print("a == b")
else
    print("a < b")


Fixed submission:
s=input().split()
a=int(s[0])
b=int(s[1])

if a > b:
    print("a > b")
elif a == b:
    print("a == b")
else:
    print("a < b")
Buggy python submission (verdict: Runtime Error):

w, h, x, y, r = map(int, input().split())

if x >= r and < x <= (w-r):
    if y >= r and y <= (h-r):
        print("Yes")
    else:
        print("No")
else:
    print("No")


Fixed submission:
w, h, x, y, r = map(int, input().split())

if x >= r and x <= (w-r):
    if y >= r and y <= (h-r):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):

w, h, x, y, r = map(int, input().split())

if x >= r and < x <= (w-r):
    if y >= r and y <= (h-r):
        print("Yes")
    else:
        print("No")
else:
    print("No")


Fixed submission:
w, h, x, y, r = map(int, input().split())

if x >= r and x <= (w-r):
    if y >= r and y <= (h-r):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):

w, h, x, y, r = map(int, input().split())

if x >= r and < x <= (w-r):
    if y >= r and y <= (h-r):
        print("Yes")
    else:
        print("No")
else:
    print("No")


Fixed submission:
w, h, x, y, r = map(int, input().split())

if x >= r and x <= (w-r):
    if y >= r and y <= (h-r):
        print("Yes")
    else:
        print("No")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n=0
while i = input() != "0":
    n++
    print("Case " + str(n) + ":" +i)


Fixed submission:
n=0
i = int(input())
while i != 0:
    n+=1
    print("Case " + str(n) + ": " +str(i))
    i = int(input())

Buggy python submission (verdict: Runtime Error):
n=0
while i = input() != "0":
    n+=1
    print("Case " + str(n) + ":" +i)


Fixed submission:
n=0
i = int(input())
while i != 0:
    n+=1
    print("Case " + str(n) + ": " +str(i))
    i = int(input())

Buggy python submission (verdict: Runtime Error):
n=0
while i = input() != "0":
    n+=1
    print("Case " + str(n) + ":" +i)


Fixed submission:
n=0
i = int(input())
while i != 0:
    n+=1
    print("Case " + str(n) + ": " +str(i))
    i = int(input())

Buggy python submission (verdict: Runtime Error):
n=0
i = int(input())
while i != 0:
    n+=1
    print("Case " + str(n) + ":" +i)
    i int(input())


Fixed submission:
n=0
i = int(input())
while i != 0:
    n+=1
    print("Case " + str(n) + ": " +str(i))
    i = int(input())

Buggy python submission (verdict: Runtime Error):
n=0
i = int(input())
while i != 0:
    n+=1
    print("Case " + str(n) + ":" +i)
    i = int(input())


Fixed submission:
n=0
i = int(input())
while i != 0:
    n+=1
    print("Case " + str(n) + ": " +str(i))
    i = int(input())
Buggy python submission (verdict: Time Limit Exceeded):
a, b, c= map(int, input().split())
d=0
while a != b+1:
    if c%a == 0:
        d+=1
        a+=1
print(d)


Fixed submission:
a, b, c= map(int, input().split())
d=0
while a != b+1:
    if c%a == 0:
        d+=1
    a+=1
print(d)
Buggy python submission (verdict: Runtime Error):
a, b= map(int, input().split())
d=int(a/b)
r=a%b
f=a/b
print(a, b, c)


Fixed submission:
a, b= map(int, input().split())
d=a//b
r=a%b
f=a/b
print('{0} {1} {2:.5f}'.format(d, r, f))
Buggy python submission (verdict: Runtime Error):
from math import pi
a=int(input())
print(a*pi)


Fixed submission:
from math import pi
a=float(input())
print(a*a*pi, 2*a*pi)

Buggy python submission (verdict: Runtime Error):
from math import pi
a=2 * int(input())
print(a*pi)


Fixed submission:
from math import pi
a=float(input())
print(a*a*pi, 2*a*pi)
Buggy python submission (verdict: Runtime Error):
a, op, b = input().split()

ans = int(a) op int(b)

print(ans)


Fixed submission:
while 1:
    s=input()
    if '?' in s:break
    print(int(eval(s)))
Buggy python submission (verdict: Runtime Error):
l=input().split()
print(min(l), max(l), sum(l))



Fixed submission:

input()
l=list([int(i) for i in input().split()])
print(min(l), max(l), sum(l))

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


Fixed submission:

input()
l=list([int(i) for i in input().split()])
print(min(l), max(l), sum(l))

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


Fixed submission:

input()
l=list([int(i) for i in input().split()])
print(min(l), max(l), sum(l))
Buggy python submission (verdict: Runtime Error):
while 1:
    a, b = map(int, input().split())
    for i in a:
        for j in b:
            p+="#"
        print(p)


Fixed submission:
while True:
    a, b = map(int, input().split())
    if a == 0: break
    for i in range(a):
        print("#"*b)
    print()

Buggy python submission (verdict: Runtime Error):
while true:
    a, b = map(int, input().split())
    if a == 0 and b == 0 : break
    for i in range(a):
        p=""
        for j in range(b):
            p+="#"
        print(p)




Fixed submission:
while True:
    a, b = map(int, input().split())
    if a == 0: break
    for i in range(a):
        print("#"*b)
    print()
Buggy python submission (verdict: Runtime Error):
while True:
    h, w = map(int, input().split())
    if a == 0: break

    for i in range(h)
        for j in range(w)
            if (i+j) % 2 == 0 : print("#")
            else : print(".")
        print() 
    print()


Fixed submission:

while True:
    h, w = map(int, input().split())
    if h == 0: break

    for i in range(h):
        for j in range(w):
            if (i+j) % 2 == 0 : print("#",end="")
            else : print(".",end="")
        print() 
    print()

Buggy python submission (verdict: Runtime Error):
while True:
    h, w = map(int, input().split())
    if h == 0: break

    for i in range(h)
        for j in range(w)
            if (i+j) % 2 == 0 : print("#")
            else : print(".")
        print() 
    print()



Fixed submission:

while True:
    h, w = map(int, input().split())
    if h == 0: break

    for i in range(h):
        for j in range(w):
            if (i+j) % 2 == 0 : print("#",end="")
            else : print(".",end="")
        print() 
    print()

Buggy python submission (verdict: Runtime Error):

while True:
    h, w = map(int, input().split())
    if h == 0: break

    for i in range(h)
        for j in range(w)
            if (i+j) % 2 == 0 : print("#")
            else : print(".")
        print() 


Fixed submission:

while True:
    h, w = map(int, input().split())
    if h == 0: break

    for i in range(h):
        for j in range(w):
            if (i+j) % 2 == 0 : print("#",end="")
            else : print(".",end="")
        print() 
    print()

Buggy python submission (verdict: Runtime Error):

while True:
    h, w = map(int, input().split())
    if h == 0: break

    for i in range(h)
        for j in range(w)
            if (i+j) % 2 == 0 : print("#",end="")
            else : print(".",end="")
        print() 
    print()



Fixed submission:

while True:
    h, w = map(int, input().split())
    if h == 0: break

    for i in range(h):
        for j in range(w):
            if (i+j) % 2 == 0 : print("#",end="")
            else : print(".",end="")
        print() 
    print()
Buggy python submission (verdict: Runtime Error):

n=int(input())

for i in range(n)
    if i % 3 == 0 or i//10 == 3 :
        print(str(i) + " ")
    else : 



Fixed submission:
n=int(input())
for i in range(n):
    if (i+1) % 3 == 0 or "3" in str(i+1) :
        print(" " + str(i+1), end="")
print()

Buggy python submission (verdict: Runtime Error):

n=int(input())

for i in range(n):
    if i % 3 == 0 or i//10 == 3 :
        print(str(i) + " ")
    else : 



Fixed submission:
n=int(input())
for i in range(n):
    if (i+1) % 3 == 0 or "3" in str(i+1) :
        print(" " + str(i+1), end="")
print()
Buggy python submission (verdict: Runtime Error):

n=int(input())

a=input().split()


for i in range(n):
    out=a[(n-i)]
    print(str(out))
print()


Fixed submission:
n=int(input())

a=input().split()

b=[]
for i in range(n):
    out=a[(n-i-1)]
    b.append(out)
print(" ".join(map(str, b)))
Buggy python submission (verdict: Runtime Error):
def croad():
    n,k = map(int,input().split())
    x = list(map(int,input().split()))
    y = []
    for i in range(n-1):
        y.append(x[i+1]-x[i])
    y.sort()
    y.reverse()
    while k>1:
        y.pop(0)
        k -= 1
    print(sum(y))

a = int(input())
for i in range(a):
    croad()


Fixed submission:
def croad():
    n,k = map(int,input().split())
    x = list(map(int,input().split()))
    y = []
    for i in range(n-1):
        y.append(x[i+1]-x[i])
    y.sort()
    y.reverse()
    while k>1 and len(y)>0:
        y.pop(0)
        k -= 1
    print(sum(y))

a = int(input())
for i in range(a):
    croad()

Buggy python submission (verdict: Runtime Error):
def croad():
    n,k = map(int,input().split())
	if n == 1:
	    print(0)
	else:
        x = list(map(int,input().split()))
        y = []
        for i in range(n-1):
                y.append(x[i+1]-x[i])
        y.sort()
        y.reverse()
        while k>1 and len(y)>0:
            y.pop(0)
            k -= 1
        print(sum(y))

a = int(input())
for i in range(a):
    croad()


Fixed submission:
def croad():
    n,k = map(int,input().split())
    x = list(map(int,input().split()))
    y = []
    for i in range(n-1):
        y.append(x[i+1]-x[i])
    y.sort()
    y.reverse()
    while k>1 and len(y)>0:
        y.pop(0)
        k -= 1
    print(sum(y))

a = int(input())
for i in range(a):
    croad()
Buggy python submission (verdict: Runtime Error):
while True:
    x, y = list(map(int, input().split()))

    if x == 0 and y == 0:


    





Fixed submission:
while True:
    x, y = list(map(int, input().split()))

    if x == 0 and y == 0:
        break

    if x > y:
        print(y, x)
    else:
        print(x, y)
Buggy python submission (verdict: Runtime Error):


import math

pai = math.pi
print(pai)

r = int(input())

print('{:.6f} {:.6f}'.format(pai*r**2,2*pai*r))


Fixed submission:
import math

pai = math.pi

r = float(input())

print('{:.6f} {:.6f}'.format(pai*r**2,2*pai*r))

Buggy python submission (verdict: Runtime Error):
import math

pai = math.pi

r = int(input())

print('{:.6f} {:.6f}'.format(pai*r**2,2*pai*r))


Fixed submission:
import math

pai = math.pi

r = float(input())

print('{:.6f} {:.6f}'.format(pai*r**2,2*pai*r))

Buggy python submission (verdict: Runtime Error):
import math

pai = math.pi

r = int(input())

print('{:.6f} {:.6f}'.format(pai*r**2,2*pai*r))


Fixed submission:
import math

pai = math.pi

r = float(input())

print('{:.6f} {:.6f}'.format(pai*r**2,2*pai*r))
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [input() for i in range(n)]


print(min(a), max(a), sum(a))





Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
 
print(min(a), max(a), sum(a))

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list[map(int.input().split())]
 
 
print(min(a), max(a), sum(a))


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
 
print(min(a), max(a), sum(a))
Buggy python submission (verdict: Time Limit Exceeded):
def fibonacci(n):
    if n == 0 or n == 1:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)
        

print(fibonacci(int(input())))


Fixed submission:
import sys
input = sys.stdin.readline


def inpl():
    return list(map(int, input().split()))


def f(n):
    if n < 2:
        return 1
    ret = [0] * (n + 1)
    ret[0] = 1
    ret[1] = 1
    for i in range(2, n + 1):
        ret[i] = ret[i - 2] + ret[i - 1]
    return ret[n]


print(f(int(input())))
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()

print a*b, (a+b)*2

Fixed submission:
num = raw_input()

list = num.split(" ")

a = int(list[0])
b = int(list[1])

print a*b, (a+b)*2

Buggy python submission (verdict: Runtime Error):
num = raw_input()
a = int(num[0])
b = int(num[2])

print a*b, (a+b)*2

Fixed submission:
num = raw_input()

list = num.split(" ")

a = int(list[0])
b = int(list[1])

print a*b, (a+b)*2
Buggy python submission (verdict: Runtime Error):
if __name__ == "__main__":
    n = input()
    F = []
    F.append(1)
    F.append(1)
    for i in range(2,n+1):
        F.append(F[i-1] + F[i-2])
        print(F[i])

    print(F[n])

Fixed submission:
if __name__ == "__main__":
    n = input()
    F = []
    F.append(1)
    F.append(1)
    for i in range(2,n+1):
        F.append(F[i-1] + F[i-2])

    print(F[n])
Buggy python submission (verdict: Runtime Error):
input(x)
print(x*x*x)


Fixed submission:
x = int(input(''))
print(x*x*x)

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


Fixed submission:
x = int(input(''))
print(x*x*x)
Buggy python submission (verdict: Runtime Error):
a = int(input('tate'))
b = int(input('yoko'))
area = a*b
lenght = 2a + 2b
print(area)
print(lenght)


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

Buggy python submission (verdict: Runtime Error):
a = int(input('tate'))
b = int(input('yoko'))
area = a*b
lenght = 2*a + 2*b
print(area)
print(lenght)


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

Buggy python submission (verdict: Runtime Error):
a = int(input('tate'))
b = int(input('yoko'))
area = a*b
lenght = 2*a + 2*b
print(area)
print(lenght)


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

Buggy python submission (verdict: Runtime Error):
a = int(input('tate')) b = int(input('yoko'))
area = a*b
lenght = 2*a + 2*b
print(area) print(lenght)


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

Buggy python submission (verdict: Runtime Error):
a = int(input('')) b = int(input(''))
area = a*b
lenght = 2*a + 2*b
print(area) print(lenght)


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

if a > b :
	print("a > b")
elif a = b:
	print("a == b")
else : 
	print("a < b")


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

if a > b :
	print("a > b")
elif a == b:
	print("a == b")
else : 
	print("a < b")
Buggy python submission (verdict: Runtime Error):
a = []
x = 1
while True:
    n = input()
    if n == 0:
        break
    a.append(n)
    x += 1
print ("Case",x,":",a) 


Fixed submission:
c = 0
while True:
    x = int(input()); c += 1
    if x == 0: break
    print("Case {}: {}".format(c, x))
Buggy python submission (verdict: Runtime Error):
while True:
	a, b = sorted(map.(int,input().split()))
	if (a == 0) & (b == 0): break
	print(a,b)


Fixed submission:
while True:
    a, b = sorted(map(int, input().split()))
    if (a == 0) & (b == 0): break
    print(a, b)