Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(input() for i in range(N))
ls = []
ls3 = []
for i in range(N):
  if a[i] not in ls:
    ls.append(a[i])
ls2 = [0 for i in range(len(ls))]
for i in range(len(ls)):
  for j in range(len(a)):
    if ls[i] == a[j]:
      ls2[i] += 1
for i in range(len(ls)):
  if ls2[i] == max(ls2):
    ls3.append(ls[i])
ls3.sort()
for i in range(len(ls3)):
  print(ls3[i])

Fixed submission:
N = int(input())
a = list(input() for i in range(N))
a.sort()
count = 1
max = 0
ls = []
for i in range(N - 1):
  if a[i] == a[i + 1]:
    count += 1
  else:
    if count > max:
      ls = []
      ls.append(a[i])
      max = count
    elif count == max:
      ls.append(a[i])
    count = 1
if count > max:
  ls = []
  ls.append(a[N - 1])
elif count == max:
  ls.append(a[N - 1])
ls.sort()
for i in range(len(ls)):
  print(ls[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(input() for i in range(N))
ls = []
ls3 = []
for i in range(N):
  if a[i] not in ls:
    ls.append(a[i])
ls2 = [0 for i in range(len(ls))]
for i in range(len(ls)):
  for j in range(len(a)):
    if ls[i] == a[j]:
      ls2[i] += 1
for i in range(len(ls)):
  if ls2[i] == max(ls2):
    ls3.append(ls[i])
ls3.sort()
for i in range(len(ls3)):
  print(ls3[i])

Fixed submission:
N = int(input())
a = list(input() for i in range(N))
a.sort()
count = 1
max = 0
ls = []
for i in range(N - 1):
  if a[i] == a[i + 1]:
    count += 1
  else:
    if count > max:
      ls = []
      ls.append(a[i])
      max = count
    elif count == max:
      ls.append(a[i])
    count = 1
if count > max:
  ls = []
  ls.append(a[N - 1])
elif count == max:
  ls.append(a[N - 1])
ls.sort()
for i in range(len(ls)):
  print(ls[i])
Buggy python submission (verdict: Time Limit Exceeded):
N, W = map(int, input().split())
l = []
for i in range(N):
  L = list(map(int, input().split()))
  l.append(L)
dp = [[0 for i in range(W+1)] for j in range(N+1)]
for i in range(1,N+1):
  for j in range(W+1):
    if j >= l[i-1][0]:
      dp[i][j] = max(dp[i-1][j], dp[i-1][j-l[i-1][0]]+l[i-1][1])
    else:
      dp[i][j] = dp[i-1][j]
print(dp[N][W])

Fixed submission:
N, W = map(int, input().split())
l = []
for i in range(N):
  L = list(map(int, input().split()))
  l.append(L)
sum_of_weight = 0
sum_of_value = 0
for i in range(N):
  sum_of_weight += l[i][0]
  sum_of_value += l[i][1]
dp = [[sum_of_weight+1 for i in range(sum_of_value+1)] for j in range(N+1)]
dp[0][0] = 0
for i in range(1,N+1):
  for j in range(sum_of_value+1):
    if j >= l[i-1][1]:
      dp[i][j] = min(dp[i-1][j], dp[i-1][j-l[i-1][1]]+l[i-1][0])
    else:
      dp[i][j] = dp[i-1][j]
ans = 0
for i in range(N+1):
  for j in range(sum_of_value+1):
    if W >= dp[i][j] and ans < j:
      ans = j
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = 0
while n:
    d = n%10
    n = n//10
    s += d
if s%9 == 0:
    print("Yes")
else:
    print("No")
#a = list(map(int,input().split()))
#n,k,t = map(int,input().split())


Fixed submission:
n = int(input())
if n%9 == 0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
if ord('n')>90:
  print('a')
else:
  print("A")

Fixed submission:
n = input()
if n.isupper(): 
    print("A")
else :
    print('a')
Buggy python submission (verdict: Runtime Error):
#D                 more faster method than above               see it ..........
l = lambda : list(map(int,input().split().strip()))
n = int(input())
a = l
t = [0]*(10**5+1)
s = 0
for i in a:
    s += i
    t[i] += 1
q = int(input())
for _ in range(q):
    b,c = l
    s += (c-b)*t[b]
    t[c] += t[b]
    t[b] = 0
    print(s)


Fixed submission:
#D                 more faster method than above               see it ..........
l = lambda : list(map(int,input().strip().split()))
n = int(input())
a = l()
t = [0]*(10**5+1)
s = 0
for i in a:
    s += i
    t[i] += 1
q = int(input())
for _ in range(q):
    b,c = l()
    s += (c-b)*t[b]
    t[c] += t[b]
    t[b] = 0
    print(s)

Buggy python submission (verdict: Time Limit Exceeded):
#D
from collections import defaultdict
n = int(input())
a = list(map(int,input().split()))
mp = defaultdict(int)
for i in a:
    mp[i] += 1
q = int(input())
for _ in range(q):
    #print(mp)
    s = 0   
    b,c=map(int,input().split())
    if c in mp:
        mp[c] = mp[c]+mp[b]
        mp.pop(b)
    elif b in mp:
        mp[c] = mp.pop(b)
        
    for i in mp:
        s += (mp[i])*i
    print(s)
    

Fixed submission:
#D                 more faster method than above               see it ..........
l = lambda : list(map(int,input().strip().split()))
n = int(input())
a = l()
t = [0]*(10**5+1)
s = 0
for i in a:
    s += i
    t[i] += 1
q = int(input())
for _ in range(q):
    b,c = l()
    s += (c-b)*t[b]
    t[c] += t[b]
    t[b] = 0
    print(s)

Buggy python submission (verdict: Runtime Error):
from collections import defaultdict
n = int(input())
a = list(map(int,input().split()))
mp = defaultdict(int)
for i in a:
    mp[i] += 1
q = int(input())
for _ in range(q):
    #print(mp)
    s = 0   
    b,c=map(int,input().split())
    if c in mp:
        mp[c] = mp[c]+mp[b]
        mp.pop(b)
    else:
        mp[c] = mp.pop(b)
    for i in mp:
        s += (mp[i])*i
    print(s)
    

Fixed submission:
#D                 more faster method than above               see it ..........
l = lambda : list(map(int,input().strip().split()))
n = int(input())
a = l()
t = [0]*(10**5+1)
s = 0
for i in a:
    s += i
    t[i] += 1
q = int(input())
for _ in range(q):
    b,c = l()
    s += (c-b)*t[b]
    t[c] += t[b]
    t[b] = 0
    print(s)
Buggy python submission (verdict: Runtime Error):
s,w =int(input())
if w>=s:
  print('UNSAFE')
else:
  print("SAFE")
  

Fixed submission:
#A
s,w = map(int,input().split())
if w>=s :
    print('unsafe')
else :
    print('safe')
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
arr = list(map(int,input().split()))
s = sum(arr)
a = (s//(4*M))
c = 0
for i in range(n):
    if arr[i]>a:
        c +=1
if c==m:
    print('YES')
else:
    print('NO')

Fixed submission:
N, M = map(int,input().split())
A = list(map(int,input().split()))
A.sort(reverse=True)
S = sum(A)
if A[M-1] >= S / (4*M):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
s,t = map(str,input().split())
a = ''
for i in range(n):
    a = a[i]+s[i]+t[i]
print(a)

Fixed submission:
n = int(input())
s,t = map(str,input().split())
a = ''
for i in range(n):
    a = a+s[i]+t[i]
print(a)

Buggy python submission (verdict: Runtime Error):
n = int(input())
s,t = map(str,input().split())
a = ""
for i in range(n):
    a = a[i]+s[i]+t[i]
print(a)

Fixed submission:
n = int(input())
s,t = map(str,input().split())
a = ''
for i in range(n):
    a = a+s[i]+t[i]
print(a)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
for i in range((n//2)+1):
    if s[i] == s[i+(n//2)]:
        c+= 1
if c*2 == n:
    print("Yes")
else:
    print("No")
    

Fixed submission:
n = int(input())
s = input()
c = 0
for i in range((n//2)):
    if s[i] == s[i+(n//2)]:
        c+= 1
if c*2 == n:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
def compare(a, b):
  	c=0
    for x, y in zip(a, b):
        if x == y:
          c += 1
x = input()
y = input()
compare(x,y)

Fixed submission:
def compare(a, b):
    c=0
    for x, y in zip(a, b):
        if x == y:
          c += 1
    return c
x = input()
y = input()
print(compare(x,y))

Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c== 0
if a[0] = b[0]:
  c = c+1
if a[1] = b[1]:
  c= c+1
ifa[2] = b[2]:
  c= c+1
print(c)

Fixed submission:
def compare(a, b):
    c=0
    for x, y in zip(a, b):
        if x == y:
          c += 1
    return c
x = input()
y = input()
print(compare(x,y))
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
C=list(input()) #listにすると文字列が１文字ごとに１要素となる
cnt=0
flag1=False
flag2=True

for i in range(n):
  if C[i]=='W':
    for t in range(1,n-i):
      if C[-t]=='R':
        C[i]='R'
        C[-t]='W'
        cnt+=1
        flag2=False
        break
    if flag2:
      flag1=True
  if flag1:
    break

print(cnt)


Fixed submission:
#二分探査
n=int(input())
C=list(input())
w=0
r=C.count('R')
ans=max(w,r)

for i in range(n):
  if C[i]=='W':
    w+=1
  if C[i]=='R':
    r-=1
  if ans>max(w,r):
    ans=max(w,r)
    
print(ans)


#以下のコードはO(n**2)なのでn<2*10**5では重すぎる
"""
n=int(input())
C=list(input()) #listにすると文字列が１文字ごとに１要素となる
cnt=0
flag1=False
flag2=True

for i in range(n):
  if C[i]=='W':
    for t in range(1,n-i):
      if C[-t]=='R':
        C[i]='R'
        C[-t]='W'
        cnt+=1
        flag2=False
        break
    if flag2:
      flag1=True
  if flag1:
    break

print(cnt)
"""
Buggy python submission (verdict: Runtime Error):
n=input()
if n.islower:
  print(a)
else:
  print(A)

Fixed submission:
n=input()
if n.islower():
  print('a')
else:
  print('A')
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
q=int(input())
b=[0]*q
c=[0]*q
for i in range(q):
  b[i],c[i]=map(int,input().split())

s=sum(a)

#このコードはO(10**10)になる可能性があり、重すぎる
"""
for i in range(q):
  while b[i] in a:
    s+=c[i]-b[i]
    a.remove(b[i])
    a.append(c[i])
  print(s)
"""

cnt_list=[0]*(10**5)
for i in range(n):
  cnt_list[a[i]]+=1

for i in range(q):
  s+=(c[i]-b[i])*cnt_list[b[i]]
  cnt_list[c[i]]+=cnt_list[b[i]]
  cnt_list[b[i]]=0
  print(s)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
q=int(input())
b=[0]*q
c=[0]*q
for i in range(q):
  b[i],c[i]=map(int,input().split())

s=sum(a)

#このコードはO(10**10)になる可能性があり、重すぎる
"""
for i in range(q):
  while b[i] in a:
    s+=c[i]-b[i]
    a.remove(b[i])
    a.append(c[i])
  print(s)
"""

cnt_list=[0]*(10**5+1)
for i in range(n):
  cnt_list[a[i]]+=1

for i in range(q):
  s+=(c[i]-b[i])*cnt_list[b[i]]
  cnt_list[c[i]]+=cnt_list[b[i]]
  cnt_list[b[i]]=0
  print(s)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
q=int(input())
b=[0]*q
c=[0]*q
for i in range(q):
  b[i],c[i]=map(int,input().split())

s=sum(a)

for i in range(q):
  while b[i] in a:
    s+=c[i]-b[i]
    a.remove(b[i])
    a.append(c[i])
  print(s)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
q=int(input())
b=[0]*q
c=[0]*q
for i in range(q):
  b[i],c[i]=map(int,input().split())

s=sum(a)

#このコードはO(10**10)になる可能性があり、重すぎる
"""
for i in range(q):
  while b[i] in a:
    s+=c[i]-b[i]
    a.remove(b[i])
    a.append(c[i])
  print(s)
"""

cnt_list=[0]*(10**5+1)
for i in range(n):
  cnt_list[a[i]]+=1

for i in range(q):
  s+=(c[i]-b[i])*cnt_list[b[i]]
  cnt_list[c[i]]+=cnt_list[b[i]]
  cnt_list[b[i]]=0
  print(s)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
q=int(input())
b=[0]*q
c=[0]*q
for i in range(q):
  b[i],c[i]=map(int,input().split())

s=sum(a)

for i in range(q):
  cnt=a.count(b[i])
  s+=cnt*(c[i]-b[i])
  for _ in range(cnt):
    a.remove(b[i])
    a.append(c[i])
  print(s)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
q=int(input())
b=[0]*q
c=[0]*q
for i in range(q):
  b[i],c[i]=map(int,input().split())

s=sum(a)

#このコードはO(10**10)になる可能性があり、重すぎる
"""
for i in range(q):
  while b[i] in a:
    s+=c[i]-b[i]
    a.remove(b[i])
    a.append(c[i])
  print(s)
"""

cnt_list=[0]*(10**5+1)
for i in range(n):
  cnt_list[a[i]]+=1

for i in range(q):
  s+=(c[i]-b[i])*cnt_list[b[i]]
  cnt_list[c[i]]+=cnt_list[b[i]]
  cnt_list[b[i]]=0
  print(s)
Buggy python submission (verdict: Runtime Error):
x,y,z=map(int,imput().split())
print(z,x,y)

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

Buggy python submission (verdict: Runtime Error):
x,y,z=map(int,imput().split())
print(z,x,y)


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

Buggy python submission (verdict: Runtime Error):
x,y,z=map(int,imput().split())
print(z+' '+x+' '+y)


Fixed submission:
x,y,z=map(int,input().split())
print(z,x,y)
Buggy python submission (verdict: Runtime Error):
s=input()
if s[3]==s[2] and s[5]==s[4]:
print('Yes')
else:
print('No')

Fixed submission:
s=list(input())
if s[3]==s[2] and s[5]==s[4]:
	print('Yes')
else:
	print('No')

Buggy python submission (verdict: Runtime Error):
s=list(input())
if s[3]==s[2] and s[5]==s[4]:
print('Yes')
else:
print('No')

Fixed submission:
s=list(input())
if s[3]==s[2] and s[5]==s[4]:
	print('Yes')
else:
	print('No')

Buggy python submission (verdict: Runtime Error):
s=list(input())
if s[3]=s[2] and s[5]=s[4]:
print('Yes')
else:
print('No')

Fixed submission:
s=list(input())
if s[3]==s[2] and s[5]==s[4]:
	print('Yes')
else:
	print('No')

Buggy python submission (verdict: Runtime Error):
s=list(input())
if s[3]=s[4] and s[5]=s[6]:
print('Yes')
else:
print('No')

Fixed submission:
s=list(input())
if s[3]==s[2] and s[5]==s[4]:
	print('Yes')
else:
	print('No')
Buggy python submission (verdict: Runtime Error):
x=int(input())
a=x//500*1000
b=(x-x//500*500)//5*5
input(a+b)

Fixed submission:
x=int(input())
a=x//500*1000
b=(x-x//500*500)//5*5
print(a+b)
Buggy python submission (verdict: Time Limit Exceeded):
n,a,b=map(int,input().split())
sum=0
while n>sum:
    sum+=(a+b)
x=sum//(a+b)-1
left=n-x*(a+b)
if left<=a:
    print(a*x+left)
else:
    print(a*x+a)

Fixed submission:
n,a,b=map(int,input().split())
x=n//(a+b)
left=n-x*(a+b)
if left<=a:
    print(a*x+left)
else:
    print(a*x+a)
Buggy python submission (verdict: Runtime Error):
n=input()
print(round(n/2))

Fixed submission:
n=int(input())
if n%2==0:
    print(n//2)
else:
    print((n+1)//2)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
import math
print(1+math.floor(math.log(n,k)))

Fixed submission:
n,r=map(int,input().split())
if n>=10:
    print(r)
else:
    print(r+100*(10-n))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
u=input()
if u=='red':
    print(a-1,b)
else:
    print(a,b-1)

Fixed submission:
s,t=input().split()
a,b=map(int,input().split())
u=input()
if u==s:
    print(a-1,b)
else:
    print(a,b-1)
Buggy python submission (verdict: Runtime Error):
s=len(input())
print(x*s)

Fixed submission:
s=len(input())
print('x'*s)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
p=list(map(int,input().split()))
cnt=0
list=[]

for i in range(n):
  list.append(p[i])
  if min(list)==p[i]:
    cnt+=1
    
print(cnt)

Fixed submission:
n=int(input())
p=list(map(int,input().split()))
cnt=0
tiny=float('inf')

for i in range(n):
  if tiny>=p[i]:
    cnt+=1
    tiny=p[i]
  else:
    pass
    
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
p=list(map(int,input().split()))
cnt=0

for i in range(n):
  if min([p[t] for t in range(i+1)])==p[i]:
    cnt+=1
    
print(cnt)

Fixed submission:
n=int(input())
p=list(map(int,input().split()))
cnt=0
tiny=float('inf')

for i in range(n):
  if tiny>=p[i]:
    cnt+=1
    tiny=p[i]
  else:
    pass
    
print(cnt)
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=list(map(int,input().split()))

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

power=[0]*n
for i in range(n):
  while a[i]%2==0:
    a[i]//=2
    power[i]+=1
    
if power.count(power[0])==n:
  x=1
  for i in range(n):
    x=lcm(x,a[i]//2)

  print((m+x)//(2*x))
else:
  print(0)

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

import math
def lcm(x, y):
    return (x * y) // math.gcd(x, y)
x=1
for i in range(n):
  x=lcm(x,a[i]//2)

power=[0]*n
for i in range(n):
  while a[i]%2==0:
    a[i]//=2
    power[i]+=1
    
if power.count(power[0])==n:  
  print((m+x)//(2*x))
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
n=int(input())
if n%2==0:
    print(1/2)
else:
    print((n+1)/2/n

Fixed submission:
n=int(input())
if n%2==0:
    print(1/2)
else:
    print((n+1)/2/n)
Buggy python submission (verdict: Runtime Error):
d={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':Sunny'}
s=input()
print(d[s])

Fixed submission:
d={'Sunny':'Cloudy','Cloudy':'Rainy','Rainy':'Sunny'}
s=input()
print(d[s])
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    x=(b-1)//(a-1)
    if (b-1)%(a-1)==0:
        print(x)
     else:
        print(x+1)
else:
    print(1)

Fixed submission:
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    x=(b-1)//(a-1)
    if (b-1)%(a-1)==0:
        print(x)
    else:
        print(x+1)
else:
    print(1)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    print(b//a+1)
elif a=b:
    print(b//a)
else:
    print(1)

Fixed submission:
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    x=(b-1)//(a-1)
    if (b-1)%(a-1)==0:
        print(x)
    else:
        print(x+1)
else:
    print(1)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    print(b//a+1)
elif a=b:
    priint(b//a)
else:
    print(1)

Fixed submission:
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    x=(b-1)//(a-1)
    if (b-1)%(a-1)==0:
        print(x)
    else:
        print(x+1)
else:
    print(1)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    print(b//a+1)
elif a==B:
    priint(b//a)
else:
    print(1)

Fixed submission:
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    x=(b-1)//(a-1)
    if (b-1)%(a-1)==0:
        print(x)
    else:
        print(x+1)
else:
    print(1)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    print(b//a+1)
elif a=B:
    priint(b//a)
else:
    print(1)

Fixed submission:
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    x=(b-1)//(a-1)
    if (b-1)%(a-1)==0:
        print(x)
    else:
        print(x+1)
else:
    print(1)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a!=b:
    print(b//a+1)
else:
    priint(b//a)

Fixed submission:
a,b=map(int,input().split())
if b==1:
    print(0)
elif a<b:
    x=(b-1)//(a-1)
    if (b-1)%(a-1)==0:
        print(x)
    else:
        print(x+1)
else:
    print(1)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))

cnt=0

for i in range(n):
  if a[n-i]>=b[n-1-i]:
    cnt+=b[n-1-i]
  else:    
    if a[n-1-i]-(b[n-1-i]-a[n-i])>=0:
      a[n-1-i]-=b[n-1-i]-a[n-i]
      cnt+=b[n-1-i]
    else:
      cnt+=a[n-i]+a[n-1-i]
      a[n-1-i]=0
      
print(cnt)


Fixed submission:
a,b=map(int,input().split())
if (a+b)%2==0:
    print((a+b)//2)
else:
    print('IMPOSSIBLE')
Buggy python submission (verdict: Runtime Error):
import numpy as np
n=int(input())
a=[0]*n
b=[0]*n
for i in range(n):
  a[i],b[i]=map(int,input().split())

flag=True
sum=0
sorted_index=np.argsort(b)
for i in sorted_index:
  sum+=a[i]
  if sum>b[i]:
    flag=False
    break
    
if flag:
  print('Yes')
else:
  print('No')

Fixed submission:
import numpy as np
n=int(input())
a=[0]*n
b=[0]*n
for i in range(n):
  a[i],b[i]=map(int,input().split())

flag=True
sum=0
sorted_index=np.argsort(b)
for i in sorted_index:
  sum+=a[i]
  if sum>b[i]:
    flag=False
    break
    
if flag:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
x,y=input().split()
if x>y:
    print('>')
elif x=y:
    print('=')
else:
    print('<')

Fixed submission:
x,y=input().split()
if x>y:
    print('>')
elif x==y:
    print('=')
else:
    print('<')
Buggy python submission (verdict: Runtime Error):
from itertools import product
import numpy as np

x = int(input())

if 400 <= x < 600:
    print('8')
elif 600 <= x < 800:
    print('7')
elif 800 <= x < 1000:
    print('6')
elif 1000 <= x < 1200:
    print('5')
elif 1200 <= x < 1400:
    print('4')
elif 1400 <= x < 1600:
    print('3')
elif 1600 <= x < 1800:
    print('2')
elif 1800 <= x < 2000:
    print('1')

Fixed submission:
x = int(input())

if 400 <= x < 600:
    print('8')
elif 600 <= x < 800:
    print('7')
elif 800 <= x < 1000:
    print('6')
elif 1000 <= x < 1200:
    print('5')
elif 1200 <= x < 1400:
    print('4')
elif 1400 <= x < 1600:
    print('3')
elif 1600 <= x < 1800:
    print('2')
elif 1800 <= x < 2000:
    print('1')
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
from functools import reduce

N, K = [int(n) for n in input().split()]
scores = [int(n) for n in input().split()]

d = deque(maxlen=200001)
for i, score in enumerate(scores, start=1):
    if i < K:
        d.append(score)
    elif i == K:
        d.append(score)
        pre_e = reduce(lambda x, y: x*y, d)
        d.popleft()
    else:
        d.append(score)
        e = reduce(lambda x, y: x*y, d)
        if e > pre_e:
            print('Yes')
        else:
            print('No')
        pre_e = e
        d.popleft()


Fixed submission:
N, K = [int(n) for n in input().split()]
scores = [int(n) for n in input().split()]
min_pointer = 0
max_pointer = K
for i, score in enumerate(scores, start=1):
    if i > K:
        if scores[max_pointer] > scores[min_pointer]:
            print('Yes')
        else:
            print('No')
        min_pointer += 1
        max_pointer += 1

Buggy python submission (verdict: Runtime Error):
from itertools import product
import numpy as np

H, W, K = [int(n) for n in input().split()]
arr = np.zeros((H, W))
count = 0

for h in range(H):
    row = input()
    arr[h, :] = np.array([0 if mark=='.' else 1 for mark in row])

for row_onehot, col_onehot in product(product(range(2), repeat=H), product(range(2), repeat=W)):
    row_indexes = np.argwhere(np.array(row_onehot)==1).flatten()
    col_indexes = np.argwhere(np.array(col_onehot)==1).flatten()
    arr_ = arr.copy()
    for row_idx in row_indexes:
        arr_[row_idx, :] = 0
    for col_idx in col_indexes:
        arr_[:, col_idx] = 0
    if arr_.sum() == K:
        count += 1

print(count)

Fixed submission:
N, K = [int(n) for n in input().split()]
scores = [int(n) for n in input().split()]
min_pointer = 0
max_pointer = K
for i, score in enumerate(scores, start=1):
    if i > K:
        if scores[max_pointer] > scores[min_pointer]:
            print('Yes')
        else:
            print('No')
        min_pointer += 1
        max_pointer += 1

Buggy python submission (verdict: Runtime Error):
from itertools import product
import numpy as np

H, W, K = [int(n) for n in input().split()]
arr = np.zeros((H, W))
count = 0

for h in range(H):
    row = input()
    arr[h, :] = np.array([0 if mark=='.' else 1 for mark in row])

for row_onehot, col_onehot in product(product(range(2), repeat=H), product(range(2), repeat=W)):
    row_indexes = np.argwhere(np.array(row_onehot)==1).flatten()
    col_indexes = np.argwhere(np.array(col_onehot)==1).flatten()
    arr_ = arr.copy()
    for row_idx in row_indexes:
        arr_[row_idx, :] = 0
    for col_idx in col_indexes:
        arr_[:, col_idx] = 0
    if arr_.sum() == K:
        count += 1

print(count)

Fixed submission:
N, K = [int(n) for n in input().split()]
scores = [int(n) for n in input().split()]
min_pointer = 0
max_pointer = K
for i, score in enumerate(scores, start=1):
    if i > K:
        if scores[max_pointer] > scores[min_pointer]:
            print('Yes')
        else:
            print('No')
        min_pointer += 1
        max_pointer += 1