Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
print(str[::-1])

Fixed submission:
import sys
str = sys.stdin.readline()[:-1]
print(str[::-1])
Buggy python submission (verdict: Runtime Error):
import math
a, b, c = map(int, raw_input().split())
c = c / 180.0 * math.pi

s = 0.5 * a * b * math.sin(c))
l = a + b + math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.sin(c))
h = b * math.sin(c)

print "%f" % s
print "%f" % l
print "%f" % h

Fixed submission:
import math
a, b, c = map(float, raw_input().split())
c = (c * math.pi) / 180.0

print "%f" %(a * b * math.sin(c) / 2.0)
print "%f" %(a + b + math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(c)))
print "%f" %((b * math.sin(c)))

Buggy python submission (verdict: Runtime Error):
import math
a, b, c = map(int, input().split())
c = c / 180.0 * math.pi

s = 0.5 * a * b * math.sin(c))
l = a + b + math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.sin(c))
h = b * math.sin(c)

print ("%f" % s)
print ("%f" % l)
print ("%f" % h)

Fixed submission:
import math
a, b, c = map(float, raw_input().split())
c = (c * math.pi) / 180.0

print "%f" %(a * b * math.sin(c) / 2.0)
print "%f" %(a + b + math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(c)))
print "%f" %((b * math.sin(c)))
Buggy python submission (verdict: Runtime Error):
while True:
    try:
        a = [int(i) for i in input().split()]
        print(sum(a))
    except EOFError:
        break

Fixed submission:
while True:
    try:
        a = map(int, input().split())
        print(sum(a))
    except EOFError:
        break

Buggy python submission (verdict: Runtime Error):
while True:
    try:
        a = [int(i) for i in input().split()]
        print(sum(a))
    except EOFError:
        break

Fixed submission:
while True:
    try:
        a = map(int, input().split())
        print(sum(a))
    except EOFError:
        break
Buggy python submission (verdict: Runtime Error):
input(n)
print(n**3)

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

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

Fixed submission:
x = int(input())
print(x**3)
Buggy python submission (verdict: Runtime Error):
line = input().split(' ')
a = line[0]
b = line[1]

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

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

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

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

print(a*b2*(a+b))

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

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

Buggy python submission (verdict: Runtime Error):
x = int(input())
y = int(input())
print(str(x*y) + " " + str(2*x + 2*y))

Fixed submission:
x = input().split(" ")
print(int(x[0])*int(x[1]), 2*(int(x[0])+int(x[1])))

Buggy python submission (verdict: Runtime Error):
x = int(input().rstrip())
y = int(input().rstrip())
print(str(x*y) + " " + str(2*x + 2*y))

Fixed submission:
x = input().split(" ")
print(int(x[0])*int(x[1]), 2*(int(x[0])+int(x[1])))

Buggy python submission (verdict: Runtime Error):
line = input().rstrip().split(" ")
x = int(line[0])
y = int(line[1])
print(str(x*y) + " " + str(2*x + 2*y)

Fixed submission:
x = input().split(" ")
print(int(x[0])*int(x[1]), 2*(int(x[0])+int(x[1])))
Buggy python submission (verdict: Runtime Error):
x = input().split(" ")
w = int(x[0])
h = int(x[1])
x = int(x[2])
y = int(x[3])
r = int (x[4])
if x - r < 0:
    print("No")
elif w < x + r:
    print("No")
elif y - r < 0:
    print("No")
elif h < y + r:
    print("No")
else:
    print("Yes")

Fixed submission:
line = input().split(" ")
w = int(line[0])
h = int(line[1])
x = int(line[2])
y = int(line[3])
r = int(line[4])
if x - r < 0:
    print("No")
elif w < x + r:
    print("No")
elif y - r < 0:
    print("No")
elif h < y + r:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
x = input().split(" ")
w = int(x[0])
h = int(x[1])
x = int(x[2])
y = int(x[3])
r = int(x[4])
if x - r < 0:
    print("No")
elif w < x + r:
    print("No")
elif y - r < 0:
    print("No")
elif h < y + r:
    print("No")
else:
    print("Yes")

Fixed submission:
line = input().split(" ")
w = int(line[0])
h = int(line[1])
x = int(line[2])
y = int(line[3])
r = int(line[4])
if x - r < 0:
    print("No")
elif w < x + r:
    print("No")
elif y - r < 0:
    print("No")
elif h < y + r:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
for i in range(1,100000000000)
    x = int(input())
    if x == 0:
        break
    print("Case " + str(i) + ": " + str(x))

Fixed submission:
for i in range(1,10005):
    x = int(input())
    if x == 0:
        break
    print("Case " + str(i) + ": " + str(x))
Buggy python submission (verdict: Runtime Error):
r = int(input())
pi = 3.1415926535
print("%.5f %.5f" % (pi*r*r, 2*pi*r))

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

Buggy python submission (verdict: Runtime Error):
r = int(input())
pi = 3.1415926535
print("%.8f %.8f" % (pi*r*r, 2*pi*r))

Fixed submission:
r = float(input())
pi = 3.14159265358979323846264338
print("%.7f %.7f" % (pi*r*r, 2*pi*r))
Buggy python submission (verdict: Runtime Error):
inport sys
str = []
for line in sys.stdin.readlines()
    str.append(line.rstrip())
num = len(str)
for i in range(num)
    s = str.split(" ")
    a = int(s[0])
    b = s[1]
    c = s[2]
    if b =="?":
        break
    if b == "+":
        print(a+c)
    if b == "-":
        print(a-c)
    if b == "*":
        print(a*c)
    if b == "/"
        print(a//c)

Fixed submission:
for i in range(100000):
    s = input().rstrip().split(" ")
    a = int(s[0])
    b = s[1]
    c = int(s[2])
    if b =="?":
        break
    if b == "+":
        print(a+c)
    if b == "-":
        print(a-c)
    if b == "*":
        print(a*c)
    if b == "/":
        print(int(a/c))

Buggy python submission (verdict: Runtime Error):
inport sys
str = []
for line in sys.stdin.readlines()
    str.append(line.rstrip())
num = len(str)
for i in range(num)
    s = str.split(" ")
    a = int(s[0])
    b = s[1]
    c = s[2]
    if b =="?":
        break
    if b == "+":
        print(a+c)
    if b == "-":
        print(a-c)
    if b == "*":
        print(a*c)
    if b == "/"
        print(int(a/c))

Fixed submission:
for i in range(100000):
    s = input().rstrip().split(" ")
    a = int(s[0])
    b = s[1]
    c = int(s[2])
    if b =="?":
        break
    if b == "+":
        print(a+c)
    if b == "-":
        print(a-c)
    if b == "*":
        print(a*c)
    if b == "/":
        print(int(a/c))
Buggy python submission (verdict: Runtime Error):
n = int(input())
min = 1000000
max = -1000000
sum = 0
for i in range(n):
    x = int(input())
    if x < min:
        min = x
    if x > max:
        max = x
    sum += x
print("%d %d %d", % (min,max,sum))

Fixed submission:
n = int(input())
s = input().rstrip().split(" ")
min = 1000000
max = -1000000
sum = 0
for i in s:
    x = int(i)
    if x < min:
        min = x
    if x > max:
        max = x
    sum += x
print("%d %d %d" % (min,max,sum))

Buggy python submission (verdict: Runtime Error):
n = int(input().rstrip())
min = 1000000
max = -1000000
sum = 0
for i in range(n):
    x = int(input().rstrip())
    if x < min:
        min = x
    if x > max:
        max = x
    sum += x
print("%d %d %d", % (min,max,sum))

Fixed submission:
n = int(input())
s = input().rstrip().split(" ")
min = 1000000
max = -1000000
sum = 0
for i in s:
    x = int(i)
    if x < min:
        min = x
    if x > max:
        max = x
    sum += x
print("%d %d %d" % (min,max,sum))
Buggy python submission (verdict: Runtime Error):
import string

n=int(raw_input())

for i in range(n):
    print(raw_input().replace("Hoshino", "Hoshina"))

Fixed submission:
import string

n=int(input())

for i in range(n):
    print(input().replace("Hoshino", "Hoshina"))
Buggy python submission (verdict: Runtime Error):
while 1:
    n=int(input())
    cnt=0
    for i in range(10):
        for j in range(10):
            for k in range(10):
                for l in range(10):
                    if i+j+k+l==n:
                        cnt=cnt+1
    print(cnt)

Fixed submission:
import sys
for line in sys.stdin:
    n=int(line)
    cnt=0
    for i in range(10):
        for j in range(10):
            for k in range(10):
                for l in range(10):
                    if i+j+k+l==n:
                        cnt=cnt+1
    print(cnt)
Buggy python submission (verdict: Runtime Error):
tmp = input()
tmp = tmp.split(" ")
x,y = map(int,tmp)
if x == y:
	print("a == b")

elif x > y:
	print("a > b")

else:
	print("a < b")

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

else :
	print("No")
Buggy python submission (verdict: Runtime Error):
import math
import sys

while True:
	try:
		a,b = map(int, input().split())
		x = math.gcd(a,b)
		i = 1
		while True:
			if a*i%b == 0:
				y = a*i
				break
			else:
				i = i+1
		print(x,y)
	except EOFError:
		break

Fixed submission:
import math
import sys

while True:
	try:
		a,b = map(int, input().split())
		p = a
		q = b
		while True:
			r = p%q
			if r == 0:
				x = q
				break
			else:
				p = q
				q = r
		i = 1
		while True:
			if a*i%b == 0:
				y = a*i
				break
			else:
				i = i+1
		print(x,y)
	except EOFError:
		break

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

while True:
	try:
		a,b = map(int, input().split())
		x = math.gcd(a,b)
		i = 1
		while True:
			if a*i%b == 0:
				y = a*i
				break
			else:
				i = i+1
		print(x,y)
	except EOFError:
		break

Fixed submission:
import math
import sys

while True:
	try:
		a,b = map(int, input().split())
		p = a
		q = b
		while True:
			r = p%q
			if r == 0:
				x = q
				break
			else:
				p = q
				q = r
		i = 1
		while True:
			if a*i%b == 0:
				y = a*i
				break
			else:
				i = i+1
		print(x,y)
	except EOFError:
		break
Buggy python submission (verdict: Runtime Error):
import math
import sys

lines = input()
print(lines.reverse())

Fixed submission:
import math
import sys

lines = input()
print(lines[::-1])
Buggy python submission (verdict: Runtime Error):
import math

def Eratos(n):
	primes = [2]
	if n % 2 == 0:
		num = [2*i+1 for i in range(1,n/2)]
	else:
		num = [2*i+1 for i in range(1,(n+1)/2)]
	tmp = []

	top = 1
	while top < math.sqrt(n):
		top = num[0]
		for i in range(1,len(num)):
			if num[i] % top != 0:
				tmp.append(num[i])
		num = tmp
		tmp = []
		primes.append(top)
	for i in range(len(num)):
		primes.append(num[i])
	return primes

def list_count(list_a,n):
	cont = 0
	for i in range(len(list_a)):
		if list_a[i] > n:
			break
		else:
			cont += 1
	return cont

primes = Eratos(1000000)
while True:
	try:
		n = int(input())
		print(list_count(primes,n))
	except EOFError:
		break


Fixed submission:
import math

def Eratos(n):
	primes = [2]
	num = [2*i+1 for i in range(1,n//2)]
	tmp = []

	top = 1
	while top < math.sqrt(n):
		top = num[0]
		for i in range(1,len(num)):
			if num[i] % top != 0:
				tmp.append(num[i])
		num = tmp
		tmp = []
		primes.append(top)
	for i in range(len(num)):
		primes.append(num[i])
	return primes

def list_count(list_a,n):
	cont = 0
	for i in range(len(list_a)):
		if list_a[i] > n:
			break
		else:
			cont += 1
	return cont

primes = Eratos(1000000)
while True:
	try:
		n = int(input())
		print(list_count(primes,n))
	except EOFError:
		break

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

def Eratos(n):
	primes = [2]
	if n % 2 == 0:
		num = [2*i+1 for i in range(1,n/2)]
	else:
		num = [2*i+1 for i in range(1,(n+1)/2)]
	tmp = []

	top = 1
	while top < math.sqrt(n):
		top = num[0]
		for i in range(1,len(num)):
			if num[i] % top != 0:
				tmp.append(num[i])
		num = tmp
		tmp = []
		primes.append(top)
	for i in range(len(num)):
		primes.append(num[i])
	return primes

def list_count(list_a,n):
	cont = 0
	for i in range(len(list_a)):
		if list_a[i] > n:
			break
		else:
			cont += 1
	return cont

primes = Eratos(1000000)
while True:
	try:
		n = int(input())
		print(list_count(primes,n))
	except EOFError:
		break


Fixed submission:
import math

def Eratos(n):
	primes = [2]
	num = [2*i+1 for i in range(1,n//2)]
	tmp = []

	top = 1
	while top < math.sqrt(n):
		top = num[0]
		for i in range(1,len(num)):
			if num[i] % top != 0:
				tmp.append(num[i])
		num = tmp
		tmp = []
		primes.append(top)
	for i in range(len(num)):
		primes.append(num[i])
	return primes

def list_count(list_a,n):
	cont = 0
	for i in range(len(list_a)):
		if list_a[i] > n:
			break
		else:
			cont += 1
	return cont

primes = Eratos(1000000)
while True:
	try:
		n = int(input())
		print(list_count(primes,n))
	except EOFError:
		break
Buggy python submission (verdict: Runtime Error):
import sys
import math

def decide_move(x,y,tile,check):
	if tile == '<':
		x -= 1
		check[x][y] += 1
		return x,y,check
	elif tile == '>':
		x += 1
		check[x][y] += 1
		return x,y,check
	elif tile == '^':
		y -= 1
		check[x][y] += 1
		return x,y,check
	else:
		y += 1
		check[x][y] += 1
		return x,y,check


while True:
	h,w = map(int,input().split())
	if h == 0:
		break
	tile_map = []
	for i in range(h):
		tile_map[i] = input()
	check =[[0 for i in range(w)]for j in range(h)]
	check[0][0] = 1
	x = 0
	y = 0
	status = 0

	while True:
		if tile_map[x][y] == '.':
			status = 1
			print(y,x)
			break
		x,y,check = decide_move(x,y,tile_map[x][y],check)
		if check[x][y] > 1:
			status = 1
			print('LOOP')
			break

Fixed submission:
import sys
import math

def decide_move(x,y,tile,check):
	if tile == '<':
		y -= 1
		check[x][y] += 1
		return x,y,check
	elif tile == '>':
		y += 1
		check[x][y] += 1
		return x,y,check
	elif tile == '^':
		x -= 1
		check[x][y] += 1
		return x,y,check
	else:
		x += 1
		check[x][y] += 1
		return x,y,check


while True:
	h,w = map(int,input().split())
	if h == 0:
		break
	tile_map = []
	for i in range(h):
		tile_map.append(input())
	check =[[0 for i in range(w)]for j in range(h)]
	check[0][0] = 1
	x = 0
	y = 0
	status = 0

	while True:
		if tile_map[x][y] == '.':
			status = 1
			print(y,x)
			break
		x,y,check = decide_move(x,y,tile_map[x][y],check)
		if check[x][y] > 1:
			status = 1
			print('LOOP')
			break

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

def decide_move(x,y,tile,check):
	if tile == '<':
		x -= 1
		check[x][y] += 1
		return x,y,check
	elif tile == '>':
		x += 1
		check[x][y] += 1
		return x,y,check
	elif tile == '^':
		y -= 1
		check[x][y] += 1
		return x,y,check
	else:
		y += 1
		check[x][y] += 1
		return x,y,check


while True:
	h,w = map(int,input().split())
	if h == 0:
		break
	tile_map = []
	for i in range(h):
		tile_map.append(input())
	check =[[0 for i in range(w)]for j in range(h)]
	check[0][0] = 1
	x = 0
	y = 0
	status = 0

	while True:
		if tile_map[x][y] == '.':
			status = 1
			print(y,x)
			break
		x,y,check = decide_move(x,y,tile_map[x][y],check)
		if check[x][y] > 1:
			status = 1
			print('LOOP')
			break

Fixed submission:
import sys
import math

def decide_move(x,y,tile,check):
	if tile == '<':
		y -= 1
		check[x][y] += 1
		return x,y,check
	elif tile == '>':
		y += 1
		check[x][y] += 1
		return x,y,check
	elif tile == '^':
		x -= 1
		check[x][y] += 1
		return x,y,check
	else:
		x += 1
		check[x][y] += 1
		return x,y,check


while True:
	h,w = map(int,input().split())
	if h == 0:
		break
	tile_map = []
	for i in range(h):
		tile_map.append(input())
	check =[[0 for i in range(w)]for j in range(h)]
	check[0][0] = 1
	x = 0
	y = 0
	status = 0

	while True:
		if tile_map[x][y] == '.':
			status = 1
			print(y,x)
			break
		x,y,check = decide_move(x,y,tile_map[x][y],check)
		if check[x][y] > 1:
			status = 1
			print('LOOP')
			break
Buggy python submission (verdict: Runtime Error):
import sys

dic = {}
while True:
	try:
		a,b = map(str,input(),split())
		page = int(b)

		if a not in dic:
			dic[a] = [page]
		else:
			dic[a].append(page)
			
	except EOFError:
		sorted(dic.keys())
		names = list(dic.keys())
		for i in range(len(names)):
			print(names[i])
			for j in range(len(dic[i])):
				if j == len(dic[i])-1:
					print(dic[i][j])
				else:
					sys.stdout.write(dic[i][j])
		break

Fixed submission:
import sys

dic = {}
while True:
	try:
		a,b = map(str,input().split())
		page = int(b)

		if a not in dic:
			dic[a] = [page]
		else:
			dic[a].append(page)

	except EOFError:
		names = sorted(dic.keys())
		for i in range(len(names)):
			print(names[i])
			pages = sorted(dic[names[i]])
			for j in range(len(pages)):
				if j == len(pages)-1:
					print(pages[j])
				else:
					sys.stdout.write(str('{:} '.format(pages[j])))
		break
Buggy python submission (verdict: Runtime Error):
import sys
while 1:
	n=int(input())
	if n==0:
		break
	s=list(int(input().split()))
	cont=0
	while 1:
		tmp=[]
		for i in range(n):
			tmp[i]=[s.count(s[i])]
		if s==temp:
			print(cont)
			break
		else:
			cont+=1
	for i in range(n):
		if i != n-1:
			sys.stdout('{0} '.format(s[i]))
		else:
			print(s[i])

Fixed submission:
while 1:
	n=int(input())
	if n==0:
		break
	s=list(map(int,input().split()))
	cont=0
	while 1:
		tmp=[]
		for i in range(n):
			tmp.append(s.count(s[i]))
		if s==tmp:
			print(cont)
			break
		else:
			s=tmp
			cont+=1
	for i in range(n):
		if i != n-1:
			print(s[i],end=' ')
		else:
			print(s[i])
Buggy python submission (verdict: Runtime Error):
a,b,c,d = 0,0,0,0
while 1:
	lng=list(int(input().split()))
	lng.sort()
	if lng[0] + lng[1] <= lng[2]:
		print('%d %d %d %d' % (a,b,c,d))
		break
	else:
		a += 1
		if lng[0]**2 + lng[1]**2 == lng[2]**2:
			b += 1
		elif lng[0]**2 + lng[1]**2 >= lng[2]**2:
			d += 1
		else:
			c += 1


Fixed submission:
a,b,c,d = 0,0,0,0
while 1:
	lng=list(map(int,input().split()))
	lng.sort()
	if lng[0] + lng[1] <= lng[2]:
		print('%d %d %d %d' % (a,b,c,d))
		break
	else:
		a += 1
		if lng[0]**2 + lng[1]**2 == lng[2]**2:
			b += 1
		elif lng[0]**2 + lng[1]**2 <= lng[2]**2:
			d += 1
		else:
			c += 1
Buggy python submission (verdict: Runtime Error):
import math

def Eratos(n):
	primes = [2]
	num = [2*i+1 for i in range(1,n//2)]
	tmp = []

	top = 1
	while top < math.sqrt(n):
		top = num[0]
		for i in range(1,len(num)):
			if num[i] % top != 0:
				tmp.append(num[i])
		num = tmp
		tmp = []
		primes.append(top)
	for i in range(len(num)):
		primes.append(num[i])
	return primes

n = int(input())
cont = 0
nums = []
for i in range(n):
	a = int(input())
	nums.append(a)
nums.sort()
primes = Eratos(nums[n-1])
for i in range(n):
	if primes.count(num[i])!=0:
		cont += 1
print(cont)


Fixed submission:
import math

def Eratos(n):
	primes = [2]
	num = [2*i+1 for i in range(1,n//2)]
	tmp = []

	top = 1
	while top < math.sqrt(n):
		top = num[0]
		for i in range(1,len(num)):
			if num[i] % top != 0:
				tmp.append(num[i])
		num = tmp
		tmp = []
		primes.append(top)
	for i in range(len(num)):
		primes.append(num[i])
	return primes

n = int(input())
cont = 0
primes = Eratos(10010)
for i in range(n):
	a = int(input())
	if a<10000:
		if primes.count(a)!=0:
			cont += 1
	else:
		for j in range(len(primes)):
			if a%primes[j]==0:
				break
			else:
				if math.sqrt(a)<primes[j]:
					cont += 1
					break
print(cont)
Buggy python submission (verdict: Runtime Error):
import queue

def Dijkstra(vertex,edges,start):
	weight = [0 if i==start else float("inf") for i in range(vertex)]
	Q = queue.PriorityQueue()
	Q.put((weight[start],start))

	while(not Q.Empty()):
		cur = Q.get()
		if weight[cur[1]] < cur[0]:
			continue
		for j in range(len(edges[cur[1]])):
			if weight[edges[cur[1]][j][1]] > weight[cur[1]] + edges[cur[1]][j][2]:
				weight[edges[cur[1]][j][1]] = weight[cur[1]] + edges[cur[1]][j][2]
				Q.put((weight[edges[cur[1]][j][1]],edges[cur[1]][j][1]))
	return weight

V,E,r = map(int,input().split())
edges = [[] for i in range(V)]
for i in range(E):
	data = list(map(int,input().split()))
	edges[data[0]].append(data)
edges.sort()
w = Dijkstra(V,edges,r)
for i in range(len(w)):
	print(w[i])


Fixed submission:
import queue

def Dijkstra(vertex,edges,start):
	weight = [0 if i==start else float("inf") for i in range(vertex)]
	Q = queue.PriorityQueue()
	Q.put((weight[start],start))

	while(not Q.empty()):
		cur = Q.get()
		if weight[cur[1]] < cur[0]:
			continue
		for j in range(len(edges[cur[1]])):
			if weight[edges[cur[1]][j][1]] > weight[cur[1]] + edges[cur[1]][j][2]:
				weight[edges[cur[1]][j][1]] = weight[cur[1]] + edges[cur[1]][j][2]
				Q.put((weight[edges[cur[1]][j][1]],edges[cur[1]][j][1]))
	return weight

V,E,r = map(int,input().split())
edges = [[] for i in range(V)]
for i in range(E):
	data = list(map(int,input().split()))
	edges[data[0]].append(data)
for j in range(V):
	edges[j].sort()
w = Dijkstra(V,edges,r)
for i in range(len(w)):
	if w[i]==float("inf"):
		print('INF')
	else:
		print(w[i])
Buggy python submission (verdict: Runtime Error):
a,b=map(int(input().split()))
print(a*b,2*(a+b))


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

r = int(input())
print('%f %f' % (2*math.pi*r, (r**2)*math.pi)


Fixed submission:
import math
pi=math.pi
r = float(input())
print('%f %f' % (r*pi*r, 2*r*pi))

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


Fixed submission:
import math
pi=math.pi
r = float(input())
print('%f %f' % (r*pi*r, 2*r*pi))
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
a.sorted()
ans = 0
for i in range(len(a)):
	ans += a[i]
print("%d %d %d" % a[0],a[len(a)-1],ans)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 0
for i in range(len(a)):
	ans += a[i]
print("%d %d %d" % (a[0],a[len(a)-1],ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 0
for i in range(len(a)):
	ans += a[i]
print("%d %d %d" % a[0],a[len(a)-1],ans)


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 0
for i in range(len(a)):
	ans += a[i]
print("%d %d %d" % (a[0],a[len(a)-1],ans))
Buggy python submission (verdict: Runtime Error):
def include3(n):
	cond = 0
	while True:
		if n%10==3:
			cond = 1
			return cond
		elif n>9:
			n /= 10
		else:
			return cond

n = int(input())
print(' ',end='')
for i in range(i,n+1):
	if i%3==0 or include3(n)==1:
		print('%d ' % (n))


Fixed submission:
def include3(n):
	cond = 0
	while True:
		if n%10==3:
			cond = 1
			return cond
		elif n>9:
			n //= 10
		else:
			return cond

n = int(input())
for i in range(1,n+1):
	if i%3==0 or include3(i)==1:
		print(' ',end='')
		print(i,end='')
print()
Buggy python submission (verdict: Runtime Error):
n = int(input())
S,H,C,D = [0 for i in range(13)]
for i in range(n):
	data = input().split()
	num = int(data[1])
	if data[0]=='S':
		S[num-1] = 1
	elif data[0]=='H':
		H[num-1] = 1
	elif data[0]=='C':
		C[num-1] = 1
	else:
		D[num-1] = 1
for j in range(13):
	if S[j]==0:
		print('S %d' % (j+1))
for j in range(13):
	if H[j]==0:
		print('H %d' % (j+1))
for j in range(13):
	if C[j]==0:
		print('C %d' % (j+1))
for j in range(13):
	if D[j]==0:
		print('D %d' % (j+1))


Fixed submission:
n = int(input())
S = [0 for i in range(13)]
H = [0 for i in range(13)]
C = [0 for i in range(13)]
D = [0 for i in range(13)]
for i in range(n):
	data = input().split()
	num = int(data[1])
	if data[0]=='S':
		S[num-1] = 1
	elif data[0]=='H':
		H[num-1] = 1
	elif data[0]=='C':
		C[num-1] = 1
	else:
		D[num-1] = 1
for j in range(13):
	if S[j]==0:
		print('S %d' % (j+1))
for j in range(13):
	if H[j]==0:
		print('H %d' % (j+1))
for j in range(13):
	if C[j]==0:
		print('C %d' % (j+1))
for j in range(13):
	if D[j]==0:
		print('D %d' % (j+1))