Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
def main15():
    strbuf1 = input('');
    strbuf2 = input('');
    strbufs1 = strbuf1.split();
    strbufs2 = strbuf2.split();
    buf1 = [];
    buf2 = [];
    ba = 0;
    for i in range(2):
        buf1.append(int(strbufs1[i]));
    for i in range(buf1[0]):
        buf2.append(int(strbufs2[i]));
        if(buf2[i] == 1):
            ba = i;
            break;
    are = buf1[1] - 1;
    kai1 = math.ceil(ba/are);
    kk = ba - are * kai1;
    kai2 = math.ceil((buf1[0] -(ba+1+kk))/are)
    print(int(kai1+kai2));

def main16():
    strbuf = input('');
    num = int(strbuf);
    kazu = 0;
    number = 1;
    while(kazu<num):


        kazu = kazu + 1;

        number = number + 1;


if __name__ == '__main__':
    main15()

Fixed submission:
import math
def main15():
    strbuf1 = input('');
    strbuf2 = input('');
    strbufs1 = strbuf1.split();
    strbufs2 = strbuf2.split();
    buf1 = [];
    buf2 = [];
    ba = 0;
    for i in range(2):
        buf1.append(int(strbufs1[i]));
    for i in range(buf1[0]):
        buf2.append(int(strbufs2[i]));
        if(buf2[i] == 1):
            ba = i;
            break;
    are = buf1[1] - 1;
    kai1 = math.ceil(ba/are);
    kk = are * kai1 - ba;
    kai2 = math.ceil((buf1[0] -(ba+1+kk))/are)
    print(int(kai1+kai2));

def main16():
    strbuf = input('');
    num = int(strbuf);
    kazu = 0;
    number = 1;
    while(kazu<num):


        kazu = kazu + 1;

        number = number + 1;


if __name__ == '__main__':
    main15()

Buggy python submission (verdict: Runtime Error):
import math
def main15():
    strbuf1 = input('');
    strbuf2 = input('');
    strbufs1 = strbuf1.split();
    strbufs2 = strbuf2.split();
    buf1 = [];
    buf2 = [];
    ba = 0;
    for i in range(2):
        buf1.append(int(strbufs1[i]));
    for i in range(buf1[0]):
        buf2.append(int(strbufs2[i]));
        if(buf2[i] == 1):
            ba = i;
            break;
    are = buf1[1] - 1;
    kai1 = ceil(ba/are);
    kk = ba - are * kai1;
    kai2 = ceil((buf1[0] -(ba+1+kk))/are)
    print(int(kai1+kai2));

def main16():
    strbuf = input('');
    num = int(strbuf);
    kazu = 0;
    number = 1;
    while(kazu<num):


        kazu = kazu + 1;

        number = number + 1;


if __name__ == '__main__':
    main15()

Fixed submission:
import math
def main15():
    strbuf1 = input('');
    strbuf2 = input('');
    strbufs1 = strbuf1.split();
    strbufs2 = strbuf2.split();
    buf1 = [];
    buf2 = [];
    ba = 0;
    for i in range(2):
        buf1.append(int(strbufs1[i]));
    for i in range(buf1[0]):
        buf2.append(int(strbufs2[i]));
        if(buf2[i] == 1):
            ba = i;
            break;
    are = buf1[1] - 1;
    kai1 = math.ceil(ba/are);
    kk = are * kai1 - ba;
    kai2 = math.ceil((buf1[0] -(ba+1+kk))/are)
    print(int(kai1+kai2));

def main16():
    strbuf = input('');
    num = int(strbuf);
    kazu = 0;
    number = 1;
    while(kazu<num):


        kazu = kazu + 1;

        number = number + 1;


if __name__ == '__main__':
    main15()
Buggy python submission (verdict: Runtime Error):
def main2():
    strbuf = input("");
    strbufs = strbuf.split();
    buf = [];
    for i in range(2):
        buf.append(int(strbufs[i]));
    sa = strbufs[1] - strbufs[0];
    takasa = sa * (sa + 1) / 2;
    result = takasa - strbufs[1];
    print(result);


if __name__ == '__main__':
    main2()

Fixed submission:
def main2():
    strbuf = input("");
    strbufs = strbuf.split();
    buf = [];
    for i in range(2):
        buf.append(int(strbufs[i]));
    sa = buf[1] - buf[0];
    takasa = sa * (sa + 1) / 2;
    result = takasa - buf[1];
    print(int(result));


if __name__ == '__main__':
    main2()
Buggy python submission (verdict: Runtime Error):
def main11():
    str = input("");
    flag = True;
    for i in range((len(str)-1)):
        for j in range(i+1,len(str)):
            if(str[i]==str[j]):
                flag = False;
    if flag:
        print(yes);
    else:
        print(no);



if __name__ == '__main__':
    main11()

Fixed submission:
def main11():
    str = input("");
    flag = True;
    for i in range((len(str)-1)):
        for j in range(i+1,len(str)):
            if(str[i]==str[j]):
                flag = False;
    if flag:
        print("yes");
    else:
        print("no");



if __name__ == '__main__':
    main11()
Buggy python submission (verdict: Runtime Error):
def main10():
    buf = int(input(""));
    strbuf = input("");
    strbufs = strbuf.split();
    buf2 = [];
    for i in range(buf):
        buf2.append(int(strbufs[i]));
    if len(buf2) == 1:
        return("YES");
    else:
        ki = 0;
        for i in range(buf):
            if buf2 % 2 == 1:
                ki += 1;
        if ki % 2 == 0:
            print("YES");
        else:
            print("NO");



if __name__ == '__main__':
    main10()

Fixed submission:
def main10():
    buf = int(input(""));
    strbuf = input("");
    strbufs = strbuf.split();
    buf2 = [];
    for i in range(buf):
        buf2.append(int(strbufs[i]));
    if len(buf2) == 1:
        return("YES");
    else:
        ki = 0;
        for i in range(buf):
            if buf2[i] % 2 == 1:
                ki += 1;
        if ki % 2 == 0:
            print("YES");
        else:
            print("NO");



if __name__ == '__main__':
    main10()
Buggy python submission (verdict: Runtime Error):
def main10():
    buf = int(input(""));
    strbuf = input("");
    strbufs = strbuf.split();
    buf2 = [];
    for i in range(buf):
        buf2.append(int(strbufs[i]));
    if len(buf2) == 1:
        return("YES");
    else:
        ki = 0;
        for i in range(buf):
            if buf2[i] % 2 == 1:
                ki += 1;
        if ki % 2 == 0:
            print("YES");
        else:
            print("NO");



if __name__ == '__main__':
    main10()

Fixed submission:
def main24():
    strbuf = input("");
    strbufs = strbuf.split();
    buf = [];
    for i in range(3):
        buf.append(int(strbufs[i]));
    if (buf[0]%2==1)and(buf[1]%2==1)and(buf[2]%2==1):
        buf.sort();
        are = buf[0] * buf[1];
        print(are);
    else:
        print(0);

if __name__ == '__main__':
    main24()
Buggy python submission (verdict: Runtime Error):
import re

input()
print(len(re.findall('ABC', input()))


Fixed submission:
import re

input()
print(len(re.findall('ABC', input())))

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

input()
print(len(re.findall(input(), 'ABC'))

Fixed submission:
import re

input()
print(len(re.findall('ABC', input())))
Buggy python submission (verdict: Runtime Error):
a, b, k = list(map(int, input().split()))
if k > a:
  m = k - a
  if m < 0:
    b = 0
  else:
	b -= m
  a = 0
else:
  a = a - k
print(a, b)


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

n = min(a,k)
a -= n
k -= n
print(a, max(b - k, 0))
Buggy python submission (verdict: Runtime Error):
n, a, b = map(input().split())
print(min(n*a, b))

Fixed submission:
n, a, b = map(int, input().split())
print(min(n*a, b))
Buggy python submission (verdict: Runtime Error):
import numpy as np
import itertools
n,m,d = map(int, input().split())

n = [x for x in range(1, n+1)]
x = np.array(list(itertools.product(n, repeat=m)))
print(np.sum((x[:,1:] - x[:,:-1]) == d) / x.shape[0])


Fixed submission:
a, b = map(int, input().split())
print('+' if a + b ==15 else '*' if a * b == 15 else 'x')

Buggy python submission (verdict: Runtime Error):
import numpy as np
import itertools
n,m,d = map(int, input().split())

n = np.arange(1, n+1)
x = np.array(list(itertools.product(n, repeat=m)))
print(np.sum((x[:,1:] - x[:,:-1]) == d) / x.shape[0])


Fixed submission:
a, b = map(int, input().split())
print('+' if a + b ==15 else '*' if a * b == 15 else 'x')
Buggy python submission (verdict: Runtime Error):
import math
input()
x = list(map(int, input().split()))
print(math.max(x) - math.min(x))

Fixed submission:
input()
x = list(map(int, input().split()))
print(max(x) - min(x))
Buggy python submission (verdict: Runtime Error):
import math
import numpy as np

x = int(input())
x_sqrt = math.sqrt(x)
maxlist = []

def hoge(x, x_sqrt):
    for b in range(2, x_sqrt+1):
        i = 1
        while b ** i <= x:
            i += 1
        maxlist.append(b **(i-1))
    return np.max(np.array(maxlist))

if x - x_sqrt == 0:
    print(x)
else:
    print(hoge(x, int(x_sqrt)))

Fixed submission:
import math


a,b,c,d = map(int, input().split(' '))
if math.fabs(a - c) <= d:
  print('Yes')
elif math.fabs(a-b) <= d and math.fabs(b-c) <= d:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
import itertools
import numpy as np


def check1(b: list):
    """
    FalseならOK
    Args:
        b:

    Returns:

    """
    for idx, num in enumerate(b[:-1]):
        return num in b[idx + 1:]


def check2(b: list):
    """
    FalseならOK
    Args:
        b:

    Returns:

    """
    return True in [is_prime(int(np.sum(np.array(i)))) for i in itertools.combinations(b, 5)]



def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2 or q & 1 == 0: return False
    return pow(2, q - 1, q) == 1


if __name__ == '__main__':

    num_list = []
    size = int(input())
    while len(num_list) != size:
        x = np.random.randint(1000)
        if is_prime(x):
            num_list.append(x)
            if len(num_list) >= 2:
                if not check1(num_list):
                    if len(num_list) >= 5:
                        if not check2(num_list):
                            continue
                        else:
                            del num_list[len(num_list) - 1]
                else:
                    del num_list[len(num_list) - 1]

    print(' '.join(map(str, num_list)))


Fixed submission:
import datetime
a, b = map(int, input().split(' '))
start = datetime.date(2018, 1, 1).toordinal()
end = datetime.date(2018, a, b).toordinal()

def checker(num):
    check_day = datetime.date(2018, num, num).toordinal()
    if start <= check_day <= end:
        return True
    else:
        return False

print(list(map(checker, [i for i in range (1, 13)])).count(True))
Buggy python submission (verdict: Runtime Error):
import numpy as np

x, y, z = map(int, input().split(' '))
row = np.array([x,y,z])

for times in range(int(input()):
    row[row.argmax()] = row.max() * 2
print(np.sum(row))

Fixed submission:
import numpy as np

x, y, z = map(int, input().split(' '))
row = np.array([x, y, z])

for times in range(int(input())):
    row[row.argmax()] = row.max() * 2
    
print(np.sum(row))
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
print(6-A-B)

Fixed submission:
A = int(input())
B = int(input())
print(6-A-B)
Buggy python submission (verdict: Runtime Error):
n, d = map(int,input().split())

d = d*2+1

for i in range(1,n):
    n -= d
    if n < 1:
        break

print(i)

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

d = d*2+1

for i in range(1,n+1):
    n -= d
    if n < 1:
        break

print(i)

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

for i in range(1,n):
    n -= (2*d+1)
    if n<= 0:
        break

print(i)

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

d = d*2+1

for i in range(1,n+1):
    n -= d
    if n < 1:
        break

print(i)
Buggy python submission (verdict: Runtime Error):
print('second' if all(a[i] % 2 == 0 for i in range(N)) else 'first')

Fixed submission:
N = int(raw_input())
a = []
for i in range(N):
   a.append(int(raw_input()))
print('second' if all(a[i] % 2 == 0 for i in range(N)) else 'first')
Buggy python submission (verdict: Runtime Error):
b = int(input())
if b == "A":
  print("T")
elif b == "C":
  print("G")
elif b == "G":
  print("C")
else:
  print("A")

Fixed submission:
b = input()
if b == "A":
  print("T")
elif b == "C":
  print("G")
elif b == "G":
  print("C")
else:
  print("A")
Buggy python submission (verdict: Runtime Error):
S = input()
agct = ['A','G','C','T']
count = 0
max_count = 0
for i in len(S):
  if S[i] in agct:
    count += 1
  else:
    max_count = max(count,max_count)
print(max_count)

Fixed submission:
L = ["A","T","C","G"]
S = input()
S += "B"
count = 0
maxcount = 0
for i in S:
  if i in L:
    count += 1
  else:
    maxcount = max(count,maxcount)
    count = 0
print(maxcount)
Buggy python submission (verdict: Runtime Error):
H, W = map(int, input.split())
h, w = map(int, input.split())
print((H-h)*(W-w))

Fixed submission:
H, W = map(int, input().split())
h, w = map(int, input().split())
print((H-h)*(W-w))
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
max = 8
if A <= max && B <= max:
  print("Yay!")
else:
  print(":(")
  
  

Fixed submission:
A, B = map(int, input().split())
max = 8
if A <= max and B <= max:
  print("Yay!")
else:
  print(":(")
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
count = 0
for i in range(a, b+1):
    s = str(i)
    if(s[0]==s[-1] and s[1]==s[-2]):
        count += 1
print(count)

Fixed submission:
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])

Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
count = 0
for i in range(A, B+1):
  s = str(i)
  if s[0] == s[-1] and s[1] == i[-2]:
    count += 1
print(count)

Fixed submission:
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])

Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
count = 0
for i in range(A, B+1):
  s = str(i)
  if s[0] == s[4] and s[1] == i[3]:
    count += 1
print(count)

Fixed submission:
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])

Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
count = 0
for i in range(A, B+1):
  i = str(i)
  if i[0] == i[4] and i[1] == i[3]:
    count += 1
print(count)

Fixed submission:
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])

Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
count = 0
for i in range(A, B+1):
  i = str(i)
  if i == i[::-1]:
    count += 1
print(count)

Fixed submission:
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])

Buggy python submission (verdict: Runtime Error):
a,b,c = map(str, input().split())
d,e,f = map(str, input().split())
g,h,q = map(str, input().split())

print(a+e+q)

Fixed submission:
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
X = int(input())
 
counter = 0
for a in range(A+1):
    for b in range(B+1):
        for c in range(C+1):
            if(500*a + 100*b + 50*c == X):
                counter += 1
print(counter)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())

print((X-A) % B)

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
X = int(input())
 
count = 0
for a in range(A+1):
	for b in range(B+1):
        for c in range(C+1):
            if(500*a + 100*b + 50*c == X):
                count += 1
print(count)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())

print((X-A) % B)

Buggy python submission (verdict: Runtime Error):
A = int(input()) #¥500
B = int(input()) #¥100
C = int(input()) #¥50
X = int(input())
count = 0
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if a*500 + b*100 + c*50 == X:
        count += 1
print(count)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())

print((X-A) % B)

Buggy python submission (verdict: Runtime Error):
A = int(input()) #¥500
B = int(input()) #¥100
C = int(input()) #¥50
X = int(input())

count = 0
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if X == (a*500 + b*100 + c*50):
        count += 1
print(count)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())

print((X-A) % B)

Buggy python submission (verdict: Runtime Error):
A = int(input()) #¥500
B = int(input()) #¥100
C = int(input()) #¥50
X = int(input())
count = 0
for a in range(A+1):
  for b in range(B+1):
    for c in range(C+1):
      if (X == a*500 + b*100 + c*50):
        count += 1
print(count)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())

print((X-A) % B)
Buggy python submission (verdict: Runtime Error):
a,b = int(input().split(" "))
c=a*b
if c % 2 == 0:
  print("Even")
else:
  print("Odd")

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

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

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

Buggy python submission (verdict: Runtime Error):
a,b = int(input().split())
c=a*b
if c % 2 == 0:
  print("Even")
else:
  print("Odd")

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

Buggy python submission (verdict: Runtime Error):
a,b = int(input().split())
c=a*b
if c % 2 == 0:
  print("Odd")
else:
  print("Even")
 

Fixed submission:
a, b = map(int, input().split())
c = a * b
if c % 2 == 0:
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
alphabet = input()
alphabet = ord(alphabet)+1
print(chr(alphabet)

Fixed submission:
moji = input()
moji = ord(moji)+1
print(chr(moji))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
alphaList  =   ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
moji = ""
for str in s:
    index = alphaList.index(str)
    addNum = 0
    if index == 24:
        addNum = 0
    elif index ==  25:
        addNum = 1
    else:
        addNum = index + n 
    moji = moji + alphaList[addNum]
print(moji)

Fixed submission:
n = int(input())
s = input()
alphaList  =   ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
moji = ""
for str in s:
    index = alphaList.index(str)
    addNum = index + n
    if addNum >25:
        addNum = addNum - 26 
    moji = moji + alphaList[addNum]
print(moji)

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
alphaList  =   ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
moji = ""
for str in s:
    index = alphaList.index(str)
    addNum = 0
    if index == 24:
        addNum = 0
    elif index ==  25:
        addNum = 1
    else:
        addNum = index + n 
        print(addNum)
    moji = moji + str.replace(str, alphaList[addNum])
print(moji)

Fixed submission:
n = int(input())
s = input()
alphaList  =   ["A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"]
moji = ""
for str in s:
    index = alphaList.index(str)
    addNum = index + n
    if addNum >25:
        addNum = addNum - 26 
    moji = moji + alphaList[addNum]
print(moji)
Buggy python submission (verdict: Time Limit Exceeded):
list = input().split(' ')
(A,B,K)=(int(list[0]),int(list[1]),int(list[2]))
for i in range(K):
    if A >= 1:
        A = A-1
    elif B >= 1:
        B = B-1
print(A,B)

Fixed submission:
list = input().split(' ')
(A,B,K)=(int(list[0]),int(list[1]),int(list[2]))
if A >= K:
    A = A - K
elif 1 <= A < K:
    B = B - K + A
    if B < 0:
        B = 0
    A = 0
else:
    A = 0
    B = B - K
    if B < 0:
        B = 0
print(A,B)
Buggy python submission (verdict: Runtime Error):
def calc(x):
    global mount
    global list
    count=0
    for y in range(1,x+1):
        if mount[x] >= mount[x-y]:
            count+=1
    if x == count:
        list.append(x)

N=int(input())

mount=input().split()

list=[]

for z in range(1,len(mount)):
    calc(z)

print(1+len(list))

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

sum=0
for i in range(2):
    if A >= B:
        sum+=A
        A-=1
    else:
        sum+=B
        B-=1
print(sum)
Buggy python submission (verdict: Runtime Error):
S = input()
2 N = len(S)
3 ans = 0
4 for i in range(N):
5 for j in range(i, N):
6 if all('ACGT'.count(c) == 1 for c in S[i : j + 1]):
7 ans = max(ans, j - i + 1)
8 print(ans)


Fixed submission:
def check(s,i):
   global count
   count+=1
   if i+1 < len(s):
       if s[i+1] == 'A' or s[i+1] == 'C' or s[i+1] =='G' or s[i+1] =='T':
           check(s,i+1) 

s=input()
count=0
list=[]
for i in range(len(s)):
    count=0
    if s[i] == 'A' or s[i] == 'C' or s[i] =='G' or s[i] =='T':
        check(s,i)
    list.append(count)

print(max(list))
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

c = input()
ans = ord(c)+1
print(chr(ans))

Fixed submission:
c = input()
ans = ord(c)+1
print(chr(ans))

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

c = input()
print(chr(ord(c)+1))

Fixed submission:
c = input()
ans = ord(c)+1
print(chr(ans))

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

c = input()
print(chr(ord(c)+1))

Fixed submission:
c = input()
ans = ord(c)+1
print(chr(ans))

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

c = input()
print(chr(ord(c)+1))

Fixed submission:
c = input()
ans = ord(c)+1
print(chr(ans))

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

c = input()
print(chr(ord(c)+1))

Fixed submission:
c = input()
ans = ord(c)+1
print(chr(ans))
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

a,b = ( int(x) for x in input().split() )

min_ = min([a,b])
max_ = max([a,b])

ret = a * b

for i in reversed(range(0,min_)):
  if max_ % i == 0 and min_ % i == 0:
    ret = min_ * max_ / i
    break

print(int(ret))

Fixed submission:
import sys
input = sys.stdin.readline

a,b = ( int(x) for x in input().split() )

min_ = min([a,b])

ret = a * b

for i in reversed(range(1,min_+1)):
  if a % i == 0 and b % i == 0:
    ret = int(a * b / i)
    break

print(ret)
Buggy python submission (verdict: Runtime Error):
a,b,c=input(),split()
if (int(b)-int(a))==(int(c)-int(b)):
	print("YES")
else:
	print("NO")

Fixed submission:

a,b,c=input().split()
if (int(b)-int(a))==(int(c)-int(b)):
	print("YES")
else:
	print("NO")

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()
if (int(b)-int(a)==(int(c)-int(b):
	print("YES")
else:
	print("NO")

Fixed submission:

a,b,c=input().split()
if (int(b)-int(a))==(int(c)-int(b)):
	print("YES")
else:
	print("NO")

Buggy python submission (verdict: Runtime Error):
a,b,c=split(input())
if (int(b)-int(a)==(int(c)-int(b):
	print("YES")
else:
	print("NO")

Fixed submission:

a,b,c=input().split()
if (int(b)-int(a))==(int(c)-int(b)):
	print("YES")
else:
	print("NO")
Buggy python submission (verdict: Runtime Error):
k = int(input()) # 500円玉の枚数
x = int(input()) # 総額

if (k*500 >= x):
    print('Yes')
else:
    print('No')



Fixed submission:
k, x = map(int, input().split()) # 500円玉の枚数

if (k*500 >= x):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
s = input()

if s = "Sunny":
  print("Cloudy")
elif s = "Cloudy":
  print("Rainy")
else:
  print("Sunny")
  

Fixed submission:
s = input()

if s == "Sunny":
  print("Cloudy")
elif s == "Cloudy":
  print("Rainy")
else:
  print("Sunny")
Buggy python submission (verdict: Time Limit Exceeded):
import sys
import numpy as np

# N:人数 K:初期ポイント Q:ラウンド内回数 A:正解者ID
N,K,Q = map(int, input().split())
A = []
for i in range(Q):
  A.append(int(input()))

if K > Q:
  for i in range(N):
    print("Yes")
  sys.exit()

score = np.full(N, K)
for rd in range(Q):
  score = score - 1
  score[A[rd]-1] = score[A[rd]-1] + 1
  
for ID in range(N):
  if score[ID] <= 0:
    print("No")
  else:
    print("Yes")


Fixed submission:
n,k,q = map(int, input().split())
A = []
for i in range(q):
  A.append(int(input()))

scores = [k-q] * n
for i in range(q):
  scores[A[i]-1] = scores[A[i]-1] + 1

for i in range(n):
  if scores[i] <= 0:
    print("No")
  else:
    print("Yes")