Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
a,b,c = map(int,input().split())
n = 0
eatC = False
eatB = False
eatA = False
for i in range(a+b+c):
    if eatC:
        if b > 0:
                b -= 1
                n += 1
                eatB = True
                eatA = eatC = False
        else:
            if a > 0:
                a -= 1
                eatA = True
                eatB = eatC = False
            else:
                break
    elif eatB:
        if c > 0:
            c -= 1
            n += 1
            eatC = True
            eatA = eatB = False
        elif b > 0:
            b -= 1
            n += 1
            eatB = True
            eatA = eatC = False
        else:
            if a > 0:
                a -= 1
                eatA = True
                eatB = eatC = False
            else:
                break
    else:
        if c > 0:
            c -= 1
            n += 1
            eatC = True
            eatA = eatB = False
        else:
            if a > 0:
                a -= 1
                eatA = True
                eatC = eatB = False
            else:
                break
print(n)

Fixed submission:
a,b,c = map(int,input().split())
#n = 0
if c == 0:
    n = b    
elif c > a + b:
    n = 2 * (a + b) - a + 1
else:
    n = c + (a + b) - a
print(n)
Buggy python submission (verdict: Runtime Error):
N = int(input())
old_dl = [list(map(int,input().split())) for _ in range(N)]
dl = []
for k in old_dl:
    if k[2] != 0:
        dl.append(k)
if len(dl) == 1:
    print(dl[2])
else:
    for x in range(101):
        for y in range(101):
            ndl = [l[2]+abs(l[0]-x)+abs(l[1]-y) for l in dl]
            if max(ndl) == min(ndl):
                #print(ndl)
                print(x,y,max(ndl))
                exit(0)

Fixed submission:
N = int(input())
old_dl = [list(map(int,input().split())) for _ in range(N)]
dl = []
for k in old_dl:
    if k[2] != 0:
        dl.append(k)
if len(dl) == 1:
    print(*dl[0])
else:
    for x in range(101):
        for y in range(101):
            ndl = [l[2]+abs(l[0]-x)+abs(l[1]-y) for l in dl]
            if max(ndl) == min(ndl):
                #print(ndl)
                print(x,y,max(ndl))
                exit(0)
Buggy python submission (verdict: Runtime Error):
import math
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        d = int( (math.log(int(S[i]))) * ((2**5)*(10**15)) ) + 1
        if d<K:K-=d
        else:break
        i += 1
print(S[i])

Fixed submission:
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        break
print(S[i])

Buggy python submission (verdict: Runtime Error):
import math
S = input()
K = int(input())
i = 0
while True:
    print('first:',S[i])
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        d = int( (math.log(int(S[i]))) * ((2**5)*(10**15)) ) + 1
        if d<K:K-=d
        else:break
        i += 1
print(S[i])

Fixed submission:
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        break
print(S[i])

Buggy python submission (verdict: Runtime Error):
import math
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        d = int(math.log(int(S[i]))*5*10**15)
        if d<K:K-=d
        else:break
        i += 1
print(S[i])

Fixed submission:
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        break
print(S[i])

Buggy python submission (verdict: Runtime Error):
import math
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        d = int(math.log(int(S[i]))*10**15)
        if d<K:K-=d
        else:break
        i += 1
print(S[i])

Fixed submission:
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        break
print(S[i])

Buggy python submission (verdict: Runtime Error):
import math
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            print(S[i])
        else:
            K-=1
            i+=1
    else:
        d = int(math.log(int(S[i]))*10**15)
        if d<K:K-=d
        else:break
        i += 1

Fixed submission:
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        break
print(S[i])

Buggy python submission (verdict: Runtime Error):
import math
S = input()
K = int(input())
i = 0
while True:
    d = int(math.log(int(S[i]))*10**15)
    if d<K:K-=d
    else:break
    i += 1
print(S[i])

Fixed submission:
S = input()
K = int(input())
i = 0
while True:
    if S[i] == '1':
        if K == 1:
            break
        else:
            K-=1
            i+=1
    else:
        break
print(S[i])
Buggy python submission (verdict: Runtime Error):
c = 0
for s in input():
  if s = '+':c += 1
  else:c-= 1
print(c)

Fixed submission:
c = 0
for s in input():
  if s == '+':c += 1
  else:c-= 1
print(c)
Buggy python submission (verdict: Runtime Error):
N = int(input())
if N >=1000:
  print('ABD'
else:
  print('ABC')

Fixed submission:
N = int(input())
if N >=1000:
  print('ABD')
else:
  print('ABC')
Buggy python submission (verdict: Runtime Error):
A,B,C,D = map(int,input().split())
if abs(A-C)<=D:
  print('Yes')
else:
  if abs(A-B)<=D an abs(B-C)<=D:
    print('Yes')
  else:
    print('No')

Fixed submission:
A,B,C,D = map(int,input().split())
if abs(A-C)<=D:
  print('Yes')
else:
  if abs(A-B)<=D and abs(B-C)<=D:
    print('Yes')
  else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n,m= map(int,input().split())
par = [-1]*(n)
def find(x):
    if par[x]<0:return x
    else:
        par[x]=find(par[x])
        return par[x]
def unite(x,y):
    px,py=find(x),find(y)
    if px==py:return False
    else:
        if px<py:px,py=py,px
        par[px]+=par[py]
        par[py]=px
        return True
p= list(map(int,input().split()))
for i in range(m):
    x,y= map(int,input().split())
    unite(x-1,y-1)
gr={}
for c in range(n):#par:
    ap=find(c)
    gr[ap]=gr.get(ap,[])+[c]
g=0
for key in gr.keys():
    temp=[p[index]-1 for index in gr[key]]
    newset = set(gr[key]) & set(temp)
    g+=len(newset)
print(g)

Fixed submission:
n,m= map(int,input().split())
par = [-1]*(n)
def find(x):
    if par[x]<0:return x
    else:
        par[x]=find(par[x])
        return par[x]
def unite(x,y):
    px,py=find(x),find(y)
    if px==py:return False
    else:
        if px<py:px,py=py,px
        par[px]+=par[py]
        par[py]=px
        return True
p= list(map(int,input().split()))
gl=[[] for _ in range(n)]
for i in range(m):
    x,y= map(int,input().split())
    unite(x-1,y-1)
for c in range(n):#par:
    ap=find(c)
    gl[ap].append(c)
g=0
for sg in gl:
    temp=[p[index]-1 for index in sg]
    newset = set(sg) & set(temp)
    g+=len(newset)
print(g)
Buggy python submission (verdict: Runtime Error):
print(input().split.count('o') * 100 + 700)

Fixed submission:
print(input().count('o') * 100 + 700)
Buggy python submission (verdict: Runtime Error):
A,B,C,X,Y = map(int,input().split())
if A+B <　2*C:print(A*X+B*Y)
else:
    if X>Y:print(min(2*Y*C+(X-Y)*A, 2*X*C))
    else:print(min(2*X*C+(Y-X)*B, 2*Y*C))

Fixed submission:
A,B,C,X,Y=map(int,input().split())
if A+B<2*C:print(A*X+B*Y)
else:
    if X>Y:print(min(2*Y*C+(X-Y)*A,2*X*C))
    else:print(min(2*X*C+(Y-X)*B,2*Y*C))
Buggy python submission (verdict: Runtime Error):
a = int(inpit())
b = int(inpit())
c = int(inpit())
d = int(inpit())
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):
line = ''.join(['.#']*50)
dot=['.','#']
cl=[''.join(['.']*100),''.join(['#']*100)]
ba=[b-1,a-1]
ans=[]
for c in [0,1]:
    ans.append(cl[c])
    for i in range(ba[c]//50):
        ans.append(line)
        ans.append(cl[c])
    ans.append(''.join(['.#']*(ba[c]%50))+cl[c][(ba[c]%50)*2:])
    ans.append(cl[c])
print(len(ans))
for l in ans:print(''.join(l))

Fixed submission:
a,b= map(int,input().split())
line=''.join(['.#']*50)
dot=['.','#']
cl=[''.join(['.']*100),''.join(['#']*100)]
ba=[b-1,a-1]
ans=[]
y=ans.append
for c in [0,1]:
    y(cl[c])
    for i in range(ba[c]//50):
        y(line)
        y(cl[c])
    y(''.join(['.#']*(ba[c]%50))+cl[c][(ba[c]%50)*2:])
    y(cl[c])
print(len(ans),100)
for l in ans:print(''.join(l))
Buggy python submission (verdict: Runtime Error):
A,B,C,D = map(int,input().split())
if A+B = C+D:
  print('Balanced')
elif A+B > C+D:
  print('Left')
else:
  print('Right')

Fixed submission:
A,B,C,D = map(int,input().split())
if A+B == C+D:
    print('Balanced')
elif A+B > C+D:
    print('Left')
else:
    print('Right')
Buggy python submission (verdict: Runtime Error):
,K = map(int,input().split())
a = list(map(int,input().split()))
adic = {}
for c in a:adic[c] = adic.get(c,0) + 1
alist = sorted([adic[c] for c in adic.keys()])
print(sum(alist[:len(alist)-K]))

Fixed submission:
N,K = map(int,input().split())
a = list(map(int,input().split()))
adic = {}
for c in a:adic[c] = adic.get(c,0) + 1
alist = sorted([adic[c] for c in adic.keys()])
print(sum(alist[:len(alist)-K]))
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())
print(min(A*T,B))

Fixed submission:
N,A,B = map(int,input().split())
print(min(A*N,B))
Buggy python submission (verdict: Runtime Error):
N = sorted(input().split())
if N[1] == N[2] and (N[0] == N[1] or N[2] == N[3]):
  print('Yes')
else:
  print('No')
 


Fixed submission:
N = input()
if N[1] == N[2] and (N[0] == N[1] or N[2] == N[3]):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
pre2 = 2
pre1 = 1
for i in range(2,N+1):
    l = pre2 + pre1
    pre2,pre1 = pre1,l
else:print(l)

Fixed submission:
N = int(input())
pre2,pre1 = 2,1
if N == 1:print(1)
else:
    for i in range(2,N+1):
        l = pre2 + pre1
        pre2,pre1 = pre1,l
    else:print(l)
Buggy python submission (verdict: Runtime Error):
n,m= map(int,input().split())
henl = []
usehen = [False] * n
brdic = {}
for _ in range(m):
    a,b= map(int,input().split())
    brdic[a] = brdic.get(a,[]) + [b]
    brdic[b] = brdic.get(b,[]) + [a]
    henl.append((a,b))

ordin = [-1]*(n+1)
lowlink = [-1]*(n+1)
k=[1]
bn=[0]
def dfs(node):
    ordin[node]=k[0]
    k[0]+=1
    lowlink[node]=ordin[node]
    for br in brdic[node]:
        temp = (min(node,br),max(node,br))
        if ordin[br]==-1:
            usehen[henl.index(temp)]=True
            dfs(br)
            lowlink[node] = min(lowlink[br],lowlink[node])
        else:
            if usehen[henl.index(temp)]==False:lowlink[node] = min(ordin[br],lowlink[node])
        if ordin[node] < lowlink[br]:bn[0]+=1
dfs(1)
print(bn[0])

Fixed submission:
n,m= map(int,input().split())
henl = []
usehen = [False] * m
brdic = {}
for _ in range(m):
    a,b= map(int,input().split())
    brdic[a] = brdic.get(a,[]) + [b]
    brdic[b] = brdic.get(b,[]) + [a]
    henl.append((a,b))

ordin = [-1]*(n+1)
lowlink = [-1]*(n+1)
k=[1]
bn=[0]
def dfs(node):
    ordin[node]=k[0]
    k[0]+=1
    lowlink[node]=ordin[node]
    for br in brdic[node]:
        temp = (min(node,br),max(node,br))
        if ordin[br]==-1:
            usehen[henl.index(temp)]=True
            dfs(br)
            lowlink[node] = min(lowlink[br],lowlink[node])
        else:
            if usehen[henl.index(temp)]==False:lowlink[node] = min(ordin[br],lowlink[node])
        if ordin[node] < lowlink[br]:bn[0]+=1
dfs(1)
print(bn[0])
Buggy python submission (verdict: Runtime Error):
n = input()
if n = n[::-1]:
  print('Yes')
else:
  print('No')

Fixed submission:
n = input()
if n == n[::-1]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
N,M = list(map(int,input().split()))
atob = [0] * N
btoz = [0] * N
for _ in range(M):
    a, b = list(map(int,input().split()))
    if a == 1:atob[b-1] = 1
    elif a == N:btoz[b-1] = 1
    if b == 1:atob[a-1] = 1
    elif b == N:btoz[a-1] = 1

for i in range(N):
    if a[i]*b[i] == 1:
        print('POSSIBLE')
        break
else:print('IMPOSSIBLE')

Fixed submission:
N,M = list(map(int,input().split()))
atob = [0] * N
btoz = [0] * N
for _ in range(M):
    a, b = list(map(int,input().split()))
    if a == 1:atob[b-1] = 1
    elif a == N:btoz[b-1] = 1
    if b == 1:atob[a-1] = 1
    elif b == N:btoz[a-1] = 1

for i in range(N):
    if atob[i]*btoz[i] == 1:
        print('POSSIBLE')
        break
else:print('IMPOSSIBLE')

Buggy python submission (verdict: Time Limit Exceeded):
N,M = list(map(int,input().split()))
atob = []
btoz = []
for _ in range(M):
    a, b = list(map(int,input().split()))
    if a == 1:
        if b in btoz:
            print('POSSIBLE')
            break
        atob.append(b)
    elif b == N:
        if a in atob:
            print('POSSIBLE')
            break
        btoz.append(a)
else:print('IMPOSSIBLE')

Fixed submission:
N,M = list(map(int,input().split()))
atob = [0] * N
btoz = [0] * N
for _ in range(M):
    a, b = list(map(int,input().split()))
    if a == 1:atob[b-1] = 1
    elif a == N:btoz[b-1] = 1
    if b == 1:atob[a-1] = 1
    elif b == N:btoz[a-1] = 1

for i in range(N):
    if atob[i]*btoz[i] == 1:
        print('POSSIBLE')
        break
else:print('IMPOSSIBLE')
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A%3==0 or B%3==0 or (A+B)%==0:
  print('Possible')
else:
  print('Impossible')

Fixed submission:
A,B = map(int,input().split())
if A%3==0 or B%3==0 or (A+B)%3==0:
    print('Possible')
else:
    print('Impossible')
Buggy python submission (verdict: Time Limit Exceeded):
n,a,b= map(int,input().split())
sh = sorted([int(input()) for i in range(n)],reverse=True)
sumh = sum(sh)
def nibu(t):
    rt=0
    for i in range(n):
        temp = -1*(-1*max(0,sh[i]-t*b)//(a-b))
        if temp>0:rt+=-1*(-1*max(0,sh[i]-t*b)//(a-b))
        else:break
    return True if t>=rt else False
l=max(sh)//a
r=max(sh)//b+1
while r-l!=1:
    m = (l+r)//2
    if nibu(m):r=m
    else:l=m
print(r)

Fixed submission:
n,a,b= map(int,input().split())
sh = sorted([int(input()) for i in range(n)],reverse=True)
sumh = sum(sh)
def nibu(t):
    rt=0
    for i in range(n):
        temp = -1*(-1*max(0,sh[i]-t*b)//(a-b))
        if temp>0:rt+=-1*(-1*max(0,sh[i]-t*b)//(a-b))
        else:break
        if rt>t:return False
    return True if t>=rt else False
l=max(sh)//a
r=max(sh)//b+1
while r-l!=1:
    m = (l+r)//2
    if nibu(m):r=m
    else:l=m
print(r)

Buggy python submission (verdict: Time Limit Exceeded):
n,a,b= map(int,input().split())
sh = sorted([int(input()) for i in range(n)],reverse=True)
sumh = sum(sh)
def nibu(t):
    rt=0
    for i in range(n):
        temp = -1*(-1*max(0,sh[i]-t*b)//(a-b))
        if temp>0:rt+=-1*(-1*max(0,sh[i]-t*b)//(a-b))
        else:break
    return True if t>=rt else False

l,r=0,-1*(-1*sumh//b)
while r-l!=1:
    m = (l+r)//2
    if nibu(m):r=m
    else:l=m

print(r)

Fixed submission:
n,a,b= map(int,input().split())
sh = sorted([int(input()) for i in range(n)],reverse=True)
sumh = sum(sh)
def nibu(t):
    rt=0
    for i in range(n):
        temp = -1*(-1*max(0,sh[i]-t*b)//(a-b))
        if temp>0:rt+=-1*(-1*max(0,sh[i]-t*b)//(a-b))
        else:break
        if rt>t:return False
    return True if t>=rt else False
l=max(sh)//a
r=max(sh)//b+1
while r-l!=1:
    m = (l+r)//2
    if nibu(m):r=m
    else:l=m
print(r)

Buggy python submission (verdict: Time Limit Exceeded):
n,a,b= map(int,input().split())
sh = sorted([int(input()) for i in range(n)])
sumh = sum(sh)
def nibu(t):
    rt=0
    for i in range(n):rt+=-1*(-1*max(0,sh[i]-t*b)//(a-b))
    return True if t>=rt else False
l,r=0,-1*(-1*sumh//b)
while r-l!=1:
    m = (l+r)//2
    if nibu(m):r=m
    else:l=m
print(r)


Fixed submission:
n,a,b= map(int,input().split())
sh = sorted([int(input()) for i in range(n)],reverse=True)
sumh = sum(sh)
def nibu(t):
    rt=0
    for i in range(n):
        temp = -1*(-1*max(0,sh[i]-t*b)//(a-b))
        if temp>0:rt+=-1*(-1*max(0,sh[i]-t*b)//(a-b))
        else:break
        if rt>t:return False
    return True if t>=rt else False
l=max(sh)//a
r=max(sh)//b+1
while r-l!=1:
    m = (l+r)//2
    if nibu(m):r=m
    else:l=m
print(r)
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
if M == 0:
    print(0)
else:
    l = [[0 for _ in range(M)] for _ in range(M)]
    for _ in range(M):
        a,b = map(int,input().split())
        l[a-1][b-1] = 1
        l[b-1][a-1] = 1
    g = 0
    def dfs(a,route):
        global g
        if len(route) == N:g += 1
        else:
            for i in range(N):
                if a == i:pass
                else:
                    if l[a][i] == 1 and (not i in route):
                        dfs(i,route+[i])
    dfs(0,[0])
print(g)

Fixed submission:
N,M = map(int,input().split())
if M == 0:
    print(0)
else:
    l = [[0 for _ in range(N)] for _ in range(N)]
    for _ in range(M):
        a,b = map(int,input().split())
        l[a-1][b-1] = 1
        l[b-1][a-1] = 1
    g = 0
    def dfs(a,route):
        global g
        if len(route) == N:g += 1
        else:
            for i in range(N):
                if a == i:pass
                else:
                    if l[a][i] == 1 and (not i in route):
                        dfs(i,route+[i])
    dfs(0,[0])
print(g)

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
l = [[0 for _ in range(M)] for _ in range(M)]
for _ in range(M):
    a,b = map(int,input().split())
    l[a-1][b-1] = 1
    l[b-1][a-1] = 1
g = 0
def dfs(a,route):
    global g
    if len(route) == N:g += 1
    else:
        for i in range(N):
            if a == i:pass
            else:
                if l[a][i] == 1 and (not i in route):dfs(i,route+[i])
dfs(0,[0])
print(g)

Fixed submission:
N,M = map(int,input().split())
if M == 0:
    print(0)
else:
    l = [[0 for _ in range(N)] for _ in range(N)]
    for _ in range(M):
        a,b = map(int,input().split())
        l[a-1][b-1] = 1
        l[b-1][a-1] = 1
    g = 0
    def dfs(a,route):
        global g
        if len(route) == N:g += 1
        else:
            for i in range(N):
                if a == i:pass
                else:
                    if l[a][i] == 1 and (not i in route):
                        dfs(i,route+[i])
    dfs(0,[0])
print(g)
Buggy python submission (verdict: Time Limit Exceeded):
K,S = map(int,input().split())
g = 0
for x in range(0,K+1):
    for y in range(x,K+1):
        for z in range(y,K+1):
            if x+y+z == S:
                if x == y == z:g += 1
                elif x == y or y == z:g += 3
                else:g += 6
print(g)

Fixed submission:
K,S = map(int,input().split())
t = 0
#c = 0
for x in range(max(0,S-2*K),min(S//3+1,K+1)):
    if S-x > 2 * K:
        pass
    else:
        for y in range(max(x,S-x-K),min((S-x)//2+1,K+1)):
            #c += 1
            z = S - x - y
            if z < y:
                #print('pass')
                pass
            else:
                #print(x,y,z)
                if x == y == z:
                    t += 1
                elif x == y or y == z:
                    t += 3
                else:
                    t += 6
print(t)
Buggy python submission (verdict: Runtime Error):
l = list(map(int,input().split()))
if l % 2 == 1:
  print('No')
else:
  if l//2 in l:
    print('Yes')
  else:
    print('No')

Fixed submission:
l = list(map(int,input().split()))
if sum(l) % 2 == 1:
  print('No')
else:
  if sum(l)//2 in l:
    print('Yes')
  else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
pt = pa = 0
for _ in range(N):
    t,a = map(int,input().split())
    if pt == 0:pt,pa = t,a
    else:
        if (pt <= t) and (pa <= a):pt,pa = t,a
        else:
            i = 2
            while True:
                if (pt <= t*i) and (pa <= a*i):
                    pt,pa = t*i,a*i
                    break
                i += 1
print(pt+pa)

Fixed submission:
N = int(input())
pt = pa = 0
for _ in range(N):
    t,a = map(int,input().split())
    if pt == 0:
        pt,pa = t,a
    else:
        #print(pt,pa,t,a)
        if (pt <= t) and (pa <= a):
            pt,pa = t,a
        else:
            '''
            i = 2
            while True:
                if (pt <= t*i) and (pa <= a*i):
                    pt,pa = t*i,a*i
                    break
                i += 1
            '''
            if t == a:
                #that is t = a = 1
                maxta = max(pt,pa)
                pt = pa = maxta
            else:
                w1 = -1 * ((-1 *pt) // t)
                w2 = -1 * ((-1 *pa) // a)
                w = max(w1,w2)
                pt = w * t
                pa = w * a
                #print(pt,pa)
print(pt+pa)
Buggy python submission (verdict: Runtime Error):
a=int(input())
s=int(input())

if a >= 3200:
    print(s)
else:
    print("red")

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

if a >= 3200:
    print(s)
else:
    print("red")
Buggy python submission (verdict: Runtime Error):
N=int(imput())
if N%9 == 0:
  print("Yes")
else:
  print("No")

Fixed submission:
N=int(input())
if N%9 == 0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N=int(imput())
if N<600:
  print(8)
elif N<800:
  print(7)
elif N<1000:
  print(6)
elif N<1200:
  print(5)
elif N<1400:
  print(4)
elif N<1600:
  print(3)
elif N<1800:
  print(2)
else:
  print(1)

Fixed submission:
N=int(input())
if N<600:
  print(8)
elif N<800:
  print(7)
elif N<1000:
  print(6)
elif N<1200:
  print(5)
elif N<1400:
  print(4)
elif N<1600:
  print(3)
elif N<1800:
  print(2)
else:
  print(1)
Buggy python submission (verdict: Runtime Error):
import math

def distance(N, D, point):
    count = 0
    for i in range(N):
        if math.sqrt(points[i][0]**2 + points[i][1]**2) <= D:
            count += 1
    return count


if __name__ == "__main__":
    N, D = map(int, input().split())
    points = []
    for _ in range(N):
        x, y = map(int, input.split())
        points.append([x,y])
    print(distance(N,D,points))

Fixed submission:
import math

def distance(N, D, point):
    count = 0
    for i in range(N):
        if math.sqrt(points[i][0]**2 + points[i][1]**2) <= D:
            count += 1
    return count


if __name__ == "__main__":
    N, D = map(int, input().split())
    points = []
    for _ in range(N):
        x, y = map(int, input().split())
        points.append([x,y])
    print(distance(N,D,points))

Buggy python submission (verdict: Runtime Error):
def distance(N, D, point):
    count = 0
    for i in range(N):
        if sqrt(points[i][0]**2 + points[i][1]**2) <= D:
            count += 1
    return count


if __name__ == "__main__":
    N, D = map(int, input().split())
    points = []
    for _ in range(N):
        x, y = map(int, input.split())
        points.append([x,y])
    print(distance(N,D,points))

Fixed submission:
import math

def distance(N, D, point):
    count = 0
    for i in range(N):
        if math.sqrt(points[i][0]**2 + points[i][1]**2) <= D:
            count += 1
    return count


if __name__ == "__main__":
    N, D = map(int, input().split())
    points = []
    for _ in range(N):
        x, y = map(int, input().split())
        points.append([x,y])
    print(distance(N,D,points))
Buggy python submission (verdict: Runtime Error):
def calc(int: a) -> int:
    return a+a**2+a**3

if __name__ == "__main__":
    a = int(input())
    print(calc(a))

Fixed submission:
def calc(a: int) -> int:
    return a+a**2+a**3

if __name__ == "__main__":
    a = int(input())
    print(calc(a))