Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03393 (python)

Fixed submission:
s = str(input())
list_s = list(s)
alp_list = list("abcdefghijklmnopqrstuvwxyz")
dict_alp = {}
ans = 0
for i in range(26):
    dict_alp[alp_list[i]] = i+1
if len(list_s) == 26:
    i = 25
    while True:
        try:
            if dict_alp[list_s[i]] > dict_alp[list_s[i-1]]:
                list_s = list_s[:i]
                x = list_s.pop()
                break
            else:
                i -= 1
        except IndexError:
            ans = -1
            break
    if ans != -1:
        alp_set = []
        for alp in alp_list:
            if not alp in list_s:
                if dict_alp[alp] > dict_alp[x]:
                    alp_set.append(alp)
        alp_set.sort()
        list_s.append(alp_set[0])
else:
    for alp in alp_list:
        if not alp in list_s:
            list_s.append(alp)
            break
if ans == -1:
    print(ans)
else:
    print("".join(list_s))

Buggy submission (verdict: Runtime Error):
s = str(input())
list_s = list(s)
alp_list = list("abcdefghijklmnopqrstuvwxyz")
dict_alp = {}
ans = 0
for i in range(26):
    dict_alp[alp_list[i]] = i+1
if len(list_s) == 26:
    i = 25
    while True:
        try:
            if dict_alp[list_s[i]] > dict_alp[list_s[i-1]]:
                list_s = list_s[:i]
                x = list_s.pop()
                break
            else:
                i -= 1
        except IndexError:
            ans = -1
            break
    alp_set = []
    for alp in alp_list:
        if not alp in list_s:
            if dict_alp[alp] > dict_alp[x]:
                alp_set.append(alp)
    alp_set.sort()
    list_s.append(alp_set[0])
else:
    for alp in alp_list:
        if not alp in list_s:
            list_s.append(alp)
            break
if ans == -1:
    print(ans)
else:
    print("".join(list_s))
Problem p03523 (python)

Fixed submission:

s = str(input())
list_ans = []
list_ans.append("KIHBR")
list_ans.append("AKIHBR")
list_ans.append("KIHABR")
list_ans.append("KIHBAR")
list_ans.append("KIHBRA")
list_ans.append("AKIHABR")
list_ans.append("AKIHBAR")
list_ans.append("AKIHBRA")
list_ans.append("KIHABAR")
list_ans.append("KIHABRA")
list_ans.append("KIHBARA")
list_ans.append("AKIHABAR")
list_ans.append("AKIHABRA")
list_ans.append("AKIHBARA")
list_ans.append("KIHABARA")
list_ans.append("AKIHABARA")
if s in list_ans:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
s = str(s)
list_ans.append("KIHBR")
list_ans.append("AKIHBR")
list_ans.append("KIHABR")
list_ans.append("KIHBAR")
list_ans.append("KIHBRA")
list_ans.append("AKIHABR")
list_ans.append("AKIHBAR")
list_ans.append("AKIHBRA")
list_ans.append("KIHABAR")
list_ans.append("KIHABRA")
list_ans.append("KIHBARA")
list_ans.append("AKIHABAR")
list_ans.append("AKIHABRA")
list_ans.append("AKIHBARA")
list_ans.append("KIHABARA")
list_ans.append("AKIHABARA")
if s in list_ans:
    print("YES")
else:
    print("NO")
Problem p03611 (python)

Fixed submission:
n = int(input())
l = input().split()

for i in range(0,n):
	l[i] = int(l[i])

dict_i = {}
for i in range(-1,100001):
	dict_i[i] = 0
	
for j in range(n):
	dict_i[l[j]] += 1
	dict_i[l[j] + 1] += 1
	dict_i[l[j] - 1] += 1
print(max(dict_i.values()))

Buggy submission (verdict: Runtime Error):
a = input()
l = a.split()
n = int(l[0])
l.pop(0)

for i in range(n):
	l[i] = int(l[i])

counting = 0
list_i = []
for i in range(100000):
	counting = 0
	for j in range(n):
		if (l[j] == i or l[j] == i-1 or l[j] == i+1):
			counting += 1		
	list_i.append(counting)
			
print(max(list_i))

Buggy submission (verdict: Runtime Error):
a = input()
l = a.split()
n = int(l[0])
l.pop(0)

for i in range(n):
	l[i] = int(l[i])

counting = 0
list_i = []
for i in range(100000):
	counting = 0
	for j in range(n):
		if (l[j] == i or l[j] == i-1 or l[j] == i+1):
			counting += 1		
	list_i.append(counting)
			
print(max(list_i))
Problem p03943 (python)

Fixed submission:
a,b,c = map(int, input().split())
if max(a,b,c) == (a+b+c -max(a,b,c)):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c = map(int, input())
if max(a,b,c) == (a+b+c -max(a,b,c)):
  print("Yes")
else:
  print("No")
Problem p02664 (python)

Fixed submission:
t = input()

list_t = list(t)

n = len(list_t)

for i in range(n):
    if n == 1:
        list_t[i] = 'D'
        break
    if list_t[i] == '?':
        if i > 0 and i < n - 1:
            if list_t[i - 1] == 'P' and list_t[i + 1] == 'P':
                list_t[i] = 'D'
            if list_t[i - 1] == 'P' and list_t[i + 1] == 'D':
                list_t[i] = 'D'
            if list_t[i - 1] == 'P' and list_t[i + 1] == '?':
                list_t[i] = 'D'
            if list_t[i - 1] == 'D' and list_t[i + 1] == 'P':
                list_t[i] = 'D'
            if list_t[i - 1] == 'D' and list_t[i + 1] == 'D':
                list_t[i] = 'P'
            if list_t[i - 1] == 'D' and list_t[i + 1] == '?':
                list_t[i] = 'P'
        elif i > 0:
            if list_t[i - 1] == 'P':
                list_t[i] = 'D'
            if list_t[i - 1] == 'D':
                list_t[i] = 'D'
        elif i < n - 1:
            if list_t[i + 1] == 'P':
                list_t[i] = 'D'
            if list_t[i + 1] == 'D':
                list_t[i] = 'P'
            if list_t[i + 1] == '?':
                list_t[i] = 'D'


print(''.join(list_t))

Buggy submission (verdict: Runtime Error):
t = input()

list_t = list(t)

for i in range(len(list_t)):
    if list_t[i] == '?':
        if i > 0:
            if list_t[i - 1] == 'P':
                list_t[i] = 'D'
            else:
                list_t[i] = 'D'
        if i < len(list_t) + 1:
            if list_t[i + 1] == 'D':
                list_t[i] = 'P'

print(''.join(list_t))

Buggy submission (verdict: Runtime Error):
t = input()

list_t = list(t)

for i in range(len(list_t)):
    if list_t[i] == '?':
        if i > 0:
            if list_t[i - 1] == 'P':
                list_t[i] = 'D'
            else:
                list_t[i] = 'D'
        if i < len(list_t):
            if list_t[i + 1] == 'D':
                list_t[i] = 'P'

print(''.join(list_t))
Problem p02783 (python)

Fixed submission:
h, a = map(int, input().split(' '))
if h % a == 0:
    print(h // a)
else:
    print(h // a + 1)

Buggy submission (verdict: Runtime Error):
h a = map(int, input().split(' '))
if h % a == 0:
    print(h // a)
else:
    print(h // a + 1)
Problem p02795 (python)

Fixed submission:
import math

h = int(input())
w = int(input())
n = int(input())

l = max(h, w)
print(math.ceil(n / l))

Buggy submission (verdict: Runtime Error):
h = input()
w = input()
n = input()

l = max(h, w)
print(n // l)
Problem p02802 (python)

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

pena = [0 for i in range(n)]
acc = [0 for i in range(n)]

for i in range(m):
    pp, ss = input().split(' ')
    p = int(pp) - 1

    if acc[p] == 0:
        if ss == 'WA':
            pena[p] += 1
        else:
            acc[p] = 1

for i in range(n):
    pena[i] = pena[i] * acc[i]

print(sum(acc), sum(pena))

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

pena = [0 for i in range(n)]
acc = [0 for i in range(n)]

for i in range(m):
    pp, ss = input().split(' ')
    p = int(pp) - 1

    if acc[p] == 0:
        if ss == 'WA':
            pena[p] += 1
        else:
            acc[p] = 1

for i in range(m):
    pena[i] = pena[i] * acc[i]

print(sum(acc), sum(pena))
Problem p03005 (python)

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

if k != 1:
    print(n-k)
else:
    print('0')

Buggy submission (verdict: Runtime Error):
n, k = map(int, input())

if k != 1:
    print(n-k)
else:
    print('0')
Problem p03006 (python)

Fixed submission:
import collections

n = int(input())

x = []
y = []
for i in range(n):
    xx, yy = map(int, input().split())
    x.append(xx)
    y.append(yy)

vec = []
vec_set = []

for i in range(n):
    vec2 = []
    for j in range(n):
        vec2.append((x[i] - x[j], y[i] - y[j]))
        vec_set.append((x[i] - x[j], y[i] - y[j]))
    vec.append(vec2)

cc = collections.Counter(vec_set)

v_l = []
for key,value in cc.items():
    if key != (0,0):
        v_l.append(value)
if len(v_l) != 0:
    print(n - max(v_l))
else:
    print(1)

Buggy submission (verdict: Runtime Error):
import collections

n = int(input())

x = []
y = []
for i in range(n):
    xx, yy = map(int, input().split())
    x.append(xx)
    y.append(yy)

vec = []
vec_set = []

for i in range(n):
    vec2 = []
    for j in range(n):
        vec2.append((x[i] - x[j], y[i] - y[j]))
        vec_set.append((x[i] - x[j], y[i] - y[j]))
    vec.append(vec2)

cc = collections.Counter(vec_set)

v_l = []
for key,value in cc.items():
    if key != (0,0):
        v_l.append(value)
print(n - max(v_l))
Problem p03136 (python)

Fixed submission:
n = int(input())
polys = list(map(int, input().split(' ')))

if sum(polys) - max(polys) > max(polys):
        print('Yes')
else:
        print('No')

Buggy submission (verdict: Runtime Error):
n = int(input())
polys = []
for i in range(n):
        polys.append(int(input()))

if sum(polys) - max(polys) > max(polys):
        print('Yes')
else:
        print('No')
Problem p03238 (python)

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

Buggy submission (verdict: Runtime Error):
n=int(input())
if n==1:print("Hello word")
a=int(input())
b=int(input())
if n==2 :print(a+b)
Problem p03455 (python)

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

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 整数の入力
a, b = map(int,input().split())
c = (a*b)%2
if c = 0:
    print("Even")
else:
    print("Odd")
Problem p03493 (python)

Fixed submission:
numbers = list(input())
count = 0
for s in numbers:
    a = int(s)
    if a == 1:
        count +=1
print(count)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
 
cnt = 0
while True:
  check = sum([n % 2 for n in A])
  if check == 0:
    A = [n/2 for n in A]
    cnt += 1
  else:
    break
    
print(cnt)
Problem p02778 (python)

Fixed submission:
S = input()
L = len(S)
for i in range(L):
    print("x",end='')

Buggy submission (verdict: Runtime Error):
S = input()
L = len[S]
for i in rnage(L):
    print("x")

Buggy submission (verdict: Runtime Error):
S = int(input())
L = len[S]
for i in rnage(L):
    print(L)
Problem p02783 (python)

Fixed submission:
h, a = [int(i) for i in input().split()]
i = h//a + 1
if h%a == 0:
  i -= 1
print(i)

Buggy submission (verdict: Runtime Error):
print(a)
Problem p02910 (python)

Fixed submission:
S = input()
# L = len(S) % 2
youtube = 0

for i in range(len(S)):
  if i % 2 == 0: # 奇数
    if S[i] == "L":
      youtube += 1
  else:#偶数
    if S[i] == "R":
      youtube += 1
if youtube > 0:
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
S = input()
# L = len(S) % 2
for i in range()
  if i % 2 == 0:
    if S[i] == "R" or S[i] == "U" or S[L] == "D":
      print("Yes")
  else:
    print("No")
Problem p03085 (python)

Fixed submission:
b = input()
if b == "A":
    print("T")
elif b == "T":
    print("A")
elif b == "C":
    print("G")
elif b == "G":
    print("C")

Buggy submission (verdict: Runtime Error):
b = input()
if b == "A":
    print(T)
elif b == "T":
    print(A)
elif b == "C":
    print(G)
elif b == "G":
    print(C)

Buggy submission (verdict: Runtime Error):
b = input()
if b = "A":
    print("T")
elif b = "T":
    print("A")
elif b = "C":
    print("G")
elif b = "G":
    print("C")

Buggy submission (verdict: Runtime Error):
b = input()
if b = "A":
    print(T)
elif b = "T":
    print(A)
elif b = "C":
    print(G)
elif b = "G":
    print(C)
Problem p03260 (python)

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

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
l = a * b
l * i
e = l * i
for i in range(1,3):
  if e % 2 == 0:
    print("NO")
else:
  print("YES")
Problem p03369 (python)

Fixed submission:
s = input()
l = 700
if (s[0]) == "o":
    l += 100
if (s[1]) == "o":
    l += 100
if (s[2]) == "o":
    l += 100
print(l)

Buggy submission (verdict: Runtime Error):
s = input()
l = 700
if (s[0]) == o:
  l + 100
elif (s[1]) == o:
  l + 100
elif (s[2]) == o:
  l + 100
print(l)
Problem p03501 (python)

Fixed submission:
N, A, B= map(int,input().split())
L =N*A
if L <= B:
  print(L)
else:
  print(B)

Buggy submission (verdict: Runtime Error):
N, A, B= map(int,input().split())
L =N*A
if L > K:
  print(L)
else:
  print(B)

Buggy submission (verdict: Runtime Error):
N, A, B= map(int.input().split())
L =N*A
if L > K:
  print(L)
else:
  print(B)
Problem p03711 (python)

Fixed submission:
x , y = map(int,input().split())
A = [1,3,5,7,8,10,12]
B = [4,6,9,11]
C = [2]
if x in A and y in A:
  print("Yes")
elif  x in B and y in B:
  print("Yes")  
else:
  print("No")

Buggy submission (verdict: Runtime Error):
x , y = map(iint,input().split())
A = [1,3,5,7,8,10,12]
B = [4,6,9,11]
C = [2]
if x in A and y in A:
  print("Yes")
elif  x in B and y in B:
  print("Yes")
else:
  print("No")
Problem p03729 (python)

Fixed submission:
A, B, C = input().split()
if (A[-1]) == (B[0]) and (B[-1]) == (C[0]):
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
A, B, C = input().split()
# l = A[-1] 
# v = B[0]
# n = B[-1]
# s = C[0]
# if l == v and v == n and n == s:
if (A[-1]) == (B[0]) and (B[-1]) == (C[0])
    print("Yes")
else:
    print("No")
Problem p02675 (python)

Fixed submission:
n=input()
if n[-1] == "2" or n[-1] == "4" or n[-1] == "5" or n[-1] == "7" or n[-1] == "9":
    print("hon")
elif n[-1] == "0" or n[-1] == "1" or n[-1] == "6" or n[-1] == "8":
    print("pon")
elif n[-1] == "3":
    print("bon")

Buggy submission (verdict: Runtime Error):
import math
a, b, h, m =map(int,input().split())
angle_m = m*6
angle_h1 = h*30
angle_h2 = angle_h1 + m*0.5
angle = angle_h2 - angle_m
print((a**2-2*a*b*math.cos(math.radians(angle))+b**2)**0.5)
Problem p02706 (python)

Fixed submission:
n,m=map(int,input().split())
l=(map(int,input().split()))
c=sum(l)
if c <=n:
    print(n-c)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
a,b=map(int,input().split())
if a+b<=n:
    print(n-(a+b))
else:
    print(-1)

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

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

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

Fixed submission:
a=int(input())
print((a//500)*1000+((a%500)//5)*5)

Buggy submission (verdict: Runtime Error):
a=int(input())
assert(a>0)
if a > 500:
    print((a//500)*1000+((a%500)//5)*5)
else:
    print(a//5*5)
Problem p02741 (python)

Fixed submission:
list=[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]
n=int(input())
print(list[n-1])

Buggy submission (verdict: Runtime Error):
list=[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]
n = int(input()
print(list[n])
Problem p04043 (python)

Fixed submission:
abc =input()
five = abc.count("5")
seven = abc.count("7")
 
if five==2 and seven==1:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
print(''.join(sorted([ input() for i in range(a)])))

Buggy submission (verdict: Runtime Error):
n,l = map(int,input().split())
print("".join(sorted([ input() for i in range(n)])))

Buggy submission (verdict: Runtime Error):
n,l = map(int,input().split())
print("".join(sorted([ input() for i in range(a)])))

Buggy submission (verdict: Runtime Error):
a=input()
print(["No", "Yes"][a.count("5"==2 and a.count("7")==1)])

Buggy submission (verdict: Runtime Error):
a=input()
print(["Yes", "No"][a.count("5"==2 and a.count("7")==1)])
Problem p02675 (python)

Fixed submission:
a=input()
if a[-1]=='3': print('bon')
elif a[-1]=='0' or a[-1]=='1' or a[-1]=='6' or a[-1]=='8': print('pon')
else: print('hon')

Buggy submission (verdict: Runtime Error):
a=input()
if a[-1]==3: print('bon')
elif: a[-1]==0 or a[-1]==1 or a[-1]==6 or a[-1]==8: print('pon')
else: print('hon')

Buggy submission (verdict: Runtime Error):
a=input()
if a[-1]==3: print('bon')
elif a[-1]==0 or a[-1]==1 or a[-1]==6 or a[-1]==8: print('pon')
else print('hon')
Problem p03434 (python)

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

a.sort(reverse=True)

Alice = 0
Bob = 0

for i in range(N):
    if i % 2 == 0:
        Alice += a[i]
    else:
        Bob += a[i]

print("{}".format(Alice - Bob))

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

a.sort(reversed=True)

for i in range(N):
    Alice = 0
    Bob = 0
    if N % 2 == 0:
        Alice += list[i]
    else:
        Bob += list[i]

print("{}".format(Alice - Bob))
Problem p03470 (python)

Fixed submission:
N = int(input())
ld = [0] * N
for i in range(N):
    d = int(input())
    ld[i] = d

t = set(ld)

print(len(t))

Buggy submission (verdict: Runtime Error):
N = int(input())
ld = [0] * N
for i in range(N):
    d = int(input())
    ld[i] = d

bucket = [0] * N
for j in range(N):
    bucket[ld[j] - 1] += 1

tower = 0

for k in range(N):
    if bucket[k] > 0:
        tower += 1

print(tower)

Buggy submission (verdict: Runtime Error):
N = int(input())
ld = [0] * N
for i in range(N):
    d = int(input())
    ld[i] = d

upper = N + 2
bucket = [0] * upper
for j in range(N):
    bucket[ld[j]] += 1

tower = 0

for k in range(1, N+1):
    if bucket[k] > 0:
        tower += 1

print(tower)

Buggy submission (verdict: Runtime Error):
N = int(input())
ld = [0] * N
for i in range(N):
    d = int(input())
    ld[i] = d

bucket = [0] * (N + 5)
for j in range(N):
    bucket[ld[j]] += 1

tower = 0

for k in range(1, N+1):
    if bucket[k] > 0:
        tower += 1

print(tower)

Buggy submission (verdict: Runtime Error):
N = int(input())
ld = [0] * N
for i in range(N):
    d = int(input())
    ld[i] = d

bucket = [0] * N
for j in range(N):
    bucket[ld[j]] += 1

tower = 0

for k in range(N):
    if bucket[k] > 0:
        tower += 1

print(tower)

Buggy submission (verdict: Runtime Error):
N = int(input())
ld = []
for i in range(N):
    d = int(input())
    ld.append(d)

bucket = [0] * N
for i in range(N):
    bucket[ld[i]] += 1

tower = 0

for k in range(N):
    if bucket[k] > 0:
        tower += 1

print(tower)
Problem p02642 (python)

Fixed submission:
from collections import Counter
n = int(input())
a = list(map(int, input().split()))

c = Counter(a)
b = [k for k, v in c.items() if v == 1]
b.sort()
d = {b: i for i, b in enumerate(b)}

gg = [True] * len(b)
mx = 10 ** 6 + 1
for i in c.keys():
    for j in range(2 * i, mx, i):
        if j in d:
            gg[d[j]] = False

print(sum(gg))

Buggy submission (verdict: Runtime Error):
def main():
    n = int(input())
    a = list(map(int, input().split()))
    a.sort()
    ans = 0
    if a[0] != a[1]:
        ans += 1

    for i in range(1, n):
        flg = True
        if i != n - 1:
            if a[i] == a[i - 1] or a[i] == a[i + 1] or a[i] < a[i-1]*2:
                continue
        else:
            if a[i] == a[i - 1] or a[i] < a[i-1]*2:
                continue

        for j in range(i):
            if a[i] % a[j] == 0:
                flg = False
                break
            if a[j] * 2 > a[i]:
                break
        if flg:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    n = int(input())
    a = list(map(int, input().split()))
    a.sort()
    ans = 0
    if a[0] != a[1]:
        ans += 1

    for i in range(1, n):
        flg = True
        if i != n - 1:
            if a[i] == a[i - 1] or a[i] == a[i + 1]:
                continue
        else:
            if a[i] == a[i - 1]:
                continue

        for j in range(i):
            if a[i] % a[j] == 0:
                flg = False
                break
            if a[j] * 2 > a[i]:
                break
        if flg:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()
Problem p02621 (python)

Fixed submission:
num = int(input())

print(num + num ** 2 + num ** 3)

Buggy submission (verdict: Runtime Error):
num = int(input())
print(num + num * mum + num ** 3)
Problem p02657 (python)

Fixed submission:
#169 値A＊Bを整数として出力せよ。

#1 入力をプログラムで扱えるように受け取ること
a, b = map(int, input().split())
#print(a, b)

#2 受け取った入力値を使って、適切に処理{計算}すること
answer = a * b

#3 計算した結果を出力すること
print(answer)

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int (input())
print(A * B)
Problem p03308 (python)

Fixed submission:
num_len = int(input())
numbers = list(map(int, input().split()))
print(max(numbers) - min(numbers))

Buggy submission (verdict: Runtime Error):
num_len = int(input())
numbers = list(map(int, input().split()))
print(max(numbers) - min(numbers)
Problem p02681 (python)

Fixed submission:
S = input()
T = input()

s = len(S)

if S != T[:s]:
  print("No")

else:
  if (s + 1) == len(T):
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
S = input()
T = input()

s = len(S)

if S != T[:s]:
  print("No")

else:
  if (s + 1) = len(T):
    print("Yes")
  else:
    print("No")
Problem p02718 (python)

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

A.sort(reverse=True)

if A[M-1] < 1/(4*M)*sum(A):
    print("No")
else:
    print("Yes")

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

A.sort(reverse=True)

if A[M] < 1/(4*M)*sum(A):
    print("No")
else:
    print("Yes")
Problem p02811 (python)

Fixed submission:
#https://atcoder.jp/contests/abc150/tasks/abc150_a

K, X= map(int, input().split())

if 500*K<X:
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
#https://atcoder.jp/contests/abc150/tasks/abc150_a
K= [ ]
K= int(input())

X= [ ]
X= int(input())

if 500*K<X:
    print("No")
elif 500*K==X:
    print("Yes")
elif 500*K>X:
    print("Yes")

Buggy submission (verdict: Runtime Error):
#https://atcoder.jp/contests/abc150/tasks/abc150_a
K= [ ]
K= int(input())

X= [ ]
X= int(input())

if 500*K<X:
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
#https://atcoder.jp/contests/abc150/tasks/abc150_a
K= int(input())

X= int(input())

if 500*K<X:
    print("No")
else:
    print("Yes")
Problem p02812 (python)

Fixed submission:
#https://atcoder.jp/contests/abc150/tasks/abc150_b
N= int(input())
s= input()

A= []
A= list(s)

#print(A)

add = 0
for i in range(0, N-2):
    if A[i]== 'A' and A[i+1]=='B' and A[i+2]=='C':
        add = add + 1

print(add)

Buggy submission (verdict: Runtime Error):
#https://atcoder.jp/contests/abc150/tasks/abc150_b
N= int(input())

A= []
s= input()
A= list(s)

#print(A)

add = 0
for i in range(0, N-1):
    if A[i]== 'A' and A[i+1]=='B' and A[i+2]=='C':
        add = add + 1

print(add)

Buggy submission (verdict: Runtime Error):
#https://atcoder.jp/contests/abc150/tasks/abc150_b
N= int(input())

A= []
s= input()
A= list(s)


print(A)

add = 0
for i in range(0, N-1):
    if A[i]== 'A' and A[i+1]=='B' and A[i+2]=='C':
        add = add + 1

print(add)
Problem p02765 (python)

Fixed submission:
n,r=map(int,input().split())
if n<10:
  r=r+100*(10-n)
print(r)

Buggy submission (verdict: Runtime Error):
n,r=map(input().split())
if n<10:
  r=r+100*(10-n)
print(r)