Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
x,y=map(int,input().split())
if x<y:
    x,y=y,x

z = x % y
if x==y:
    print(x)
else:
    gcd=0
    for i in range(1,z+1):
        if z % i ==0 and y % i ==0:
            gcd=i
    print(gcd)



Fixed submission:
def calc_gcd(a,b):
    if a < b:
        a,b=b,a
    if b == 0:
        return a
    return calc_gcd(b,a%b)

x,y=map(int,input().split())
print("%d"%(calc_gcd(x,y)))

Buggy python submission (verdict: Runtime Error):
def calc_gcd(a,b):
    if a < b:
        a,b=b,a
    if b == a:
        return a
    return calc_gcd(b,a%b)

x,y=map(int,input().split())
print("%d"%(calc_(x,y)))



Fixed submission:
def calc_gcd(a,b):
    if a < b:
        a,b=b,a
    if b == 0:
        return a
    return calc_gcd(b,a%b)

x,y=map(int,input().split())
print("%d"%(calc_gcd(x,y)))

Buggy python submission (verdict: Runtime Error):
def calc_gcd(a,b):
    if a < b:
        a,b=b,a
    if b == a:
        return a
    return calc_gcd(b,a%b)

x,y=map(int,input().split())
print("%d"%(calc_gcd(x,y)))



Fixed submission:
def calc_gcd(a,b):
    if a < b:
        a,b=b,a
    if b == 0:
        return a
    return calc_gcd(b,a%b)

x,y=map(int,input().split())
print("%d"%(calc_gcd(x,y)))
Buggy python submission (verdict: Runtime Error):
n,m,l=map(int,input().split())
A=[list(map(int,input().split())) for i in range(n)]
B=[list(map(int,input().split())) for i in range(m)]
C=[[0]*l for i in range(n)]

for x in range(n):
    for y in range(m):
        for z in range(l):
            C[x][y] += A[x][z]*B[z][y]

for row in range(n):
    print("%d"%(C[row][0]).end="")
    for col in range(1,l):
        print(" %d"%(C[row][col]),end="")
    print()



Fixed submission:
n,m,l=map(int,input().split())
A=[list(map(int,input().split())) for i in range(n)]
B=[list(map(int,input().split())) for i in range(m)]
C=[[0]*l for i in range(n)]

for x in range(n):
    for y in range(l):
        for z in range(m):
            C[x][y] += A[x][z]*B[z][y]

for row in range(n):
    print("%d"%(C[row][0]),end="")
    for col in range(1,l):
        print(" %d"%(C[row][col]),end="")
    print()

Buggy python submission (verdict: Runtime Error):
n,m,l=map(int,input().split())
A=[list(map(int,input().split())) for i in range(n)]
B=[list(map(int,input().split())) for i in range(m)]
C=[[0]*l for i in range(n)]

for x in range(n):
    for y in range(m):
        for z in range(l):
            C[x][y] += A[x][z]*B[z][y]

for row in range(n):
    print("%d"%(C[row][0]),end="")
    for col in range(1,l):
        print(" %d"%(C[row][col]),end="")
    print()



Fixed submission:
n,m,l=map(int,input().split())
A=[list(map(int,input().split())) for i in range(n)]
B=[list(map(int,input().split())) for i in range(m)]
C=[[0]*l for i in range(n)]

for x in range(n):
    for y in range(l):
        for z in range(m):
            C[x][y] += A[x][z]*B[z][y]

for row in range(n):
    print("%d"%(C[row][0]),end="")
    for col in range(1,l):
        print(" %d"%(C[row][col]),end="")
    print()
Buggy python submission (verdict: Runtime Error):
Target=input()
Target.swapcases()
print(Target)



Fixed submission:
target=input()
Ans=target.swapcase()
print(Ans)
Buggy python submission (verdict: Runtime Error):
while True:
    table=str(input())
    if table[0] == '0':
        break
    print(sum(int(num) for num in table(num)))



Fixed submission:
while True:
    table=str(input())
    if table[0] == '0':
        break
    print(sum(int(num) for num in(table)))
Buggy python submission (verdict: Runtime Error):
import sys

letter="abcdefghijklmnopqrstuvwxyz"
table=[]*26
input_str=sys.stdin.read()

for A in input_str:
    index=0
    for B in letter:
        if A == B or A == B.upper():
            table[index] += 1
            break
        index += 1

for i in ragne(len(letter)):
    print("%s : %d"%(letter[i],table[i]))



Fixed submission:
letter="abcdefghijklmnopqrstuvwxyz"
table=[0]*26
while True:
    try:
        input_str=input()
    except:
        break
    for A in input_str:
        index=0
        for B in letter:
            if A == B or A == B.upper():
                table[index] += 1
                break
            index += 1

for i in range(len(letter)):
    print("%s : %d"%(letter[i],table[i]))

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

letter="abcdefghijklmnopqrstuvwxyz"
While True
    table=[0]*26
    try:
        input_str=input()
    except:
        break    
    for A in input_str:
        index=0
        for B in letter:
            if A == B or A == B.upper():
                table[index] += 1
                break
                index += 1

    for i in range(len(letter)):
        print("%s : %d"%(letter[i],table[i]))



Fixed submission:
letter="abcdefghijklmnopqrstuvwxyz"
table=[0]*26
while True:
    try:
        input_str=input()
    except:
        break
    for A in input_str:
        index=0
        for B in letter:
            if A == B or A == B.upper():
                table[index] += 1
                break
            index += 1

for i in range(len(letter)):
    print("%s : %d"%(letter[i],table[i]))

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

letter="abcdefghijklmnopqrstuvwxyz"
While True:
    table=[0]*26
    try:
        input_str=input()
    except:
        break
    for A in input_str:
        index=0
        for B in letter:
            if A == B or A == B.upper():
                table[index] += 1
                break
                index += 1

    for i in range(len(letter)):
        print("%s : %d"%(letter[i],table[i]))



Fixed submission:
letter="abcdefghijklmnopqrstuvwxyz"
table=[0]*26
while True:
    try:
        input_str=input()
    except:
        break
    for A in input_str:
        index=0
        for B in letter:
            if A == B or A == B.upper():
                table[index] += 1
                break
            index += 1

for i in range(len(letter)):
    print("%s : %d"%(letter[i],table[i]))
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
#coding:utf-8

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

maxdata = data[1] - data[0]

for i,n in enumerate(data):
    if len(data[i:]) == 1 :
        break

    nowdata = max(data[i+1:])-n
    if maxdata < nowdata:
        maxdata = nowdata

print(maxdata)


Fixed submission:
#!/usr/bin/env python3
#coding:utf-8

n = int(input())
ans = -10000000000
mini = 10000000000

for i in range(n):
    x = int(input())
    ans = ans if (x-mini) < ans else x-mini
    mini = mini if x > mini else x

print(ans)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
# coding: utf-8

class Dice() :

    mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),
            'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1),'CW':(0,2,4,1,3,5)}

    way = ("N","E","W","S","CW","Nop")

    def __init__(self, data):
        self.label = data

    def move(self, data):
        if data == "Nop"
            return
        self.label = [self.label[idx] for idx in self.mask[data]]

    def get_up(self):
        return self.label[0]

    def compare_6sq(self, dice2):
        check = True
        for i in range(6):
            if self.label[i] == dice2.label[i] :
                continue
            else:
                check = False
                break

        return check
    
    def compare_4rot(self, dice2):
        ok = False
        for i in range(4):
            self.move("CW")
            if self.compare_6sq(dice2) :
                ok =True
                break
        return ok
    
    def compare(self,dice2)
        ok = False
        orderway =("Nop","E","N","E","N","E")

        for s in orderway:
            self.move(s)
            if self.compare_4rot(dice2):
                ok = True
                break
        
        return ok





dice1 = Dice(input().split())
dice2 = Dice(input().split())

if dice1.compare(dice2) :
    print ("Yes")
else:
    print ("No")



Fixed submission:
#!/usr/bin/env python3
# coding: utf-8
import random


class Dice() :

    mask = {'N':(1,5,2,3,0,4), 'E':(3,1,0,5,4,2),
            'W':(2,1,5,0,4,3), 'S':(4,0,2,3,5,1),'CW':(0,2,4,1,3,5)}

    way = ("N","E","W","S","CW","Nop")

    def __init__(self, data):
        self.label = data

    def move(self, data):
        if data == "Nop":
            return
        self.label = [self.label[idx] for idx in self.mask[data]]

    def get_up(self):
        return self.label[0]

    def compare_6sq(self, dice2):
        check = True
        for i in range(6):
            if self.label[i] == dice2.label[i] :
                continue
            else:
                check = False
                break

        return check
    
    def compare_4rot(self, dice2):
        ok = False
        for i in range(4):
            self.move("CW")
            if self.compare_6sq(dice2) :
                ok =True
                break
        return ok
    
    def compare(self,dice2):
        ok = False
        orderway =("Nop","E","N","E","N","E")

        for s in orderway:
            self.move(s)
            if self.compare_4rot(dice2):
                ok = True
                break
        
        return ok





dice1 = Dice(input().split())
dice2 = Dice(input().split())

if dice1.compare(dice2) :
    print ("Yes")
else:
    print ("No")
Buggy python submission (verdict: Time Limit Exceeded):
x,y=map(int,input().split())

def gg(a,b):
    for d in range(b,0,-1):
        #print(d)
        if a%d==0 and b%d==0:
            return d
if x>y:
    print(gg(x,y))
else:
    print(gg(y,x))



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

def gg(a,b):
    if a%b==0 and b%b==0:
        return b
    return gg(b,a%b)

if x>y:
    print(gg(x,y))
else:
    print(gg(y,x))

Buggy python submission (verdict: Runtime Error):
data = list(map(int,input().split()))
if(data[0] < data[1]): data[0],data[1] = data[1],data[0]
z = data[0] % data[1]
gcd = 0
for i in range(1,z):
    if(z%i == 0 and y%i == 0 and gcd < i): gcd = i
print(gcd)


Fixed submission:
data = list(map(int,input().split()))
if(data[0] < data[1]): data[0],data[1] = data[1],data[0]

def gcd(x,y):
    return x if y == 0 else gcd(y,x%y)

print(gcd(data[0],data[1]))

Buggy python submission (verdict: Runtime Error):
data = list(map(int,input().split()))
if(data[0] < data[1]): data[0],data[1] = data[1],data[0]
z = data[0] % data[1]

def gcd(x,y):
    return x if y == 0 else gcd(y,x%y)

else: print(gcd)


Fixed submission:
data = list(map(int,input().split()))
if(data[0] < data[1]): data[0],data[1] = data[1],data[0]

def gcd(x,y):
    return x if y == 0 else gcd(y,x%y)

print(gcd(data[0],data[1]))

Buggy python submission (verdict: Runtime Error):
data = list(map(int,input().split()))
if(data[0] < data[1]): data[0],data[1] = data[1],data[0]

def gcd(x,y):
    return x if y == 0 else gcd(y,x%y)

else: print(gcd(data[0],data[1]))


Fixed submission:
data = list(map(int,input().split()))
if(data[0] < data[1]): data[0],data[1] = data[1],data[0]

def gcd(x,y):
    return x if y == 0 else gcd(y,x%y)

print(gcd(data[0],data[1]))
Buggy python submission (verdict: Runtime Error):
n = inta(input())
c = 0
for _ in range(n):
    data = int(input())
    for i in range(2,data):
        if(data%i == 0):
            c += 1
            break
print(c)


Fixed submission:
def is_prime(n):
    for i in range(2,n):
        if i*i > n:
            return True
        if n%i == 0:
            return False
    return True
c = 0
n = int(input())
for _ in range(n):
    data = int(input())
    if is_prime(data): c+= 1
print(c)
Buggy python submission (verdict: Runtime Error):
a,b = -1e11,1e11
for _ in int(input()):
    data = int(input())
    a,b = max(a,c-b),min(b,c)
print(a)


Fixed submission:
a,b = -1e11,1e11
for _ in range(int(input())):
    c = int(input())
    a,b = max(a,c-b),min(b,c)
print(a)

Buggy python submission (verdict: Runtime Error):
a,b = -1e11,1e11
for _ in range(int(input())):
    data = int(input())
    a,b = max(a,c-b),min(b,c)
print(a)


Fixed submission:
a,b = -1e11,1e11
for _ in range(int(input())):
    c = int(input())
    a,b = max(a,c-b),min(b,c)
print(a)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split())

c = 0
while flag:
    flag = False
    for j in range(n-1,1,-1):
        if(a[j] < a[j-1]):
            a[j],a[j-1] = a[j-1],a[j]
            flag = 1
            c += 1
print(*a)
print(c)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
flag = True
c = 0
while flag:
    flag = False
    for j in range(n-1,0,-1):
        if(a[j] < a[j-1]):
            a[j],a[j-1] = a[j-1],a[j]
            flag = True
            c += 1
print(*a)
print(c)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split())
flag = True
c = 0
while flag:
    flag = False
    for j in range(n-1,1,-1):
        if(a[j] < a[j-1]):
            a[j],a[j-1] = a[j-1],a[j]
            flag = 1
            c += 1
print(*a)
print(c)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
flag = True
c = 0
while flag:
    flag = False
    for j in range(n-1,0,-1):
        if(a[j] < a[j-1]):
            a[j],a[j-1] = a[j-1],a[j]
            flag = True
            c += 1
print(*a)
print(c)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input()))
c = 0
min = 9
for i in range(0,n):
    minj = i
    for j in range(i+1,n):
        if a[j] < a[minj]:
            minj = j
    a[i],a[minj] = a[minj],a[j]
    c += 1
print(*a)
print(c)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
c = 0
min = 0
for i in range(n):
    minj = i
    for j in range(i,n):
        if a[j] < a[minj]:
            minj = j
    if(i != minj):
        a[i],a[minj] = a[minj],a[i]
        c += 1
    
print(*a)
print(c)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input()))
c = 0
min = 9
for i in range(0,n):
    minj = i
    for j in range(i+1,n):
        if a[j] < a[minj]:
            minj = j
    a[i],a[minj] = a[minj],a[j]
    c += 1
    
print(*a)
print(c)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
c = 0
min = 0
for i in range(n):
    minj = i
    for j in range(i,n):
        if a[j] < a[minj]:
            minj = j
    if(i != minj):
        a[i],a[minj] = a[minj],a[i]
        c += 1
    
print(*a)
print(c)
Buggy python submission (verdict: Runtime Error):
from collections import deque
n = int(input())
dList = deque()

for _ in range(n):
  op = list(map(str,input().split()))
  if(op[0] == "insert"):
    dList.appendleft(op[1])
  elif(op[0] == "delete"):
    try:
        dList.remove(op[1])
    except:
        pass
  elif(op[0] == "deleteFirst"):
    dList.popleft()
  elif(op[0] == "deleteLast") :
    dList.pop()

print(*dList[1])



Fixed submission:

import collections,sys
def s():
  d = collections.deque()
  input()
  for e in sys.stdin:
    if "i"==e[0]: d.appendleft(e[7:-1])
    else:
      if " "==e[6]:
        m = e[7:0-1]
        if m in d: d.remove(m)
      elif "i"==e[7]: d.popleft()
      else: d.pop()
  print(*d)

s()

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
n = int(input())
dList = deque()

for _ in range(n):
  op = list(map(str,input().split()))
  if(op[0] == "insert"):
    dList.appendleft(op[1])
  elif(op[0] == "delete"):
    try:
        dList.remove(op[1])
    except:
        pass
  elif(op[0] == "deleteFirst"):
    dList.popleft()
  elif(op[0] == "deleteLast") :
    dList.pop()

print(*dList)



Fixed submission:

import collections,sys
def s():
  d = collections.deque()
  input()
  for e in sys.stdin:
    if "i"==e[0]: d.appendleft(e[7:-1])
    else:
      if " "==e[6]:
        m = e[7:0-1]
        if m in d: d.remove(m)
      elif "i"==e[7]: d.popleft()
      else: d.pop()
  print(*d)

s()

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
n = int(input())
dList = deque()

for _ in range(n):
  op = list(map(str,input().split()))
  if(op[0] == "insert"):
    dList.appendleft(op[1])
  elif(op[0] == "delete"):
    try:
        dList.remove(op[1])
    except:
        pass
  elif(op[0] == "deleteFirst"):
    dList.popleft()
  elif(op[0] == "deleteLast") :
    dList.pop()

print(*dList)



Fixed submission:

import collections,sys
def s():
  d = collections.deque()
  input()
  for e in sys.stdin:
    if "i"==e[0]: d.appendleft(e[7:-1])
    else:
      if " "==e[6]:
        m = e[7:0-1]
        if m in d: d.remove(m)
      elif "i"==e[7]: d.popleft()
      else: d.pop()
  print(*d)

s()
Buggy python submission (verdict: Runtime Error):
import math
data = list(map(int,input().split()))
print("%f" %(math.sqrt(abs(data[0]-data[2])**2 + abs(data[1]-data[3]**2))))


Fixed submission:
import math
data = list(map(float,input().split()))
print("%f" %(math.sqrt(abs(data[0]-data[2])**2 + abs(data[1]-data[3])**2)))
Buggy python submission (verdict: Runtime Error):
from math import *
data = list(map(int,input().split()))
print("%f %f %f" %(b*cos(radians(c))*a/2,a+b+b*sin(radians(c)),b*sin(radians(c))))


Fixed submission:
from math import *
a,b,c = map(int,input().split())
c = radians(c)
S = a*b*sin(c)/2
print("%.10f %.10f %.10f" %(S,a+b+sqrt(a*a+b*b-2*a*b*cos(c)),2*S/a ))

Buggy python submission (verdict: Runtime Error):
from math import *
a,b,c = int(input().split())
print("%f %f %f" %(b*cos(radians(c))*a/2,a+b+b*sin(radians(c)),b*sin(radians(c))))


Fixed submission:
from math import *
a,b,c = map(int,input().split())
c = radians(c)
S = a*b*sin(c)/2
print("%.10f %.10f %.10f" %(S,a+b+sqrt(a*a+b*b-2*a*b*cos(c)),2*S/a ))

Buggy python submission (verdict: Runtime Error):
from math import *
a,b,c = map(int,input().split())
c = radians(c)
S = a*b*sin(c)/2
print("%f %f %f" %(S,sqrt(a*a+b*b-2*a*b*cos(c),2*S/a )))


Fixed submission:
from math import *
a,b,c = map(int,input().split())
c = radians(c)
S = a*b*sin(c)/2
print("%.10f %.10f %.10f" %(S,a+b+sqrt(a*a+b*b-2*a*b*cos(c)),2*S/a ))

Buggy python submission (verdict: Runtime Error):
from math import *
a,b,c = map(int,input().split())
c = radians(c)
S = a*b*sin(c)/2
print("%f %f %f" %(S,sqrt(a*a+b*b-2*a*b*cos(c)),2*S/a )))


Fixed submission:
from math import *
a,b,c = map(int,input().split())
c = radians(c)
S = a*b*sin(c)/2
print("%.10f %.10f %.10f" %(S,a+b+sqrt(a*a+b*b-2*a*b*cos(c)),2*S/a ))
Buggy python submission (verdict: Runtime Error):
a = int(input());
b = int(input());

print(a + " " + b);


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

print("%d %d" % (num[0]*num[1],(num[0]+num[1])*2))

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

print(a + " " + b)


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

print("%d %d" % (num[0]*num[1],(num[0]+num[1])*2))

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

print(num[0] + " " + num[1])


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

print("%d %d" % (num[0]*num[1],(num[0]+num[1])*2))
Buggy python submission (verdict: Runtime Error):
num = list(map(int,input().sprit()))
if(num[0] < num[1]):
    if(num[1] < num[2]):print("Yes")
else:print("No")


Fixed submission:
num = list(map(int,input().split()))
if(num[0] < num[1] and num[1] < num[2] and num[0] < num[2]): print("Yes")
else: print("No")

Buggy python submission (verdict: Runtime Error):
num = list(map(int,input().split()))
if(num[0] < num[1] && num[1] < num[2] && num[0] < num[2]): print("Yes")
else: print("No")


Fixed submission:
num = list(map(int,input().split()))
if(num[0] < num[1] and num[1] < num[2] and num[0] < num[2]): print("Yes")
else: print("No")
Buggy python submission (verdict: Runtime Error):
num = list(map(int,input().split()))
list = []

for i in num:
    if(i == 0): list.append(num[i])
    else: 
        if(list[i-1] > num[i]):
            list.append = list[i]
            list[i-1] = num[i]


Fixed submission:
num = list(map(int,input().split()))
num.sort()
print("%d %d %d" %(num[0],num[1],num[2]))
Buggy python submission (verdict: Runtime Error):
num = list(map(int,input().split))
 
circle_px = num[2] + num[4]
circle_mx = num[2] - num[4]

circle_py = num[3] + num[4]
circle_my = num[3] - num[4]

if(circle_px <= num[0] and circle_mx >= 0 and circle_py <= num[1] and circle_py >= 0): print("Yes")
else: print("No")


Fixed submission:
num = list(map(int,input().split()))
 
circle_px = num[2] + num[4]
circle_mx = num[2] - num[4]

circle_py = num[3] + num[4]
circle_my = num[3] - num[4]

if(circle_px <= num[0] and circle_mx >= 0 and circle_py <= num[1] and circle_py >= 0): print("Yes")
else: print("No")
Buggy python submission (verdict: Runtime Error):
list = []
while True:
    if(int(input()) == 0): break
    else: list.append(input())
    
for i in list:
    print("Case %d:%d" %(i,list[i]))


Fixed submission:
list = []
while True:
    a = int(input())
    if(a == 0): break
    else: list.append(a)
    

for i in range(len(list)):
    print("Case %d: %d" %(i+1,list[i]))

Buggy python submission (verdict: Runtime Error):
list = []
while True:
    if(int(input()) == 0): break
    else: list.append(input())
    
for i in len(list):
    print("Case %d:%d" %(i,list[i]))


Fixed submission:
list = []
while True:
    a = int(input())
    if(a == 0): break
    else: list.append(a)
    

for i in range(len(list)):
    print("Case %d: %d" %(i+1,list[i]))

Buggy python submission (verdict: Runtime Error):
list = []
while True:
    if(int(input()) == 0): break
    else: list.append(input())
    
for i in range(len(list)):
    print("Case %d:%d" %(i,list[i]))


Fixed submission:
list = []
while True:
    a = int(input())
    if(a == 0): break
    else: list.append(a)
    

for i in range(len(list)):
    print("Case %d: %d" %(i+1,list[i]))

Buggy python submission (verdict: Runtime Error):
list = []
while True:
    if(int(input()) == 0): break
    else: list.append(input())
    
c = 0
for i in list:
    c = c + 1
    print("Case %d:%d" %(c,i))


Fixed submission:
list = []
while True:
    a = int(input())
    if(a == 0): break
    else: list.append(a)
    

for i in range(len(list)):
    print("Case %d: %d" %(i+1,list[i]))

Buggy python submission (verdict: Runtime Error):
list = []
while True:
    if(int(input()) == 0): break
    else: list.append(int(input()))
    

for i in len(list):
    print("Case %d:%d" %(i,list[i]))


Fixed submission:
list = []
while True:
    a = int(input())
    if(a == 0): break
    else: list.append(a)
    

for i in range(len(list)):
    print("Case %d: %d" %(i+1,list[i]))
Buggy python submission (verdict: Runtime Error):
list = []
while True:
    num = list(map(int,input()))
    if(num[0] == 0 and num[1] == 0):
        break
    else:
        if(num[0] > num[1]):
            print("%d %d" %(num[1],num[0]))
        else:
            print("%d %d" %(num[0],num[1]))
            


Fixed submission:
while True:
    num = list(map(int,input().split()))
    if(num[0] == 0 and num[1] == 0):
        break
    else:
        if(num[0] > num[1]):
            print("%d %d" %(num[1],num[0]))
        else:
            print("%d %d" %(num[0],num[1]))

Buggy python submission (verdict: Runtime Error):
list = []
while True:
    num = list(map(int,input().split()))
    if(num[0] == 0 and num[1] == 0):
        break
    else:
        if(num[0] > num[1]):
            print("%d %d" %(num[1],num[0]))
        else:
            print("%d %d" %(num[0],num[1]))
            


Fixed submission:
while True:
    num = list(map(int,input().split()))
    if(num[0] == 0 and num[1] == 0):
        break
    else:
        if(num[0] > num[1]):
            print("%d %d" %(num[1],num[0]))
        else:
            print("%d %d" %(num[0],num[1]))
Buggy python submission (verdict: Runtime Error):
r = int(input())
pi = 3.14159265359
print("%.6f %.6f" %(pi*r*r,2*pi*r))


Fixed submission:
r = float(input())
pi = 3.14159265359
print("%.6f %.6f" %(pi*r*r,2*pi*r))