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

Fixed submission:
s = input()
a = 700
for i in s:
    if i == "o":
        a += 100
    if i == "x":
        continue
print(a)

Buggy submission (verdict: Runtime Error):
s = input()
a = 700
for i in s:
    if i == o:
        a += 100
    if i == x:
        continue
print(a)
Problem p03693 (python)

Fixed submission:
r, g, b = map(int, input().split())
a = 100 * r + 10 * g + b
if a % 4 == 0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
r, g, b = map(int, input().split())
a = 100 * r + 10 * g + b
if a % 4 = 0:
    print("YES")
else:
    print("NO")
Problem p03777 (python)

Fixed submission:
a, b = input().split()
if a == b:
    print("H")
else:
    print("D")

Buggy submission (verdict: Runtime Error):
a, b = input(),split()
if a == b:
    print("H")
else:
    print("D")
Problem p03282 (python)

Fixed submission:
s = input()
k = int(input()) - 1


for i in range(len(s)):
    if s[i] != "1" or i == k:
        break

print(s[i])

Buggy submission (verdict: Runtime Error):
s = input()
k = int(input())

print(s[1])
Problem p03379 (python)

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

y = sorted(x)
a = y[len(x)//2]
b = y[(len(x)//2) - 1]

for i in range(n):
    if x[i] <= b:
        print(a)
    else:
        print(b)

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

def naive(x):
    return [median(x[:i] + x[i+1:]) for i in range(len(x))]
  
for i in naive(x):
  print(i)
Problem p03427 (python)

Fixed submission:
n = input()

sum = int(n[0]) + (len(n)-1) * 9

if len(n) == 1:
    print(n)
else:
    print(sum if set(n[1:]) == {"9"} else sum - 1)

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

sum = int(n[0]) + (len(n)-1) * 9
print(sum if set(n[1:]) == {"9"} else sum - 1)
Problem p03457 (python)

Fixed submission:
n = int(input())
pos = [list(map(int, input().split())) for _ in range(n)]

def func(n, pos):
    c_t, c_x, c_y = 0, 0, 0

    for i in pos:
        d_t = i[0] - c_t
        z = abs(i[1] - c_x) + abs(i[2] - c_y)

        if z > d_t or (d_t - z) % 2 != 0:
            return "No"
        else:
            c_t, c_x, c_y = i[0], i[1], i[2]

    return "Yes"


print(func(n, pos))

Buggy submission (verdict: Runtime Error):
    n = int(input())
    pos = [list(map(int, input().split())) for _ in range(n)]
     
    def func(n, pos):
        c_t, c_x, c_y = 0, 0, 0
     
        for i in pos:
            d_t = i[0] - c_t
            z = abs(i[1] - c_x) + abs(i[2] - c_y)
     
            if z > d_t or (d_t - z) % 2 != 0:
                return "No"
            else:
                c_t, c_x, c_y = 0, 0, 0
     
        return "Yes"
     
     
    print(func(n, pos))
Problem p03611 (python)

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

def func(a):
  count = [0] * (max(a)+1)

  for i in a:
      count[i] += 1

  max_n = 0
  for j in range(1, len(count)-1):
      max_n = max(max_n, count[j] + count[j-1] + count[j+1])
  max_n = max(max_n, count[-1] + count[-2])

  return max_n

print(n if len(set(a)) == 1 else func(a))

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

def func(a):
  count = [0] * (max(a)+1)

  for i in a:
      count[i] += 1

  max_n = 0
  for j in range(1, len(count)-1):
      max_n = max(max_n, count[j] + count[j-1] + count[j+1])
  max_n = max(max_n, count[-1] + count[-2])
  
  return max_n

ptint(n if len(set(a)) == 1 else func(a))

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

count = [0] * (max(a)+1)

for i in a:
    count[i] += 1

max_n = 0
for j in range(1, len(count)-1):
    max_n = max(max_n, count[j] + count[j-1] + count[j+1])
max_n = max(max_n, count[-1] + count[-2])

print(max_n)

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

count = [0] * (max(a)+1)

for i in a:
    count[i] += 1

max_n = 0
for j in range(1, len(count)-1):
    max_n = max(max_n, count[j] + count[j-1] + count[j+1])
max_n = max(max_n, count[-1] + count[-2])

print(max_n)
Problem p03738 (python)

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

if a > b:
    print("GREATER")
elif a < b:
    print("LESS")
elif a == b:
    print("EQUAL")

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

if a > b:
    print("GREATER")
elif a < b:
    print("LESS")
elif a == b:
    print("EQUAL")

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

if a > b:
	print("GREATER")
elif a < b:
    print("LESS")
elif a == b:
    print("EQUAL")

Buggy submission (verdict: Runtime Error):
a, b = map(int(input().split())
           
if a > b:
	print("GREATER")
elif a < b: 
    print("LESS")
elif a == b:
    print("EQUAL")
Problem p04043 (python)

Fixed submission:
a, b, c, = map(int, input().split())
h = [5, 5, 7]
b = [a, b, c]

if sorted(h) == sorted(b):
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a, b, c, = map(int(input().split()))
h = [5, 5, 7]
b = [a, b, c]

if sorted(h) == sorted(b):
    print("YES")
else:
    print("NO")
Problem p03294 (python)

Fixed submission:
import sys
import fractions

dp = None
A = []

def lcm(a, b):
    return a * b // fractions.gcd(a, b)

def f(m):
    ans = 0
    for a in A:
        ans += m % a
    return ans

def main():
    global A

    N = int(input())
    A = [int(_) for _ in input().split()]

    lcmtemp = 1

    for a in A:
        lcmtemp = lcm(lcmtemp, a)

    print(f(lcmtemp-1))

main()

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

dp = None
A = []

def lcm(a, b):
    return a * b // fraction.gcd(a, b)

def f(m):
    ans = 0
    for a in A:
        ans += m % a
    return ans

def main():
    global A

    N = int(input())
    A = [int(_) for _ in input().split()]

    lcmtemp = 1

    for a in A:
        lcmtemp = lcm(lcmtemp, a)

    print(f(lcmtemp-1))

main()

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

dp = None
A = []

def lcm(a, b):
    return a * b // math.gcd(a, b)

def f(m):
    ans = 0
    for a in A:
        ans += m % a
    return ans

def main():
    global A

    N = int(input())
    A = [int(_) for _ in input().split()]

    lcmtemp = 1

    for a in A:
        lcmtemp = lcm(lcmtemp, a)

    print(f(lcmtemp-1))

main()

Buggy submission (verdict: Runtime Error):
import sys
import math
import collections
import itertools
import array
from functools import reduce
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None
A = []

def lcm(a, b):
    return a * b // math.gcd(a, b)

def f(m):
    ans = 0
    for a in A:
        ans += m % a
    return ans

def main():
    global A

    N = int(input())
    A = [int(_) for _ in input().split()]

    lcmtemp = 1

    for a in A:
        lcmtemp = lcm(lcmtemp, a)

    print(f(lcmtemp-1))

main()

Buggy submission (verdict: Runtime Error):
import sys
import math
import collections
import itertools
import array
from functools import reduce
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None
A = []

def lcm(a, b):
    return a * b // math.gcd(a, b)

def f(m):
    ans = 0
    for a in A:
        ans += m % a
    return ans

def main():
    global A

    N = int(input())
    A = [int(_) for _ in input().split()]

    lcmtemp = 1

    for a in A:
        lcmtemp = lcm(lcmtemp, a)

    print(f(lcmtemp-1))

main()
Problem p03339 (python)

Fixed submission:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None

def main():
    N = int(input())
    S = input()

    ans = S[1:].count("E")
    A = []
    A.append(ans)

    for i in range(1, N):
        if S[i - 1] == "W":
            ans += 1
        if S[i] == "E":
            ans -= 1
        A.append(ans)

    print(min(A))



main()

Buggy submission (verdict: Runtime Error):
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None
S = None

def main():
    global S

    N = int(input())
    S = input()

    if N == 2:
        if S == "WE":
            print(1)
        else:
            print(0)
        sys.exit()

    E, W = [], []
    e, w = 0, 0

    for s in S:
        if s == "E":
            e += 1
        else:
            w += 1
        E.append(e)
        W.append(w)

    ans = min(ans, E[-1] - E[0 + 1])
    for leader in range(1, N):
        if leader == N - 1:
            ans = min(ans, W[leader - 1])
        else:
            ans = min(ans, W[leader - 1] + E[-1] - E[leader + 1])

    print(ans)


main()

Buggy submission (verdict: Runtime Error):
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# --------------------------------------------

dp = None
S = None

def main():
    global S

    N = int(input())
    S = input()

    if N == 2:
        if S == "WE":
            print(1)
        else:
            print(0)
        sys.exit()

    E, W = [], []
    e, w = 0, 0

    for s in S:
        if s == "E":
            e += 1
        else:
            w += 1
        E.append(e)
        W.append(w)

    ans = min(ans, E[-1] - E[0 + 1])
    for leader in range(1, N):
        elif leader == N - 1:
            ans = min(ans, W[leader - 1])
        else:
            ans = min(ans, W[leader - 1] + E[-1] - E[leader + 1])

    print(ans)


main()
Problem p03469 (python)

Fixed submission:
S = input()
S = S[:3] + "8" + S[4:]
print(S)

Buggy submission (verdict: Runtime Error):
import math

def main():
    N, H = map(int, input().split())

    cuts = []
    throws = []
    for i in range(N):
        tmp = [int(j) for j in input().split()]
        cuts.append(tmp[0])
        throws.append(tmp[1])

    max_cut = max(cuts)
    t1 = 0

    throws.sort(reverse=True)

    for throw in throws:
        if throw < max_cut:
            break
        H -= throw
        t1 += 1

    t2 = math.ceil(H / max_cut)

    print(t1 + t2)




main()
Problem p03472 (python)

Fixed submission:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


# --------------------------------------------

dp = None


def main():
    N, H = li_input()
    S = [li_input() for _ in range(N)]

    ans = 0
    strong_throw = []

    maxcut = -1
    for s in S:
        if s[0] > maxcut:
            maxcut = s[0]

    for s in S:
        if s[1] > maxcut:
            strong_throw.append(s[1])

    strong_throw.sort(reverse=True)

    for st in strong_throw:
        H -= st
        ans += 1

        if H <= 0:
            break

    if H > 0:
        ans += math.ceil(H / maxcut)

    print(ans)


main()

Buggy submission (verdict: Runtime Error):
def main():
    N, H = map(int, input().split())

    cuts = []
    throws = []
    for i in range(N):
        tmp = [int(j) for j in input().split()]
        cuts.append(tmp[0])
        throws.append(tmp[1])

    max_cut = max(cuts)

    # 切るだけでおｋ
    if max_cut >= max(throws):
        n_cut = H // sum(max_cut)
        if H % max_cut != 0:
            n_cut += 1
        print(n_cut)

    else:
        throws_new = list(filter((lambda x: x > max_cut), throws))
        n_throw = len(throws_new)

        # 必要な切る回数を計算
        n_cut = (H - sum(throws_new)) // max_cut

        if (H - sum(throws_new)) % max_cut != 0:
            n_cut += 1

        print(n_throw + n_cut)


main()
Problem p03609 (python)

Fixed submission:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


# --------------------------------------------

dp = None


def main():
    X, t = li_input()

    print(max(X - t, 0))


main()

Buggy submission (verdict: Runtime Error):
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


# --------------------------------------------

dp = None


def main():
    X, t = li_input()

    print(max(X - t), 0)


main()
Problem p02830 (python)

Fixed submission:
n = int(input())
s = input().split(" ")
b = list(s[0])
c = list(s[1])
a = ""
for i in range(n):
    a = a + b[i] + c[i]
print(a)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = [input() for i in range(2)]
a = ""
for i in s:
    a = a + i
print(a)
Problem p02921 (python)

Fixed submission:
a=input()
b=input()
if a[0]==b[0]:
  A=1
else:
  A=0
if a[1]==b[1]:
  B=1
else:
  B=0
if a[2]==b[2]:
  C=1
else:
  C=0
print(A+B+C)

Buggy submission (verdict: Runtime Error):
a=list(map(input().split()))
b=list(map(input().split()))
if a[0]==b[0]:
  A=1
else:
  A=0
if a[1]==b[1]:
  B=1
else:
  B=0
if a[2]==b[2]:
  C=1
else:
  C=0
print(A+B+C)

Buggy submission (verdict: Runtime Error):
a,b,c=map(input().split())
d,e,f=map(input().split())
if a==d:
  A=1
else:
  A=0
if b==e:
  B=1
else:
  B=0
if c==f:
  C=1
else:
  C=0
print(A+B+C)
Problem p02957 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if abs(a-c)==abs(b-c):
  print(c)
else:
  print('IMPOSSIBLE')

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().aplit())
if abs(a-c)==abs(b-c):
  print(c)
else:
  print('IMPOSSIBLE')
Problem p03101 (python)

Fixed submission:
a,b=map(int,input().split())
c,d=map(int,input().split())
print((a-c)*(b-d))

Buggy submission (verdict: Runtime Error):
a,b=map((int,input()).split())
c,d=map((int,input()).split())
print(a*b-c*b-d*a)
Problem p03206 (python)

Fixed submission:
a=int(input())
if a==25:
  print('Christmas')
elif a==24:
  print('Christmas Eve')
elif a==23:
  print('Christmas Eve Eve')
elif a==22:
  print('Christmas Eve Eve Eve')

Buggy submission (verdict: Runtime Error):
a=int(input())
if a=25:
  print('Christmas')
elif a=24:
  print('Christmas Eve')
elif a=23:
  print('Christmas Eve Eve')
elif a=22:
  print('Christmas Eve Eve Eve')

Buggy submission (verdict: Runtime Error):
a=int(input())
if a=25:
  print('Christmas')
elif a=24:
  print('Christmas Eve')
elif a=23:
  print('Christmas Eve Eve')
elif a=22:
  print('Christmas Eve Eve Eve')
Problem p03210 (python)

Fixed submission:
a=int(input())
if a==3 or a==5 or a==7:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
a=int(input())
if a==3 or a==5 or a==7:
  print(YES)
else:
  print(NO)
Problem p03543 (python)

Fixed submission:
n=input()
if n[0]==n[1]==n[2] or n[1]==n[2]==n[3]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n=int(input())
if n[0]==n[1]==n[2] or n[1]==n[2]==n[3]:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n=int(input())
if n[0]=n[1]=n[2] or n[1]=n[2]=n[3]:
  print('Yes')
else:
  print('No')
Problem p03563 (python)

Fixed submission:
a=int(input())
b=int(input())
print(2*b-a)

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
print(2*b-a)
Problem p03623 (python)

Fixed submission:
x,a,b=map(int,input().split())
if abs(x-a)>=abs(x-b):
  print('B')
else:
  print('A')

Buggy submission (verdict: Runtime Error):
x,a,b=map(int,input().split())
if abs(x-a)>=abs(x-b)
  print('B')
else:
  print('A')

Buggy submission (verdict: Runtime Error):
x,a,b=map(int,input().split())
if |x-a|>=|x-b|:
  print('B')
else:
  print('A')
Problem p03777 (python)

Fixed submission:
a,b=map(str,input().split())
if a=='H':
  print(b)
elif b=='H':
  print('D')
else:
  print('H')

Buggy submission (verdict: Runtime Error):
a,b=map(input().split())
if a=='H':
  print(b)
elif b=='H':
  print('D')
else:
  print('H')
Problem p03795 (python)

Fixed submission:
a=int(input())
print(800*a-200*(a//15))

Buggy submission (verdict: Runtime Error):
a=input()
print(800*a-200*(a//15))
Problem p03813 (python)

Fixed submission:
a=int(input())
if a<1200:
  print('ABC')
else:
  print('ARC')

Buggy submission (verdict: Runtime Error):
a=int,input()
if a<1200:
  print('ABC')
else:
  print('ARC')
Problem p02887 (python)

Fixed submission:
N=int(input())
S=str(input())
cnt=1

for i in range(len(S)-1):
  if S[i]==S[i+1]:
    continue
  else:
    cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
N=int(input())
S=str(input())
cnt=1

for i in range(N):
  if S[i]==S[i+1]:
    continue
  else:
    cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
N=int(input())
S=str(input())
cnt=1

for i in range(len(S)):
  if S[i]==S[i+1]:
    continue
  else:
    cnt+=1
print(cnt)

Buggy submission (verdict: Runtime Error):
N=int(input())
S=str(input())
cnt=1

for i in range(len(S)):
  if S[i]==S[i+1]:
    continue
  else:
    cnt+=1

print(cnt)

Buggy submission (verdict: Runtime Error):
n=int(input())
s=str(input())
slime_cnt=0

for i in range(n-1):
  if s[i]==s[i+1]:
    slime_cnt=slime_cnt
  if s[i]!=s[i+1]:
    slime_cnt+=1
if s[-1]==s[-2]:
  print(slime_cnt)
else:
  print(slime_cnt+1)
Problem p02899 (python)

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

B=[[A[i],i] for i in range(N)]
B.sort()

for i in B:
  print((i[1]+1))

Buggy submission (verdict: Runtime Error):
N=int(input())
A=map(int,input().split())
listA = []

for num in range(N):
  if num == (list(A))[i]:
    listA.append(num)
Problem p03220 (python)

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

for i in range(0,len(H)):
  H[i]=abs(1000*a-t*1000+H[i]*6)
  
print(H.index(min(H))+1)

Buggy submission (verdict: Runtime Error):
n=int(input())
t,a=list(input().split())
H=list(input().split())
L=list()

for i in range(H):
  Ave_temparature=abs(float(a)-(float(t)-float(H[i])*0.006))
  L.append(Ave_temparature)
  
print(min(L))

Buggy submission (verdict: Runtime Error):
n=int(input())
t,a=list(input().split())
H=list(input().split())
L=list()

for i in range(H):
  Ave_temparature=abs(float(a)-float(t)-float(H[i])*0.006)
  L.append(Ave_temparature)
  
print(min(L))

Buggy submission (verdict: Runtime Error):
n=int(input())
t,a=list(input().split())
H=list(input().split())
L=list()

for i in range(H):
  Ave_temparature=abs(float(a)-float(t-H[i]*0.006))
  L.append(Ave_temparature)
  
print(min(L))
Problem p03369 (python)

Fixed submission:
S=list(input())
count=0

if S[0]=='o':
  count+=1
if S[1]=='o':
  count+=1
if S[2]=='o':
  count+=1
  
print(count*100+700)

Buggy submission (verdict: Runtime Error):
S=list(input())
count=0

if  s='o':
  count+=1

print(count*100+700)

Buggy submission (verdict: Runtime Error):
s=str(input())
price=700
count=0

if s[0]=='o':
  count+=1
else:
  continue
if s[1]=='o':
  count+=1
else:
  continue
if s[2]=='o':
  count+=1
else:
  continue
print(price+count*100)

Buggy submission (verdict: Runtime Error):
s=list(map(str,input().split()))
price=700

for i in s:
  if s[i]=="o":
    price+=100
  else:
    price=price

print(price)

Buggy submission (verdict: Runtime Error):
s=list(map(str,input().split()))
price=700

for i in range(s):
  if s[i]=="o":
    price+=100
  else:
    price=price

print(price)

Buggy submission (verdict: Runtime Error):
s=list(map(str,input()))
price=700

for i in range(s):
  if s[i]=="o":
    price+=100
  else:
    price=price

print(price)

Buggy submission (verdict: Runtime Error):
s=str(input())
price=700

for i in range(s.size):
  if s[i]=="o":
    price+=100

print(price)

Buggy submission (verdict: Runtime Error):
s=str(input())
price=700

for i in range(s):
  if s[i]=="o":
    price+=100

print(price)

Buggy submission (verdict: Runtime Error):
s=str(input())
price=700

if s[0]=o:
  price+=100
if s[1]=o:
  price+=100
if s[2]=o:
  price+=100
else:
  price=price

print(price)

Buggy submission (verdict: Runtime Error):
s=str(input())
price=700

if s[0]=o:
  price+=100
if s[1]=o:
  price+=100
if s[2]=o:
  price+=100

print(price)
Problem p03370 (python)

Fixed submission:
n,x=map(int,input().split())
m=[int(input()) for i in range(n)]
cnt=0
mass=0
cnt+=n

for i in range(n):
  mass+=int(m[i])
ans=(x-mass)//min(m)
print(ans+cnt)

Buggy submission (verdict: Runtime Error):
n,x=map(int,input().split())
m=[int(input()) for i in range(n)]
cnt=0
mass=0
cnt+=n

for i in range(n):
  mass+=int(m[i])
  
if (x-mass)>=min(m):
  for j in range(1,n):
    ans=(x-mass)-min(int(m))
    cnt+=1
    if ans<0:
      break
  print(cnt-1)

else:
  print(cnt)
Problem p03433 (python)

Fixed submission:
n=int(input())
a=int(input())

if n%500==0:
    print('Yes')
elif n%500<=a:
    print('Yes')
else:
    print('No')

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

if n%500==0:
    print('Yes')
elif n%500<=a:
    print('Yes')
else:
    print('No')

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

if n%500==0:
    print('Yes')
elif n%500<=a:
    print('Yes')
else: n%500>a:
    print('No')

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

if n%500==0:
    print('Yes')
elif n%500<=a:
    print('Yes')
elif n%500>a:
    print('No')
Problem p03485 (python)

Fixed submission:
import math

a,b=map(int,input().split())
x=(a+b)/2

print(math.ceil(x))

Buggy submission (verdict: Runtime Error):
a,b=int(input())

x=(a+b)//2

print(x)
Problem p03610 (python)

Fixed submission:
s=str(input())
ans=str('')
for i in range(0,len(s),2):
  ans+=s[i]
print(ans)

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

for i in range(len(s)):
  if s.index(s[i]) % 2 == 0:
    del s[i]
  else:
    continue
print(s)

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

for i in range(len(s)):
  if s.index(s[i]) % 2 == 0:
    del s[i]
print(s)