Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
if (A-2*B)>=0:
  print(A-2B)
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):
A,B=map(int,input().split())
if A-2*B>=0:
  print(A-2B)
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())
S=input()
for i in range(N-1):
    if S[i]==S[i+1]:
       S= S.replace(S[i],'')
print(len(S))

Fixed submission:
N=int(input())
S=input()
ans=1
for i in range(N-1):
    if S[i]!=S[i+1]:
       ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
N,K,Q = map(int,input().split())
S=[int(input()) for i in range(Q)]
Point=[int(K-Q) for i in range(N)]
for x in range(Q):
    Point[S[x]]+=1

for x in range(N):
    if Point[x]<1:
        print("No")
    else:
        print("Yes")

Fixed submission:
N,K,Q = map(int,input().split())
S=[int(input()) for i in range(Q)]
Point=[int(K-Q) for i in range(N)]
for x in range(Q):
    Point[S[x]-1]+=1

for x in range(N):
    if Point[x]<1:
        print("No")
    else:
        print("Yes")
Buggy python submission (verdict: Runtime Error):
N=int(input)
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=0
for x in range(len[B]):
  ans=ans+B[x]
for i in range(len[A]-1):
  if (A[i+1]-A[i])==0:
    ans=ans+C[A[i]-1]
print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=0
for x in range(len(B)):
  ans=ans+B[x]
for i in range(len(A)-1):
  if (A[i+1]-A[i])==1:
    ans=ans+C[A[i]-1]
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
H=list(map(int,input().split()))

ans = 0
i = 0
cnt = 0
for i in range(N-1):
    if H[i] >= H[i+1]:
       cnt += 1
    else:
        ans = max(ans, cnt)
        cnt = 0
ans = max(ans, cnt)
print(ans)


Fixed submission:
S=input()
T=input()
ans=0
for i in range(3):
    if S[i]==T[i]:
      ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
ans=0
for i in range(3):
if S[i]==T[i]:
  ans+=1
print(ans)

Fixed submission:
S=input()
T=input()
ans=0
for i in range(3):
    if S[i]==T[i]:
      ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
ans=0
for i in range(3)
if S[i]==T[i]:
  ans+=1
print(ans)

Fixed submission:
S=input()
T=input()
ans=0
for i in range(3):
    if S[i]==T[i]:
      ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
ans=0
for x in range(3)
if S[i]==T[i]:
  ans+=1
print(ans)

Fixed submission:
S=input()
T=input()
ans=0
for i in range(3):
    if S[i]==T[i]:
      ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
H=list(map(int,input().split()))
 
ans = 0
i = 0
cnt = 0
for i in range(N):
    if H[i] >= H[i+1]:
       cnt += 1
    else:
        ans = max(ans, cnt)
        cnt = 0
ans = max(ans, cnt)
print(ans)

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

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

ans = 0
i = 0
cnt = 0
for i in range(N-1):
    if H[i] >= H[i+1]:
       cnt += 1
    else:
        ans = max(ans, cnt)
        cnt = 0
ans = max(ans, cnt)
print(ans)


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

Fixed submission:
A,B=map(int,input().split())
print(max(A+B,A-B,A*B))

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
print(max(A+B,A-B,A*B))

Fixed submission:
A,B=map(int,input().split())
print(max(A+B,A-B,A*B))

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
print(max(A+B,A-B,A*B))

Fixed submission:
A,B=map(int,input().split())
print(max(A+B,A-B,A*B))

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
if (A+B)>(A-B) and (A+B)>(A*B):
  print(A+B)
elif (A-B)>(A+B) and (A-B)>(A*B):
  print(A-B)
else (A*B)>(A+B) and (A*B)>(A-B):
  print(A*B)

Fixed submission:
A,B=map(int,input().split())
print(max(A+B,A-B,A*B))

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
if (A+B)>=(A-B) and (A+B)>=(A*B):
  print(A+B)
elif (A-B)>=(A+B) and (A-B)>=(A*B):
  print(A-B)
else (A*B)>=(A+B) and (A*B)>=(A-B):
  print(A*B)

Fixed submission:
A,B=map(int,input().split())
print(max(A+B,A-B,A*B))

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
if A+B>=A-B and A+B>=A*B:
  print(A+B)
elif A-B>=A+B and A-B>=A*B:
  print(A-B)
else A*B>=A+B and A*B>=A-B:
  print(A*B)

Fixed submission:
A,B=map(int,input().split())
print(max(A+B,A-B,A*B))
Buggy python submission (verdict: Runtime Error):
A = int(input()) # num of 500 coins
B = int(input()) # num of 100 coins
C = int(input()) # num of  50 coins
X = int(input()) # amount of payment

ans = 0

Bmax = B * 100
Cmax = C * 50

for a in range(A+1):
    rest = X - 500 * a
    if rest < 0:
        break
    if rest > Bmax + Cmax:
        continue
    if rest = 0:
        ans += 1
        continue
    else: # 0 < rest <= Bmax + Cmax
        for b in range(B+1):
            rest = rest - 100 * b
            if rest < 0:
                break
            if rest > Cmax:
                continue
            else:
                ans += 1

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-

a = int(input()) # 500
b = int(input()) # 100
c = int(input()) # 50
x = int(input())

ans = 0

for i in range(a + 1):
    for j in range(b + 1):
        for k in range(c + 1):
            if 500 * i + 100 * j + 50 * k == x:
                ans += 1

print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()

words = {'dream', 'dreamer', 'erase', 'eraser'}

def is_prefix_daydream(s, prefix):
    if s == prefix:
        return True
    elif s.startswith(prefix):
        return is_daydream(s[len(prefix):])
    else:
        return False

def is_daydream(s):
    if s == '':
        return True
    else:
        return any(is_prefix_daydream(s, w) for w in words)

if is_daydream(s):
    print('YES')
else:
    print('NO')


Fixed submission:
import sys

S = input()
S_ = S[::-1]

# words = 'dream dreamer erase eraser'.split()
# words_ = {w[::-1] for w in words}

index = 0
index_max = len(S)

while True:
    if index == index_max:
        print('YES')
        sys.exit()
    elif S_[index:].startswith('maerd'):
        index += 5
        continue
    elif S_[index:].startswith('remaerd'):
        index += 7
        continue
    elif S_[index:].startswith('esare'):
        index += 5
        continue
    elif S_[index:].startswith('resare'):
        index += 6
        continue
    else:
        print('NO')
        sys.exit()

Buggy python submission (verdict: Runtime Error):
s = input()

words = {'dream', 'dreamer', 'erase', 'eraser'}

def is_prefix_daydream(s, prefix):
    if s == prefix:
        return True
    elif s.startswith(prefix):
        return is_daydream(s[len(prefix):])
    else:
        return False

def is_daydream(s):
    if s == '':
        return True
    else:
        return any(is_prefix_daydream(s, w) for w in words)

if is_daydream(s):
    print('YES')
else:
    print('NO')


Fixed submission:
import sys

S = input()
S_ = S[::-1]

# words = 'dream dreamer erase eraser'.split()
# words_ = {w[::-1] for w in words}

index = 0
index_max = len(S)

while True:
    if index == index_max:
        print('YES')
        sys.exit()
    elif S_[index:].startswith('maerd'):
        index += 5
        continue
    elif S_[index:].startswith('remaerd'):
        index += 7
        continue
    elif S_[index:].startswith('esare'):
        index += 5
        continue
    elif S_[index:].startswith('resare'):
        index += 6
        continue
    else:
        print('NO')
        sys.exit()
Buggy python submission (verdict: Runtime Error):
A=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K=int(input())

print(A[K]-1)

Fixed submission:
A=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K=int(input())

print(A[K-1])
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())

from decila import Decimal

if Decimal.sqrt(a)+Decimal.sqrt(b)<Decimal.sqrt(c):
    print('Yes')
else:
    print('No')


Fixed submission:
a,b,c=map(int,input().split())

if c-a-b>0 and 4*a*b<(c-b-a)*(c-a-b):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
if A==0:
    print(0)
elif A!=0 and N>(A+B):
    print(num_A*A+int(sur/(A+B)))
elif A!=0 and N<=(A+B) and N>=A:
    print(A)
elif A!=0 and N<=(A+B) and N<A:
    print(N)

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

num_A=int(N/(A+B))
sur=int(N-(A+B)*num_A)

if A==0:
    print(0)
elif A!=0 and N>(A+B) and sur>=A:
    print(num_A*A+A)
elif A!=0 and N>(A+B) and sur<A:
    print(num_A*A+sur)
elif A!=0 and N<=(A+B) and N>=A:
    print(A)
elif A!=0 and N<=(A+B) and N<A:
    print(N)
Buggy python submission (verdict: Runtime Error):
N=input()

if N%2==0:
    print(int(N/2))
else :
    print(int(N/2)+1)

Fixed submission:
N=int(input())

if N%2==0:
    print(int(N/2))
else :
    print(int(N/2)+1)
Buggy python submission (verdict: Runtime Error):
import math

A,B=map(int,input().split())

gcd=math.gcd(A,B)

ANS=A*B/gcd

print(int(ANS))

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

for i in range(max(A,B)):
    if A%(i+1)==0 and B%(i+1)==0:
        gcd=i+1

ANS=A*B/gcd

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

flag=0

if N%2==0:
    for i in range(int(N/2)):
        if S[i]!=S[i+3]:
            flag+=1

    if flag==0:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Fixed submission:
N=int(input())
S=input()
flag=0

if N%2==0:
    for i in  range(0,int(N/2)):
        if S[i]!=S[i+int(N/2)]:
            flag+=1

    if flag==0:
        print('Yes')
    else :
        print('No')
else :
    print('No')

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

if N%2==0:
    for i in  range(0,int(N/2)):
        if S[i]!=S[i+3]:
            flag+=1

    if flag==0:
        print('Yes')
    else :
        print('No')
else :
    print('No')

Fixed submission:
N=int(input())
S=input()
flag=0

if N%2==0:
    for i in  range(0,int(N/2)):
        if S[i]!=S[i+int(N/2)]:
            flag+=1

    if flag==0:
        print('Yes')
    else :
        print('No')
else :
    print('No')

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

if N%2==0:
    for i in  range(0,int(N/2)):
        if S[i]!=S[i+3]:
            flag+=1

        if flag==0:
            print('Yes')
        else :
            print('No')
else :
    print('No')

Fixed submission:
N=int(input())
S=input()
flag=0

if N%2==0:
    for i in  range(0,int(N/2)):
        if S[i]!=S[i+int(N/2)]:
            flag+=1

    if flag==0:
        print('Yes')
    else :
        print('No')
else :
    print('No')

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

for i in  range(0,int(N/2)):
    if S[i]!=S[i+3]:
        flag+=1

if flag==0:
    if N!=1:
        print('Yes')
    else :
        print('No')
else :
    print('No')

Fixed submission:
N=int(input())
S=input()
flag=0

if N%2==0:
    for i in  range(0,int(N/2)):
        if S[i]!=S[i+int(N/2)]:
            flag+=1

    if flag==0:
        print('Yes')
    else :
        print('No')
else :
    print('No')
Buggy python submission (verdict: Runtime Error):
I=int(input().split())
x=int(input().split())
y=int(input().split())

if (min(y,I[3])-max(x,I[2]))>0:
    print('No War')
    
else :
    print('War')

Fixed submission:
x=input().split()

for i in range(2):
    x[i]=int(x[i])

y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))

Buggy python submission (verdict: Runtime Error):
x=input().split()

y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))

Fixed submission:
x=input().split()

for i in range(2):
    x[i]=int(x[i])

y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))

Buggy python submission (verdict: Runtime Error):
import sys
 
argv=sys.argv
 
x=[0]*2
for i in range(2):
	x[i]=(int)(argv[i+1])
    
y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))

Fixed submission:
x=input().split()

for i in range(2):
    x[i]=int(x[i])

y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))

Buggy python submission (verdict: Runtime Error):
import sys
 
argv=sys.argv
 
x=[0]*2
for i in range(2):
	x[i]=(int)(argv[i+1])
    
y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))

Fixed submission:
x=input().split()

for i in range(2):
    x[i]=int(x[i])

y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))

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

argv=sys.argv

x=[0]*2
for i in range(2):
	x[i]=(int)(argv[i+1])
    
y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]

print(max(y))

Fixed submission:
x=input().split()

for i in range(2):
    x[i]=int(x[i])

y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))

Buggy python submission (verdict: Runtime Error):
argv=sys.argv

x=[0]*2
for i in range(10):
	x[i]=(int)(argv[i+1])
    
MAX=x[0]+x[1]
MIN=x[0]-x[1]
MUL=x[0]*x[1]

print(max(MAX,MIN,MUL))

Fixed submission:
x=input().split()

for i in range(2):
    x[i]=int(x[i])

y=[0]*3
y[0]=x[0]+x[1]
y[1]=x[0]-x[1]
y[2]=x[0]*x[1]
 
print(max(y))
Buggy python submission (verdict: Time Limit Exceeded):
x=input().split()

y=[0]*2

y[0]=int(x[0])
y[1]=int(x[1])

K=0

while 1:
    if y[0]+y[1]==2*K:
        print(K)
        
    K=+1
    
    if y[1]<=K:
        print('IMPOSSIBLE')
        break;

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

if (A-B)%2==0:
    print(int((A+B)/2))
else :
    print('IMPOSSIBLE')

Buggy python submission (verdict: Time Limit Exceeded):
x=input().split()

flag=0

for K in range(0,1000000000):
    a=(int(x[0])-K)*(int(x[0])-K)
    b=(int(x[1])-K)*(int(x[1])-K)
    
    if a==b:
        print(K)
        flag=+1

if flag==0:
    print('IMPOSSIBLE')

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

if (A-B)%2==0:
    print(int((A+B)/2))
else :
    print('IMPOSSIBLE')
Buggy python submission (verdict: Runtime Error):
N=int(input())
p=list(map(int,input().split()))

P=sorted(p)
print(p)
print(P)
flag=0

for i in range(0,5):
    if p[i]!=P[i]:
        flag+=1

if (flag==2)or(flag==0):
    print('YES')
else :
    print('NO')

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

P=sorted(p)
flag=0

for i in range(0,N):
    if p[i]!=P[i]:
        flag+=1

if flag==2:
    print('YES')
elif flag==0:
    print('YES')
else :
    print('NO')

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

P=sorted(p)

flag=0

for i in range(0,5):
    if p[i]!=P[i]:
        flag+=1

if flag==2:
    print('YES')
else :
    print('NO')

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

P=sorted(p)
flag=0

for i in range(0,N):
    if p[i]!=P[i]:
        flag+=1

if flag==2:
    print('YES')
elif flag==0:
    print('YES')
else :
    print('NO')
Buggy python submission (verdict: Runtime Error):
r=input()

print(3*int(r)*int(r)

Fixed submission:
r=input()

print(3*int(r)*int(r))
Buggy python submission (verdict: Runtime Error):
N,K=map(int,input().split())
S=list(input())

S[K+1]=S[K+1].lower()

print(S)

Fixed submission:
N,K=map(int,input().split())
S=list(input())
ANS=' '

S[K-1]=S[K-1].lower()

for i in S:
    ANS+=i

print(ANS)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=int(input())
B=int(input())

if N==1:
    print('Hello World')
else : 
    print(A+B)

Fixed submission:
N=int(input())

if N==1:
    print('Hello World')

elif N==2:
    A=int(input())
    B=int(input())
    print(A+B)
Buggy python submission (verdict: Runtime Error):
I=int(input().split())
x=int(input().split())
y=int(input().split())

if (min(y,I[3])-max(x,I[2]))>0:
    print('No War')
    
else :
    print('War')

Fixed submission:
N,M,X,Y=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))

x.append(X)
y.append(Y)

if (min(y)-max(x))>0:
    print('No War')
    
else :
    print('War')

Buggy python submission (verdict: Runtime Error):
N,M,X,Y=map(int,input().split())
x=int(input().split())
y=int(input().split())

if (min(y,Y)-max(x,X))>0:
    print('No War')
    
else :
    print('War')

Fixed submission:
N,M,X,Y=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))

x.append(X)
y.append(Y)

if (min(y)-max(x))>0:
    print('No War')
    
else :
    print('War')

Buggy python submission (verdict: Runtime Error):
N,M,X,Y=map(int,input().split())
x=int(input().split())
y=int(input().split())

if (min(y,Y)-max(x,X))>0:
    print('No War')
    
else :
    print('War')

Fixed submission:
N,M,X,Y=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))

x.append(X)
y.append(Y)

if (min(y)-max(x))>0:
    print('No War')
    
else :
    print('War')

Buggy python submission (verdict: Runtime Error):
N,M,X,Y=map(int,input().split())
x,y=map=(int,input().split())

if (min(y,Y)-max(x,X))>0:
    print('No War')
    
else :
    print('War')

Fixed submission:
N,M,X,Y=map(int,input().split())
x=list(map(int,input().split()))
y=list(map(int,input().split()))

x.append(X)
y.append(Y)

if (min(y)-max(x))>0:
    print('No War')
    
else :
    print('War')
Buggy python submission (verdict: Runtime Error):
if A*B%2==0:
    print('No')
else :
    print('Yes')

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


if (A*B)%2==0:
    print('No')
else :
    print('Yes')
Buggy python submission (verdict: Runtime Error):
A,B=map(int.input().split())

print(A*B-A-B+1)

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

print(A*B-A-B+1)
Buggy python submission (verdict: Runtime Error):
if N/K==1:
    print(0)
else:
    print(int(N/K)+1-int(N/K))

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

if N%K==0:
    print(0)
else:
    print(int(N/K)+1-int(N/K))
Buggy python submission (verdict: Runtime Error):
S=input().split()

plus=0

for i in S:
    if S[i]=="+":
        plus+=1
    else :
        plus-=1

print(plus)

Fixed submission:
s=input()

print (s.count("+") - s.count("-"))
Buggy python submission (verdict: Runtime Error):
A,B,C,D=map(int,input().split())

print(min(A,B)+min(C,D))

Fixed submission:
A=int(input())
B=int(input())
C=int(input())
D=int(input())

print(min(A,B)+min(C,D))
Buggy python submission (verdict: Runtime Error):
S=str(input())

S[3]=8

print(S)

Fixed submission:
S=str(input())

S_changed=S[:3]+'8'+S[4:]

print(S_changed)
Buggy python submission (verdict: Runtime Error):
N=input()

if N[0]==N[1] and N[1]==N[2]:
    print('Yes')
elif N[1]==N[2] and N[2]==N[3]:
    print('Yes')
elif N[2]==N[3] and N[3]==N[0]:
    print('Yes')
elif N[0]==N[2] and N[31]==N[3]:
    print('Yes')
else :
    print('No')

Fixed submission:
N=input()

if N[0]==N[1] and N[1]==N[2]:
    print('Yes')
elif N[1]==N[2] and N[2]==N[3]:
    print('Yes')
else :
    print('No')
Buggy python submission (verdict: Runtime Error):
N=list(input())

flag=0

for i in N:
    if N[i]==9:
        flag+=1
    
if flag==0:
    print('No')
else :
    print('Yes')

Fixed submission:
N=list(input())
flag=0

for i in range(0,2):
    if int(N[i])==9:
        flag+=1
    
if flag==0:
    print('No')
else :
    print('Yes')
Buggy python submission (verdict: Runtime Error):
A,B,C=input().split()

if A[2]==B[0] and B[2]==C[0]:
    print('YES')
else :
    print('NO')

Fixed submission:
A,B,C=input().split()

if A[-1]==B[0] and B[-1]==C[0]:
    print('YES')
else :
    print('NO')

Buggy python submission (verdict: Runtime Error):
A,B,C=input().split()

if A[2]==B[0] and B[2]==C[0]:
    print('YES')
else :
    print('NO')

Fixed submission:
A,B,C=input().split()

if A[-1]==B[0] and B[-1]==C[0]:
    print('YES')
else :
    print('NO')
Buggy python submission (verdict: Runtime Error):
n = int(input())
if n==1:
  	print("Hello World")
else:
  	a,b = map(int,input().split())
    print(int(a+b))


Fixed submission:
n = int(input())
if n==1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(int(a+b))

Buggy python submission (verdict: Runtime Error):
n = int(input())
if n==1:
  print("Hello World")
else:
  a,b = map(int,input().split())
  print(int(a+b))

Fixed submission:
n = int(input())
if n==1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(int(a+b))
Buggy python submission (verdict: Runtime Error):
s = input()
ans = "AC"
if s[0] != 'A':
    ans = "WA"
cnt = 0
for i in s[2:-1]:
    if i.isupper() and i!='C':
        ans ="WA"
    elif i=='C':
        cnt +=1

if cnt!=1:
    flag=False
print("AC"if flag else "WA")


Fixed submission:
s = input()
ans = "AC"
if s[0] != 'A':
    ans = "WA"
cnt = 0
for i in range(1,len(s)):
    if s[i].isupper():
        if i == 1 or s[i]!= "C" or i==len(s)-1:
            ans = "WA"
        cnt+=1
if cnt!=1:
    ans="WA"
print(ans)
Buggy python submission (verdict: Runtime Error):
#include<bits/stdc++.h>
using namespace std;

string s;

int main(){
  cin >> s;
  int sn  = 0:
  int n
  for(int i=0;i<s.size();i++){
    sn += s[i]-'0';
    n = 10*n+(s[i]-'0');
  if(n%sn!=0)cout<<"No"<<endl;
  else cout <<"Yes"<<endl
  return 0

Fixed submission:
n = input()
sn=0
for i in n:
    sn += int(i)
n = int(n)
if n%sn==0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
d,n = map(int,input().split())

tmp = []
for i in range(1,100):
    tmp.append(i*100**d)
print(tmp[n-1])

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

tmp = []
for i in range(1,100):
    tmp.append(i*100**d)
tmp.append(101*100**d)
print(tmp[n-1])

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

tmp = []
for i in range(1,100):
    tmp.append(i*100**d)
print(tmp[n])

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

tmp = []
for i in range(1,100):
    tmp.append(i*100**d)
tmp.append(101*100**d)
print(tmp[n-1])