Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
from sys import stdin
from collections import deque
V, E = map(int, stdin.readline().split())
adj_list = [[] for _ in [] * V]
is_visited = [False] * V
for _ in [] * E:
    s, t = map(int, stdin.readline().split())
    adj_list[s].append(t)
out = deque()
def dfs(u):
    is_visited[u] = True
    for v in adj_list[u]:
        if not is_visited[v]:
            dfs(v)
    out.appendleft(u)
for s in range(V):
    if not is_visited[s]:
        dfs(s)
print(*out, sep='\n')

Fixed submission:
from sys import stdin
from collections import deque
V, E = map(int, stdin.readline().split())
adj_list = [[] for _ in [0] * V]
is_visited = [False] * V
for _ in [0] * E:
    s, t = map(int, stdin.readline().split())
    adj_list[s].append(t)
out = deque()
def dfs(u):
    is_visited[u] = True
    for v in adj_list[u]:
        if not is_visited[v]:
            dfs(v)
    out.appendleft(u)
for s in range(V):
    if not is_visited[s]:
        dfs(s)
print(*out, sep='\n')

Buggy python submission (verdict: Runtime Error):
from sys import stdin
from collections import deque
V, E = map(int, stdin.readline().split())
adj_list = [[] for _ in [] * V]
is_visited = [False] * V
for _ in [0] * E:
    s, t = map(int, stdin.readline().split())
    adj_list[s].append(t)
out = deque()
def dfs(u):
    is_visited[u] = True
    for v in adj_list[u]:
        if not is_visited[v]:
            dfs(v)
    out.appendleft(u)
for s in range(V):
    if not is_visited[s]:
        dfs(s)
print(*out, sep='\n')

Fixed submission:
from sys import stdin
from collections import deque
V, E = map(int, stdin.readline().split())
adj_list = [[] for _ in [0] * V]
is_visited = [False] * V
for _ in [0] * E:
    s, t = map(int, stdin.readline().split())
    adj_list[s].append(t)
out = deque()
def dfs(u):
    is_visited[u] = True
    for v in adj_list[u]:
        if not is_visited[v]:
            dfs(v)
    out.appendleft(u)
for s in range(V):
    if not is_visited[s]:
        dfs(s)
print(*out, sep='\n')
Buggy python submission (verdict: Runtime Error):
import sys
readline = sys.stdin.readline
from collections import deque
from math import isinf
INF = float("inf")
sys.setrecursionlimit(200000)
n = int(readline())
G = [[] for _ in range(n)]
for _ in [0] * (n - 1):
    s, t, w = map(int, readline().split())
    G[s].append([t, w])
    G[t].append([s, w])
def bfs(s, D):
    dq = deque([s])
    D = [INF] * n
    D[s] = 0
    while dq:
        u = dq.popleft()
        for i in range(len(G[u])):
            e = G[u][i]
            if isinf(D[e[0]]):
                D[e[0]] = D[u] + e[1]
                dq.append(e[0])
    return D
D = bfs(0, D)
D = bfs(max([i for i in range(n) if not isinf(D[i]) and 0 < D[i]]))
print(max(D[i] for i in range(n) if not isinf(D[i])))

Fixed submission:
import sys
readline = sys.stdin.readline
def dfs(root):
    visited = [False] * n
    queue = [(0, root)]
    longest = (-1, -1)
    while queue:
        total_weight, node = queue.pop()
        if visited[node]: continue
        visited[node] = True
        longest = max(longest, (total_weight, node))
        queue += [(total_weight + w, t) for w, t in edges[node] if not visited[t]]
    return longest
n = int(readline())
edges = [set() for _ in range(n)]
for _ in range(n - 1):
    s, t, w = map(int, readline().split())
    edges[s].add((w, t))
    edges[t].add((w, s))
_, ln = dfs(0)
ld, _ = dfs(ln)
print(ld)
Buggy python submission (verdict: Runtime Error):
import math
x1, y1, x2, y2 = [int(i) for i in input().split()]
print(math.hypot(x1 - x2, y1 - y2))

Fixed submission:
from math import *
x1, y1, x2, y2 = map(float, input().split())
print(hypot(x1 - x2, y1 - y2))

Buggy python submission (verdict: Runtime Error):
import math
x1, y1, x2, y2 = [int(i) for i in input().split()]
print(math.hypot(x1 - x2, y1 - y2))

Fixed submission:
from math import *
x1, y1, x2, y2 = map(float, input().split())
print(hypot(x1 - x2, y1 - y2))
Buggy python submission (verdict: Runtime Error):
import math
a, b, c = [float(i) for i in input().split()]
cos(math.radians(c))
print(a * b * math.sin(math.radians(c)) / 2)
print(a + b + math.sqrt(a**2 + b**2 - 2 * a * b * math.cos(math.radians(c))))
print(b * math.sin(math.radians(c)))

Fixed submission:
from math import *
a, b, C = map(float, input().split())
c = sqrt(a ** 2 + b ** 2 - 2 * a * b * cos(radians(C)))
s = (a + b + c) / 2
S = sqrt(s * (s - a) * (s - b) * (s - c))
L = a + b + c
h = b * sin(radians(C))
print(S)
print(L)
print(h)
Buggy python submission (verdict: Runtime Error):
from statistics import pstdev
while True:
    data_count = int(input())
    if data_count == 0:
        break
    print(pstdev(sum(int(x) for x in input().split())))


Fixed submission:
from statistics import pstdev
while True:
    data_count = int(input())
    if data_count == 0:
        break
    print(pstdev(map(int, input().split())))
Buggy python submission (verdict: Runtime Error):
from math import *
import numpy as np
input()
P1 = []
P2 = []
P3 = []
for a, b in zip(map(int, input().split()), map(int, input().split())):
    t = abs(a - b)
    P1.append(t)
    P2.append(t ** 2)
    P3.append(t ** 3)
print("{:f}".format(sum(P1)))
print(sqrt(sum(P2)))
print(np.cbrt(sum(P3)))
print("{:f}".format(max(P1)))



Fixed submission:
input()
P1 = []
P2 = []
P3 = []
for a, b in zip(map(int, input().split()), map(int, input().split())):
    t = abs(a - b)
    P1.append(t)
    P2.append(t ** 2)
    P3.append(t ** 3)
print("{:f}".format(sum(P1)))
print(sum(P2) ** (1 / 2))
print(sum(P3) ** (1 / 3))
print("{:f}".format(max(P1)))
Buggy python submission (verdict: Runtime Error):
s  = input()
print(str(s // 3600) + ":" + str(s // 60) + ":" + str(s % 60))

Fixed submission:
t=int(input())
print(f"{t//3600}:{t//60%60}:{t%60}")

Buggy python submission (verdict: Runtime Error):
s  = input()
print(s // 3600, end="")
print(":", end="")
print(s // 60, end="")
print(":", end="")
print(s % 60)

Fixed submission:
t=int(input())
print(f"{t//3600}:{t//60%60}:{t%60}")
Buggy python submission (verdict: Runtime Error):
a, b = input().split()
s = "=="
a = abs(a)
b = abs(b)
if a < b: s = "<"
elif a > b: s = ">"
print("a", s, "b")

Fixed submission:
a, b = map(int, input().split())
print("a", ("==" if a == b else "<" if a < b else ">"), "b")
Buggy python submission (verdict: Runtime Error):
from math import *
r = int(input())
print(r * r * pi, 2 * r * pi)



Fixed submission:
r = float(input())
print("{:.6f} {:.6f}".format(r * r * 3.14159265359, 2 * r * 3.14159265359))

Buggy python submission (verdict: Runtime Error):
from math import *
r = int(input())
print("{:.6f} {:.6f}".format(r * r * pi, 2 * r * pi))



Fixed submission:
r = float(input())
print("{:.6f} {:.6f}".format(r * r * 3.14159265359, 2 * r * 3.14159265359))

Buggy python submission (verdict: Runtime Error):
from math import pi
r = int(input())
print("{:.6f} {:.6f}".format(r * r * pi, 2 * r * pi))



Fixed submission:
r = float(input())
print("{:.6f} {:.6f}".format(r * r * 3.14159265359, 2 * r * 3.14159265359))

Buggy python submission (verdict: Runtime Error):
from math import pi
r = int(input())
print("{:.6f} {:.6f}".format(r * r * pi, 2 * r * pi))



Fixed submission:
r = float(input())
print("{:.6f} {:.6f}".format(r * r * 3.14159265359, 2 * r * 3.14159265359))

Buggy python submission (verdict: Runtime Error):
r = int(input())
print("{:.6f} {:.6f}".format(r * r * 3.14159265359, 2 * r * 3.14159265359))


Fixed submission:
r = float(input())
print("{:.6f} {:.6f}".format(r * r * 3.14159265359, 2 * r * 3.14159265359))

Buggy python submission (verdict: Runtime Error):
r = int(input())
print(r * r * 3.14159265359, 2 * r * 3.14159265359)


Fixed submission:
r = float(input())
print("{:.6f} {:.6f}".format(r * r * 3.14159265359, 2 * r * 3.14159265359))
Buggy python submission (verdict: Runtime Error):
input()
li = map(int, input().split())
print(min(li), max(li), sum(li))


Fixed submission:
input()
li = list(map(int, input().split()))
print(min(li), max(li), sum(li))
Buggy python submission (verdict: Runtime Error):
from itertools import combinations
while True:
    n, x = map(int, input().split())
    if n == x == 0:
        break
    print(sum(a + b + c == x for a, b, c in combinations(range(1, n + 1), 3))



Fixed submission:
from itertools import combinations
while True:
    n, x = map(int, input().split())
    if n == x == 0:
        break
    print(len([1 for a, b, c in combinations(range(1, n + 1), 3) if a + b + c == x]))

Buggy python submission (verdict: Runtime Error):
from itertools import combinations
while True:
    n, x = map(int, input().split())
    if n == x == 0:
        break
    print(len(1 for a, b, c in combinations(range(1, n + 1), 3) if a + b + c == x))



Fixed submission:
from itertools import combinations
while True:
    n, x = map(int, input().split())
    if n == x == 0:
        break
    print(len([1 for a, b, c in combinations(range(1, n + 1), 3) if a + b + c == x]))
Buggy python submission (verdict: Runtime Error):
a, b = int(input().split())

if a < b:
  print ("a < b")
elif b < a:
  print ("a > b")
else:
  print ("a == b")

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

if a < b:
  print ("a < b")
elif b < a:
  print ("a > b")
else:
  print ("a == b")
Buggy python submission (verdict: Runtime Error):
count = int(input())
a = [int(input()) for i in range(count)]

a.sort()
for i in range(count):
  print (a[i])

Fixed submission:
a = list(map(int, input().split()))
a.sort()
print(a[0],a[1],a[2])

Buggy python submission (verdict: Runtime Error):
a = map(int, input().split())
a.sort()
for i in 3:
  print (a[i])

Fixed submission:
a = list(map(int, input().split()))
a.sort()
print(a[0],a[1],a[2])

Buggy python submission (verdict: Runtime Error):
a = map(int, input().split())
a.sort()
for i in 3:
  print (list(a[i]), ' ')

Fixed submission:
a = list(map(int, input().split()))
a.sort()
print(a[0],a[1],a[2])
Buggy python submission (verdict: Runtime Error):
x, y = map(int, input().split())

while (x != 0 && y != 0):
    if x <= y :
        print(x, y)
    elif x > y :
        print(y, x)

    x, y = map(int, input().split())

Fixed submission:
while 1:
    x,y = map(int,input().split())
    if not x+y:break
    if x > y : x,y = y,x
    print(x,y)

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

while (x != 0 && y != 0):
    if x <= y :
        print(x, y)
    elif x > y :
        print(y, x)

    x = int(input())
    y = int(input())

Fixed submission:
while 1:
    x,y = map(int,input().split())
    if not x+y:break
    if x > y : x,y = y,x
    print(x,y)

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

while (x != 0 && y != 0):
    if x <= y :
        print(x, y)
    else :
        print(y, x)

    x = int(input())
    y = int(input())

Fixed submission:
while 1:
    x,y = map(int,input().split())
    if not x+y:break
    if x > y : x,y = y,x
    print(x,y)
Buggy python submission (verdict: Runtime Error):
a, b, c = map (int, input().split())
count = 0
for i in range(a, b+1):
    if c % i == 0:
        count += 1

print (count)

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

print ("%d %d %.10f" % (a // b, a % b, a / b))
Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
pi = math.pi
print ("%f %f" % (r*r*pi, 2*r*pi))

Fixed submission:
import math
r = float(input())
pi = math.pi
print ("%f %f" % (r*r*pi, 2*r*pi))

Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
pi = math.pi
print ("%f %f" % (r*r*pi, 2*r*pi))

Fixed submission:
import math
r = float(input())
pi = math.pi
print ("%f %f" % (r*r*pi, 2*r*pi))
Buggy python submission (verdict: Runtime Error):
num = int(input())
array = [int(input()) for i in range(num)]

print (min(array), max(array), sum(array))

Fixed submission:
num = int(input())
array = list(map(int, input().split()))

print (min(array), max(array), sum(array))
Buggy python submission (verdict: Runtime Error):
while True:
    H, W = map(int, input().split())
    if W == 0 and H == 0:
        break
   for i in range(H):
        print ('#' * W)
    print()

Fixed submission:
while True:
    H, W = map(int, input().split())
    if W == 0 and H == 0:
        break
  
    for i in range(H):
        print ('#' * W)
    print()
Buggy python submission (verdict: Runtime Error):
w, h = 0, 0

def dfs(x, y, data):
    data[x][y] = 0
    for dx in range(-1, 2):
        for dy in range(-1, 2):
            sx, sy = x + dx, y + dy
            if sx < 0 or sx >= h or sy < 0 or sy >= w:
                continue
            if data[sx][sy] > 0:
                data = dfs(sx, sy, data)
    return data

while True:
    w, h = map(int, input().split())
    if w == h == 0:
        break

    data = []
    for i in range(h):
        data.append(list(map(int, input().split())))

    ans = 0
    for x in range(h):
        for y in range(w):
            if data[x][y] > 0:
                ans += 1
                data = dfs(x, y, data)
    print (ans)


Fixed submission:
from queue import Queue
w, h = 0, 0

def bfs(x, y, data):
    que = Queue()
    que.put((x, y))

    while not que.empty():
        x, y = que.get()
        if data[x][y] == 0:
            continue

        data[x][y] = 0
        for dx in range(-1, 2):
            for dy in range(-1, 2):
                sx, sy = x + dx, y + dy
                if sx < 0 or sx >= h or sy < 0 or sy >= w:
                    continue
                que.put((sx, sy))
    return data


while True:
    w, h = map(int, input().split())
    if w == h == 0:
        break

    data = []
    for i in range(h):
        data.append(list(map(int, input().split())))

    ans = 0
    for x in range(h):
        for y in range(w):
            if data[x][y] > 0:
                ans += 1
                data = bfs(x, y, data)
    print (ans)
Buggy python submission (verdict: Runtime Error):
from math import floor

while True:
    e = int(input())
    if e == 0:
        break

    ans = 10 ** 10
    for z in range(floor(e ** (1 / 3)) + 1):
        for y in range(floor((e - z) ** (1 / 2)) + 1):
            x = e - y ** 2 - z ** 3
            if x < 0:
                continue
            ans = min(ans, x + y + z)
    print (ans)


Fixed submission:
from math import floor

while True:
    e = int(input())
    if e == 0:
        break

    ans = 10 ** 10
    z = 0
    while z ** 3 <= e:
        y = floor((e - z **3) ** 0.5)
        x = e - y ** 2 - z ** 3
        ans = min(ans, x + y + z)
        z += 1
    print (ans)

Buggy python submission (verdict: Runtime Error):
from math import floor

while True:
    e = int(input())
    if e == 0:
        break

    ans = 10 ** 10
    for z in range(floor(e ** (1 / 3)) + 1):
        ez = e - z ** 3
        if ez < 0:
            break
        for y in range(floor(ez ** (1 / 2)) + 1):
            x = ez - y ** 2
            if x < 0:
                break
            ans = min(ans, x + y + z)
    print (ans)


Fixed submission:
from math import floor

while True:
    e = int(input())
    if e == 0:
        break

    ans = 10 ** 10
    z = 0
    while z ** 3 <= e:
        y = floor((e - z **3) ** 0.5)
        x = e - y ** 2 - z ** 3
        ans = min(ans, x + y + z)
        z += 1
    print (ans)
Buggy python submission (verdict: Runtime Error):
while True:
    t, p, r = map(int, input().split())
    if t == p == r = 0:
        break

    data = [[0 for i in range(p + 1)] for i in range(t + 1)]
    for i in range(r):
        li = input().split()
        tid, pid, time = map(int, li[:3])
        if li[3] == "WRONG":
            data[tid][pid] -= 1
        else:
            data[tid][pid] = time - data[tid][pid] * 1200

    rank = list()
    for tid in range(1, t + 1):
        ans, pen = 0, 0
        for pid in range(1, p + 1):
            if data[tid][pid] > 0:
                ans -= 1
                pen += data[tid][pid]
        rank.append((ans, pen, tid))

    for ans, pen, tid in sorted(rank):
        print(tid, -ans, pen)


Fixed submission:
while True:
    t, p, r = map(int, input().split())
    if t == p == r == 0:
        break

    data = [[0 for i in range(p + 1)] for i in range(t + 1)]
    for i in range(r):
        li = input().split()
        tid, pid, time = map(int, li[:3])
        if li[3] == "WRONG":
            data[tid][pid] -= 1
        else:
            data[tid][pid] = time - data[tid][pid] * 1200

    rank = list()
    for tid in range(1, t + 1):
        ans, pen = 0, 0
        for pid in range(1, p + 1):
            if data[tid][pid] > 0:
                ans -= 1
                pen += data[tid][pid]
        rank.append((ans, pen, tid))

    for ans, pen, tid in sorted(rank):
        print(tid, -ans, pen)
Buggy python submission (verdict: Runtime Error):
for i in range(10000):
 x = int(input())
  if (x == 0):
    break
  print("Case ",i+1, ": ",x)


Fixed submission:
for i in range(10000):
  x = int(input())
  if (x == 0):
    break
  print("Case " + str(i+1) + ": " + str(x))
Buggy python submission (verdict: Runtime Error):
n = int(input())
d = {
for i in range(n):
  card = input()
  cards[card] = 1
  
for c in ['S','H','C','D']:
  for n in range(1,14):
    card = c + ' ' + str(n)
    if not key in cards:
      print(card)


Fixed submission:
n = int(input())
cards = {}
for i in range(n):
  card = input()
  cards[card] = 1

for c in ['S', 'H', 'C', 'D']:
  for n in range(1,14):
    key = c + ' ' + str(n)
    if not key in cards:
      print(key)

Buggy python submission (verdict: Runtime Error):
n = int(input())
cards = {}
for i in range(n):
  card = input()
  cards[card] = 1
  
for c in ['S','H','C','D']:
  for n in range(1,14):
    card = c + ' ' + str(n)
    if not key in cards:
      print(key)


Fixed submission:
n = int(input())
cards = {}
for i in range(n):
  card = input()
  cards[card] = 1

for c in ['S', 'H', 'C', 'D']:
  for n in range(1,14):
    key = c + ' ' + str(n)
    if not key in cards:
      print(key)
Buggy python submission (verdict: Runtime Error):
import math
def distance():
    x1,x2,x3,x4 = map(int, input().split())
    n = (x3 - x1)**2 + (x4 - x2)**2
    ans = math.sqrt(n)
    print(ans)
    
if __name__ == '__main__':
    distance()


Fixed submission:
import math

x1,x2,x3,x4 = map(float, input().split())
n = (x3 - x1)**2 + (x4 - x2)**2
ans = math.sqrt(n)
print(ans)

Buggy python submission (verdict: Runtime Error):
import numpy as np
def distance():
    x1,x2,x3,x4 = map(float, input().split())
    n = (x3 - x1)**2 + (x4 - x2)**2
    ans = np.sqrt(n)
    print(ans)
    
if __name__ == '__main__':
    distance()


Fixed submission:
import math

x1,x2,x3,x4 = map(float, input().split())
n = (x3 - x1)**2 + (x4 - x2)**2
ans = math.sqrt(n)
print(ans)

Buggy python submission (verdict: Runtime Error):
import numpy as np

x1,x2,x3,x4 = map(float, input().split())
n = (x3 - x1)**2 + (x4 - x2)**2
ans = np.sqrt(n)
print(ans)
    



Fixed submission:
import math

x1,x2,x3,x4 = map(float, input().split())
n = (x3 - x1)**2 + (x4 - x2)**2
ans = math.sqrt(n)
print(ans)

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

x1,x2,x3,x4 = map(float, input().split())
n = (x3 - x1)**2 + (x4 - x2)**2
ans = numpy.sqrt(n)
print(ans)


Fixed submission:
import math

x1,x2,x3,x4 = map(float, input().split())
n = (x3 - x1)**2 + (x4 - x2)**2
ans = math.sqrt(n)
print(ans)
Buggy python submission (verdict: Runtime Error):
import statistics as st

while True:
    n = float(input())
    if n == 0:
        break
    scores = list(map(float, input().split()))
    std = st.stdev(scores)
    print(std)


Fixed submission:
import math

while True:
    n = float(input())
    aan = 0
    if n == 0:
        break
    scores = list(map(float, input().split()))
    total = sum(scores)
    avg = total / len(scores)
    for score in scores:
        aan += (score - avg)**2
    aa = aan / len(scores)
    a = math.sqrt(aa)
    print(a)
Buggy python submission (verdict: Runtime Error):

line = int(input().split)

area = line[0] * line[1] % 2

peri = line[0] * 2 + line[1] * 2

print(area + ' ' + peri)


Fixed submission:

line = input().split()

a = int(line[0])
b = int(line[1])

print(str(a * b) + ' ' + str((a+b) * 2))

Buggy python submission (verdict: Runtime Error):
x = input()
    a = int( x.split(' ')[0] )
    b = int( x.split(' ')[1] )
    print( a * b, (a + b) * 2 )


Fixed submission:

line = input().split()

a = int(line[0])
b = int(line[1])

print(str(a * b) + ' ' + str((a+b) * 2))

Buggy python submission (verdict: Runtime Error):
x = input()
    a = int( x.split(' ')[0] )
    b = int( x.split(' ')[1] )
    print( a * b, (a + b) * 2 )


Fixed submission:

line = input().split()

a = int(line[0])
b = int(line[1])

print(str(a * b) + ' ' + str((a+b) * 2))

Buggy python submission (verdict: Runtime Error):
x = input()
    a = int( x.split[0] )
    b = int( x.split[1] )
    print( a * b, (a + b) * 2 )


Fixed submission:

line = input().split()

a = int(line[0])
b = int(line[1])

print(str(a * b) + ' ' + str((a+b) * 2))
Buggy python submission (verdict: Runtime Error):
line = int(input())

a = line[0]
b = line[1]

if a == b:
    print(str(a) + ' == ' + str(b))
elif a > b:
    print(str(a) + ' > ' + str(b))
else:
    print(str(a) + ' < ' + str(b))


Fixed submission:
l = map(int,input().split())
l = list(l)
a =l[0]
b =l[1]

if a < b:
    print('a < b')
elif a > b:
    print('a > b')
else:
    print('a == b')

Buggy python submission (verdict: Runtime Error):

list = input().split
l = list(map(int,list))
a =l[0]
b =l[1]

if a < b:
    print('a < b')
elif a > b:
    print('a > b')
else:
    print('a == b'


Fixed submission:
l = map(int,input().split())
l = list(l)
a =l[0]
b =l[1]

if a < b:
    print('a < b')
elif a > b:
    print('a > b')
else:
    print('a == b')

Buggy python submission (verdict: Runtime Error):

list = input().split
l = list(map(int,list))
a =l[0]
b =l[1]

if a < b:
    print('a < b')
elif a > b:
    print('a > b')
else:
    print('a == b')


Fixed submission:
l = map(int,input().split())
l = list(l)
a =l[0]
b =l[1]

if a < b:
    print('a < b')
elif a > b:
    print('a > b')
else:
    print('a == b')
Buggy python submission (verdict: Runtime Error):

a = list(map(input().split()))

if a[0] =< a[1] =< a[2]:
    print('Yes')
else:
    print('No')


Fixed submission:

a = list(map(int, input().split()))

if a[0] < a[1] < a[2]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):

a = list(map(int,input().split())

if a[0] =< a[1] =< a[2]:
    print('Yes')
else:
    print('No')


Fixed submission:

a = list(map(int, input().split()))

if a[0] < a[1] < a[2]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):

a = list(map(int, input().split()))

if a[0] =< a[1] =< a[2]:
    print('Yes')
else:
    print('No')


Fixed submission:

a = list(map(int, input().split()))

if a[0] < a[1] < a[2]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
list = int(map(int, input().split()))

print(sorted(list)


Fixed submission:
list = input().split()
uplist = sorted(list)

print(" ".join(map(str,uplist)))

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

print(sorted(list))


Fixed submission:
list = input().split()
uplist = sorted(list)

print(" ".join(map(str,uplist)))

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

print(" ".join(map(str,uplist))


Fixed submission:
list = input().split()
uplist = sorted(list)

print(" ".join(map(str,uplist)))