Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a=input().split()
b=[]
for i in range(len(a)):

	if a[i]=="+":

		b[len(b)-2]=b[len(b)-2]+b[len(b)-1];
		del b[len(b)-1]

	elif a[i]=="-":

		b[len(b)-2]=b[len(b)-2]-b[len(b)-1];
		del b[len(b)-1]

	elif a[i]=="*":

		b[len(b)-2]=b[len(b)-2]*b[len(b)-1];
		del b[len(b)-1]

	else:
		b.append(int(a[i]))

		
print(b[len(b)-1])


Fixed submission:
a=input().split()
b=[]
for i in range(len(a)):

	if a[i]=="+":

		b[len(b)-2]=b[len(b)-2]+b[len(b)-1];
		del b[len(b)-1]

	elif a[i]=="-":

		b[len(b)-2]=b[len(b)-2]-b[len(b)-1];
		del b[len(b)-1]

	elif a[i]=="*":

		b[len(b)-2]=b[len(b)-2]*b[len(b)-1];
		del b[len(b)-1]

	else:
		b.append(int(a[i]))

		
print(b[len(b)-1])

Buggy python submission (verdict: Runtime Error):
a=input().split()
b=[]
for i in range(len(a)):

	if a[i]=="+":

		b[len(b)-2]=b[len(b)-2]+b[len(b)-1];
		del b[len(b)-1]

	elif a[i]=="-":

		b[len(b)-2]=b[len(b)-2]-b[len(b)-1];
		del b[len(b)-1]

	elif a[i]=="*":

		b[len(b)-2]=b[len(b)-2]*b[len(b)-1];
		del b[len(b)-1]

	else:
		b.append(int(a[i]))

		
print(b[len(b)-1])


Fixed submission:
a=input().split()
b=[]
for i in range(len(a)):

	if a[i]=="+":

		b[len(b)-2]=b[len(b)-2]+b[len(b)-1];
		del b[len(b)-1]

	elif a[i]=="-":

		b[len(b)-2]=b[len(b)-2]-b[len(b)-1];
		del b[len(b)-1]

	elif a[i]=="*":

		b[len(b)-2]=b[len(b)-2]*b[len(b)-1];
		del b[len(b)-1]

	else:
		b.append(int(a[i]))

		
print(b[len(b)-1])
Buggy python submission (verdict: Runtime Error):
n=int(input())
x=[0 for i in range(n)]
y=[0 for i in range(n)]
for i in range(n):
    x[i]=input()
    y[i]=input()

for i in range(n):
    X=list(x[i])
    Y=list(y[i])
    a=[int(0) for i in range(len(X))]
    for j in range(len(X)):
        b=-1
        for l in range(j,len(X)):
            for k in range(len(Y)):
                if X[l]==Y[k] and b<k:
                    b=k
                    a[j]+=1
                    break
                
    print(max(a))
a=[0 for i in range(n)]a=[0 for i in range(n)]


Fixed submission:
def lcs(x, y):
    a = len(x)
    b = len(y)
    c1 = [0] * (b + 1)
    for i in range(a):
        e1 = x[i]
        c2 = c1[:]#スライス
        for j in range(b):
            if e1 == y[j]:
                c1[j+1] = c2[j] + 1
            elif c1[j+1] < c1[j]:
                c1[j+1] = c1[j]
    return c1[-1]
    
n = int(input().rstrip())#rstripで余計な空白削除
ret = []
for i in range(n):
    s1 = input().rstrip()
    s2 = input().rstrip()
    ret.append(lcs(s1, s2))
print(*ret, sep="\n")
Buggy python submission (verdict: Runtime Error):
n=int(input())

list=list(map(int,input().split()))
for i in range(1,N):
    v=A[i]
    j=i-1
    while j>=0 and A[j]>v:
        A[j+1]=A[j]
        j=j-1
        A[j+1]=v
    for i in range(len(A)):
        if i!=len(A)-1:
            print(A[i],end=' ')
        else :
            print(A[i])





Fixed submission:
n=int(input())

list=list(map(int,input().split()))
for i2 in range(len(list)):
    if i2!=len(list)-1:
        print(list[i2],end=' ')
    else :
        print(list[i2])

for i in range(1,n):
    v=list[i]
    j=i-1
    while j>=0 and list[j]>v:
        list[j+1]=list[j]
        j=j-1
    list[j+1]=v
    for i2 in range(len(list)):
        if i2!=len(list)-1:
            print(list[i2],end=' ')
        else :
            print(list[i2])
Buggy python submission (verdict: Runtime Error):
list=[]
for i in input.split():
    if i=='+':
        list[len(list)-1]=list[len(list)-1]+list[len(list)]
        list.pop()
    elif i=='-':
        list[len(list)-1]=[len(list)-1]-list[len(list)]
        list.pop()
    elif i=='*':
        list[len(list)-1]=[len(list)-1]*list[len(list)]
        list.pop()
    else:
        list.append()
print(list[0])



Fixed submission:
list=[]
for i in input().split():
    if i=='+':
        list[len(list)-2]=int(list[len(list)-2])+int(list[len(list)-1])
        list.pop()
    elif i=='-':
        list[len(list)-2]=int(list[len(list)-2])-int(list[len(list)-1])
        list.pop()
    elif i=='*':
        list[len(list)-2]=int(list[len(list)-2])*int(list[len(list)-1])
        list.pop()
    else:
        list.append(i)
print(list[0])
Buggy python submission (verdict: Runtime Error):

n=int(input())
lista=[0 for i in range(n)]
lista=input().split()
n2=int(input())
listb=[0 for i in range(n2)]
listb=input().split()
cnt=0
for i in range(n2):
    x=0
    
    for j in range(n):
        if listb[i]==lista[j] and if x==0:
            x=1
            cnt+=1

print(cnt)


Fixed submission:

n=int(input())
lista=[0 for i in range(n)]
lista=input().split()
n2=int(input())
listb=[0 for i in range(n2)]
listb=input().split()
cnt=0
for i in range(n2):
    x=0
    
    for j in range(n):
        if listb[i]==lista[j] and x==0:
            x=1
            cnt+=1

print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
lista=[0 for i in range(n)]
lista=input().split()
n2=int(input())
listb=[0 for i in range(n2)]
listb=input().split()
cnt=0
for i in range(n2):
    x=0
    for j in range(n):
        if listb[i]==lista[j] and x==0:
            x=1
            cnt+=1
print(cnt)


Fixed submission:
n=int(input())
lista=[int(i) for i in input().split()]
n2=int(input())
listb=[int(i) for i in input().split()]
cnt=0


for i in listb:
    C=int(len(lista)/2)
    D=[0,len(lista)]
    while(1):
        if i<lista[C]:
            for k in D:
                if C>k:
                    d=k
                    break
            D.insert(0,C)
            C=int((C+d)/2)

        elif i>lista[C]:
            for k in D:
                if C<k:
                    d=k
                    break
            D.insert(0,C)
            C=int((C+d)/2)
        else:
            cnt+=1
            break
    
        if C==D[0]:
            break
    
        
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
lista=[0 for i in range(n)]
lista=input().split()
n2=int(input())
listb=[0 for i in range(n2)]
listb=input().split()
cnt=0

for i in range(n2):
    x=0

    
    if int(lista[int(n/2)])>int(listb[i]):
        listc=[lista[k] for k in range(int(n/2))]
    
        for j in range(len(listc)):
            if listb[i]==listc[j] and x==0:
                
                x=1
                cnt+=1
    else: 
        listc=[lista[k] for k in range(int(n/2),n)]
      
        for j in range(len(listc)):
          
            if listb[i]==listc[j] and x==0:
               
                x=1
                cnt+=1
print(cnt)


Fixed submission:
n=int(input())
lista=[int(i) for i in input().split()]
n2=int(input())
listb=[int(i) for i in input().split()]
cnt=0


for i in listb:
    C=int(len(lista)/2)
    D=[0,len(lista)]
    while(1):
        if i<lista[C]:
            for k in D:
                if C>k:
                    d=k
                    break
            D.insert(0,C)
            C=int((C+d)/2)

        elif i>lista[C]:
            for k in D:
                if C<k:
                    d=k
                    break
            D.insert(0,C)
            C=int((C+d)/2)
        else:
            cnt+=1
            break
    
        if C==D[0]:
            break
    
        
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
list=[]
list1=[]
for i in range(n):
    a,b=map(str,input().split())
    if a=="insert":
        list.append(b)
    if a=="find":
        if b in list:
            list1.append(1)
        else:
            list1.append(0)

for i in range(len(list1)):
    if list1[i]==1:
        print("yes")
    else:
        print("no")
        


Fixed submission:
n=int(input())
list={}
list1=[]
for i in range(n):
    a,b=map(str,input().split())
    if a=="insert":
        list.setdefault(b,i)
    if a=="find":
        if b in list:
            list1.append("yes")
        else:
            list1.append("no")

for i in list1:
    print(i)

Buggy python submission (verdict: Runtime Error):
n=int(input())
list=[]
list1=[]
for i in range(n):
    a,b=map(str,input().split())
    if a=="insert":
        list.append(b)
    if a=="find":
        if b in list:
            list1.append("yes")
        else:
            list1.append("no")

for i in list1:
    print(i


Fixed submission:
n=int(input())
list={}
list1=[]
for i in range(n):
    a,b=map(str,input().split())
    if a=="insert":
        list.setdefault(b,i)
    if a=="find":
        if b in list:
            list1.append("yes")
        else:
            list1.append("no")

for i in list1:
    print(i)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
list=[]
list1=[]
for i in range(n):
    a,b=map(str,input().split())
    if a=="insert":
        list.append(b)
    if a=="find":
        if b in list:
            list1.append("yes")
        else:
            list1.append("no")

for i in list1:
    print(i)


Fixed submission:
n=int(input())
list={}
list1=[]
for i in range(n):
    a,b=map(str,input().split())
    if a=="insert":
        list.setdefault(b,i)
    if a=="find":
        if b in list:
            list1.append("yes")
        else:
            list1.append("no")

for i in list1:
    print(i)
Buggy python submission (verdict: Runtime Error):
a=input().split()
n=int(a[0])
q=int(a[1])
b=[0 for i in range(2*n)]
cnt=0
for i in range(n):
    B=input().split()
    b[2*i]=B[0]
    b[2*i+1]=int(B[1])
while len(b)>0:
    if b[1]-100>0:
        tmp1=b[0]
        tmp2=b[1]-100
        del b[0]
        del b[0]
        b.append(tmp1)
        b.append(tmp2)
        cnt=cnt+100
    else:
        cnt=cnt+b[1]
        print(b[0],cnt)
        del b[0]
        del b[0


Fixed submission:
a=input().split()
n=(int)(a[0])
q=(int)(a[1])
b=[0 for i in range(2*n)]
cnt=0
tmp=0
for i in range(n):
    B=input().split()
    b[2*i]=B[0]
    b[2*i+1]=int(B[1])
while len(b)>0:
    tmp=b[1]-q
    if tmp>0:
        b.append(b[0])
        b.append(tmp)
        del b[0]
        del b[0]
        cnt=cnt+q
    else:
        cnt=cnt+b[1]
        print(b[0],cnt)
        del b[0]
        del b[0]
Buggy python submission (verdict: Runtime Error):
def levenshtein(X,Y):
    f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]
    for i in range(len(X)+1):
        f[i][0]=i
    for j in range(1,len(Y)+1):
        f[0][j]=j
    for i in range(1,len(X)+1):
        for j in range(len(Y)+1):
            if X[i-1]==Y[j-1]:
                f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])
            else:
                f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)
    return f[len(X)][len(Y)]

X=input()
Y=input()

print(levenshtein(X,Y))


Fixed submission:
def levenshtein(X,Y):
    f=[[0 for i in range(len(Y)+1)]for j in range(len(X)+1)]
    for i in range(len(X)+1):
        f[i][0]=i
    for j in range(len(Y)+1):
        f[0][j]=j
    for i in range(1,len(X)+1):
        for j in range(1,len(Y)+1):
            if X[i-1]==Y[j-1]:
                f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1])
            else:
                f[i][j]=min(f[i-1][j]+1,f[i][j-1]+1,f[i-1][j-1]+1)
    return f[len(X)][len(Y)]

X=input()
Y=input()

print(levenshtein(X,Y))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input(),split()))

for i in range(n):
	v=a[i]
	j=i-1
	while j>=0 and a[j]>v:
		a[j+1]=a[j]
		j=j-1
	a[j+1]=v
	print(' '.join(map(str,a)))



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

for i in range(n):
	v=a[i]
	j=i-1
	while j>=0 and a[j]>v:
		a[j+1]=a[j]
		j=j-1
	a[j+1]=v
	print(' '.join(map(str,a)))

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

print(' '.join(map(str,a)))

for i in range(1,n):
	v=a[i]
	j=i-1
	while j>=0 and a[j]>v:
		a[j+1]=a[j]
		j=j-1
	a[j+1]=v
	print(' '.join(map(str,a)))


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

for i in range(n):
	v=a[i]
	j=i-1
	while j>=0 and a[j]>v:
		a[j+1]=a[j]
		j=j-1
	a[j+1]=v
	print(' '.join(map(str,a)))
Buggy python submission (verdict: Runtime Error):
import math

def is_prime(n):
	for i in range(2,math.floor(math.sqrt(n))+1):
		if n!=2 or n%2==0:
			return False
		elif n%i==0:
			return False
    return True
 
cnt = 0
n=int(input())
for i in range(n):
    k=int(input())
    if is_prime(k):
        cnt += 1
 
print(cnt)


Fixed submission:
import math

def is_prime(n):
	for i in range(2,math.floor(math.sqrt(n))+1):
		if n%i==0:
			return False
	return True
 
cnt = 0
n=int(input())
for i in range(n):
    k=int(input())
    if is_prime(k):
        cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
S=[]
T=[]
S_num=int(input())
S=input().split()
T_num=int(input())
T=input().split()
cnt=0

for i in T:
	print(i)
	right=S_num-1
	left=0
	center=int((right+left)/2)
	while left<=center and right>=center:
		if S[center]==T[i]:
			cnt+=1
			break
		elif S[center]>i:
			right=center-1
			center=int((left+right)/2)
		elif S[center]<i:
			left=center+1
			center=int((left+right)/2)
print(cnt)


Fixed submission:
s = int(input())
S = list(map(int, input().split()))
t= int(input())
T = list(map(int, input().split()))
cnt = 0
for i in T:
	a=0
	b=s-1
	while b >= a:
		mid=int((a+b)/2)
		if S[mid]==i:
			cnt+= 1
			break
		elif S[mid]>i:
			b=mid-1
			continue
		else:
			a=mid+1
			continue
print(cnt)

Buggy python submission (verdict: Runtime Error):
def binary_search(S,i,S_num)
	left=0
	right=
	while left<right:
		center=int((left+right)/2)
		if S[center]==i:
			return True
		elif S[center]>i:
			right=center-1
		elif S[center]<i:
			left=center+1
	return False

S=[]
T=[]
S_num=int(input())
S=input().split()
T_num=int(input())
T=input().split()
cnt=0

for i in T:
	if binary_search(S,i,S_num):
		cnt+=1
	
print(cnt)


Fixed submission:
s = int(input())
S = list(map(int, input().split()))
t= int(input())
T = list(map(int, input().split()))
cnt = 0
for i in T:
	a=0
	b=s-1
	while b >= a:
		mid=int((a+b)/2)
		if S[mid]==i:
			cnt+= 1
			break
		elif S[mid]>i:
			b=mid-1
			continue
		else:
			a=mid+1
			continue
print(cnt)
Buggy python submission (verdict: Runtime Error):
import math
  
n = int(input())
 
def koch(n,x_0,y_0,x_1,y_1):
    if n == 0:
        return  
    x_s = x_0 + (x_1- x_0)/3
    y_s = y_0 + (y_1 -y_0)/3
    x_t = x_0 + (x_1- x_0)* 2/3
    y_t = y_0 + (y_1 -y_0) *2/3
    x_u =  (x_t - x_s) * math.cos(math.pi/3) - (y_t - y_s) * math.sin(math.pi/3) + x_s
    y_u =  (x_t - x_s) * math.sin(math.pi/3) + (y_t - y_s) * math.cos(math.pi/3) + y_s
  
    koch(n-1,x_0,y_0,x_s,y_s)
    print(x_s,y_s)
    koch(n-1,x_s,y_s,x_u,y_u)
    print(x_u,y_u)
    koch(n-1,x_u,y_u,x_t,y_t)
    print(x_t,y_t)
    koch(n-1,x_t,y_t,x_1,y_1)
      
print(0,0)
koch(n,0,0,100,0)
print(100,0)


Fixed submission:
import math
  
n = int(input())
  
  
  
def koch(n,x_0,y_0,x_1,y_1):
    if n == 0:
        return  
    x_m1 = x_0 + (x_1- x_0)/3
    y_m1 = y_0 + (y_1 -y_0)/3
    x_m2 = x_0 + (x_1- x_0)* 2/3
    y_m2 = y_0 + (y_1 -y_0) *2/3
    x_m =  (x_m2 - x_m1) * math.cos(math.pi/3) - (y_m2 - y_m1) * math.sin(math.pi/3) + x_m1
    y_m =  (x_m2 - x_m1) * math.sin(math.pi/3) + (y_m2 - y_m1) * math.cos(math.pi/3) + y_m1
  
    koch(n-1,x_0,y_0,x_m1,y_m1)
    print(x_m1,y_m1)
    koch(n-1,x_m1,y_m1,x_m,y_m)
    print(x_m,y_m)
    koch(n-1,x_m,y_m,x_m2,y_m2)
    print(x_m2,y_m2)
    koch(n-1,x_m2,y_m2,x_1,y_1)
      
print(0,0)
koch(n,0,0,100,0)
print(100,0)
Buggy python submission (verdict: Runtime Error):
a=float(input())
b=float(input())
c=a*b
d=(a+b)*2
print(c,d)


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

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


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

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


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

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


Fixed submission:
a,b=map(int,input().split())
c=a*b
d=(a+b)*2
print(c,d)
Buggy python submission (verdict: Runtime Error):
def gcd(x,y):
    if y==0:
        return x
    else:
        return gcd(y,x%y)

x,y=map(int,raw_input().split())
print(gcd(x,y))



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

x,y=map(int,raw_input().split())
print(gcd(x,y))

Buggy python submission (verdict: Runtime Error):
def gcd(x,y):
    if y==0:
        return x
    else:
        return gcd(y,x%y)

x,y=map(int,raw_input().split())
print(gcd(x,y))



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

x,y=map(int,raw_input().split())
print(gcd(x,y))

Buggy python submission (verdict: Runtime Error):
def gcd(x,y):
    if y==0:
        return x
    else:
        return gcd(y,x%y)

x,y=map(int,raw_input().split())
print(gcd(x,y))



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

x,y=map(int,raw_input().split())
print(gcd(x,y))
Buggy python submission (verdict: Runtime Error):
a=int(input("input a"))
b=int(input("input b"))
print(a*b," ",2*(a+b))



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

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



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

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



Fixed submission:
a,b=map(int,input().split())
x=a*b
y=2*(a+b)
print(x,y)
Buggy python submission (verdict: Runtime Error):
l=[]
c=0
s=input().split()
for i in s:
	if i=="+":
		l[c-2]=l[c-2]+l[c-1]
		c=c-1
	elif i=="-":
		l[c-2]=l[c-2]-l[c-1]
		c=c-1
	elif i=="*":
		l[c-2]=l[c-2]*l[c-1]
		c=c-1
	else:
		l[c]=int(i)
		c=c+1
printl[0]


Fixed submission:
l=[0]*1000
c=0
s=input().split()
for i in s:
	if i=="+":
		l[c-2]=l[c-2]+l[c-1]
		c=c-1
	elif i=="-":
		l[c-2]=l[c-2]-l[c-1]
		c=c-1
	elif i=="*":
		l[c-2]=l[c-2]*l[c-1]
		c=c-1
	else:
		l[c]=int(i)
		c=c+1
print(l[0])

Buggy python submission (verdict: Runtime Error):
l=[]
c=0
s=input().split()
for i in s:
	if i=="+":
		l[c-2]=l[c-2]+l[c-1]
		c=c-1
	elif i=="-":
		l[c-2]=l[c-2]-l[c-1]
		c=c-1
	elif i=="*":
		l[c-2]=l[c-2]*l[c-1]
		c=c-1
	else:
		l[c]=int(i)
		c=c+1
printl[0]


Fixed submission:
l=[0]*1000
c=0
s=input().split()
for i in s:
	if i=="+":
		l[c-2]=l[c-2]+l[c-1]
		c=c-1
	elif i=="-":
		l[c-2]=l[c-2]-l[c-1]
		c=c-1
	elif i=="*":
		l[c-2]=l[c-2]*l[c-1]
		c=c-1
	else:
		l[c]=int(i)
		c=c+1
print(l[0])
Buggy python submission (verdict: Runtime Error):
c=0
n=int(input())
s=int(input().split())
nqint(input())
t=int(input().split())
for i in t:
	for j in s:
		if i==j:
			c +=1
print(c)


Fixed submission:
c=0
n=int(input())
s=input().split()
q=int(input())
t=input().split()
for i in t:
	for j in s:
		if int(i)==int(j):
			c +=1
			break
print(c)

Buggy python submission (verdict: Runtime Error):
c=0
n=int(input())
s=int(input().split())
nqint(input())
t=int(input().split())
for i in t:
	for j in s:
		if i==j:
			c +=1
print(c)


Fixed submission:
c=0
n=int(input())
s=input().split()
q=int(input())
t=input().split()
for i in t:
	for j in s:
		if int(i)==int(j):
			c +=1
			break
print(c)
Buggy python submission (verdict: Runtime Error):
from math import pi
r = int(input())
print("{:.6f} {:.6f}".format(2 * pi * r, pi * r ** 2))



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

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



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

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



Fixed submission:
from math import pi
r = float(input())
print("{:.6f} {:.6f}".format(pi * r ** 2, 2 * pi * r))
Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
    if b==0:
        return a
    c=a%b
    return gcd(b,c)
x=int(input("x:"))
y=int(input("y:"))
if x<y:
    x,y=y,x
m=gcd(x,y)
print(m)
def gcd(x,y):


Fixed submission:
def gcd(a,b):
    if b==0:
        return a
    c=a%b
    return gcd(b,c)
x,y=map(int,input().split())
if x<y:
    x,y=y,x
m=gcd(x,y)
print(m)

Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
    if b==0:
        return a
    c=a%b
    return gcd(b,c)
x=int(input("x:"))
y=int(input("y:"))
if x<y:
    x,y=y,x
m=gcd(x,y)
print(m)
def gcd(x,y):
    if b==0:
        return a
    return gcd(b,c)


Fixed submission:
def gcd(a,b):
    if b==0:
        return a
    c=a%b
    return gcd(b,c)
x,y=map(int,input().split())
if x<y:
    x,y=y,x
m=gcd(x,y)
print(m)

Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
    if b==0:
        return a
    c=a%b
    return gcd(b,c)
x=int(input(""))
y=int(input(""))
if x<y:
    x,y=y,x
m=gcd(x,y)
print(m)
def gcd(x,y):


Fixed submission:
def gcd(a,b):
    if b==0:
        return a
    c=a%b
    return gcd(b,c)
x,y=map(int,input().split())
if x<y:
    x,y=y,x
m=gcd(x,y)
print(m)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=map(int,input().split())
b=0
for_in range(a):
	for i in range(n-1,0,-1):
		if a[i]<a[i-1]:
			a[i],a[i-1]=a[i-1],a[i]
			b=b+1
print(*a)
print(b)


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=0
for _ in a:
    for i in range(n-1,0,-1):
        if a[i]<a[i-1]:
            a[i],a[i-1]=a[i-1],a[i]
            b+=1
print(*a)
print(b)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split())
b=0
for _ in a:
    for i in range(n-1,0,-1):
        if a[i]<a[i-1]:
            a[i],a[i-1]=a[i-1],a[i]
            b+=1
print(*a)
print(b)


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=0
for _ in a:
    for i in range(n-1,0,-1):
        if a[i]<a[i-1]:
            a[i],a[i-1]=a[i-1],a[i]
            b+=1
print(*a)
print(b)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split())
b=0
for _ in a:
    for i in range(n-1,0,-1):
        if a[i]<a[i-1]:
            a[i],a[i-1]=a[i-1],a[i]
            b+=1
print(*a)
print(b)


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=0
for _ in a:
    for i in range(n-1,0,-1):
        if a[i]<a[i-1]:
            a[i],a[i-1]=a[i-1],a[i]
            b+=1
print(*a)
print(b)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=0
for i in range(n):
    minj=i
    for j in range(i+1,n-1):
        if a[minj]>a[j]:
            minj=j
    if i!=minj:
        a[i],a[minj]=a[minj],a[i]
            b+=1
print(*a)
print(b)


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

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=0
for i in range(n-1):
    minj=i
    for j in range(i+1,n-1):
        if a[minj]>a[j]:
            minj=j
    if i!=minj:
        a[i],a[minj]=a[minj],a[i]
            b+=1
print(*a)
print(b)


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

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=0
for i in range(n-1):
    minj=i
    for j in range(i+1,n-1):
        if a[minj]>a[j]:
            minj=j
    if i!=minj:
        a[i],a[minj]=a[minj],a[i]
            b+=1
print(*a)
print(b)


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
b=0
for i in range(n):
    minj=i
    for j in range(i,n):
        if a[minj]>a[j]:
            minj=j
    if i!=minj:
        a[i],a[minj]=a[minj],a[i]
        b+=1
print(*a)
print(b)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input(),split())
x=a*b
y=2*(a+b)
print(x,y)


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