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

def is_prime(x,y):
    if(y >= x-1):
        return 1
    elif(x % y == 0):
        return 0
    return 1 and is_prime(x,y+2)

a = ""
l = []
count = 0
for input in sys.stdin:
    a += input
l = sorted(set(a.split()))
for input in l:
    if(int(input) > 2 and int(input) % 2 != 0 and is_prime(int(input),3)):
        count += 1
    elif(int(input) == 2):
        count += 1
print count


Fixed submission:
import sys

def is_prime(x):
    if(x <= 3 and x > 1):
        return True
    elif(x % 2 == 0 or x % 3 == 0 or x < 2):
        return False
    i = 5
    while(i * i <= x):
        if(x % i == 0 or x % (i + 2) == 0):
            return False
        i += 6
    return True

l = []
count = 0
for input in sys.stdin:
    l.append(int(input))
for data in range(1,len(l)):
    if(is_prime(l[data]) == True):
        count += 1
print count

Buggy python submission (verdict: Time Limit Exceeded):
import sys

def is_prime(x,y):
    while(y < x):
        if(x % y == 0):
            return 0
        y += 2
    return 1

a = ""
l = []
count = 0
for input in sys.stdin:
    a += input
l = sorted(set(a.split()))
for input in l:
    if(int(input) > 2 and int(input) % 2 != 0 and is_prime(int(input),3)):
        count += 1
    elif(int(input) == 2):
        count += 1
print count


Fixed submission:
import sys

def is_prime(x):
    if(x <= 3 and x > 1):
        return True
    elif(x % 2 == 0 or x % 3 == 0 or x < 2):
        return False
    i = 5
    while(i * i <= x):
        if(x % i == 0 or x % (i + 2) == 0):
            return False
        i += 6
    return True

l = []
count = 0
for input in sys.stdin:
    l.append(int(input))
for data in range(1,len(l)):
    if(is_prime(l[data]) == True):
        count += 1
print count

Buggy python submission (verdict: Time Limit Exceeded):
import sys

def is_prime(x,y):
    while(y < x):
        if(x % y == 0):
            return 0
        y += 2
    return 1

a = ""
l = []
count = 0
for input in sys.stdin:
    a += input
l = (a.split())
b = int(l[0])
l = sorted(set(l[1:]))
for i in l:
    if(int(i) == 2):
        count += 1
    elif(int(i) > 2 and int(i) % 2 != 0 and is_prime(int(i),3) == 1):
        count += 1
print count


Fixed submission:
import sys

def is_prime(x):
    if(x <= 3 and x > 1):
        return True
    elif(x % 2 == 0 or x % 3 == 0 or x < 2):
        return False
    i = 5
    while(i * i <= x):
        if(x % i == 0 or x % (i + 2) == 0):
            return False
        i += 6
    return True

l = []
count = 0
for input in sys.stdin:
    l.append(int(input))
for data in range(1,len(l)):
    if(is_prime(l[data]) == True):
        count += 1
print count
Buggy python submission (verdict: Runtime Error):
print raw_input()**3


Fixed submission:
print int(raw_input())**3
Buggy python submission (verdict: Runtime Error):
a = raw_input()
a = a.split()
for i in range(0,len(a)):
    a[i] = int(a[i])
b = sorted(a)
for i in range(0,len(a)):
    if(a[i] != b[i] or a[i] == a[i+1]):
        print 'No'
        break
if(i == len(a)-1):
    print 'Yes'


Fixed submission:
a = raw_input()
a = a.split()
for i in range(0,len(a)):
    a[i] = int(a[i])
b = sorted(a)
for i in range(0,len(a)):
    if(a[i] != b[i] or (i != (len(a) - 1) and a[i] == a[i+1])):
        print 'No'
        break
if(i == len(a)-1):
    print 'Yes'
Buggy python submission (verdict: Runtime Error):
import sys

l = []
for input in sys.stdin:
    l.append(input.split())
for i in range(0,len(l)):
    if(l[i][1] == '+'):
        print int(l[i][0])+int(l[i][2])
    elif(l[i][1] == '-'):
        print int(l[i][0])-int(l[i][2])
    elif(l[i][1] == '*'):
        print int(l[i][0])*int(l[i][2])
    elif(l[i][1] == '/'):
        print int(l[i][0])/int(l[i][2])
    else:
        continue


Fixed submission:
import sys

l = []
for i in sys.stdin:
    l.append(i.split())

for i in range(0,len(l)):
    if len(l[i]) == 3:
        if l[i][1] == '+':
            result = int(l[i][0]) + int(l[i][2])
        elif l[i][1] == '-':
            result = int(l[i][0]) - int(l[i][2])
        elif l[i][1] == '*':
            result = int(l[i][0]) * int(l[i][2])
        elif l[i][1] == '/':
            result = int(l[i][0]) / int(l[i][2])
        else:
            break
        print(int(result))

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

l = []
for input in sys.stdin:
    l.append(input.split())
for i in range(0,len(l)):
    if(l[i][1] == '+'):
        print int(l[i][0])+int(l[i][2])
    elif(l[i][1] == '-'):
        print int(l[i][0])-int(l[i][2])
    elif(l[i][1] == '*'):
        print int(l[i][0])*int(l[i][2])
    elif(l[i][1] == '/'):
        print int(l[i][0])/int(l[i][2])
    else:
        continue


Fixed submission:
import sys

l = []
for i in sys.stdin:
    l.append(i.split())

for i in range(0,len(l)):
    if len(l[i]) == 3:
        if l[i][1] == '+':
            result = int(l[i][0]) + int(l[i][2])
        elif l[i][1] == '-':
            result = int(l[i][0]) - int(l[i][2])
        elif l[i][1] == '*':
            result = int(l[i][0]) * int(l[i][2])
        elif l[i][1] == '/':
            result = int(l[i][0]) / int(l[i][2])
        else:
            break
        print(int(result))
Buggy python submission (verdict: Runtime Error):
import math
x=int(input())
pi=math.pi
print(round(2*x*pi,6),round(x*x*pi,6))

Fixed submission:
x=float(input())
pi=3.141592653589793
print(str(round(x*x*pi,6))+" "+str(round(2*x*pi,6)))

Buggy python submission (verdict: Runtime Error):
import math
x=int(input())
pi=math.pi
print(round(2*x*pi,6),round(x*x*pi,6))

Fixed submission:
x=float(input())
pi=3.141592653589793
print(str(round(x*x*pi,6))+" "+str(round(2*x*pi,6)))
Buggy python submission (verdict: Runtime Error):
a = list(map(int, input().split()))
b=""
while (len(a)!=0):
    x=min(a)
    b+=(str(x)+" ")
    a.remove(x)
print(b)

Fixed submission:
a = list(map(int, input().split()))
b=""
while (len(a)!=0):
    x=min(a)
    b+=(str(x)+" ")
    a.remove(x)
print(b.rstrip())

Buggy python submission (verdict: Runtime Error):
a = list(map(int, input().split()))
b=""
while (len(a)!=0):
    x=min(a)
    b+=(str(x)+" ")
    a.remove(x)
print(b)

Fixed submission:
a = list(map(int, input().split()))
b=""
while (len(a)!=0):
    x=min(a)
    b+=(str(x)+" ")
    a.remove(x)
print(b.rstrip())
Buggy python submission (verdict: Runtime Error):
n=int(input())
lst=[]
for i in range(n):
    lst.append(input())
lst=lst.sort()
print(lst)
print(lst[0])

Fixed submission:
n=int(input())
lst=[]
for i in range(n):
    lst.append(input())
#lst.sort()
#print(lst)
#print(lst[0])
c="zzzzzzzzzzzzzzzzzzzzzzz"
for j in lst:
    if j < c:
        c=j
print(c)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
S=list(map(int,input().split()))
q=int(input())
T=list(map(int,input().split()))
ans=0
for i in T:
    if i in S:
        ans += 1
print(ans)

Fixed submission:
input()
a=set(input().split())
input()
b=set(input().split())

print(len(a&b))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
S=list(map(int,input().split()))
q=int(input())
T=list(map(int,input().split()))
ans=0
for i in T:
    if i in S:
        ans += 1
        S.remove(i)
print(ans)

Fixed submission:
input()
a=set(input().split())
input()
b=set(input().split())

print(len(a&b))
Buggy python submission (verdict: Runtime Error):
"""
# Too slow
def add2(a, b):
    a, b = align_digit(a, b)
    zipped = zip(a[::-1], b[::-1])
    carry = 0
    result = []
    for a, b in zipped:
        s = int(a) + int(b) + carry
        carry = int(s / 10)
        result.append(str(s % 10))
    if result[-1] == '0':
        result[-1] = str(carry)
    print(''.join(result[::-1]))
"""


def align_digit(a, b):
    la, lb = len(a), len(b)
    if la < lb:
        a = a.zfill(lb)
    elif lb < la:
        b = b.zfill(la)
    return a, b


def split_to_ints(s, n=10):
    length = len(s)
    return [int(s[i-n:i]) for i in range(length, 0, -n)]


def add(a, b, n=10):
    a, b = align_digit(a, b)
    print(a, b)
    ints_a = split_to_ints(a, n)
    ints_b = split_to_ints(b, n)
    carry = 0
    result = []

    zipped = list(zip(ints_a, ints_b))[::-1]
    print(zipped)
    for i, (int_a, int_b) in enumerate(zipped):
        s = int_a + int_b + carry
        carry = int(s / (10 ** n))
        if i != len(zipped) - 1:
            result.append(str(s % (10 ** (n - 1))).zfill(n))
        else:
            result.append(str(s))

    print(result)
    ret = str(int(''.join(reversed(result))))
    if len(ret) > 80:
        return 'overflow'
    return ret


if __name__ == '__main__':
    n_input = int(input())
    for i in range(n_input):
        a, b = input(), input()
        print(add(a, b))


Fixed submission:
# 12,432 -> 012,432
def align_digits(a, b):
    la, lb = len(a), len(b)
    if la < lb:
        a = a.zfill(lb)
    elif lb < la:
        b = b.zfill(la)
    return a, b


def add(a, b):
    a, b = align_digits(a, b)
    zipped = list(zip(a[::-1], b[::-1]))
    carry = 0
    result = []
    for i, z in enumerate(zipped):
        a, b = z
        s = int(a) + int(b) + carry
        carry = int(s / 10)
        if i == len(zipped) - 1:
            result.append(str(s))
        else:
            result.append(str(s % 10))
    ans = ''.join(result[::-1])
    if len(ans) > 80:
        return 'overflow'
    return ans


if __name__ == '__main__':
    n_input = int(input())
    inputs = []
    for i in range(n_input):
        inputs.append((input(), input()))
    for a, b in inputs:
        print(add(a, b))
Buggy python submission (verdict: Runtime Error):
a=x*x*x
print a


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

Buggy python submission (verdict: Runtime Error):
x=imput()
y=x**3
print int(y)


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

Buggy python submission (verdict: Runtime Error):
x=imput()
y=pow(x,3)
print int(y)


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

Buggy python submission (verdict: Runtime Error):
def main():
x=imput()
y=pow(x,3)
print (y)


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

a = input()
b = input()

x=a*b
y=2*(a+b)

print int(x)
print int(y)



Fixed submission:
a,b=map(int,input().split())
print(a*b,2*(a+b))
Buggy python submission (verdict: Time Limit Exceeded):
def wa(a,x,y):
    S = 0
    for i in range(x,y+1):
        S = S + a[i]
    return S

n = int(input())
while n != 0:
    a = []
    for i in range(n):
        a.append(int(input()))
    ans = a[0]
    for i in range(n):
        for j in range(i+1,n):
            ans = max(wa(a,i,j),ans)
    print(ans)
    n = int(input())



Fixed submission:
import math

def sign(x):
    if x >= 0:
        return True
    else:
        return False

n = int(input())
while n != 0:
    a = []
    for i in range(n):
        a.append(int(input()))
    b = []
    b.append(a[0])
    for i in range(1,len(a)):
        if b[len(b)-1] > 0 and a[i] > 0:
            b[len(b)-1] = b[len(b)-1] + a[i]
        else:
            b.append(a[i])

    ans = b[0]
    for i in range(len(b)):
        S = 0
        for j in range(i,len(b)):
            S = S + b[j]
            ans = max(S, ans)
    print(ans)
    n = int(input())

Buggy python submission (verdict: Time Limit Exceeded):
import math

def sign(x):
    if x >= 0:
        return True
    else:
        return False

def wa(a,x,y):
    S = 0
    for i in range(x,y+1):
        S = S + a[i]
    return S

n = int(input())
while n != 0:
    a = []
    for i in range(n):
        a.append(int(input()))
    b = []
    b.append(a[0])
    for i in range(1,len(a)):
        if sign(b[len(b)-1]) == sign(a[i]):
            b[len(b)-1] = b[len(b)-1] + a[i]
        else:
            b.append(a[i])

    ans = b[0]
    for i in range(len(b)):
        for j in range(i,len(b)):
            ans = max(wa(b,i,j),ans)
    print(ans)
    n = int(input())



Fixed submission:
import math

def sign(x):
    if x >= 0:
        return True
    else:
        return False

n = int(input())
while n != 0:
    a = []
    for i in range(n):
        a.append(int(input()))
    b = []
    b.append(a[0])
    for i in range(1,len(a)):
        if b[len(b)-1] > 0 and a[i] > 0:
            b[len(b)-1] = b[len(b)-1] + a[i]
        else:
            b.append(a[i])

    ans = b[0]
    for i in range(len(b)):
        S = 0
        for j in range(i,len(b)):
            S = S + b[j]
            ans = max(S, ans)
    print(ans)
    n = int(input())
Buggy python submission (verdict: Time Limit Exceeded):
def get_input():
    while True:
        try:
            yield ''.join(input())
        except EOFError:
            break

ans1 = [1 for i in range(4001)]
ans2 = [0 for i in range(4001)]
ans3 = [0 for i in range(4001)]
ans4 = [0 for i in range(4001)]

for i in range(1001):
    ans1[i] = 1
for i in range(1001,4001):
    ans1[i] = 0

for i in range(4001):
    for j in range(i+1):
        ans2[i] += ans1[j]

for i in range(4001):
    for j in range(i+1):
        ans3[i] += ans2[j]

for i in range(4001):
    for j in range(i+1):
        ans4[i] += ans3[j]

N = list(get_input())
for l in range(len(N)):
    print(ans4[int(N[l])])



Fixed submission:
def get_input():
    while True:
        try:
            yield ''.join(input())
        except EOFError:
            break

ans1 = [0 for i in range(4001)]
ans2 = [0 for i in range(4001)]
ans3 = [0 for i in range(4001)]
ans4 = [0 for i in range(4001)]

for i in range(1001):
    ans1[i] = 1
for i in range(1001,4001):
    ans1[i] = 0

for i in range(4001):
    for j in range(1001):
        ans2[i] += ans1[i-j]

for i in range(4001):
    for j in range(1001):
        ans3[i] += ans2[i-j]

for i in range(4001):
    for j in range(1001):
        ans4[i] += ans3[i-j]

#print("DONE")
N = list(get_input())
for l in range(len(N)):
    print(ans4[int(N[l])])
Buggy python submission (verdict: Runtime Error):
def search(table, visited, i, j, c):
    visited[i][j] = True

    if table[i-1][j] == c and visited[i-1][j] == False:
        search(table, visited, i-1, j, c)
    if table[i+1][j] == c and visited[i+1][j] == False:
        search(table, visited, i+1, j, c)
    if table[i][j-1] == c and visited[i][j-1] == False:
        search(table, visited, i, j-1, c)
    if table[i][j+1] == c and visited[i][j+1] == False:
        search(table, visited, i, j+1, c)

    return

while True:
    H,W = [int(i) for i in input().split()]
    if H == 0 and W == 0:
        break

    visited = [[False for i in range(W+2)] for j in range(H+2)]
    table = [["." for i in range(W+2)] for j in range(H+2)]

    for i in range(1, H+1):
        s = input()
        for j in range(1, W+1):
            table[i][j] = s[j-1]

    ans = 0
    for i in range(1, H+1):
        for j in range(1, W+1):
            if visited[i][j] == False:
                ans = ans + 1
                search(table, visited, i, j, table[i][j])
    print(ans)




Fixed submission:
import sys

sys.setrecursionlimit(20000)

def search(table, visited, i, j, c):
    visited[i][j] = True

    if table[i+1][j] == c and visited[i+1][j] == False:
        search(table, visited, i+1, j, c)
    if table[i-1][j] == c and visited[i-1][j] == False:
        search(table, visited, i-1, j, c)
    if table[i][j+1] == c and visited[i][j+1] == False:
        search(table, visited, i, j+1, c)
    if table[i][j-1] == c and visited[i][j-1] == False:
        search(table, visited, i, j-1, c)


while True:
    H,W = [int(i) for i in input().split()]
    if H == 0 and W == 0:
        break

    visited = [[False for i in range(W+2)] for j in range(H+2)]
    table = [["." for i in range(W+2)] for j in range(H+2)]

    for i in range(1,H+1):
        s = input()
        for j in range(1,W+1):
            table[i][j] = s[j-1]

    ans = 0
    for i in range(1,H+1):
        for j in range(1,W+1):
            if visited[i][j] == False:
                ans += 1
                search(table, visited, i, j, table[i][j])

    print(ans)
Buggy python submission (verdict: Runtime Error):
while True:
    N = input()
    if N == "0":
        break

    q1,b,c1,c2,q2 = [int(i) for i in N.split()]

    x = min((b-c2*q1) // (c1-c2), q2, b // c1)
    y = (b-c1*x) // c2

    if x <= 0:
        print("NA")
    else:
        print(x,y)



Fixed submission:
while True:
    N = input()
    if N == "0":
        break

    q1,b,c1,c2,q2 = [int(i) for i in N.split()]

    if c1 <= c2:
        x = min(q2, b // c1)
    else:
        x = min((b-c2*q1) // (c1-c2), q2, b // c1)
    y = (b-c1*x) // c2

    if x <= 0 or x + y < q1:
        print("NA")
    else:
        print(x,y)
Buggy python submission (verdict: Runtime Error):
import math
x1,y1,x2,y2 = map(int,input().split(" "))
yoko = x2 - x1
tate = y2 - y1
print(math.sqrt(yoko**2+tate**2))

Fixed submission:
import math
x1,y1,x2,y2 = map(float,input().split(" "))
yoko = x2 - x1
tate = y2 - y1
print(math.sqrt(yoko**2+tate**2))
Buggy python submission (verdict: Runtime Error):
from collections import deque
n = int(input())

d = deque()

for _ in range(n):
    com = input()
    if ( len(com) == 8):
        com , i = com.split()

    if (com[0] == 'i'):
        d.appendleft(int(i))
    elif (com[0] == 'd'):
        if (len(com) == 6):
            d.remove(int(i))
        elif (com[6] == 'F'):
            d.popleft()
        elif (com[6] == 'L'):
            d.pop()
ans = map(str, d)
ans = " ".join(ans)
print(ans)

Fixed submission:
from collections import deque
n = int(input())

d = deque()

for _ in range(n):
    com = input()
    if (com[0] == 'i'):
        com ,i = com.split()
        d.appendleft(int(i))
    elif (com[0] == 'd'):
        if (com[6] == ' '):
            com, i = com.split()
            try:
                d.remove(int(i))
            except ValueError:
                pass
        elif (com[6] == 'F'):
            d.popleft()
        elif (com[6] == 'L'):
            d.pop()
ans = map(str, d)
ans = " ".join(ans)
print(ans)

Buggy python submission (verdict: Runtime Error):
from collections import deque
n = int(input())

d = deque()

for _ in range(n):
    com = input()

    if (com[0] == 'i'):
        com ,i = com.split()
        d.appendleft(int(i))
    elif (com[0] == 'd'):
        if (com[7].isdigit()):
            com, i = com.split()
            d.remove(int(i))
        elif (com[6] == 'F'):
            d.popleft()
        elif (com[6] == 'L'):
            d.pop()
ans = map(str, d)
ans = " ".join(ans)
print(ans)

Fixed submission:
from collections import deque
n = int(input())

d = deque()

for _ in range(n):
    com = input()
    if (com[0] == 'i'):
        com ,i = com.split()
        d.appendleft(int(i))
    elif (com[0] == 'd'):
        if (com[6] == ' '):
            com, i = com.split()
            try:
                d.remove(int(i))
            except ValueError:
                pass
        elif (com[6] == 'F'):
            d.popleft()
        elif (com[6] == 'L'):
            d.pop()
ans = map(str, d)
ans = " ".join(ans)
print(ans)
Buggy python submission (verdict: Runtime Error):
print "\n".join(sorted([input() for x in xrange(10)])[:3])

Fixed submission:
print "\n".join(map(str,sorted([input() for _ in xrange(10)], reverse = True)[:3]))
Buggy python submission (verdict: Runtime Error):
while True:
	dict = {}
	n = input()
	if n == 0:break
	for x in xrange(n):
		a, b = raw_input().split()
		dict[a] = b
	res = ""
	for x in xrange(input()):
		a = raw_input()
		if a in dict:
			res += dict[a]
		else
			res += a
	print a

Fixed submission:
while True:
	dict = {}
	n = input()
	if n == 0:break
	for x in xrange(n):
		a, b = raw_input().split()
		dict[a] = b
	res = ""
	for x in xrange(input()):
		a = raw_input()[0]
		if a in dict:
			res += dict[a]
		else:
			res += a
	print res
Buggy python submission (verdict: Runtime Error):
def comb(a, b):
    if(a < b or b < 0):return 0
    if(b > a - b)return comb(a, a - b)
    return comb(a, b - 1) * (a - b + 1) / b

a, b, c = map(int, raw_input().split())
c -= a * b
print comb(c + a - 1, c)

Fixed submission:
def fact(x):
    res = 1
    for i in xrange(1, x + 1):
        res *= i
    return res

def comb(a, b):
    if(a < b or b < 0):return 0
    if(b == 0):return 1
    return fact(a)/fact(b)/fact(a-b)

a, b, c = map(int, raw_input().split())
c -= a * b
print comb(c + a - 1, c)

Buggy python submission (verdict: Runtime Error):
def comb(a, b):
    if(a < b or b < 0):return 0
    if(b > a - b):return comb(a, a - b)
    return comb(a, b - 1) * (a - b + 1) / b

a, b, c = map(int, raw_input().split())
c -= a * b
print comb(c + a - 1, c)

Fixed submission:
def fact(x):
    res = 1
    for i in xrange(1, x + 1):
        res *= i
    return res

def comb(a, b):
    if(a < b or b < 0):return 0
    if(b == 0):return 1
    return fact(a)/fact(b)/fact(a-b)

a, b, c = map(int, raw_input().split())
c -= a * b
print comb(c + a - 1, c)

Buggy python submission (verdict: Runtime Error):
def comb(a, b):
    if(a < b or b < 0):return 0
	if(b == 0):return 1
    if(b > a - b):return comb(a, a - b)
    return comb(a, b - 1) * (a - b + 1) / b

a, b, c = map(int, raw_input().split())
c -= a * b
print comb(c + a - 1, c)

Fixed submission:
def fact(x):
    res = 1
    for i in xrange(1, x + 1):
        res *= i
    return res

def comb(a, b):
    if(a < b or b < 0):return 0
    if(b == 0):return 1
    return fact(a)/fact(b)/fact(a-b)

a, b, c = map(int, raw_input().split())
c -= a * b
print comb(c + a - 1, c)

Buggy python submission (verdict: Runtime Error):
def comb(a, b):
    if(a < b or b < 0):return 0
    if(b == 0):return 1
    if(b > a - b):return comb(a, a - b)
    return comb(a, b - 1) * (a - b + 1) / b

a, b, c = map(int, raw_input().split())
c -= a * b
print comb(c + a - 1, c)

Fixed submission:
def fact(x):
    res = 1
    for i in xrange(1, x + 1):
        res *= i
    return res

def comb(a, b):
    if(a < b or b < 0):return 0
    if(b == 0):return 1
    return fact(a)/fact(b)/fact(a-b)

a, b, c = map(int, raw_input().split())
c -= a * b
print comb(c + a - 1, c)
Buggy python submission (verdict: Runtime Error):

a = int(raw_input())
# ??????
print a*a*a

Fixed submission:
# -*- coding: utf-8 -*-
a = int(raw_input())
# ??????
print a*a*a
Buggy python submission (verdict: Runtime Error):
a, b = raw_input().split(' ')
a = int(a)
b = int(b)
s = a * b
s2 = 2 * (a + b)
print("%d %d" % (s, s2))

Fixed submission:
a, b = raw_input().split(' ')
a = int(a)
b = int(b)
s = a * b
s2 = 2 * (a + b)
print("%d %d" % (s, s2))
Buggy python submission (verdict: Runtime Error):
a = sorted(map(int,input().split(" ")),reverse=True)
for i in range(0,3):
	print(a[i])

Fixed submission:
a = [int(input()) for i in range(0,10)]
a.sort(reverse=True)
for i in range(0,3):
	print(a[i])
Buggy python submission (verdict: Runtime Error):
r = int(input())
pi = 3.141592653589
print("{0:0.8f} {1:0.8f}".format(r**2*pi,r*2*pi))

Fixed submission:
import math
r = float(input())
print("{0:.6f} {1:.6f}".format(r**2*math.pi,r*2*math.pi))

Buggy python submission (verdict: Runtime Error):
r = int(input())
pi = 3.141592653589
print("{0:0.6f} {1:0.6f}".format((r**2)*pi,r*2*pi))

Fixed submission:
import math
r = float(input())
print("{0:.6f} {1:.6f}".format(r**2*math.pi,r*2*math.pi))

Buggy python submission (verdict: Runtime Error):
r = int(input().split(" "))
pi = 3.141592653589
print("{0:0.6f} {1:0.6f}".format((r**2)*pi,r*2*pi))

Fixed submission:
import math
r = float(input())
print("{0:.6f} {1:.6f}".format(r**2*math.pi,r*2*math.pi))

Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
print("{0:0.6f} {1:0.6f}".format((r**2)*math.pi,r*2*math.pi))

Fixed submission:
import math
r = float(input())
print("{0:.6f} {1:.6f}".format(r**2*math.pi,r*2*math.pi))

Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
print("{0:.6f} {1:.6f}".format(r**2*math.pi,r*2*math.pi))

Fixed submission:
import math
r = float(input())
print("{0:.6f} {1:.6f}".format(r**2*math.pi,r*2*math.pi))
Buggy python submission (verdict: Runtime Error):
a,b=input().split(" ")
a=int(a)
b=int(b)
print(a*b,2*(a+b))

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