Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

g = 0
for i in range(n):
    if i != 0:
        g = 0
    for j in range(n):
        if j != i:
            g = g ^ a[j]
    print(g, end=' ')

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
p = 0
for i in range(n):
    p = p ^ a[i]
for i in range(n):
    print(p ^ a[i], end=' ')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    if i==0:
        ans = a[0]
    else:
        ans *= a[i]
if ans > 1000000000000000000:
    print(-1)
else:
    print(ans)


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
if 0 in a:
    print(0)
else:
    for i in range(n):
        if i==0:
            ans = a[0]
        else:
            ans *= a[i]
            if 1000000000000000000<ans:
                break
    if ans > 1000000000000000000:
        print(-1)
    else:
        print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()

if s=="RRR":
  print(3)
elif s=="RRS" or s=="SRR":
  print(2)
elif s=="SSR" or s=="SRS" or s=="RSS" or s="RSR":
  print(1)
else:
  print(0)

Fixed submission:
s = input()

if s=="RRR":
  print(3)
elif s=="RRS" or s=="SRR":
  print(2)
elif s=="SSR" or s=="SRS" or s=="RSS" or s=="RSR":
  print(1)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
X,N = map(int,input().split())
P = list(map(int,input().split()))

#リストを作る
all_l = [i for i in range(0,101)]

#Pの数値を消去
for p in P:
    all_l.remove(p)
    
#全探索
kouho = x
for i in range(200):
    kouho1 = x-i
    kouho2 = x+i
    if kouho1 not in P:
        print(x-i)
        break
    elif kouho2 not in P:

Fixed submission:
X, N = map(int, input().split())
p = list(map(int, input().split()))
 
ans = 0
for i in range(1, 102):
    if abs(X - i) < abs(X - ans) and i not in p:
        ans = i
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
ans = 2*r*pimath.pi
print(ans)

Fixed submission:
import math
r = int(input())
ans = 2*r*math.pi
print(ans)
Buggy python submission (verdict: Runtime Error):
m=int(input())
count=0#求めるトーナメント数
#複数行2数値を受け取る
x = []
y = []
for i in range(m):
    x1,y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x,y)

#最初のエントリーする人を求める
n=str()#空の文字列を作成
for j in range(0, m):#標準入力の数字を連結させてnをつくる
  n += str(x[j])*y[j]#エントリーする人の数
print(n)

#再帰呼び出しする関数
def Selection(entry):  
  l=[]#空のリストを作成。ここに選出人数を入れていく
  for k in range(0, len(n)-1):
  
    int_sum=int(n[k],10)+int(n[k+1],10)#10進数で足し算
    n_replaced=n.replace(n[k:k+2:1],str(int_sum))
    l.append(int(n_replaced,10))#このままだとlの各要素がstr型なのでintに変換
  print(l)
  n=max(l)#選出人数は最大となるものを選ぶ
  
  if n<10:
    print(count)
    exit()
  else:
    count += 1

while True:
  Selection(n)

Fixed submission:
x,y=map(int,input().split())

if (x==y==1):
  output=1000000
elif (x*y==2):
  output=500000
elif (x*y==3):
  output=400000
#elif (x*y==4):4*1が存在
elif (x==y==2):
  output=400000
elif (x*y==6):
  output=300000
elif (x*y==9):
  output=200000
  
#x or y  
elif (x==1 or y==1):
  output=300000
elif (x==2 or y==2):
  output=200000
elif (x==3 or y==3):
  output=100000
else:
  output=0
print(output)
Buggy python submission (verdict: Runtime Error):
print(s)
n=len(s)#長さ

c=0#非負整数列
N=0
j=0
k=0
for i in range(1,n):
  if (s[i-1]=="<" and s[i]==">"):
    #print(i)
    j=i
    N+=math.factorial(i-k)
    #print("<>",i-k)
  if (s[i-1]==">" and s[i]=="<"):
    k=i
    N+=math.factorial(i-j)
    #print("><",i-j)
print(N)

Fixed submission:
s=input()+"1"
a=0
b=[]
i=0
l=len(s)
e=0
while True:
    if s[i]==s[i+1]:
        a+=1
    else:
        b.append(a+1)
        a=0
    i+=1
    if i+1>=l:
        break
if s[-2]=='<':
    b.append(0)
if s[0]=='>':
    b.insert(0,0)
for i in range(len(b)//2):
    c,d=max(b[i*2],b[i*2+1]),min(b[i*2],b[i*2+1])
    e+=(c*(c+1)//2)+(d*(d-1)//2)
print(e)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
import sys
array = []

for i in range(1,n+1):
    if n % i == 0:
      array.append(i)
if len(array)%2==1:
  a=array[int(len(array)/2)]
  print(2*a-2)
else:
  a=array[int(len(array)/2)-1]
  b=array[int(len(array)/2)]
  ans=a-1+b-1
  print(ans)

Fixed submission:
n=int(input())
array = []
for i in range(1, int(n**0.5)+1):
  if n % i == 0:
    array.append(i)
    if i != n // i:
      array.append(n//i)
array.sort()
      
if len(array)%2==1:
  a=array[int(len(array)/2)]
  print(2*a-2)
else:
  a=array[int(len(array)/2)-1]
  b=array[int(len(array)/2)]
  print(a-1+b-1)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
h = list(map(int, input().split()))
 
cnt = 0
for i in range(len(h)):
    if h[i] >= K:
        cnt += 1
print(cnt)

Fixed submission:
N = int(input())
print(((N + 1)//2)/N)
  		
#int(input()) で入力された数値をint型で受け取る
#(N+1)//:N+1を2で割ったものが
#切り捨て除算
#(8+1)//2=4,(9+1)//2=5:これが正整数Nに含まれる奇数の数になる

Buggy python submission (verdict: Runtime Error):
import sys
int N = input()
float a
if N === 1:
	a = N/1
elif:
	if N%2 == 0:
    	a = N/2
    elif:
      	a = (N-2)/N
        
print(a)
  		


Fixed submission:
N = int(input())
print(((N + 1)//2)/N)
  		
#int(input()) で入力された数値をint型で受け取る
#(N+1)//:N+1を2で割ったものが
#切り捨て除算
#(8+1)//2=4,(9+1)//2=5:これが正整数Nに含まれる奇数の数になる
Buggy python submission (verdict: Runtime Error):
n,k = (int(x) for x in input().split())
h = list(map(int, input().split()))

h.sort()
i=0
while h[i]<k:
  i+=1
print(n-i)

Fixed submission:
N, K = map(int, input().split())
h = list(map(int, input().split()))
 
cnt = 0
for i in range(len(h)):
    if h[i] >= K:
        cnt += 1 
print(cnt)

Buggy python submission (verdict: Runtime Error):
n,k = (int(x) for x in input().split())
h = list(map(int, input().split()))

h.sort()
i=0
while h[i]<k:
　　i+=1

print(n-i)

Fixed submission:
N, K = map(int, input().split())
h = list(map(int, input().split()))
 
cnt = 0
for i in range(len(h)):
    if h[i] >= K:
        cnt += 1 
print(cnt)

Buggy python submission (verdict: Runtime Error):
n,k = (int(x) for x in input().split())
h = list(map(int, input().split()))

h.sort()
print(h[0])
i=0
while h[i]<k:
  i+=1

print(n-i)

Fixed submission:
N, K = map(int, input().split())
h = list(map(int, input().split()))
 
cnt = 0
for i in range(len(h)):
    if h[i] >= K:
        cnt += 1 
print(cnt)

Buggy python submission (verdict: Runtime Error):
n,k = (int(x) for x in input().split())
h = list(map(int, input().split()))

h.sort()#身長をソート.デフォルトは昇順なので降順(reverse=True)としておく
i=0
while h[i]<k:
  i+=1
  
print(n-i)

Fixed submission:
N, K = map(int, input().split())
h = list(map(int, input().split()))
 
cnt = 0
for i in range(len(h)):
    if h[i] >= K:
        cnt += 1 
print(cnt)
Buggy python submission (verdict: Runtime Error):
s=str(input())
n=str(input())
count=0
for i in range(3):
  if s[i]==t[i]:
    count+=1
print(count)

Fixed submission:
s=str(input())
t=str(input())
c=0
for i in range(len(s)):
  if s[i]==t[i]:
    c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
m=1#初期値、受け口の数
n=0#初期値、ソケットの個数
 
while True:
  m += a-1
  n += 1
  if m>=b:
    break
print(n)

Fixed submission:
a, b = map(int, input().split())
c = 0
sum = 1
while True:
    if sum>= b:
        print(c)
        break
    else:
        sum += a-1
        c+= 1
Buggy python submission (verdict: Runtime Error):
n=int(input())
h=list(int(x) for x in input().split())
 
length=0
max_length=0
 
for i in range(n-1):
  if h[i]>=h[i+1]:
    length+=1
    if length>max_length:
      max_length=length
  else:
    length=0
print(max_length)

Fixed submission:
N=int(input())
H=list(map(int,input().split()))
ans=0
tmp=0
for i in range(N-1):
    if H[i]>=H[i+1]:
        tmp+=1
    else:
        tmp=0
    ans=max(ans,tmp)
print(ans)

Buggy python submission (verdict: Runtime Error):
n=int(input())
h=[int(i) for i in input().split()]
c=0
l=[]
for i in range(n-1):  
    if h[i]>h[i+1]:
        c+=1
    else:
        c=0
    l.append(c)
print(max(l))

Fixed submission:
N=int(input())
H=list(map(int,input().split()))
ans=0
tmp=0
for i in range(N-1):
    if H[i]>=H[i+1]:
        tmp+=1
    else:
        tmp=0
    ans=max(ans,tmp)
print(ans)

Buggy python submission (verdict: Runtime Error):
n=int(input())
h=[int(i) for i in input().split()]
c=0
l=[]
for i in range(n-1):  
    if h[i]>h[i+1]:
      c+=1
    else:
      c=0
    l.append(c)
print(max(l))

Fixed submission:
N=int(input())
H=list(map(int,input().split()))
ans=0
tmp=0
for i in range(N-1):
    if H[i]>=H[i+1]:
        tmp+=1
    else:
        tmp=0
    ans=max(ans,tmp)
print(ans)
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int,input().split())
if b>a and c>a: 
  if c>b:
    print("No")
  else:
    print("Yes")
 
elif a>b and c>b:
  if a>c:
    print("Yes")
  else c<a:
    print("No)
          
 else:
   print("No")
  

Fixed submission:
a,b,c=map(int,input().split())
if a<c<b:
  print("Yes")
elif b<c<a:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
a = list(input().split(" "))
x = int(a[0])
if x < 0:
    x *= -1
k = int(a[1])
d = int(a[2])

for i in range(k):
    x -= d
    if x <= 0:
        if (k - i) % 2 == 1:
            x *= -1
            break
        else:
            x += d
            break

print(x)

Fixed submission:
a = list(input().split(" "))
x = int(a[0])
if x < 0:
    x *= -1
k = int(a[1])
d = int(a[2])
c = x // d

if c >= k:
    x -= d * k
else:
    x -= d * c
    if (k - c) % 2 == 1:
        x = (x - d) * -1

print(x)
Buggy python submission (verdict: Runtime Error):
a = list(input().split(" "))
animal = int(a[0])
foot = int(a[1])
 
saisyo = 2 * animal
saidai = 4 * animal
 
if (foot % 2 = 0) and (saisyo <= foot <= saidai):
	print("Yes")
else:
    print("No")

Fixed submission:
a = list(input().split(" "))
animal = int(a[0])
foot = int(a[1])
 
saisyo = 2 * animal
saidai = 4 * animal
 
if (foot % 2 == 0) and (saisyo <= foot <= saidai):
	print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
a = list(input().split(" "))
animal = int(a[0])
foot = int(a[1])

saisyo = 1 * animal
saidai = 2 * animal
b = foot / 2

if (foot % 2 = 0) and (saisyo <= b <= saidai):
	print("Yes")
else:
    print("No")

Fixed submission:
a = list(input().split(" "))
animal = int(a[0])
foot = int(a[1])
 
saisyo = 2 * animal
saidai = 4 * animal
 
if (foot % 2 == 0) and (saisyo <= foot <= saidai):
	print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
kazulist = []
for i in range(100):
    kazulist.append(i+1)
 
a = list(input().split(" "))
target = int(a[0])
syokyo = int(a[1])
 
b = list(input().split(" "))
for i in b:
    kazulist.remove(int(i))
 
saisyosa = 100
kotae = 0
for i in kazulist:
    sa = target - int(i)
    if sa < 0:
        sa *= -1
    if sa < saisyosa:
        saisyosa = sa
        kotae = i
 
print(kotae)

Fixed submission:
kazulist = []
for i in range(-100,200):
    kazulist.append(i)
 
a = list(input().split(" "))
target = int(a[0])
syokyo = int(a[1])

if syokyo != 0:
    b = list(input().split(" "))
    for i in b:
        kazulist.remove(int(i))
 
saisyosa = 100
kotae = 0
for i in kazulist:
    sa = target - int(i)
    #print(sa)
    if sa < 0:
        sa *= -1
    if sa < saisyosa:
        saisyosa = sa
        kotae = i
 
print(kotae)

Buggy python submission (verdict: Runtime Error):
kazulist = []
for i in range(100):
    kazulist.append(i+1)
 
a = list(input().split(" "))
target = int(a[0])
syokyo = int(a[1])
 
b = list(input().split(" "))
for i in b:
    kazulist.pop(int(i))
 
saisyosa = 100
kotae = 0
for i in kazulist:
    sa = target - int(i)
    if sa < 0:
        sa *= -1
    if sa < saisyosa:
        saisyosa = 0
        kotae = i
 
print(kotae)

Fixed submission:
kazulist = []
for i in range(-100,200):
    kazulist.append(i)
 
a = list(input().split(" "))
target = int(a[0])
syokyo = int(a[1])

if syokyo != 0:
    b = list(input().split(" "))
    for i in b:
        kazulist.remove(int(i))
 
saisyosa = 100
kotae = 0
for i in kazulist:
    sa = target - int(i)
    #print(sa)
    if sa < 0:
        sa *= -1
    if sa < saisyosa:
        saisyosa = sa
        kotae = i
 
print(kotae)

Buggy python submission (verdict: Runtime Error):
kazulist = []
for i in range(100):
    kazulist.append(i+1)

a = list(input().split(" "))
target = int(a[0])
syokyo = int(a[1])

b = list(input().split(" "))
for i in b:
    kazulist.pop(int(i))

saisyosa = 100
kotae = 0
for i in kazulist:
    sa = target - int(i)
    if sa < 0:
        sa *= -1
    if sa < saisyosa:
        saisyosa = 0
        kotae = i

print(i)


Fixed submission:
kazulist = []
for i in range(-100,200):
    kazulist.append(i)
 
a = list(input().split(" "))
target = int(a[0])
syokyo = int(a[1])

if syokyo != 0:
    b = list(input().split(" "))
    for i in b:
        kazulist.remove(int(i))
 
saisyosa = 100
kotae = 0
for i in kazulist:
    sa = target - int(i)
    #print(sa)
    if sa < 0:
        sa *= -1
    if sa < saisyosa:
        saisyosa = sa
        kotae = i
 
print(kotae)
Buggy python submission (verdict: Runtime Error):
from math import cos, sin, sqrt, radians
short = int(input())
long = int(input())
hour = int(input())
minit = int(input())

short_kaku = 90 - (30 * hour + 0.5 * minit)
short_x = short * cos(radians(short_kaku))
short_y = short * sin(radians(short_kaku))

long_kaku = 90 - 6 * minit
long_x = long * cos(radians(long_kaku))
long_y = long * sin(radians(long_kaku))

distance = sqrt((short_x - long_x) ** 2 + (short_y - long_y) ** 2)

print('{:.20f}'.format(distance))

Fixed submission:
from math import cos, sin, sqrt, radians
short, long, hour,minit = map(int,input().split())

short_kaku = 90 - (30 * hour + 0.5 * minit)
short_x = short * cos(radians(short_kaku))
short_y = short * sin(radians(short_kaku))

long_kaku = 90 - 6 * minit
long_x = long * cos(radians(long_kaku))
long_y = long * sin(radians(long_kaku))

distance = sqrt((short_x - long_x) ** 2 + (short_y - long_y) ** 2)

print(distance)

Buggy python submission (verdict: Runtime Error):
from math import cos, sin, sqrt, radians
short = int(input())
long = int(input())
hour = int(input())
minit = int(input())

short_kaku = 90 - (30 * hour + 0.5 * minit)
short_x = short * cos(radians(short_kaku))
short_y = short * sin(radians(short_kaku))

long_kaku = 90 - 6 * minit
long_x = long * cos(radians(long_kaku))
long_y = long * sin(radians(long_kaku))

distance = sqrt((short_x - long_x) ** 2 + (short_y - long_y) ** 2)

print(distance)

Fixed submission:
from math import cos, sin, sqrt, radians
short, long, hour,minit = map(int,input().split())

short_kaku = 90 - (30 * hour + 0.5 * minit)
short_x = short * cos(radians(short_kaku))
short_y = short * sin(radians(short_kaku))

long_kaku = 90 - 6 * minit
long_x = long * cos(radians(long_kaku))
long_y = long * sin(radians(long_kaku))

distance = sqrt((short_x - long_x) ** 2 + (short_y - long_y) ** 2)

print(distance)
Buggy python submission (verdict: Runtime Error):
def ip():
  	return list(map(int, input().split()))
[n,k]=ip()
arr=ip()
s=0
e=k
u=k-1
while u:
  if arr[s]<arr[e]:
      print("Yes")
  else:
      print("No")
  s+=1
  u-=1
  e+=1

Fixed submission:
def ip():
  	return list(map(int, input().split()))
[n,k]=ip()
arr=ip()
s=0
e=k
u=n-k
while u:
  if arr[s]<arr[e]:
      print("Yes")
  else:
      print("No")
  s+=1
  u-=1
  e+=1
Buggy python submission (verdict: Runtime Error):
s = int(input())
print s

Fixed submission:
s = int(input())
print(pow(s,3))
Buggy python submission (verdict: Runtime Error):
X,K,D = map(int,input().split())

q = X // D
mod = X % D

if q > K:
    ans = abs(abs(X)-K*D)
elif q==K:
    ans = mod
else:
    if abs(mod) <= abs(amod):
        if (K-q)%2 == 1:
            ans = D - mod
        else:
            ans = mod



print(ans)

Fixed submission:
X,K,D = map(int,input().split())

X = abs(X)
q = X // D
mod = X % D

if q > K:
    ans = abs(abs(X)-K*D)
elif q==K:
    ans = mod
else:
    ans1 = D-mod
    ans2 = mod

    if ans1<ans2:
        if (K-q-1)%2==1:
            ans = ans2
        else:
            ans = ans1
    else:
        if (K-q)%2==1:
            ans = ans1
        else:
            ans = ans2



print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N,K=map(int,input().split())
A = list(map(int,input().split()))

s0=1
for i in range(1,K+1):
    s0=s0*A[K-i]


for i in range(N-K):
    s1=s0/A[K-K+i]*A[K+i]
    if s1>s0:
        print('Yes')
    else:
        print('No')
    s0=s1

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


s0=A[0]


for i in range(N-K):
    s1=A[K+i]
    if s1>s0:
        print('Yes')
    else:
        print('No')
    s0=A[i+1]
Buggy python submission (verdict: Runtime Error):
import itertools
import numpy as np
N,M,X=map(int,input().split())
lista=[]
for i in range(N):
    lista.append(list(map(int,input().split())))
lista=np.array(lista)
cost=1000000000000000
judge=[X]*M
data=[k for k in range(1,N+1)]
for i in range(1,N+1):
    a=list(itertools.combinations(data,i))
    for j in a:
        clist=np.array([0]*(M+1))
        for k in j:
            clist=clist+lista[k-1]
        if all(clist[1:]>=judge):
            if clist[0]<cost:
                cost=clist[0]
                m=j
c=0
for i in m:
    c+=lista[i][0]

print(c)    

Fixed submission:
import itertools
import numpy as np
N,M,X=map(int,input().split())
lista=[]
for i in range(N):
    lista.append(list(map(int,input().split())))
lista=np.array(lista)
cost=1000000000000000
judge=[X]*M
data=[k for k in range(1,N+1)]
for i in range(1,N+1):
    a=list(itertools.combinations(data,i))
    for j in a:
        clist=np.array([0]*(M+1))
        for k in j:
            clist=clist+lista[k-1]
        if all(clist[1:]>=judge):
            if clist[0]<cost:
                cost=clist[0]
                m=j
c=0
try:
    for i in m:
        c+=lista[i-1][0]

    print(c)
except:
    print(-1)
Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())
H=list(map(int,input().split()))
AB=[]
for i in range(M):
    AB.append(list(map(int,input().split())))

J=[0]*N
for i in range(M):
    if H[AB[i][0]-1]<H[AB[i][1]-1]:
        J[AB[i][0]]+=1
    else:
        J[AB[i][1]]+=1
c=0
for i in J:
    if i == 0:
        c+=1

print(c)


Fixed submission:
N,M=map(int,input().split())
H=list(map(int,input().split()))
AB=[]
for i in range(M):
    AB.append(list(map(int,input().split())))

J=[0]*N
for i in range(M):
    if H[AB[i][0]-1]<H[AB[i][1]-1]:
        J[AB[i][0]-1]+=1
    elif H[AB[i][0]-1]==H[AB[i][1]-1]:
        J[AB[i][0]-1]+=1
        J[AB[i][1]-1]+=1    
    else:
        J[AB[i][1]-1]+=1
c=0
for i in J:
    if i == 0:
        c+=1

print(c)
Buggy python submission (verdict: Runtime Error):
,W=map(int,input().split())
S=H*W
if S%2==0:
    print(int(S/2))
else:
    print(int(S//2+1))

Fixed submission:
H,W=map(int,input().split())
S=H*W

while True:
    if H==1 or W==1:
        print(1)
        break

    if S%2==0:
        print(int(S/2))
        break
    elif S%2==1:
        print(int(S//2+1))
        break
Buggy python submission (verdict: Runtime Error):
    import numpy as np
     
    temp = input().split()
     
    s = [input().split() for i in range(int(temp[0]))]
     
    cnt = 0
     
    for i in range(int(temp[0])):
      if np.sqrt(int(s[i][0])*int(s[i][0]) + int(s[i][1])*int(s[i][1])) <= int(temp[1]):
        cnt += 1
     
    print(cnt)

Fixed submission:
import numpy as np
temp = input().split()
s = [input().split() for i in range(int(temp[0]))]
cnt = 0
for i in range(int(temp[0])):
  if np.sqrt(int(s[i][0])*int(s[i][0]) + int(s[i][1])*int(s[i][1])) <= int(temp[1]):
    cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = [input() for i in range(3)]
ans_set = set(s)
print(len(ans_set))

Fixed submission:
n = int(input())
s = [input() for i in range(n)]
ans_set = set(s)
print(len(ans_set))
Buggy python submission (verdict: Runtime Error):
i = list(map(int, input().split))
list = [-i[1]]*i[0]
for j in range(i[2]):
    list[int(input())-1] += 1

for ans in list:
    if ans > 0:
        print("Yes")
    else:
        print("No")


Fixed submission:
inp_list = list(map(int, input().split()))
n = inp_list[0]
k = inp_list[1]
q = inp_list[2]
ans_list = [k-q]*n
for i in range(q):
    ans_list[int(input())-1] += 1

for ans in ans_list:
    if ans > 0:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
list = input().split()
a = int(list[0])
b = int(list[1])
ans = a+b
ans_2 = a-b
ans_3 = a*b
if ans_2>ans:
    ans = ans_
if ans_3>ans:
    ans = ans_3
print(ans)

Fixed submission:
list = input().split()
a = int(list[0])
b = int(list[1])
ans = a+b
ans_2 = a-b
ans_3 = a*b
if ans_2>ans:
    ans = ans_2
if ans_3>ans:
    ans = ans_3
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
answer = 1
for i in range(len(A)):
    answer *= A[i]

if answer <= 1000000000000000000:
    print(answer)
else:
    print(-1)


Fixed submission:
N = int(input())
A = list(map(int, input().split()))
answer = 1
if 0 in A:
    print(0)
    exit()

for i in range(len(A)):
    if len(str(answer)) + len(str(A[i])) <= 20:
        answer *= A[i]
    else:
        print(-1)
        exit()

if answer <= 1000000000000000000:
    print(answer)
else:
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
workers = int(input())
A = list(map(int, input().split()))
for i in range(1,workers+1):
	print(A.count(i))


Fixed submission:
import collections
workers = int(input())
A = list(map(int, input().split()))
new = collections.Counter(A)
for i in range(1,workers+1):
    print(new[i])
Buggy python submission (verdict: Runtime Error):
A,B,C = list(map(int, input().split()))
if sum(A,B,C) >= 22:
    print("bust")
else:
    print("win ")

Fixed submission:
A = list(map(int, input().split()))
if sum(A) >= 22:
    print("bust")
else:
    print("win ")
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = list(input())
before = ""
after = ""
if N % 2 != 0:
  print("No")
else:
  for i in range N//2:
  	before += S[i]
  for j in range(N//2, N):
    after += S[j]
  if before == after:
    print("Yes")
  else:
    print("No")
    

Fixed submission:
N = int(input())
S = list(input())
before = ""
after = ""
if N % 2 != 0:
  print("No")
else:
  for i in range(N//2):
  	before += S[i]
  for j in range(N//2, N):
    after += S[j]
  if before == after:
    print("Yes")
  else:
    print("No")
Buggy python submission (verdict: Runtime Error):
A,B = map(input().split(" "))
if A <= 9 and B <= 9:
  print(A*B)
else:
  print(-1)


Fixed submission:
A,B = map(int, input().split(" "))
if A <= 9 and B <= 9:
  print(A*B)
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
A,B = input().split(" ")
if A <= 9 and B <= 9:
  print(A*B)
else:
  print(-1)

Fixed submission:
A,B = map(int, input().split(" "))
if A <= 9 and B <= 9:
  print(A*B)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input())
if A-(2*B) > 0:
  print(A-(2*B))
else:
  print(0)

Fixed submission:
A,B = map(int,input().split())
if A-(2*B) > 0:
  print(A-(2*B))
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
N = int(input())
tako = []
ans = 0
for i in N:
  tako.append(int(input()))
for j in range(len(tako)-1):
  ans += tako[j]*tako[j+1]
ans += tako[1] * tako[-1]
print(ans)
  

Fixed submission:
N = int(input())
ans = 0
tako = list(map(int, input().split()))
for j in range(len(tako)-1):
  for k in range(j+1, len(tako)):
      ans += tako[j] * tako[k]
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()
weather = ["Sunny", "Cloudy", "Rainy"]
if weather.index(S) < 2:
	print(weather[weather.index(S)+1]
else:
    print(weather[0])

Fixed submission:
S = input()
weather = ["Sunny", "Cloudy", "Rainy"]
if weather.index(S) < 2:
	print(weather[weather.index(S)+1])
else:
    print(weather[0])
Buggy python submission (verdict: Runtime Error):
N = int(input())
ans = 0
for i in range(1,N+1):
  if len(i) % 2 == 1:
    ans += 1
print(ans)

Fixed submission:
N = int(input())
ans = 0
for i in range(1,N+1):
  if len(str(i)) % 2 == 1:
    ans += 1
print(ans)