Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
s=j=0
a=[];b=[];d=[]
for i,x in enumerate(input()):
    if x=='\\':a+=[i]
    elif x=='/' and a:
        j=a.pop()
        c=i-j;s+=c
        while b and b[-1]>j:c+=d.pop();b.pop()
        b+=[j];d+=[c]
print(s)
print(len(b),*(d))



Fixed submission:
# -*- coding: utf-8 -*-

count = 0
backslash_index = []
area_pond = []
pending_area=[]
for index,symbol in enumerate(input()):
	if symbol == "\\":
		backslash_index += [index]
	elif symbol == '/' and backslash_index:
		last_bs_index = backslash_index.pop()
		diff = index - last_bs_index 
		count += diff 
		while area_pond and area_pond[-1] > last_bs_index:
			diff += pending_area.pop()
			area_pond.pop()

		area_pond += [last_bs_index]
		pending_area += [diff]

print(count)
print(len(area_pond),*(pending_area))
Buggy python submission (verdict: Runtime Error):
import math

r = int(input())

a = r * r * math.pi
c = 2 * r * math.pi
print('%.6f %.6f' % (a, c))

Fixed submission:
import math

r = float(input())

a = r * r * math.pi
c = 2 * r * math.pi
print('%.6f %.6f' % (a, c))
Buggy python submission (verdict: Runtime Error):
x=(int)input().strip()
print(x**3)

Fixed submission:
x=int(input().strip())
print(x**3)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-


def insertion_sort(n, A):
    for i in xrange(1, len(A)):
        key = A[i]
        j = i - 1
        while j >= 0 and A[j] > key:
            A[j + 1] = A[j]
            j -= 1
        A[j + 1] = key

if __name__ == "__main__":
    n = int(raw_input())
    A = raw_input().split(" ")
    A = map(int, A)
    insertion_sort(n, A)
    print " ".join(A).strip()

Fixed submission:
# -*- coding: utf-8 -*-
import sys

def main():
	num = int(raw_input())
	list = map(int, raw_input().split())
	sort(num, list)

def sort(num, list):
	output(list)
	for i in range(1, num):
		key = list[i]
		j = i - 1
		while j >= 0 and list[j] > key:
			list[j+1] = list[j]
			j -= 1
		list[j+1] = key
		output(list)
def output(list):
	print " ".join(map(str, list))
			


if __name__ == "__main__":
	main()
Buggy python submission (verdict: Time Limit Exceeded):
n = int(raw_input())
R = list()
max = -10000000000

for i in range(n):
    R.append(int(raw_input()))
    for j in range(i):
        if max < R[i] - R[j]:
            max = R[i] - R[j]
            
print max

Fixed submission:
n = int(raw_input())
R = list()
max = -10000000000
min =  10000000000

for i in range(n):
    R.append(int(raw_input()))

    if max < R[i] - min:
        max = R[i] - min

    if min > R[i]:
        min = R[i]
print max
Buggy python submission (verdict: Runtime Error):
N = int(raw_input())
A = raw_input().split(" ")

count = 0
for i in range(0, N):
    minj = i
    for j in range(i, N):
        if int(A[j]) < int(A[minj)]:
            minj = j

    if i != minj:
        temp = A[i]
        A[i] = A[minj]
        A[minj] = temp
        count += 1

print " ".join(A)
print count

Fixed submission:
N = int(raw_input())
A = raw_input().split(" ")

count = 0
for i in range(0, N):
    minj = i
    for j in range(i, N):
        if int(A[j]) < int(A[minj]):
            minj = j

    if i != minj:
        temp = A[i]
        A[i] = A[minj]
        A[minj] = temp
        count += 1

print " ".join(A)
print count
Buggy python submission (verdict: Runtime Error):
a = raw_input()
b = raw_input()
print int(a) * int(b), 2*(int(a) + int(b))

Fixed submission:
txt = raw_input()
a,b = txt.split()
print int(a) * int(b), 2*(int(a) + int(b))
Buggy python submission (verdict: Runtime Error):
r = int(input())
p = 3.141592653589
a = r * r * p
b = 2 * r * p
print("{0:.6f} {1:.6f}".format(a,b))

Fixed submission:
r = float(input())
p = 3.141592653589
a = r * r * p
b = 2 * r * p
print("{0:.6f} {1:.6f}".format(a,b))
Buggy python submission (verdict: Runtime Error):
while(True):
    m,f,r = [int(i) for i in input().split()]
    if(m == -1 and f == -1 and r == -1):
        break
    if(m == -1 or f == -1):
        print('F')
    elif(m + f >= 80):
        print('A')
    elif(65 <= m + f <= 80):
        prin('B')
    elif(50 <= m + f <= 65):
        print('C')
    elif(30 <= m + f <= 50):
        print('D')
        if(r >=50):
            print('C')
    else:
        print('F')

Fixed submission:
while(True):
    m,f,r = [int(i) for i in input().split()]
    if(m == -1 and f == -1 and r == -1):
        break
    if(m == -1 or f == -1):
        print('F')
    elif(m + f >= 80):
        print('A')
    elif(65 <= m + f <= 80):
        print('B')
    elif(50 <= m + f <= 65):
        print('C')
    elif(30 <= m + f <= 50 and r < 50):
        print('D')
    elif(r >= 50):
        print('C')
    else:
        print('F')
Buggy python submission (verdict: Runtime Error):
while(True):
    n,x = [int(i) for i in input().split()]
    if(n == 0 and x == 0):
        break
    t = 0
    for i in range(1,n + 1):
        for j in range(1,n + 1):
            for k range(1,n + 1):
                if(i < j < k and i + j + k == x):
                    t += 1
    print(t)

Fixed submission:
while(True):
    n,x = [int(i) for i in input().split()]
    if(n == 0 and x == 0):
        break
    t = 0
    for i in range(1,n + 1):
        for j in range(1,n + 1):
            for k in range(1,n + 1):
                if(i < j < k and i + j + k == x):
                    t += 1
    print(t)
Buggy python submission (verdict: Runtime Error):
n,m,l = [int(i) for i in input().split()]
a = [int(i) for i in input().split()] for j in range(n)]
b = [int(i) for i in input().split()] for j in range(m)]
c = [[0 for i in range(n)] for j in range(l)]
for i in range(n):
    for j in range(l):
        for k in range(m):
            c[i][j] += a[i][k] * b[k][j]
for i in range(l):
    print(' '.join(map(str,c[i])))

Fixed submission:
n,m,l = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n)]
b = [[int(i) for i in input().split()] for j in range(m)]
c = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
    for j in range(l):
        for k in range(m):
            c[i][j] += a[i][k] * b[k][j]
for i in range(n):
    print(' '.join(map(str,c[i])))

Buggy python submission (verdict: Runtime Error):
n,m,l = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n)]
b = [[int(i) for i in input().split()] for j in range(m)]
c = [[0 for i in range(n)] for j in range(l)]
for i in range(n):
    for j in range(l):
        for k in range(m):
            c[i][j] += a[i][k] * b[k][j]
for i in range(l):
    print(' '.join(map(str,c[i])))

Fixed submission:
n,m,l = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n)]
b = [[int(i) for i in input().split()] for j in range(m)]
c = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
    for j in range(l):
        for k in range(m):
            c[i][j] += a[i][k] * b[k][j]
for i in range(n):
    print(' '.join(map(str,c[i])))
Buggy python submission (verdict: Runtime Error):
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_B&lang=jp
#??????????????????????????????
#?????§??¬?´???°???????????????????????????????????¨????????¨?¨????????????????
def gcd(x,y):
    tmp = y
    
    if y > x:
        y = x
        x = tmp

    while not y == 0:
        y = x % y
        x = tmp
        tmp = y

    return x
def main():
    target = [int(a) for a in input().split()]
    print(gcd(a[0], a[1]))
    
if __name__ == "__main__":
    main()

Fixed submission:
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_B&lang=jp
#??????????????????????????????
#?????§??¬?´???°???????????????????????????????????¨????????¨?¨????????????????
def gcd(x,y):
    
    if y > x:
        x, y = y, x

    while not y == 0:
        x, y = y, x % y
    
    return x
def main():
    target = [int(a) for a in input().split()]
    print(gcd(target[0], target[1]))
    
if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_C&lang=jp
#?´???°??????
#x????´???°y???2 < y < sqrt(x)??????????????¨??????

from math import sqrt,ceil

def check_prime_number(n):
    sqrt_num = ceil(sqrt(n))
    
    if n == 2:
        return True

    if n < 2:
        return False

    if (n % 2) == 0:
        return False
    
    div = 2
    while div < n:
        if (n % div) == 0:
            return False
        div += 1
    
    return True

def count_prime_numbers(n_list):
    ans = 0
    for n in n_list:
        if check_prime_number(n):
            ans += 1
    return ans

def main():
    num = int(input())
    target_list = [int(input()) for i in range(num)]
    print(count_prime_numbers(target_list))
    
if __name__ == "__main__":
    main()

Fixed submission:
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_C&lang=jp
#?´???°??????
#x????´???°y???2 < y < sqrt(x)??????????????¨??????

from math import sqrt,ceil

def check_prime_number(n):
    sqrt_num = ceil(sqrt(n))
    
    if n == 2:
        return True
    elif n < 2 or (n % 2) == 0:
        return False

    div = 3
    while div <= sqrt_num:
        if (n % div) == 0:
            return False
        div += 2
        
    return True

def count_prime_numbers(n_list):
    ans = 0
    for n in n_list:
        if check_prime_number(n):
            ans += 1
    return ans

def main():
    num = int(input())
    target_list = [int(input()) for i in range(num)]
    print(count_prime_numbers(target_list))
    
if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):

def counting_sort(target_list):
    counter = [0 for i in range(10000)]

    for n in target_list:
        counter[n] += 1

    for i in range(1,10000):
        counter[i] = counter[i] + counter[i-1]

    result = [0 for i in range(len(target_list))]
    for n in target_list[::-1]:
        result[counter[n] - 1] = n
        counter[n] -= 1
    
    return result
if __name__ == "__main__":
    n_list = int(input())
    target_list = [int(s) for s in input().split()]
    sorted_list = counting_sort(target_list)
    print(" ".join([int(s) for s in sorted_list]))

Fixed submission:
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_6_A&lang=jp
#?¨???°?????????

def counting_sort(target_list):
    counter = [0 for i in range(10000)]

    for n in target_list:
        counter[n] += 1

    for i in range(1,10000):
        counter[i] = counter[i] + counter[i-1]

    result = [0 for i in range(len(target_list))]
    for n in target_list[::-1]:
        result[counter[n] - 1] = n
        counter[n] -= 1
    
    return result
if __name__ == "__main__":
    n_list = int(input())
    target_list = [int(s) for s in input().split()]
    sorted_list = counting_sort(target_list)
    print(" ".join([str(s) for s in sorted_list]))
Buggy python submission (verdict: Runtime Error):
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_9_B
#???????????? 17:55~

def maxHeapify(heap, index):
    left_index = 2 * index
    right_index = 2 * index + 1
    left = heap[left_index] if left_index < len(heap) else -1
    right = heap[right_index] if right_index < len(heap) else -1
    largest_index = heap.index(max([left, right, heap[index]]))

    if not largest_index == index:
        heap[index], heap[largest_index] = heap[largest_index], heap[index]
        maxHeapify(heap, largest_index)
    
def main():
    n_node = int(input())
    target_list = [""] + [int(n) for n in input().split()]
    for i in range(1, int(len(target_list) / 2) + 1)[::-1]:
        maxHeapify(target_list, i)
        
    print(*target_list)
if __name__ == "__main__":
    main()

Fixed submission:
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_9_B
#???????????? 17:55~

def maxHeapify(heap, index):
    left_index = 2 * index
    right_index = 2 * index + 1
    largest_index = index
    
    if left_index < len(heap) and heap[left_index] > heap[index]:
        largest_index = left_index

    if right_index < len(heap) and heap[right_index] > heap[largest_index]:
        largest_index = right_index

    if largest_index != index:
        heap[index], heap[largest_index] = heap[largest_index], heap[index]
        maxHeapify(heap, largest_index)
    
def main():
    n_node = int(input())
    target_list = [""] + [int(n) for n in input().split()]
    for i in range(1, int(len(target_list) / 2) + 1)[::-1]:
        maxHeapify(target_list, i)
        
    print(*target_list)
if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def prime_number(num):
    if num == 2 :
        return 1
    elif (num%2)==0:
        return 0
    elif num > 2:
        for i in range(3,num-1,2):
            if (num % i) == 0:
                return 0
        return 1

N =int(input())
count = 0
for i in range(0,N):
    num = int(input())
    count += int(prime_number(num))
print(count)


Fixed submission:
import math
def isPrimeNum(num):
    sqrtNum = int(math.sqrt(num)) + 1
    if(num == 2 or num == 3):
        return True
    elif(num % 2 == 0):
        return False
    else:
        for i in range(3, sqrtNum , 2):
            if(num % i == 0 ):
                return False
        return True
    
count = 0
N = int(input())
for i in range(N):
    num = int(input())
    if(isPrimeNum(num)):
        count += 1

print(count)
Buggy python submission (verdict: Runtime Error):

x = input()
print(x**3)


Fixed submission:

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

print("{0} {1} {2:.8f}".format(a // b, a % b, a / b))




Fixed submission:
import math

r = float(input())

print(f'{math.pi * r ** 2} {2 * math.pi * r}')

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

r = int(input())

print(f'{math.pi * r ** 2} {2 * math.pi * r}')


Fixed submission:
import math

r = float(input())

print(f'{math.pi * r ** 2} {2 * math.pi * r}')
Buggy python submission (verdict: Runtime Error):
while True:
  a, op b = input().split()

  if op == "?":
    break
  elif op == "+":
    print(int(a) + int(b))
  elif op == "-":
    print(int(a) - int(b))
  elif op == "*":
    print(int(a) * int(b))
  elif op == "/":
    print(int(a) // int(b))



Fixed submission:
while True:
  a, op, b = input().split()

  if op == "?":
    break
  elif op == "+":
    print(int(a) + int(b))
  elif op == "-":
    print(int(a) - int(b))
  elif op == "*":
    print(int(a) * int(b))
  elif op == "/":
    print(int(a) // int(b))
Buggy python submission (verdict: Runtime Error):
a = input(), b = input()
c = int(a)
d = int(b)

print(c*d, 2*c+2*d)



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

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

print(c*d, 2*c+2*d)



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

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

print(c*d 2*c+2*d)



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

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

print(c*d 2*c+2*d)



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

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

print(c*d 2*(c+d))



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

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



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

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



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

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



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

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



Fixed submission:
a,b = (int(x) for x in input().split())
print(a*b,2*(a+b))
Buggy python submission (verdict: Time Limit Exceeded):
i = 0
x = input()
while x != 0:
 print("Case {}: {}".format(i,x))
 i += i+1



Fixed submission:
i = 1
while True:
 x =int(input())
 if x == 0:
  break
 print("Case {}: {}".format(i,x))
 i = i+1

Buggy python submission (verdict: Runtime Error):
i = 0
while True:
 i += i+1
 n=int(input())
 if x == 0: break
 print("Case {}: {}".format(i,x))



Fixed submission:
i = 1
while True:
 x =int(input())
 if x == 0:
  break
 print("Case {}: {}".format(i,x))
 i = i+1

Buggy python submission (verdict: Time Limit Exceeded):
i = 0
x =input()
while x != 0:
 i += i+1
 print("Case {}: {}".format(i,x))



Fixed submission:
i = 1
while True:
 x =int(input())
 if x == 0:
  break
 print("Case {}: {}".format(i,x))
 i = i+1

Buggy python submission (verdict: Runtime Error):
i = 0
while True:
    x = int(input())
    if x == 0: break
    i = i + 1
    print("Case " + str(i) + ": " + str(x))


Fixed submission:
i = 1
while True:
 x =int(input())
 if x == 0:
  break
 print("Case {}: {}".format(i,x))
 i = i+1

Buggy python submission (verdict: Runtime Error):
i = 0
while True:
    x = int(input())
    if x == 0: break
    i = i + 1
    print("Case " + str(i) + ": " + str(x))


Fixed submission:
i = 1
while True:
 x =int(input())
 if x == 0:
  break
 print("Case {}: {}".format(i,x))
 i = i+1

Buggy python submission (verdict: Runtime Error):
i = 0
while True:
    x = int(input())
    if x == 0: break
    i = i + 1
    print("Case " + str(i) + ": " + str(x))



Fixed submission:
i = 1
while True:
 x =int(input())
 if x == 0:
  break
 print("Case {}: {}".format(i,x))
 i = i+1

Buggy python submission (verdict: Runtime Error):
i = 0
while True:
    x = int(input())
    if x == 0: 
     break
    i = i + 1
    print("Case " + str(i) + ": " + str(x))



Fixed submission:
i = 1
while True:
 x =int(input())
 if x == 0:
  break
 print("Case {}: {}".format(i,x))
 i = i+1
Buggy python submission (verdict: Time Limit Exceeded):
x,y = map(int, input().split())
while (x,y) != (0,0):
 if x < y:
  print(x,y)
 else:
  print(y,x)



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

Buggy python submission (verdict: Time Limit Exceeded):
x,y = map(int, input().split())
while (x,y) != (0,0):
 if x < y:
  print(x,y)
 else:
  print(y,x)



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

Buggy python submission (verdict: Runtime Error):
import sys
for line in sys.stdin:
    xy = sorted(map(int , line.split()))
    if xy[0] == 0 and xy[1] == 0: break
    print(*xy)



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

Buggy python submission (verdict: Runtime Error):
import sys
for line in sys.stdin:
    xy = sorted(map(int , line.split()))
    if xy[0] == 0 and xy[1] == 0: break
    print(*xy)


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

Buggy python submission (verdict: Runtime Error):
x,y = map(int, input().split())
if x==0 and y==0:
 break
if x < y:
 print(x,y)
else:
 print(y,x)

 


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

Buggy python submission (verdict: Runtime Error):
x,y = map(int, input().split())
if x==0 and y==0:
 break
if x <= y:
 print(x,y)
else:
 print(y,x)

 


Fixed submission:
while True:
 x,y = map(int, input().split())
 if x==0 and y==0:
  break
 if x <= y:
  print(x,y)
 else:
  print(y,x)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
x = 0
for i in range(a,b+1)
 if 80 %% i == 0:
  x += x+1
 print(x)



Fixed submission:
a,b,c = map(int, input().split())
x = 0
for i in range(a,b+1):
 if c%i == 0:
  x = x+1
print(x)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
x = 0
for i in range(a,b+1)
 if c %% i == 0:
  x += x+1
 print(x)



Fixed submission:
a,b,c = map(int, input().split())
x = 0
for i in range(a,b+1):
 if c%i == 0:
  x = x+1
print(x)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
x = 0
for i in range(a,b+1):
 if c %% i == 0:
  x += x+1
 print(x)



Fixed submission:
a,b,c = map(int, input().split())
x = 0
for i in range(a,b+1):
 if c%i == 0:
  x = x+1
print(x)
Buggy python submission (verdict: Runtime Error):
x=raw_input("> ")
x=x*x*x
print x

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

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

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

print 2*(a+b) a*b

Fixed submission:
a,b=map(int,raw_input().split()) #korenazo
print a*b , 2*(a+b)

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

print a*b 2*(a+b) 

Fixed submission:
a,b=map(int,raw_input().split()) #korenazo
print a*b , 2*(a+b)

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

Fixed submission:
a,b=map(int,raw_input().split()) #korenazo
print a*b , 2*(a+b)

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

Fixed submission:
a,b=map(int,raw_input().split()) #korenazo
print a*b , 2*(a+b)

Buggy python submission (verdict: Runtime Error):
a,b = map(int,raw_input().split()) #???????¬?

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

Fixed submission:
a,b=map(int,raw_input().split()) #korenazo
print a*b , 2*(a+b)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,raw_input().split()) #???????¬?
print a*b,2*(a+b)
 

Fixed submission:
a,b=map(int,raw_input().split()) #korenazo
print a*b , 2*(a+b)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,raw_input().split())

if a==b
  print "a==b"
elseif a<b
  print "a<b"
else a>b
  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"
elif a<b
  print "a<b"
else a>b
  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"
elif a<b:
	print "a<b"
else a>b:
	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())

d=[]
d.append(a,b,c)
d.sort()
print d

Fixed submission:
a,b,c = map(int,raw_input().split())
if b <= a:
    if b <= c <= a:
        print b,c,a
    elif c <= b <= a:
        print c,b,a
    else:
        print b,a,c
elif a < b:
    if a <= c <= b:
        print a,c,b
    elif c <= a < b:
        print c,a,b
    else:
        print a,b,c
Buggy python submission (verdict: Runtime Error):
W,H,x,y,r = map(int,raw_input().split())
if W+r <= x <= W-r && H+r <= y <= H-r:
	print "Yes"
else:
	print "No"

Fixed submission:
W,H,x,y,r = map(int,raw_input().split())
if r <= x <= W-r and r <= y <= H-r:
	print "Yes"
else:
	print "No"