Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = input()
N = int(N)
l = [input() for i in range(N)]
ma = -100
for i in range(0,len(l)-1):
    for j in range(i+1,len(l)):
        if(l[j] - l[i] > ma):
            ma = l[j] - l[i]
print(ma)




Fixed submission:
N = input()
N = int(N)
l = [int(input()) for i in range(N)]
flg = 1
ma = 0
mi = 0
for i in range(1,len(l)):
    if(mi > l[i-1] or flg ==1):
        mi = l[i-1]
    if(ma < l[i] - mi or flg ==1):
        ma = l[i] - mi
        flg = 0
print(ma)

Buggy python submission (verdict: Runtime Error):
N = input()
N = int(N)
l = [int(input()) for i in range(N)]
flg = 1
for i in range(0,len(l)-1):
    for j in range(i+1,len(l)):
        if(ma < l[j]-l[i] or flg ==1):
            ma = l[j] - l[i]
            flg = 0
print(ma)


Fixed submission:
N = input()
N = int(N)
l = [int(input()) for i in range(N)]
flg = 1
ma = 0
mi = 0
for i in range(1,len(l)):
    if(mi > l[i-1] or flg ==1):
        mi = l[i-1]
    if(ma < l[i] - mi or flg ==1):
        ma = l[i] - mi
        flg = 0
print(ma)

Buggy python submission (verdict: Time Limit Exceeded):
N = input()
N = int(N)
l = [int(input()) for i in range(N)]
flg = 1
ma = 0
for i in range(0,len(l)-1):
    for j in range(i+1,len(l)):
        if(ma < l[j]-l[i] or flg ==1):
            ma = l[j] - l[i]
            flg = 0
print(ma)


Fixed submission:
N = input()
N = int(N)
l = [int(input()) for i in range(N)]
flg = 1
ma = 0
mi = 0
for i in range(1,len(l)):
    if(mi > l[i-1] or flg ==1):
        mi = l[i-1]
    if(ma < l[i] - mi or flg ==1):
        ma = l[i] - mi
        flg = 0
print(ma)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
L = input().split()
L = [int(s) for s in L]
n = int(input())
l = input().split()
l = [int(s) for s in l]
ans = 0
for i in range(n):
    j = 0
    k = N-1
    while(j != k):
    #for m in range(5):
        a =  int((j + k)/2)
        if l[i] > L[a]:
            j = a
        elif l[i] < L[a]:
            k = a
        else:
            ans += 1
            break
        #print(j,k,a,ans)
        #print(l[i],L[a])
print(ans)



Fixed submission:
N = int(input())
L = input().split()
L = [int(s) for s in L]
n = int(input())
l = input().split()
l = [int(s) for s in l]
ans = 0
for i in range(n):
    j = 0
    k = N-1
    while(1):
    #for m in range(5):
        a =  int((j + k)/2)
        if l[i] == L[a] or l[i] ==L[j] or l[i] ==L[k]:
            ans += 1
            break
        elif k == j+1:
            break
        elif l[i] > L[a]:
            j = a
        elif l[i] < L[a]:
            k = a
        # print(j,k,a,ans)
        # print(l[i],L[a])
print(ans)
Buggy python submission (verdict: Runtime Error):
class binaryTree:
    def __init__(self,key,p=None,l=None,r=None):
        self.key = key
        self.p = p
        self.l = l
        self.r = r

N = int(input())
treelist = [list(input().split()) for i in range(N)]
root = None

def inorder(root):
    x = root
    if x == None:
        return
    inorder(x.l)
    
    global inlist
    inlist.append(x.key)
    
    inorder(x.r)

def insert(root,z):
    y = None
    x = root
    while x != None:
        y = x
        if z.key < x.key:
            x = x.l
        else:
            x = x.r
    z.p = y

    if y == None:
        root = z
    elif z.key < y.key:
        y.l = z
    else:
        y.r = z
    return root
    
def outorder(root):
    x = root
    if x == None:
        return
    global outlist
    outlist.append(x.key)
    
    outorder(x.l)
    outorder(x.r)

for data in treelist:
    if data[0] == "insert":
        z = binaryTree(int(data[1]))
        root = insert(root,z)
        
    if data[0] == "print":
        inlist = []
        outlist = []
        
        inorder(root)
        indata = " " + " ".join([str(num) for num in inlist])
        print(indata)
 
        outorder(root)
        outdata = " " + " ".join([str(num) for num in outist])
        print(outdata)


Fixed submission:
class binaryTree:
    def __init__(self,key,p=None,l=None,r=None):
        self.key = key
        self.p = p
        self.l = l
        self.r = r

N = int(input())
treelist = [list(input().split()) for i in range(N)]
root = None

def inorder(root):
    x = root
    if x == None:
        return
    inorder(x.l)
    
    global inlist
    inlist.append(x.key)
    
    inorder(x.r)

def insert(root,z):
    y = None
    x = root
    while x != None:
        y = x
        if z.key < x.key:
            x = x.l
        else:
            x = x.r
    z.p = y

    if y == None:
        root = z
    elif z.key < y.key:
        y.l = z
    else:
        y.r = z
    return root
    
def outorder(root):
    x = root
    if x == None:
        return
    global outlist
    outlist.append(x.key)
    
    outorder(x.l)
    outorder(x.r)

for data in treelist:
    if data[0] == "insert":
        z = binaryTree(int(data[1]))
        root = insert(root,z)
        
    if data[0] == "print":
        inlist = []
        outlist = []
        
        inorder(root)
        indata = " " + " ".join([str(num) for num in inlist])
        print(indata)
 
        outorder(root)
        outdata = " " + " ".join([str(num) for num in outlist])
        print(outdata)
Buggy python submission (verdict: Runtime Error):
def cubic(x):
    return x*x*x

print cubic(x)


Fixed submission:
x = int(input())
if x <= 100 and x >= 1:
	print(x*x*x)

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


Fixed submission:
x = int(input())
if x <= 100 and x >= 1:
	print(x*x*x)

Buggy python submission (verdict: Runtime Error):
print(math.pow(x,3))


Fixed submission:
x = int(input())
if x <= 100 and x >= 1:
	print(x*x*x)

Buggy python submission (verdict: Runtime Error):
print(math.pow(x,3))


Fixed submission:
x = int(input())
if x <= 100 and x >= 1:
	print(x*x*x)
Buggy python submission (verdict: Runtime Error):
sentinel = '\n' 
cn=1
for line in iter(input, sentinel):
	print('Case {}: {}'.format(cn,line))
	cn = cn + 1 


Fixed submission:
cn = 1
while True:
	try:
		
		line = input()
		if line == '0':
			break	
		else:
			print('Case {}: {}'.format(cn,line))
			cn = cn + 1
	except EOFError:
		break
Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
a = math.pi * math.pow(r, 2)
c = 2*math.pi*r

print('{} {}'.format(a,c))
	


Fixed submission:
import math
r = float(input())
a = math.pi * math.pow(r, 2)
c = 2*math.pi*r

print('{} {}'.format(a,c))
Buggy python submission (verdict: Runtime Error):
while True:
	try:
		line = input()
		if line == '0 ? 0':
			break	
		else:
			a,op,b = line.split(' ')
			if op == '+':
				print(int(a)+int(b))
			if op == '-':
				print(int(a)-int(b))
			if op == '*':
				print(int(a)*int(b))
			if op == '/':
				print(int(float(a)/float(b)))
	except EOFError:
		break


Fixed submission:
while True:
	try:
		line = input()
		if  '?' in line:
			break	
		else:
			a,op,b = line.split(' ')
			if op == '+':
				print(int(a)+int(b))
			if op == '-':
				print(int(a)-int(b))
			if op == '*':
				print(int(a)*int(b))
			if op == '/':
				print(int(float(a)/float(b)))
	except EOFError:
		break
Buggy python submission (verdict: Runtime Error):
,m = map(int,raw_input().strip().split(' '))
graph = [[] for i in range(n)]
for i in range(m):
    s,t = map(int,raw_input().strip().split(' '))
    graph[s].append(t)
    graph[t].append(s)
 
color = {}
c = 0
for i in range(n):
    if not i in color:
        que = [i]
        color[i] = c
        while len(que) > 0:
            u = que[0]
            for v in graph[u]:
                if not v in color:
                    color[v] = c
                    que.append(v)
            del que[0]
        c += 1
 
 
q = int(raw_input())
for i in range(q):
    s,t = map(int,raw_input().strip().split(' '))
    if color[s] == color[t]:
        print 'yes'
    else:
        print 'no'

Fixed submission:
n,m = map(int,raw_input().strip().split(' '))
graph = [[] for i in range(n)]
for i in range(m):
    s,t = map(int,raw_input().strip().split(' '))
    graph[s].append(t)
    graph[t].append(s)
 
color = {}
c = 0
for i in range(n):
    if not i in color:
        que = [i]
        color[i] = c
        while len(que) > 0:
            u = que[0]
            for v in graph[u]:
                if not v in color:
                    color[v] = c
                    que.append(v)
            del que[0]
        c += 1
 
 
q = int(raw_input())
for i in range(q):
    s,t = map(int,raw_input().strip().split(' '))
    if color[s] == color[t]:
        print 'yes'
    else:
        print 'no'
Buggy python submission (verdict: Runtime Error):
def fact(k):
    if k == 0: 
     return 1
    return k * fact(k - 1)

n = input()
a=[0]*n

for i in range(n):
 a = input()

q = input()
m = [0]*q

for i in range(q):
 m = input()

ans=[0]*fact(k)

for s in range(t):
 for t in range(n):
   ans[s*(t+1)] +=a[t]
if x in ams:
 print'yes'
else:
 print'no'
   
 

Fixed submission:
n = int(input())
a = map(int,raw_input().split())
p = int(input())
m = map(int,raw_input().split())
def goukei(i,m):
  if m ==0:
    return True
  if i >= n or m > sum(a):
    return False
  r = goukei(i + 1, m) or goukei(i + 1, m - a[i])
  return r
 
for u in range(0,p):

  if goukei(0, m[u]):
    print "yes"
  else:
    print "no"

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split())
p = int(input())
m = map(int,input().split())
def goukei(i,m):
  if m ==0:
    return True
  if i >= n or m > sum(a):
    return False
  r = goukei(i + 1, m) or goukei(i + 1, m - a[i])
  return r
 
for u in range(answer):

  if s(0, m[u]):
    print "yes"
  else:
    print "no"
   

Fixed submission:
n = int(input())
a = map(int,raw_input().split())
p = int(input())
m = map(int,raw_input().split())
def goukei(i,m):
  if m ==0:
    return True
  if i >= n or m > sum(a):
    return False
  r = goukei(i + 1, m) or goukei(i + 1, m - a[i])
  return r
 
for u in range(0,p):

  if goukei(0, m[u]):
    print "yes"
  else:
    print "no"

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,raw_input().split())
p = int(input())
m = map(int,raw_input().split())
def goukei(i,m):
  if m ==0:
    return True
  if i >= n or m > sum(a):
    return False
  r = goukei(i + 1, m) or goukei(i + 1, m - a[i])
  return r
 
for u in range(answer):

  if s(0, m[u]):
    print "yes"
  else:
    print "no"
   

Fixed submission:
n = int(input())
a = map(int,raw_input().split())
p = int(input())
m = map(int,raw_input().split())
def goukei(i,m):
  if m ==0:
    return True
  if i >= n or m > sum(a):
    return False
  r = goukei(i + 1, m) or goukei(i + 1, m - a[i])
  return r
 
for u in range(0,p):

  if goukei(0, m[u]):
    print "yes"
  else:
    print "no"

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,raw_input().split())
p = int(input())
m = map(int,raw_input().split())
def goukei(i,m):
  if m ==0:
    return True
  if i >= n or m > sum(a):
    return False
  r = goukei(i + 1, m) or goukei(i + 1, m - a[i])
  return r
 
for u in range(0,p):

  if s(0, m[u]):
    print "yes"
  else:
    print "no"
   
  
  
  
  
  
  
  

Fixed submission:
n = int(input())
a = map(int,raw_input().split())
p = int(input())
m = map(int,raw_input().split())
def goukei(i,m):
  if m ==0:
    return True
  if i >= n or m > sum(a):
    return False
  r = goukei(i + 1, m) or goukei(i + 1, m - a[i])
  return r
 
for u in range(0,p):

  if goukei(0, m[u]):
    print "yes"
  else:
    print "no"
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

print("%d %d"%(a*b)%(2*a+2*b))

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

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

print("%d %d"%((a*b),(2*a+2*b)))

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

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

print("%d"%(a*b))
print(" %d"%(2*a+2*b))

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

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
print("%d"%(a*b))
print(" %d"%(2*a+2*b))

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

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=a*b
d=2*a+2*b
print"c d

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

Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
a = n[0]*n[2]
b = n[0]*2 + n[2]*2
print'%d %d'%(a, b)

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

Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
a = n[0]*n[2]
b = n[0]*2 + n[2]*2
print'%d %d'%(a, b)

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

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

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

Buggy python submission (verdict: Runtime Error):
a,b=map('raw_input()','raw_input())
c=a*b
d=2*a+2*b
print'c d'

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

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

Fixed submission:
a,b = map(int, raw_input().split())
c = a*b
d = 2*(a+b)
print'%d %d'%(c,d)
Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
if a>b
 print"a>b"
if a<b
 print"a<b"
else
 print"a=b"

Fixed submission:
a, b = map(int, raw_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=input()
b=input()
if a>b:
 print"a>b"
if a<b:
 print"a<b"
else:
 print"a=b"

Fixed submission:
a, b = map(int, raw_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=input()
b=input()
if (a>b):
 print"a>b"
if (a<b):
 print"a<b"
else:
 print"a=b"

Fixed submission:
a, b = map(int, raw_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=input()
b=input()
if (a>b):
 print'a>b'
if (a<b):
 print'a<b'
else:
 print'a=b'

Fixed submission:
a, b = map(int, raw_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, b = map(int, input().split())
 if (a > b):
    print "a > b"
if (a < b):
    print "a < b"
else:
    print 'a == b'

Fixed submission:
a, b = map(int, raw_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, b = map(int, raw_input().split())
 if (a > b):
    print "a > b"
if (a < b):
    print "a < b"
else:
    print "a == b"

Fixed submission:
a, b = map(int, raw_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, b ,c = map(int, raw_input().split())
     
if (a < b < c):
 print a b c
elif (a < c < b):
 print a c b
elif (b < a < c):
 print b a c
elif (b < c < a):
 print b c a
elif (c < a < b):
 print c a b
elif (c < b < a):
 print c b a

Fixed submission:
n = map(int,raw_input().split())
n.sort()
print n[0], n[1] , n[2]
Buggy python submission (verdict: Runtime Error):
n = map(int,raw_input().split())
if 0 <= m[3]-m[5]  and m[3]+m[5] <= m[1] and 0 <= m[4]-m[5] and m[4]+m[5] <= m[2]:
  print 'Yes'
else:
  print'No'

Fixed submission:
m = map(int,raw_input().split())
if (0 <= m[2]-m[4])  and (m[2]+m[4] <= m[0]) and (0 <= m[3]-m[4]) and (m[3]+m[4] <= m[1]):
  print 'Yes'
else:
  print'No'

Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
if 0 <= m[3]-m[5]  and m[3]+m[5] <= m[1] and 0 <= m[4]-m[5] and m[4]+m[5] <= m[2]:
  print 'Yes'
else:
  print'No'

Fixed submission:
m = map(int,raw_input().split())
if (0 <= m[2]-m[4])  and (m[2]+m[4] <= m[0]) and (0 <= m[3]-m[4]) and (m[3]+m[4] <= m[1]):
  print 'Yes'
else:
  print'No'
Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
for i in range(1,len(m)+1)
 if(m[i-1]==0)
  break
 print"Case %d* %d",%(i,m[i-1])

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
for i in range(1,len(m)+1):
 if(m[i-1]==0):
  break
 print"Case %d* %d",%(i,m[i-1])

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
for i in range(len(m)+1):
 if(m[i-1]==0):
  break
 print"Case %d* %d",%(i,m[i-1])

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
for i in range(len(m)+1):
 if(m[i-1]==0):
  break
 print"Case %s* %s",%(i,m[i-1])

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
for i in range(len(m)+1):
 if(m[i-1]==0):
  break
 print"Case %s* %s",%(i,m[i-1])

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
for i in range(1):
 if(m[i-1]==0):
  break
 print"Case %s* %s",%(i,m[i-1])

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
for i in range(len(m)):
 if(m[i-1]==0):
  break
 print"Case %s* %s",%(i,m[i-1])

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
m = map(int,raw_input().split())
for i in range(len(m)):
 if(m[i]==0):
  break
 print"Case %s* %s",%((i+1),m[i])

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
i=0

while c!=0:
    c = int(input())
    if c == 0 : break
    c=c+1
    print "Case %d: %d" %  (c, a)

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
i=0

while c != 0:
    c = int(input())
    i = i+1
    print "Case %d: %d" %  (i,a)

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)

Buggy python submission (verdict: Runtime Error):
i=0

while True:
    c = int(input())
    ifc==0:
      break
    i = i+1
    print "Case %d: %d" %  (i,c)

Fixed submission:
i=0

while True:
    a = int(input())
    if(a==0):
      break
    i = i+1
    print "Case %d: %d" %  (i,a)
Buggy python submission (verdict: Runtime Error):
while True
 x,y =map(int,raw_input().split())
 if(x==0 and y==0):
  Break
 elif(x>y)
  print x>y

Fixed submission:
while True:
 x,y =map(int, raw_input().split())
 if(x==0 and y==0):
   break
 elif(x>y):
  print y,x  
 elif(x<=y):
  print x,y

Buggy python submission (verdict: Runtime Error):
while True:
 x,y =map(int,raw_input.split())
 if(x==y==0):
   break
 elif(x>y):
  print"%d > %d"%(x,y)
 elif(x<y):
  print"%d < %d"%(x,y)
 else:
  print"%d = %d"%(x,y)

Fixed submission:
while True:
 x,y =map(int, raw_input().split())
 if(x==0 and y==0):
   break
 elif(x>y):
  print y,x  
 elif(x<=y):
  print x,y

Buggy python submission (verdict: Runtime Error):
while True:
 x,y =map(int,raw_input.split())
 if(x==y==0):
   break
 elif(x>y):
  print"%s %s"%(x,y)
 elif(x<=y):
  print"%s %s"%(y,x)

Fixed submission:
while True:
 x,y =map(int, raw_input().split())
 if(x==0 and y==0):
   break
 elif(x>y):
  print y,x  
 elif(x<=y):
  print x,y

Buggy python submission (verdict: Runtime Error):
while True:
 x,y =map(int,raw_input.split())
 if(x==y==0):
   break
 elif(x>y):
  print x y  
 elif(x<=y):
  print y x

Fixed submission:
while True:
 x,y =map(int, raw_input().split())
 if(x==0 and y==0):
   break
 elif(x>y):
  print y,x  
 elif(x<=y):
  print x,y

Buggy python submission (verdict: Runtime Error):
while True:
 x,y =map(int, raw_input().split())
 if(x==y==0):
   break
 elif(x>y):
  print x y  
 elif(x<=y):
  print y x

Fixed submission:
while True:
 x,y =map(int, raw_input().split())
 if(x==0 and y==0):
   break
 elif(x>y):
  print y,x  
 elif(x<=y):
  print x,y
Buggy python submission (verdict: Runtime Error):
import math

r= map(int, raw_input().split())

a=float(r)*float(r)*??
b=2*float(r)*??
print a,b

Fixed submission:
import math
r=input()
a=r*r*math.pi
b=2*r*math.pi
print "%f %f"%(a,b)

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

r= map(int, raw_input().split())

a=float(r)*float(r)*math.pi
b=2*float(r)*math.pi
print a,b

Fixed submission:
import math
r=input()
a=r*r*math.pi
b=2*r*math.pi
print "%f %f"%(a,b)

Buggy python submission (verdict: Runtime Error):
r=input()
a=r*r*math.pi
b=2*r*math.pi
print "%f %f"%(a,b)

Fixed submission:
import math
r=input()
a=r*r*math.pi
b=2*r*math.pi
print "%f %f"%(a,b)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[0]*n
sum=0
for i in range(n):
 a[i]= int(input())
 sum=sum+a[i]
a.sort()

print'%d,%d,%d'%(a[0],a[n-1],sum)

Fixed submission:
int(input())
x=map(int,raw_input().split())
print min(x),max(x),sum(x)

Buggy python submission (verdict: Runtime Error):
n=input()
a=[0]*n
sum=0
for i in range(n):
 a[i]= int(input())
 sum=sum+a[i]
a.sort()

print'%d,%d,%d'%(a[0],a[n-1],sum)

Fixed submission:
int(input())
x=map(int,raw_input().split())
print min(x),max(x),sum(x)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[0]*n
sum=0
for i in range(n):
 a[i]= int(input())
 sum=sum+a[i]
a.sort()

print'a[0],a[n-1],sum'

Fixed submission:
int(input())
x=map(int,raw_input().split())
print min(x),max(x),sum(x)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[0]*n
sum=0
for i in range(n):
 a[i]= int(input())
 sum=sum+a[i]
a.sort()

print'a[0],a[n-1],sum'

Fixed submission:
int(input())
x=map(int,raw_input().split())
print min(x),max(x),sum(x)

Buggy python submission (verdict: Runtime Error):
n=int(raw_input())
a=[0]*n
sum=0
for i in range(n):
 a[i]= int(raw_input())
 sum=sum+a[i]
a.sort()

print'a[0],a[n-1],sum'

Fixed submission:
int(input())
x=map(int,raw_input().split())
print min(x),max(x),sum(x)
Buggy python submission (verdict: Runtime Error):
while 1:
   H, W = map(int, raw_input().split())
 
   if (H == 0 and W == 0): 
    break
   for i in range(H):
    if(i==0):
     print "#"*W
    elif(i==h-1):
     print "#"*W
    else:
     print "#"*
     print "."*(W-2)
     print "#"*

   print ""

Fixed submission:
while True:
   H, W = map(int, raw_input().split())
 
   if (H == 0 and W == 0): 
    break
   for i in range(H):
    if(i==0):
     print "#"*W
    elif(i==H-1):
     print "#"*W
    else:
     print ("#"+"."*(W-2)+"#")

   print ""

Buggy python submission (verdict: Runtime Error):
while 1:
   H, W = map(int, raw_input().split())
 
   if (H == 0 and W == 0): 
    break
   for i in range(H):
    if(i==0):
     print "#"*W
    elif(i==H-1):
     print "#"*W
    else:
     print "#"*
     print "."*(W-2)
     print "#"*

   print ""

Fixed submission:
while True:
   H, W = map(int, raw_input().split())
 
   if (H == 0 and W == 0): 
    break
   for i in range(H):
    if(i==0):
     print "#"*W
    elif(i==H-1):
     print "#"*W
    else:
     print ("#"+"."*(W-2)+"#")

   print ""