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

def list_seki(l):
    S = 1
    for i in range(0, len(l)):
        S *= l[i]
    return S

def hikaku(l):
    for i in range(1, len(l)):
        if l[i-1]<l[i]:
            print("Yes")
        else:
            print("No")

D = []
for x in range(K, N+1):
    before = list_seki(A[x-K:x])
    D.append(before)

hikaku(D)

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

for x in range(K-1, N-1):
    if A[x-K+1] < A[x+1]:
        print("Yes")
    else:
        print("No")

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

def list_seki(l):
    S = 1
    for i in range(0, len(l)):
        S *= l[i]
    return S

for x in range(K, N):
    before = list_seki(A[x-K:x])
    after = list_seki(A[x-K+1:x+1])
    if after > before:
        print("Yes")
    else:
        print("No")

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

for x in range(K-1, N-1):
    if A[x-K+1] < A[x+1]:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
K = int(input())
S = input()

if K >= len(S):
    print(S)
elif K < len(S):
    print(S[0:K]+'...')


Fixed submission:
N = int(input())

if N % 10 in [2,4,5,7,9]:
    print('hon')
elif N % 10 in [0,1,6,8]:
    print('pon')
elif N % 10 in [3]:
    print('bon')
Buggy python submission (verdict: Runtime Error):

S,W = map(int, input().split())

if W => S:
    print('unsafe')
else:
    print('safe')

Fixed submission:

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())

if N = M:
    print('Yes')
else:
    print('No')


Fixed submission:
N,M = map(int, input().split())
if N == M:
    print('Yes')
elif N >= M:
    print('No')
Buggy python submission (verdict: Runtime Error):
c = input()
abc = 'abcdefghijklmnopqrstuvwxyz'

for i in range(len(str(abc))):
    if abc[i] = c:
        print(abc[i+1])

Fixed submission:
C = input()
abc = 'abcdefghijklmnopqrstuvwxyz'

for i in range(len(str(abc))):
    if abc[i] == C:
        print(abc[i+1])
Buggy python submission (verdict: Runtime Error):
A1, A2, A3 = map(int, input().split())

if A1+A2+A3 => 22:
    print('bust')
else:
    print('win')

Fixed submission:
A1, A2, A3 = map(int, input().split())

if A1+A2+A3 >= 22:
    print('bust')
else:
    print('win')
Buggy python submission (verdict: Runtime Error):
input()
print(input().count('ABC'))


Fixed submission:
a = list(map(int, input().split()))
K = a[0]
X = a[1]

if 500 * K >= X:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int, input().split())
A = list(map(int, input().split()))
num = 1
data = []
for j in range(N-K+1):
    for t in range(j, j+K):
        num = num*A[t]
    data.append(num)
    num = 1
num = 1
for i in range(0, N - K):
    if data[num] > data[num - 1]:
        print("Yes")
    elif data[num] <= data[num - 1]:
        print("No")
    num+=1

Fixed submission:
n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n-k):
    print("Yes")if a[i]<a[k+i] else print("No")

Buggy python submission (verdict: Runtime Error):
N,K = map(int, input().split())
A = list(map(int, input().split()))
num = 1
num_b = None
data = []
for j in range(K):
    for t in range(j, j+3):
        num = num*A[t]
    data.append(num)
    num_b = num
    num = 1
for i in range(N - K):
    if data[i+1] > data[i]:
        print("Yes")
    elif data[i+1] <= data[i]:
        print("No")


Fixed submission:
n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n-k):
    print("Yes")if a[i]<a[k+i] else print("No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(1,n-1):
    if a[i-1]<a[i] and a[i]<a[i+1]:
        cnt+=1
    elif a[i-1]>a[i] and a[i]>a[i+1]:
        cnt+=1py
print(cnt)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(1,n-1):
    if a[i-1]<a[i] and a[i]<a[i+1]:
        cnt+=1
    elif a[i-1]>a[i] and a[i]>a[i+1]:
        cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
import math
import fractions
nc=math.floor((b-a)/c)
nd=math.floor((b-a)/d)
lcd=c*d//fractions.gcd(c,d)
ncd=math.floor((b-a)/lcd)
sum=nc+nd-ncd
print(b-a-sum)

Fixed submission:
a=input()
cnt=0
for i in range(3):
    if a[i]==a[i+1]:
        cnt+=1
print("Good" if cnt==0 else "Bad")

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
import fractions
import math
nc=math.floor(b/c)-math.ceil(a/c)+1
nd=math.floor(b/d)-math.ceil(a/d)+1
min=c*d/fractions.gcd(c,d)
ncd=math.floor(b/min)-math.ceil(a/min)+1
print(b-a+1-(nc+nd-ncd))

Fixed submission:
a=input()
cnt=0
for i in range(3):
    if a[i]==a[i+1]:
        cnt+=1
print("Good" if cnt==0 else "Bad")
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
import math
import fractions
nc=math.floor((b-a)/c)
nd=math.floor((b-a)/d)
lcd=c*d//math.gcd(c,d)
ncd=math.floor((b-a)/lcd)
sum=nc+nd-ncd
print(b-a-sum)

Fixed submission:
a,b,c,d=map(int,input().split())
import fractions
import math
nc=b//c-(a-1)//c
nd=b//d-(a-1)//d
min=c*d//fractions.gcd(c,d)
ncd=b//min-(a-1)//min
print(b-a+1-(nc+nd-ncd))

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
import math
nc=math.floor(b/c)-math.ceil(a/c)+1
nd=math.floor(b/d)-math.ceil(a/d)+1
min=c*d/math.gcd(c,d)
ncd=math.floor(b/min)-math.ceil(a/min)+1
print(b-a+1-(nc+nd-ncd))

Fixed submission:
a,b,c,d=map(int,input().split())
import fractions
import math
nc=b//c-(a-1)//c
nd=b//d-(a-1)//d
min=c*d//fractions.gcd(c,d)
ncd=b//min-(a-1)//min
print(b-a+1-(nc+nd-ncd))

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
import math
nc=math.floor(b/c)-math.ceil(a/c)+1
nd=math.floor(b/d)-math.ceil(a/d)+1
min=c*d//math.gcd(c,d)
ncd=math.floor(b/min)-math.ceil(a/min)+1
print(b-a+1-(nc+nd-ncd))

Fixed submission:
a,b,c,d=map(int,input().split())
import fractions
import math
nc=b//c-(a-1)//c
nd=b//d-(a-1)//d
min=c*d//fractions.gcd(c,d)
ncd=b//min-(a-1)//min
print(b-a+1-(nc+nd-ncd))
Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
sum=0
for i in range(n):
    sum+=a[i]
for i in range(m):
    b=list(map(int,input().split()))
    for i in range(b[0]):
        if a[i]<=b[1]:
            sum=sum-a[i]+b[1]
            a[i]=b[1]
    a.sort()
print(sum)

Fixed submission:
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
b=[]
sum=0
for i in range(m):
    b.append(list(map(int,input().split())))
b.sort(key=lambda x: x[1])
B=len(b)
b1=b[B-1][0]
b2=b[B-1][1]
b3=0
for i in range(n):
    if a[i]<b2 and b3==0:
        sum+=b2
        b1-=1
    else:
        sum+=a[i]
    if b1==0:
        B-=1
        if B==0:
            b3=1
        b1=b[B-1][0]
        b2=b[B-1][1]
print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n=int(input())
v=list(map(int,input().split()))
c=list(map(int,input().split()))
vc=[]
for i in range(n):
  vc.append(v[i]-c[i])
sv=[]
sum=0
for L in range(0, len(v)+1):
    for subset in itertools.combinations(vc, L):
      for i in range(len(subset)):
        sum=sum+int(subset[i])
      sv.append(sum)
      sum=0
print(max(sv))

Fixed submission:
import itertools
n=int(input())
v=list(map(int,input().split()))
c=list(map(int,input().split()))
vc=[]
for i in range(n):
  vc.append(v[i]-c[i])
sv=[]
for L in range(0, len(v)+1):
    for subset in itertools.combinations(vc, L):
      sv.append(sum(subset))
print(max(sv))

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n=int(input())
v=list(map(int,input().split()))
c=list(map(int,input().split()))
sv=[]
sum=0
sumc=0
for L in range(0, len(v)+1):
    for subset in itertools.combinations(v, L):
      for i in range(len(subset)):
        sum=sum+int(subset[i])
        for j in range(n):
          if int(subset[i])==v[j]:
            sumc=sumc+c[j]
      sv.append(sum-sumc)
      sum=0
      sumc=0
print(max(sv))

Fixed submission:
import itertools
n=int(input())
v=list(map(int,input().split()))
c=list(map(int,input().split()))
vc=[]
for i in range(n):
  vc.append(v[i]-c[i])
sv=[]
for L in range(0, len(v)+1):
    for subset in itertools.combinations(vc, L):
      sv.append(sum(subset))
print(max(sv))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(int,input())
sum=0
c=0
for i in range(n):
  if a[i]<0:
    a[i]=a[i]*-1:
      c=c+1
  sum=sum+a[i]
  if c%2==0:
    print(sum)
  else:
    print(sum-min(a)*2)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
sum=0
c=0
for i in range(n):
  if a[i]<0:
    a[i]=a[i]*-1
    c=c+1
  sum=sum+a[i]
if c%2==0:
  print(sum)
else:
  print(sum-min(a)*2)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(int,input())
sum=0
c=0
for i in range(n):
  if a[i]<0:
    a[i]=a[i]*-1:
      c=c+1
  sum=sum+a[i]
  if c%2==0:
    print(sum)
  else:
    print(sum-min(a*2))

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
sum=0
c=0
for i in range(n):
  if a[i]<0:
    a[i]=a[i]*-1
    c=c+1
  sum=sum+a[i]
if c%2==0:
  print(sum)
else:
  print(sum-min(a)*2)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int.input().split())
if a<=c and b>=c:
  print("Yes")
else:
  print("No")

Fixed submission:
a,b,c=map(int,input().split())
if a<b:
  if a<c and b>c:
    print("Yes")
  else:
    print("No")
else:
  if a>c and b<c:
    print("Yes")
  else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
s=input()
if s[0]==".":
  k[0]="."
  k[1]="#"
else:
  k[0]="#"
  k[1]="."
  
for i in range(n):
  if s[i]!=k[i%2]:
    s[i]=k[i%2]
print(s)

Fixed submission:
from collections import deque
n=int(input())
s=input()
black=0
write=s.count(".")
koho=deque([write,s.count("#")])
for i in s:
    if i==".":
        write-=1
    else:
        black+=1
    koho.append(write+black)
print(min(koho))
Buggy python submission (verdict: Time Limit Exceeded):
time=0
N=int(input())
p=[N,0,0,0,0,0]
A=int(input())
B=int(input())
C=int(input())
D=int(input())
E=int(input())
while p[5]!=N:
  time=time+1
  for i in range(E):
    if p[4]!=0:
      p[4]=p[4]-1
      p[5]=p[5]+1
  for i in range(D):
    if p[3]!=0:
      p[3]=p[3]-1
      p[4]=p[4]+1
  for i in range(C):
    if p[2]!=0:
      p[2]=p[2]-1
      p[3]=p[3]+1
  for i in range(B):
    if p[1]!=0:
      p[1]=p[1]-1
      p[2]=p[2]+1
  for i in range(A):
    if p[0]!=0:
      p[0]=p[0]-1
      p[1]=p[1]+1
print(time)

Fixed submission:
import math
N=int(input())
A=int(input())
B=int(input())
C=int(input())
D=int(input())
E=int(input())
print(math.ceil(N/min(A,B,C,D,E))+4)
Buggy python submission (verdict: Runtime Error):
A,B,C=map(int,input().split())
if A==B&&A==C:
  print("Yes")
else:
  print("No")

Fixed submission:
A,B,C=map(int,input().split())
if A==B and A==C:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N, Q = map(int, input().split())
S = input()
t = [0] * (N + 1)
for i in range(N):
t[i + 1] = t[i] + (1 if S[i : i + 2] == 'AC' else 0)
for i in range(Q):
l, r = map(int, input().split())
print(t[r-1] - t[l-1])

Fixed submission:
N, Q = map(int, input().split())
S = input()
t = [0] * (N + 1)
for i in range(N):
  t[i + 1] = t[i] + (1 if S[i : i + 2] == 'AC' else 0)
for i in range(Q):
  l, r = map(int, input().split())
  print(t[r-1] - t[l-1])

Buggy python submission (verdict: Time Limit Exceeded):
n,q=map(int,input().split())
s=input()
l=[]
r=[]
sum=0
for i in range(q):
  L,R=map(int,input().split())
  l.append(L)
  r.append(R)
for i in range(q):
  for j in range(l[i]-1,r[i]-1):
    if s[j]=="A" and s[j+1]=="C":
      sum+=1
  print(sum)
  sum=0

Fixed submission:
N, Q = map(int, input().split())
S = input()
t = [0] * (N + 1)
for i in range(N):
  t[i + 1] = t[i] + (1 if S[i : i + 2] == 'AC' else 0)
for i in range(Q):
  l, r = map(int, input().split())
  print(t[r-1] - t[l-1])
Buggy python submission (verdict: Runtime Error):
a=[0,0]
s=[]
a[0],a[1],k=map(int,input().split())
for i in range(1,min(a)+1):
  if a[0]%i==0 and a[1]%i==0:
    s.append(i)
print(s[len(s)-k])

Fixed submission:
import math
A,B,C=map(int,input().split())
can=math.floor(B/A)
if can>=C:
  print(C)
else:
  print(can)
Buggy python submission (verdict: Runtime Error):
a=[0,0]
s=[]
a[0],a[1],k=map(int,input().split())
for i in range(1,max(a)):
  if a[0]%i==0 and a[1]%i==0:
    s.append(i)
print(s[k-1])


Fixed submission:
a=[0,0]
s=[]
a[0],a[1],k=map(int,input().split())
for i in range(1,min(a)+1):
  if a[0]%i==0 and a[1]%i==0:
    s.append(i)
print(s[len(s)-k])

Buggy python submission (verdict: Runtime Error):
a=[]
s=[]
a[0],a[1],k=map(int(input().split()))
for i in range(max(a)):
  if a[0]%i==0 and a[1]%i==0:
    s.append(i)
print(s[k])

Fixed submission:
a=[0,0]
s=[]
a[0],a[1],k=map(int,input().split())
for i in range(1,min(a)+1):
  if a[0]%i==0 and a[1]%i==0:
    s.append(i)
print(s[len(s)-k])
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[]
sum=0
for i in range(n):
  a.append(list(map(int,input().split())))
  if a[i][1]=="BTC":
    sum+=a[i][0]*380000.0
  else:
    sum+=a[i][0]
print(sum)

Fixed submission:
n=int(input())
a=[]
sum=0
for i in range(n):
  a.append(list(input().split()))
  if a[i][1]=="BTC":
    sum+=float(a[i][0])*380000.0
  else:
    sum+=int(a[i][0])
print(sum)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[map(int,input().split()) for i in range(n)]
b=a[0]
def gcd(x,y):
  while y:
    x,y=y,x%y
  return x

for i in a:
  b=gcd(b,i)
print(b)

Fixed submission:
n=int(input())
a=[int(i) for i in input().split()]
b=a[0]
def gcd(x,y):
  while y:
    x,y=y,x%y
  return x

for i in a:
  b=gcd(b,i)
print(b)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
printint((a+(b/2)))

Fixed submission:
a,b=map(int,input().split())
print(int(a+(b/2)))
Buggy python submission (verdict: Runtime Error):
n=int(input())
t,a=[int(i) for i in input().split()]
h=[t-int(i)*0.006 for i in input().split()]
ans=0
for i in range(n):
  if abs(A-h[i])<abs(A-h[ans]):
    ans=i
print(ans+1)

Fixed submission:
n=int(input())
t,a=[int(i) for i in input().split()]
h=[t-int(i)*0.006 for i in input().split()]
ans=0
for i in range(n):
  if abs(a-h[i])<abs(a-h[ans]):
    ans=i
print(ans+1)
Buggy python submission (verdict: Runtime Error):
n,T=[int(i) for i in input().split()]
ans=[]
for i in range(n):
  c,t=[int(i) for i in input().split()]
  if t<=T:
    ans.append(c)
print(min(ans) if len(c)!=0 else "TLE")


Fixed submission:
n,T=[int(i) for i in input().split()]
ans=[]
for i in range(n):
  c,t=[int(i) for i in input().split()]
  if t<=T:
    ans.append(c)
print(min(ans) if len(ans)!=0 else "TLE")
Buggy python submission (verdict: Runtime Error):
n=input()
for i in range(len(n)):
  if n[i]=="9":
    n[i]="1"
  else:
    n[i]="9"
print(n)

Fixed submission:
n=input()
c=""
for i in range(len(n)):
  if n[i]=="9":
    c+="1"
  else:
    c+="9"
print(c)
Buggy python submission (verdict: Runtime Error):
a=int(input().split())
a.sort()
print(a[2]*10+a[1]+a[0])

Fixed submission:
a=list(map(int,input().split()))
a.sort()
print(a[2]*10+a[1]+a[0])
Buggy python submission (verdict: Runtime Error):
print(int(input())+1-int(input()))

Fixed submission:
n,i=map(int,input().split())
print(1+n-i)
Buggy python submission (verdict: Runtime Error):
a=list(input())
sum=0
for i in range(len(a)):
  sum+=1 if a[i]=="+" else sum-=1
print(sum)

Fixed submission:
a=list(input())
sum=0
for i in range(len(a)):
  sum+=1 if a[i]=="+" else -1
print(sum)
Buggy python submission (verdict: Runtime Error):
s=input()
k=int(input())
ans=[]
for i in range(len(s)):
    for j in range(i+1,len(s)+1):
        ans.append(s[i:j])
ans.sort()
a=[ans[0]]
for i in range(1,len(ans)):
    if ans[i-1]!=ans[i]:
        a.append(ans[i])
print(a[k-1])

Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if (abs(b-a)<=d and abs(c-b)<=d) or abs(c-a)<=d else "No" )

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
print("Yes" (b-a<=d and c-b<=d) or c-a<=d else "No" )

Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if (abs(b-a)<=d and abs(c-b)<=d) or abs(c-a)<=d else "No" )

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
print("Yes" b-a<=d and c-b<=d or c-a<=d else "No" )

Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if (abs(b-a)<=d and abs(c-b)<=d) or abs(c-a)<=d else "No" )

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
print("Yes" b-a<=d and c-b<=d else "No" )

Fixed submission:
a,b,c,d=map(int,input().split())
print("Yes" if (abs(b-a)<=d and abs(c-b)<=d) or abs(c-a)<=d else "No" )
Buggy python submission (verdict: Runtime Error):
a=list(input().split())
print("Yes" if a[0]!=a[1] and a[0]!=a[2] and a[1]!=a[2] else "No")

Fixed submission:
a=list(input())
print("Yes" if a[0]!=a[1] and a[0]!=a[2] and a[1]!=a[2] else "No")
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if("Yes" if a+b>=c else "No")

Fixed submission:
a,b,c=map(int,input().split())
print("Yes" if a+b>=c else "No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=int(input())
print("Yes" if (N%500)<=a else "No")

Fixed submission:
n=int(input())
a=int(input())
print("Yes" if (n%500)<=a else "No")
Buggy python submission (verdict: Runtime Error):
a=map(int,input().split())
print("Even" if (a[0]*a[1])%2==0 else "Odd")

Fixed submission:
a,b=map(int,input().split())
print("Even" if (a*b)%2==0 else "Odd")

Buggy python submission (verdict: Runtime Error):
print("Even" if (int(input())*int(input()))%2==0 else "Odd")

Fixed submission:
a,b=map(int,input().split())
print("Even" if (a*b)%2==0 else "Odd")
Buggy python submission (verdict: Runtime Error):
s=input()
s[3]="8"

Fixed submission:
s=input()
c=""
for i in range(len(s)):
  if i==3:
    c+="8"
  else:
    c+=s[i]
print(c)
Buggy python submission (verdict: Runtime Error):
a=input()
if a[0]==a[1] and a[1]==a[2] || a[1]==a[2] and a[2]==a[3]:
  print("Yes")
else:
  print("No")

Fixed submission:
a=input()
if a[0]==a[1] and a[1]==a[2] or a[1]==a[2] and a[2]==a[3]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a=input().split()
b=input().split()
print("YES" if a[0]==b[2] and a[1]==b[1] and a[2]==b[0] else "NO")

Fixed submission:
a=input()
b=input()
print("YES" if a[0]==b[2] and a[1]==b[1] and a[2]==b[0] else "NO")
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
a=[[int(i) for i in input().split()] for j in range(m)]
a.sort(key=lambda x:x[1])
a.sort(key=lambda x:x[0])
cc=0
for i in range(m):
    if a[i][0]==1:
        for j in range(i,m):
            if a[i][1]==a[j][0] and a[j][1]==n:
                cc=1
                break
    if cc==1:
        break
print("POSSIBLE" if cc==1 else "IMPOSSIBLE")

Fixed submission:
print("ABC"+input())
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a%3==0 or b%3==0 (a+b)%3==0:
  print("Possible")
else:
  print("Impossible")

Fixed submission:
a,b=map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
  print("Possible")
else:
  print("Impossible")

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a//3==0 or b//3==0 (a+b)//3==0:
  print("Possible")
else:
  print("Impossible")

Fixed submission:
a,b=map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
  print("Possible")
else:
  print("Impossible")
Buggy python submission (verdict: Runtime Error):
d=[0,1,0,2,0,2,0,0,2,0,2,0]
a,b=map(int,input().split())
if d[a]==d[b]:
  print("Yes")
else:
  print("No")

Fixed submission:
d=[0,0,1,0,2,0,2,0,0,2,0,2,0]
a,b=map(int,input().split())
if d[a]==d[b]:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
d=[0,1,0,2,0,2,0,0,2,0,2,0]
a,b=map(int,input().split())
if d[a]==d[b]:
  print("Yes")
else:
  print("No")

Fixed submission:
d=[0,0,1,0,2,0,2,0,0,2,0,2,0]
a,b=map(int,input().split())
if d[a]==d[b]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a,b,c=map(str,input().split())
if("YES" if a[len(a)-1]==b[0] and b[len(b)-1]==c[0] else "NO")


Fixed submission:
a=input().split()
print("YES" if a[0][len(a[0])-1]==a[1][0] and a[1][len(a[1])-1]==a[2][0] else "NO")

Buggy python submission (verdict: Runtime Error):
a,b,c=map(input().split())
if("YES" if a[len(a)-1]==b[0] and b[len(b)-1]==c[0] else "NO")


Fixed submission:
a=input().split()
print("YES" if a[0][len(a[0])-1]==a[1][0] and a[1][len(a[1])-1]==a[2][0] else "NO")

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()
if("YES" if a[len(a)-1]==b[0] and b[len(b)-1]==c[0] else "NO")


Fixed submission:
a=input().split()
print("YES" if a[0][len(a[0])-1]==a[1][0] and a[1][len(a[1])-1]==a[2][0] else "NO")

Buggy python submission (verdict: Runtime Error):
a=input().split()
if("YES" if a[0][len(a[0])-1]==a[1][0] and a[1][len(a[1])-1]==a[2][0] else "NO")


Fixed submission:
a=input().split()
print("YES" if a[0][len(a[0])-1]==a[1][0] and a[1][len(a[1])-1]==a[2][0] else "NO")
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a==b:
  print("Draw")
elif a==1:
  print("Alice")
elif b==1:
  print("Bob")
elif b<a:
  print("Alice")
else a<b:
  print("Bob")

Fixed submission:
a,b=map(int,input().split())
if a==b:
  print("Draw")
elif a==1:
  print("Alice")
elif b==1:
  print("Bob")
elif b<a:
  print("Alice")
else:
  print("Bob")
Buggy python submission (verdict: Runtime Error):
a=map(int,input().split())
a.sort()
print("Yes" if a[0]+a[1]==a[2] else "No")

Fixed submission:
a=list(map(int,input().split()))
a.sort()
print("Yes" if a[0]+a[1]==a[2] else "No")
Buggy python submission (verdict: Runtime Error):
a=map(int,input().split())
a.sort()
print(1 if a[0]==a[2] else 2 if a[0]==a[1] or a[1]==a[2] else 3)

Fixed submission:
a=list(map(int,input().split()))
a.sort()
print(1 if a[0]==a[2] else 2 if a[0]==a[1] or a[1]==a[2] else 3)
Buggy python submission (verdict: Runtime Error):
X = int(input())
for key, value in enumerate(rate_sec):
    if X < value:
        print(8-key)
        break

Fixed submission:
X = int(input())
rate_sec = [i*200+600 for i in range(8)]

for key, value in enumerate(rate_sec):
    if X < value:
        print(8-key)
        break