Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

ans = 0
for i in range(N):
    ans = max(ans,len(set(s[:i]) & set(s[i:])))
print(ans)

Fixed submission:
N = int(input())
S = input()
ans = 0
for i in range(N):
    ans = max(ans,len(set(S[:i]) & set(S[i:])))
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

ans = 0
for i in range(N):
    ans = max(ans,len(set(s[:i]) & set(s[i:]))
print(ans)

Fixed submission:
N = int(input())
S = input()
ans = 0
for i in range(N):
    ans = max(ans,len(set(S[:i]) & set(S[i:])))
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

ans = 0
for i in range(N):
    ans = max(ans,len(set(s[:i])) & set(s[i:]))
print(ans)

Fixed submission:
N = int(input())
S = input()
ans = 0
for i in range(N):
    ans = max(ans,len(set(S[:i]) & set(S[i:])))
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input().
a = S.count('o')
print(700 + 100 * a)

Fixed submission:
S = input()
a = S.count('o')
print(700 + 100 * a)
Buggy python submission (verdict: Runtime Error):
n,m,x = map(int,input().split())
A = list(map(int,input().split()))

ans1 = len([a for a in A if a < x])
ans2 = len([a for a in A if a > x])
print(min(ans1,ans2))

Fixed submission:
A,B,X = map(int,input().split())
if (A <= X <= (A + B)):
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
A,B,X = map(int,input().split)
if (A <= X <= (A + B)):
    print('YES')
else:
    print('NO')

Fixed submission:
A,B,X = map(int,input().split())
if (A <= X <= (A + B)):
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
A,B,X = map(int,input())
if (A <= X <= (A + B)):
    print('YES')
else:
    print('NO')

Fixed submission:
A,B,X = map(int,input().split())
if (A <= X <= (A + B)):
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))

AB = sorted(A)
C = int(N/2)
for i in range(N):
    if AB[i] <= AB[C+1]:
        print(AB[C+1])
    else:
        print(AB[C])

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

AB = sorted(A)
C = int(N//2)
for i in range(N):
    if A[i] <= AB[C-1]:
        print(AB[C])
    else:
        print(AB[C-1])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))

AB = sorted(A)
C = int(N/2)
for i in range(N):
    if AB[i] <= AB[C]:
        print(AB[C+1])
    else:
        print(AB[C])

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

AB = sorted(A)
C = int(N//2)
for i in range(N):
    if A[i] <= AB[C-1]:
        print(AB[C])
    else:
        print(AB[C-1])

Buggy python submission (verdict: Runtime Error):
N = int,input().split()
A = list(map(int,input().split()))

AB = sorted(A)
C = int(N/2)
for i in range(N):
    if AB[i] <= AB[C-1]:
        print(AB[C])
    else:
        print(AB[C-1])

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

AB = sorted(A)
C = int(N//2)
for i in range(N):
    if A[i] <= AB[C-1]:
        print(AB[C])
    else:
        print(AB[C-1])

Buggy python submission (verdict: Runtime Error):
N = int,input().split()
A = list(map(int,input().split()))

A1 = sorted(A)
a = int(N/2)
for i in range(N):
    if A1[i] <= A1[a-1]:
        print(A1[a])
    else:
        print(A1[a-1])

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

AB = sorted(A)
C = int(N//2)
for i in range(N):
    if A[i] <= AB[C-1]:
        print(AB[C])
    else:
        print(AB[C-1])

Buggy python submission (verdict: Runtime Error):
N = int,input().split()
A = list(map(int,input().split()))

A1 = sorted(A)
a = int(n/2)
for i in range(N):
    if A1[i] <= A1[a-1]:
        print(A1[a])
    else:
        print(A1[a-1])

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

AB = sorted(A)
C = int(N//2)
for i in range(N):
    if A[i] <= AB[C-1]:
        print(AB[C])
    else:
        print(AB[C-1])
Buggy python submission (verdict: Runtime Error):
a, b=map(int, input(),split())
if (a*b)% 2:
 print("Odd")
else:
 print("Even")

Fixed submission:
a, b = map(int, input().split())
if (a*b) % 2:
    print("Odd")
else:
    print("Even")
Buggy python submission (verdict: Runtime Error):
arr=[]
numbero=list(map(int, input().split()))
for i in range(numbero[0]):
    arr.append(input())
way=[[False for i in range(numbero[1])] for j in range(numbero[0])]
def waycon(i,j):
    way[i][j]=True
    if i>0:
        if not way[i-1][j] and arr[i-1][j]=='.':
            waycon(i-1,j)
    if j>0:
        if not way[i][j-1] and arr[i][j-1]=='.':
            waycon(i,j-1)
    if i<numbero[0]-1:
        if not way[i+1][j] and arr[i+1][j]=='.':
            waycon(i+1,j)
    if j<numbero[1]-1:
        if not way[i][j+1] and arr[i][j+1]=='.':
            waycon(i,j+1)
waycon(0,0)
if not way[numbero[0]-1][numbero[1]-1]:
    print(-1)
else:
    

Fixed submission:
arr=[]
numbero=list(map(int, input().split()))
for i in range(numbero[0]):
    arr.append(input())
way=[[0 for i in range(numbero[1])] for j in range(numbero[0])]
way[0][0]=1
head=0
whoop=[[0,0]]
while head<len(whoop):
    u=whoop[head][0]
    v=whoop[head][1]
    head+=1
    if u>0:
        if way[u-1][v]==0 and arr[u-1][v]=='.':
            way[u-1][v]=way[u][v]+1
            whoop.append([u-1,v])
    if v>0:
        if way[u][v-1]==0 and arr[u][v-1]=='.':
            way[u][v-1]=way[u][v]+1
            whoop.append([u,v-1])
    if u<numbero[0]-1:
        if way[u+1][v]==0 and arr[u+1][v]=='.':
            way[u+1][v]=way[u][v]+1
            whoop.append([u+1,v])
    if v<numbero[1]-1:
        if way[u][v+1]==0 and arr[u][v+1]=='.':
            way[u][v+1]=way[u][v]+1
            whoop.append([u,v+1])
if way[numbero[0]-1][numbero[1]-1]==0:
    print(-1)
else:
    head=0
    for i in arr:
        head+=i.count('.')
    print(head-way[numbero[0]-1][numbero[1]-1])
Buggy python submission (verdict: Runtime Error):
n=int(input())
if n%2=0:
  print(n)
else:
  print(2*n)

Fixed submission:
n=int(input())
if n%2==0:
  print(n)
else:
  print(2*n)

Buggy python submission (verdict: Runtime Error):
n=int(input())
if n%2=0:
  print(n)
else:
  print(2n)

Fixed submission:
n=int(input())
if n%2==0:
  print(n)
else:
  print(2*n)
Buggy python submission (verdict: Runtime Error):
n=int(input())
def lucas(n):
	if n==0:
		return 2
	if n==1:
		return 1
	if n>1:
		return lucas(n-1)+lucas(n-2)
print(lucas(n))


Fixed submission:
a=input()
def check(n):
	if n[0]==n[1]:
		if n[1]==n[2]:
			return "Yes"
		else:
			return "No"
	else:
		if n[1]==n[2]:
			if n[2]==n[3]:
				return "Yes"
			else:
				return "No"
		else:
			return "No"
print(check(a))
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
def lucas(n):
	if n==0:
		return 2
	if n==1:
		return 1
	if n>1:
		return lucas(n-1)+lucas(n-2)
print(lucas(n))


Fixed submission:
n=int(input())
def lucas(n):
	a, b = 2, 1
	for i in range(n):
		a, b = b, a+b
	return a
print(lucas(n))

Buggy python submission (verdict: Runtime Error):
n=int(input())
def lucas(n):
	if n=0:
		return 2
	if n=1:
		return 1
	if n>1:
		return lucas(n-1)+lucas(n-2)
print(lucas(n))

Fixed submission:
n=int(input())
def lucas(n):
	a, b = 2, 1
	for i in range(n):
		a, b = b, a+b
	return a
print(lucas(n))
Buggy python submission (verdict: Runtime Error):
hw=input().split()
h=int(hw[0])
w=int(hw[1])
mx=[1,1,0,-1,-1,-1,0,1]
my=[0,1,1,1,0,-1,-1,-1]
grid=[]
for t in range(h):
	row=list(input())
	grid.append(row)
for i in range(w):
	for j in range(h):
		if grid[j][i]==".":
			ctr=0
			for k in range(8):
				adx=i+mx[k]
				ady=j+my[k]
				if adx>=0 and adx<w and ady>=0 and ady<h:
					if grid[ady][adx]=="#":
						ctr+=1
			grid[j][i]=ctr
for l in range(h):
    print(''.join(grid[l]))

Fixed submission:
hw=input().split()
h=int(hw[0])
w=int(hw[1])
mx=[1,1,0,-1,-1,-1,0,1]
my=[0,1,1,1,0,-1,-1,-1]
grid=[]
for t in range(h):
	row=list(input())
	grid.append(row)
for i in range(w):
	for j in range(h):
		if grid[j][i]==".":
			ctr=0
			for k in range(8):
				adx=i+mx[k]
				ady=j+my[k]
				if adx>=0 and adx<w and ady>=0 and ady<h:
					if grid[ady][adx]=="#":
						ctr+=1
			grid[j][i]=str(ctr)
for l in range(h):
    print(''.join(grid[l]))
Buggy python submission (verdict: Runtime Error):
num=input().split(" ")
a=num[0]
b=num[1]
if a+b>=24:
	print(a+b-24)
else:
	print(a+b)

Fixed submission:
num=input().split(" ")
a=int(num[0])
b=int(num[1])
if a+b>=24:
	print(a+b-24)
else:
	print(a+b)
Buggy python submission (verdict: Time Limit Exceeded):
from functools import reduce
n=int(input())
def sqdivlist(n):
    lista=[]
    for i in range(1,int((n**0.5)//1)+1):
        if n%i==0:
            lista.append(str(i))
    return (lista)
lista2=[]
ans=[]
for j in range(len(sqdivlist(n))):
    lista2.append(int(n/int((sqdivlist(n))[j])))
    ans.append(max(len(str(sqdivlist(n)[j])),(len(str(lista2[j])))))
print(min(ans))


Fixed submission:
from functools import reduce
n=int(input())
def sqdivlist(n):
    lista=[]
    for i in range(1,int((n**0.5)//1)+1):
        if n%i==0:
            lista.append(str(i))
    return (lista)
t=len(sqdivlist(n))
u=(sqdivlist(n))
lista2=[]
ans=[]
for j in range(t):
    lista2.append(int(n/int(u[j])))
    ans.append(max(len(str(u[j])),(len(str(lista2[j])))))
print(min(ans))

Buggy python submission (verdict: Time Limit Exceeded):
from functools import reduce
n=int(input())
def sqdivlist(n):
    lista=[]
    for i in range(1,int((n**0.5)//1)+1):
        if n%i==0:
            lista.append(str(i))
    return (lista)
lista2=[]
ans=[]
for j in range(len(sqdivlist(n))):
    lista2.append(int(n/int((sqdivlist(n))[j])))
    ans.append(max(len(str(sqdivlist(n)[j])),(len(str(lista2[j])))))
print(min(ans))


Fixed submission:
from functools import reduce
n=int(input())
def sqdivlist(n):
    lista=[]
    for i in range(1,int((n**0.5)//1)+1):
        if n%i==0:
            lista.append(str(i))
    return (lista)
t=len(sqdivlist(n))
u=(sqdivlist(n))
lista2=[]
ans=[]
for j in range(t):
    lista2.append(int(n/int(u[j])))
    ans.append(max(len(str(u[j])),(len(str(lista2[j])))))
print(min(ans))

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
def sqdivlist(n):
    lista=[]
    for i in range(1,int((n**0.5)//1)+1):
        if n%i==0:
            lista.append(str(i))
    return (lista)
lista2=[]
for j in range(len(sqdivlist(n))):
    lista2.append(int(n/int((sqdivlist(n))[j])))
ans=[]
for k in range(len(sqdivlist(n))):
    ans.append(max(int(len(str(sqdivlist(n)[k]))), int(len(str(lista2[k])))))
print(min(ans))


Fixed submission:
from functools import reduce
n=int(input())
def sqdivlist(n):
    lista=[]
    for i in range(1,int((n**0.5)//1)+1):
        if n%i==0:
            lista.append(str(i))
    return (lista)
t=len(sqdivlist(n))
u=(sqdivlist(n))
lista2=[]
ans=[]
for j in range(t):
    lista2.append(int(n/int(u[j])))
    ans.append(max(len(str(u[j])),(len(str(lista2[j])))))
print(min(ans))
Buggy python submission (verdict: Runtime Error):
N = input()

if N % 2 != 0:
    answer = N * 2
    print(answer)
else:
    print(N)


Fixed submission:
N = int(input())

if N % 2 != 0:
    answer = N * 2
    print(answer)
else:
    print(N)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
s=[2,3,5]
ans=[]
for i in range(7,55555):
    for j in s:
       if i%j==0:
           break
       if i%j!=0:
           s.append(i)
           
       if i%3==1:
           ans.append(i)
           
    if len(ans)==N:
        break
    
for i in range(N):
    print(ans[i],end=",")

Fixed submission:

N=int(input())
s=[2,3,5]
ans=[]
for i in range(7,55555):
    for j in s:
       if i%j==0:
           break
       if j>i**(0.5):
           
           s.append(i)
           
           if i%5==1:
               ans.append(i)
           break
           
    if len(ans)==N:
        break
    
for i in range(N):
    print(ans[i],end=" ")

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
s=[2,3,5]
ans=[]
for i in range(7,55555):
    for j in s:
       if i%j==0:
           break
       if i%j!=0:
           s.append(i)
           
       if i%3==1:
           ans.append(i)
           
    if len(ans)==N:
        break
    
for i in range(N):
    print(ans[i],end=",")

Fixed submission:

N=int(input())
s=[2,3,5]
ans=[]
for i in range(7,55555):
    for j in s:
       if i%j==0:
           break
       if j>i**(0.5):
           
           s.append(i)
           
           if i%5==1:
               ans.append(i)
           break
           
    if len(ans)==N:
        break
    
for i in range(N):
    print(ans[i],end=" ")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().rstrip().split(" ")))

t = list(0 for i in range(n+1))
for i in range(1, n+1):
    t[i] = t[i-1] + a[i-1]

def sum_a(i, j):
    return t[j]-t[i]

min_dif = sum_a(0, n)

for i in range(2, n-1):
    j0 = 0
    j1 = i
    u = sum_a(0, i) // 2
    while j1 - j0 > 1:
        j = (j0+j1) // 2
        if 2*sum_a(0, j) <= u: 
            j0 = j
        else:
            j1 = j
    if abs(sum_a(0, j0)-sum_a(j0, i)) < abs(sum_a(0, j1) - sum_a(j1, i)): 
        p = sum_a(0, j0)
        q = sum_a(j0, i)
    else:
        p = sum_a(0, j1)
        q = sum_a(j1, i)

    j0 = i
    j1 = n
    u = sum_a(i, n) // 2
    while j1 - j0 > 1:
        j = (j0+j1) // 2
        if sum_a(i, j) <= u: 
            j0 = j
        else:
            j1 = j
    if abs(sum_a(i, j0)-sum_a(j0, n)) < abs(sum_a(i, j1) - sum_a(j1, n)): 
        r = sum_a(i, j0)
        s = sum_a(j0, n)
    else:
        r = sum_a(i, j1)
        s = sum_a(j1, n)

    min_dif = min(min_dif, max(p, q, r, s)-min(p, q, r, s))

print(min_dif)


Fixed submission:
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n*2)

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

sm = 0
for i in range(0, n):
    sm = sm + a[i]

min_dif = sm

p = 0
for i in range(n-3):
    p = p + a[i]
    if 4*p < sm:
        next
    q = 0
    for j in range(i+1, n-2):
        q = q + a[j]
        if 3*q < sm - p:
            next
        r = 0
        for k in range(j+1, n-1):
            r = r + a[k]
            if 2*r < sm - p - q:
                next
            s = 0
            for l in range(k+1, n):
                s = s + a[l]
            d = max([p, q, r, s])-min([p, q, r, s])
            min_dif = min([d, min_dif])

p = 0
for i in range(n-3):
    p = p + a[i]
    if 4*p <= sm - 3*min_dif or 4*p >= sm + 3*min_dif:
        next
    q = 0
    for j in range(i+1, n-2):
        q = q + a[j]
        if abs(p-q) >= min_dif or 4*q <= sm - 3*min_dif or 4*q >= sm + 3*min_dif:
            next
        r = 0
        for k in range(j+1, n-1):
            r = r + a[k]
            if abs(p-r) >= min_dif or abs(q-r) >= min_dif or 4*r <= sm - 3*min_dif or 4*r >= sm + 3*min_dif:
                next
            s = 0
            for l in range(k+1, n):
                s = s + a[l]
            d = max([p, q, r, s])-min([p, q, r, s])
            min_dif = min([d, min_dif])

print(min_dif)


Fixed submission:
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n*2)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = list(map(int, input().rstrip().split(" ")))

min_v = 0
for i in range(0, n):
    v = 0
    for j in range(0, n):
        v = v + abs(s[j] - (s[i]-i + j))
    if i == 0 or v < min_v:
        min_v =v
print(min_v)


Fixed submission:
n = int(input())
s = list(map(int, input().rstrip().split(" ")))

for i in range(0, n):
    s[i] = s[i] - (i+1)
s.sort()

b = s[n//2]

sm = 0
for i in range(0, n):
    sm = sm + abs(s[i] - b)

print(sm)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
N=int(input())
maxi=0
for i in range(1,N+1):
    if pow(i,2)<=N:
        maxi=pow(i,2)
print(maxi)

Fixed submission:
# coding: utf-8
N=int(input())
maxi=0
for i in range(1,N+1):
    if pow(i,2)<=N:
        maxi=pow(i,2)
    else:
        break
print(maxi)
Buggy python submission (verdict: Runtime Error):
# coding:utf-8
R=int(input())
G=int(input())
print(2G-R)

Fixed submission:
# coding: utf-8

R=int(input())
G=int(input())

print((G-R)+G)

Buggy python submission (verdict: Runtime Error):
# -＊- coding:utf-8 -＊-
R=int(input())
G=int(input())
print(2G-R)

Fixed submission:
# coding: utf-8

R=int(input())
G=int(input())

print((G-R)+G)
Buggy python submission (verdict: Runtime Error):
H,W = map(int,raw_input().split(" "))

matel = {}

for i in range(H):
    line = raw_input()
    for c in line:
        if not c in matel:
            matel[c] = 0
        matel[c] += 1




def cnter():
    cnt4 = 0
    cnt2 = 0
    cnt1 = 0

    for key in matel.keys():
        vs = matel[key]
        while vs >= 4:
            cnt4+=1
            vs-=4
        while vs >= 2:
            cnt2 += 1
            vs-=2
        cnt1 +=vs

    return cnt1,cnt2,cnt4



def solve():
    cnt1,cnt2,cnt4 = cnter()

    if H%2 == 0 and W%2 == 0:
        if cnt2 == 0 and cnt1 == 0:
            print "Yes"
        else:
            print "No"
    elif H%2 == 1 and W%2 == 1:
        if cnt1 != 1:
            print "No"
            return
        po = (W/2)+(H/2) - cnt2
        if po < 0:
            print "No"
            return

        if po %2 == 0:
            print "Yes"
        else:
            print "No"

    else:
        if cnt1:
            print "No"
            return 
        if H%2 == 1:
            po = W/2 -cnt2
        else:
            pos = H/2 - cnt2

        if po < 0:
            print "No"
            return
        if po % 2 == 0:
            print "Yes"
        else:
            print "No"

solve()


Fixed submission:
H,W = map(int,raw_input().split(" "))

matel = {}

for i in range(H):
    line = raw_input()
    for c in line:
        if not c in matel:
            matel[c] = 0
        matel[c] += 1




def cnter():
    cnt4 = 0
    cnt2 = 0
    cnt1 = 0

    for key in matel.keys():
        vs = matel[key]
        while vs >= 4:
            cnt4+=1
            vs-=4
        while vs >= 2:
            cnt2 += 1
            vs-=2
        cnt1 +=vs

    return cnt1,cnt2,cnt4



def solve():
    cnt1,cnt2,cnt4 = cnter()

    if H%2 == 0 and W%2 == 0:
        if cnt2 == 0 and cnt1 == 0:
            print "Yes"
        else:
            print "No"
    elif H%2 == 1 and W%2 == 1:
        if cnt1 != 1:
            print "No"
            return
        po = (W/2)+(H/2) - cnt2
        if po < 0:
            print "No"
            return

        if po %2 == 0:
            print "Yes"
        else:
            print "No"

    else:
        if cnt1:
            print "No"
            return 
        if H%2 == 1:
            po = W/2 - cnt2
        else:
            po = H/2 - cnt2

        if po < 0:
            print "No"
            return
        if po % 2 == 0:
            print "Yes"
        else:
            print "No"

solve()
Buggy python submission (verdict: Runtime Error):
N = input()
T = map(int,raw_input().split(" "))
A = map(int,raw_input().split(" "))




note = [1 for i in range(N)]
fx = [0 for i in range(N)]

def solve():
    global note
    if T[-1] != A[0]:
        return 0
    
    prev = 0
    for i in range(N):
        if prev > T[i]:
            return 0
        elif prev == T[i]:
            note[i] = prev
        else:
            note[i] = 1
            prev = T[i]
            fx[i] = T[i]
    prev = 0
    for i in range(N-1,-1,-1):
        if prev > A[i]:
            return 0
        elif prev == A[i]:
            if not fx[i]:
                note[i] = min(note[i],prev)
            else:
                if fx[i] > A[i]:
                    return 0

        else:
            if fx[i] and fx[i] != A[i]:
                return 0
            note[i] = 1
            prev = A[i]

    ans = 1
    for i in range(N):
        if not fx[i]:
            ans = (ans * note[i])%(10**9+7)
    return ans



    





print solve()


Fixed submission:
S = raw_input()
c = 0
f = 0
for s in S:
    if s == "C":
        c = 1
    if s == "F" and c:
        f = 1
print "Yes" if f else "No"
Buggy python submission (verdict: Runtime Error):
import math

def lcm(x):
    return (x * 2) // math.gcd(x, 2)

print(lcm(int(input())))

Fixed submission:
import math
n = int(input())
print([n, 2*n][n % 2 > 0])

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

def lcm(x):
    return (x * 2) // math.gcd(x, 2)

print(lcm(int(input())))

Fixed submission:
import math
n = int(input())
print([n, 2*n][n % 2 > 0])
Buggy python submission (verdict: Runtime Error):
A,B,X=map(int,input().split())
if A+B<=X:
    if a<=X:
        print('YES')
    else:
        print('NO')
else:
    print('NO')

Fixed submission:
A,B,X=map(int,input().split())
if A+B>=X:
    if A<=X:
        print('YES')
    else:
        print('NO')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
if x<1200:
    print('ABC')
else:
    print('ARC')

Fixed submission:
x=int(input())
if x<1200:
    print('ABC')
else:
    print('ARC')
Buggy python submission (verdict: Runtime Error):
c=input()
if c==a or c==i or c==u or c==e or c==o:
    print('vowel')
else:
    print('consonant')

Fixed submission:
c=input()
if c=='a' or c=='i' or c=='u' or c=='e' or c=='o':
    print('vowel')
else:
    print('consonant')
Buggy python submission (verdict: Runtime Error):
if a+b==c or b+c==a or c+a==b:
    print('Yes')
else:
    print('No')

Fixed submission:
a,b,c=map(int,input().split())
if a+b==c or b+c==a or c+a==b:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
if __name__ == '__main__':
    text = input()
    number = int(input())
    set = set()

    for text_len in range(1, len(text) + 1):
        for ss_len in range(len(text) - text_len + 1):
            set.add(text[ss_len:text_len + ss_len])

    print(sorted(set)[number - 1])

Fixed submission:
if __name__ == '__main__':
    text = input()
    number = int(input())
    dic = []

    for text_len in range(1, min(len(text),number) + 1):
        for ss_len in range(0, len(text) - text_len + 1):
            word = text[ss_len:text_len + ss_len]
            if word not in dic:
                dic.append(word)

    dic = sorted(dic)

    print(dic[number - 1])

Buggy python submission (verdict: Time Limit Exceeded):
if __name__ == '__main__':
    text = input()
    number = int(input())
    dic = []

    for ss_len in range(1, len(text) + 1):
        for ss in range(0, len(text) - ss_len + 1):
            c = text[ss:ss_len + ss]
            if c not in dic:
                dic.append(c)

    dic = sorted(dic)

    print(dic[number - 1])

Fixed submission:
if __name__ == '__main__':
    text = input()
    number = int(input())
    dic = []

    for text_len in range(1, min(len(text),number) + 1):
        for ss_len in range(0, len(text) - text_len + 1):
            word = text[ss_len:text_len + ss_len]
            if word not in dic:
                dic.append(word)

    dic = sorted(dic)

    print(dic[number - 1])