Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
x=list(map(int,input().split()))
a,b,c=x[0],x[1],x[2]
print(str(a//b)+" "+str(a%b)+" "+str(a/b))

Fixed submission:
x=list(map(int,input().split()))
a,b= x[0],x[1]
print(str(a//b)+" "+str(a%b)+" {0:06f}".format(a/b))

Buggy python submission (verdict: Runtime Error):
x=list(map(int,input().split()))
a,b= x[0],x[1]
print(str(a//b)+" "+str(a%b)+" {0:.6f}.format(a/b)"

Fixed submission:
x=list(map(int,input().split()))
a,b= x[0],x[1]
print(str(a//b)+" "+str(a%b)+" {0:06f}".format(a/b))

Buggy python submission (verdict: Runtime Error):
x=list(map(int,input().split()))
a,b= x[0],x[1]
print(str(a//b)+" "+str(a%b)+" {0:06f}.format(a/b)"

Fixed submission:
x=list(map(int,input().split()))
a,b= x[0],x[1]
print(str(a//b)+" "+str(a%b)+" {0:06f}".format(a/b))
Buggy python submission (verdict: Runtime Error):
import math
r=int(input())
print("{0:8f} {1:8f}".format(math.pi*r*r,r*2*math.pi))

Fixed submission:
import math
r=float(input())
print("{0:8f} {1:8f}".format(math.pi*r*r,r*2*math.pi))

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

Fixed submission:
import math
r=float(input())
print("{0:8f} {1:8f}".format(math.pi*r*r,r*2*math.pi))
Buggy python submission (verdict: Runtime Error):
while True:
    if input()=="0 ? 0":
        break
    print(eval(input())

Fixed submission:
while True:
    x=input()
    if "?" in x:
        break
    print(int(eval(x.replace("/","//"))))

Buggy python submission (verdict: Runtime Error):
while True:
    if input()=="0 ? 0":
        break
    print(eval(input()))

Fixed submission:
while True:
    x=input()
    if "?" in x:
        break
    print(int(eval(x.replace("/","//"))))

Buggy python submission (verdict: Runtime Error):
while True:
    x=input()
    if x=="0 ? 0":
        break
    print(int(eval(x)))

Fixed submission:
while True:
    x=input()
    if "?" in x:
        break
    print(int(eval(x.replace("/","//"))))

Buggy python submission (verdict: Runtime Error):
while True:
    x=input()
    if x=="0 ? 0":
        break
    print(int(eval(x)))

Fixed submission:
while True:
    x=input()
    if "?" in x:
        break
    print(int(eval(x.replace("/","//"))))

Buggy python submission (verdict: Runtime Error):
while True:
    x=input()
    if x=="0 ? 0":
        break
    print(int(eval(x.replace(/,//)))

Fixed submission:
while True:
    x=input()
    if "?" in x:
        break
    print(int(eval(x.replace("/","//"))))

Buggy python submission (verdict: Runtime Error):
while True:
    x=input()
    if x=="0 ? 0":
        break
    print(int(eval(x.replace("/","//")))

Fixed submission:
while True:
    x=input()
    if "?" in x:
        break
    print(int(eval(x.replace("/","//"))))

Buggy python submission (verdict: Runtime Error):
while True:
    x=input()
    if x=="0 ? 0":
        break
    print(int(eval(x.replace("/","//"))))

Fixed submission:
while True:
    x=input()
    if "?" in x:
        break
    print(int(eval(x.replace("/","//"))))

Buggy python submission (verdict: Runtime Error):
while True:
    x=input()
    if x=="0 ? 0":
        break
    print(eval(x.replace("/","//")))

Fixed submission:
while True:
    x=input()
    if "?" in x:
        break
    print(int(eval(x.replace("/","//"))))
Buggy python submission (verdict: Runtime Error):
first=input()
hantei=list(map(int,input().split()))
print("{0} {1} {2}".format(min(hantei),max(hantei),sum(hantei))

Fixed submission:
first=input()
hantei=list(map(int,input().split()))
print("{0} {1} {2}".format(min(hantei),max(hantei),sum(hantei)))
Buggy python submission (verdict: Runtime Error):
while True:

    W,H = tuple(map(int,input().split()))
    if W==0 & H==0:
        break
    for i in range(W):
        print("#"*H)
    |

Fixed submission:
while True:

    W,H = tuple(map(int,input().split()))
    if W==0 & H==0:
        break
    for i in range(W):
        print("#"*H)
    print("")
Buggy python submission (verdict: Runtime Error):
while True:

    W,H = map(int,input().split())
    if W==0 & H==0:
        break
    print("#"*H)
    for i in range(1,W-1):
        print("#"+"."*(H-2)+"#")
    print("#"*H)
    print(\n)

Fixed submission:
while True:

    W,H = tuple(map(int,input().split()))
    if W==0 & H==0:
        break
    print("#"*H)
    for i in range(1,W-1):
        print("#"+"."*(H-2)+"#")
    print("#"*H)
    print("")

Buggy python submission (verdict: Runtime Error):
while True:

    W,H = tuple(map(int,input().split()))
    if W==0 & H==0:
        break
    print("#"*H)
    for i in range(1,W-1):
        print("#"+"."*(H-2)+"#")
    print("#"*H)
    print(\n)

Fixed submission:
while True:

    W,H = tuple(map(int,input().split()))
    if W==0 & H==0:
        break
    print("#"*H)
    for i in range(1,W-1):
        print("#"+"."*(H-2)+"#")
    print("#"*H)
    print("")
Buggy python submission (verdict: Runtime Error):
first = input()
seconds = list(map(int,input().split()))

print("".join(seconds.reverse()))

Fixed submission:
first = input()
seconds = list(map(int,input().split()))
seconds.reverse()
t2=list(map(str, seconds))
print(" ".join(t2))

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

print(" ".join(seconds.reverse()))

Fixed submission:
first = input()
seconds = list(map(int,input().split()))
seconds.reverse()
t2=list(map(str, seconds))
print(" ".join(t2))
Buggy python submission (verdict: Runtime Error):
while True:
    if input()=="-1 -1 -1":
        break
    points = list(map(int,input().split()))
    gou = points[0] + points[1]
    if gou >= 80:
        print("A")
    elif 65 <= gou < 80:
        print("B")
    elif 50 <= gou < 65:
        print("C")
    elif 30 <= gou < 50:
        if points[2] >= 50:
            print("C")
        else:
            print("D")
    else:
        print("F")

Fixed submission:
while True:
    points = list(map(int,input().split()))

    if points == [-1,-1,-1]:
        break

    gou = points[0] + points[1]
    if points[0]==-1 or points[1]==-1:
        print("F")
    elif gou >= 80:
        print("A")
    elif 65 <= gou < 80:
        print("B")
    elif 50 <= gou < 65:
        print("C")
    elif 30 <= gou < 50:
        if points[2] >= 50:
            print("C")
        else:
            print("D")
    else:
        print("F")

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

    if points == [-1,-1,-1]:
        break

    gou = points[0] + points[1]
    if -1 in points[0] or -1 in points[1]:
        print("F")
    elif gou >= 80:
        print("A")
    elif 65 <= gou < 80:
        print("B")
    elif 50 <= gou < 65:
        print("C")
    elif 30 <= gou < 50:
        if points[2] >= 50:
            print("C")
        else:
            print("D")
    else:
        print("F")

Fixed submission:
while True:
    points = list(map(int,input().split()))

    if points == [-1,-1,-1]:
        break

    gou = points[0] + points[1]
    if points[0]==-1 or points[1]==-1:
        print("F")
    elif gou >= 80:
        print("A")
    elif 65 <= gou < 80:
        print("B")
    elif 50 <= gou < 65:
        print("C")
    elif 30 <= gou < 50:
        if points[2] >= 50:
            print("C")
        else:
            print("D")
    else:
        print("F")
Buggy python submission (verdict: Runtime Error):
while True:
   x=input()
   if x="0":
       break
   cnt = 0
   for i in x:
       num = int(i)
       cnt += num
   print(cnt)

Fixed submission:
while True:
   x=input()
   if x=="0":
       break
   cnt = 0
   for i in x:
       num = int(i)
       cnt += num
   print(cnt)
Buggy python submission (verdict: Runtime Error):
zisyo=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
turn=int(input())
ten=[0,0]

for _ in range(turn):
    hikaku = input().split()
    if zisyo.index(hikaku[0][0])<zisyo.index(hikaku[1][0]):
        ten[1] +=3
    elif zisyo.index(hikaku[0][0]) == zisyo.index(hikaku[1][0]):
        ten[0]+=1
        ten[1]+=1
    elif zisyo.index(hikaku[0][0]) > zisyo.index(hikaku[1][0]):
        ten[0] +=3

print(" ".join(ten))

Fixed submission:
turn=int(input())
ten=[0,0]

for _ in range(turn):
    hikaku = input().split()
    if hikaku[0] < hikaku[1]:
        ten[1] +=3

    elif hikaku[0] > hikaku[1]:
        ten[0] +=3

    else:
        ten[0]+=1
        ten[1]+=1

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

Buggy python submission (verdict: Runtime Error):
turn=int(input())
ten=[0,0]

for _ in range(turn):
    hikaku = input().split()
    if hikaku[0] < hikaku[1]:
        ten[1] +=3

    elif hikaku[0]) > hikaku[1]:
        ten[0] +=3

    else:
        ten[0]+=1
        ten[1]+=1

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

Fixed submission:
turn=int(input())
ten=[0,0]

for _ in range(turn):
    hikaku = input().split()
    if hikaku[0] < hikaku[1]:
        ten[1] +=3

    elif hikaku[0] > hikaku[1]:
        ten[0] +=3

    else:
        ten[0]+=1
        ten[1]+=1

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

Buggy python submission (verdict: Runtime Error):
turn=int(input())
ten=[0,0]

for _ in range(turn):
    hikaku = list(map(int,input().split()))
    if hikaku[0] < hikaku[1]:
        ten[1] +=3

    elif hikaku[0]) > hikaku[1]:
        ten[0] +=3

    else:
        ten[0]+=1
        ten[1]+=1

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

Fixed submission:
turn=int(input())
ten=[0,0]

for _ in range(turn):
    hikaku = input().split()
    if hikaku[0] < hikaku[1]:
        ten[1] +=3

    elif hikaku[0] > hikaku[1]:
        ten[0] +=3

    else:
        ten[0]+=1
        ten[1]+=1

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

Buggy python submission (verdict: Runtime Error):
turn=int(input())
ten=[0,0]

for _ in range(turn):
    hikaku = list(map(int,input().split()))
    if hikaku[0] < hikaku[1]:
        ten[1] +=3

    elif hikaku[0] > hikaku[1]:
        ten[0] +=3

    else:
        ten[0]+=1
        ten[1]+=1

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

Fixed submission:
turn=int(input())
ten=[0,0]

for _ in range(turn):
    hikaku = input().split()
    if hikaku[0] < hikaku[1]:
        ten[1] +=3

    elif hikaku[0] > hikaku[1]:
        ten[0] +=3

    else:
        ten[0]+=1
        ten[1]+=1

print(" ".join(map(str,ten)))
Buggy python submission (verdict: Time Limit Exceeded):
def g(n):
    for _ in range(n):
        t = int(input())

        if t == 2 or t == 3:
            yield 1
        else:
            for i in range(2, t // 2 + 1):
                if t % i == 0:
                    yield 0
                    break
            else:
                yield 1

n = int(input())
print(sum(g(n)))

Fixed submission:
from math import sqrt

def f(n):
    if n == 2:
        return 1

    if n % 2 == 0:
        return 0

    for i in range(3, round(sqrt(n)+1), 2):
        if n % i == 0:
            return 0
    else:
        return 1

def g(n):
    d = {}
    for _ in range(n):
        i = int(input())
        if not (i in d):
            d[i] = f(i)
        yield d[i]

n = int(input())
print(sum(g(n)))

Buggy python submission (verdict: Time Limit Exceeded):
from functools import lru_cache

@lru_cache(maxsize=None)
def g(n):
    for _ in range(n):
        t = int(input())

        if t == 2 or t == 3:
            yield 1
        else:
            for i in range(2, t // 2 + 1):
                if t % i == 0:
                    yield 0
                    break
            else:
                yield 1

n = int(input())
print(sum(g(n)))

Fixed submission:
from math import sqrt

def f(n):
    if n == 2:
        return 1

    if n % 2 == 0:
        return 0

    for i in range(3, round(sqrt(n)+1), 2):
        if n % i == 0:
            return 0
    else:
        return 1

def g(n):
    d = {}
    for _ in range(n):
        i = int(input())
        if not (i in d):
            d[i] = f(i)
        yield d[i]

n = int(input())
print(sum(g(n)))

Buggy python submission (verdict: Runtime Error):
from math import ceil, sqrt

def f(n):
    if n == 2:
        return 1

    if n % 2 == 0:
        return 0

    for i in range(3, ceil(sqrt(n)), 2):
        if pred(n, i):
            return 0
    else:
        return 1

def g(n):
    d = {}
    for _ in range(n):
        i = int(input())
        if not (i in d):
            d[i] = f(i)
        yield d[i]

n = int(input())
print(sum(g(n)))

Fixed submission:
from math import sqrt

def f(n):
    if n == 2:
        return 1

    if n % 2 == 0:
        return 0

    for i in range(3, round(sqrt(n)+1), 2):
        if n % i == 0:
            return 0
    else:
        return 1

def g(n):
    d = {}
    for _ in range(n):
        i = int(input())
        if not (i in d):
            d[i] = f(i)
        yield d[i]

n = int(input())
print(sum(g(n)))
Buggy python submission (verdict: Runtime Error):
class Converter:
    d = {
        "1 2": 2,
        "1 3": 4,
        "1 4": 1,
        "1 5": 3,
        "2 1": 3,
        "2 3": 0,
        "2 4": 5,
        "2 6": 2,
        "3 1": 1,
        "3 2": 5,
        "3 5": 0,
        "3 6": 4,
        "4 1": 4,
        "4 2": 0,
        "4 5": 5,
        "4 6": 1,
        "5 1": 2,
        "5 3": 5,
        "5 4": 0,
        "5 6": 3,
        "6 2": 3,
        "6 3": 1,
        "6 4": 4,
        "6 5": 2,
        }

    def __init__(self, s):
        self.pip = s.split()

    def __call__(self, s):
        print(self.pip[self.d[s]])

cv = Converter(input())
n = int(input())
for _ in range(n):
    cv(input())

Fixed submission:
class Converter:
    d = {
        1: { 2: 3, 3: 5, 4: 2, 5: 4, },
        2: { 1: 4, 3: 1, 4: 6, 6: 3, },
        3: { 1: 2, 2: 6, 5: 1, 6: 5, },
        4: { 1: 5, 2: 1, 5: 6, 6: 2, },
        5: { 1: 3, 3: 6, 4: 1, 6: 4, },
        6: { 2: 4, 3: 2, 4: 5, 5: 3, }
        }

    def __init__(self, s):
        l = s.split()
        self.tbl = dict(zip(l, range(1,7)))
        self.pip = dict(zip(range(1,7), l))

    def __call__(self, s):
        l, r = s.split()
        print(self.pip[self.d[self.tbl[l]][self.tbl[r]]])

cv = Converter(input())
n = int(input())
for _ in range(n):
    cv(input())
Buggy python submission (verdict: Runtime Error):
class Checker:
    d = {
        1: { 2: (3,4,5,6), 3: (5,2,4,6), 4: (2,5,3,6), 5: (4,3,2,6) },
        2: { 1: (4,3,6,5), 3: (1,6,4,5), 4: (6,1,3,5), 6: (3,4,1,5) },
        3: { 1: (2,5,6,4), 2: (6,1,5,4), 5: (1,6,2,4), 6: (5,2,1,4) },
        4: { 1: (5,2,6,3), 2: (1,6,5,3), 5: (6,1,2,3), 6: (2,5,1,3) },
        5: { 1: (3,4,6,2), 3: (6,1,4,2), 4: (1,6,3,2), 6: (4,3,1,2) },
        6: { 2: (4,3,5,1), 3: (2,5,4,1), 4: (5,2,3,1), 5: (3,4,2,1) }
        }

    def __init__(self, s):
        l = s.split()
        self.tbl = {}
        for c,i in zip(l, range(1,7)):
            if c in self.tbl:
                self.tbl[c].append(i)
            else:
                self.tbl[c] = [i]
        self.pip = dict(zip(range(1,7), l))

    def __call__(self, s):
        l = s.split()
        for i0 in self.tbl[l[0]]:
            for i1 in self.tbl[l[1]]:
                if i1 in self.d[i0]:
                    for i,j in zip(self.d[i0][i1], range(2,6)):
                        if self.pip[i] != l[j]:
                            break
                    else:
                        return True
        return False

def g():
    n = int(input()) - 1
    c = Checker(input())
    for _ in range(n):
        yield c(input())

if any(g()):
    print("No")
else:
    print("Yes")

Fixed submission:
class Checker:
    d = {
        1: { 2: (3,4,5,6), 3: (5,2,4,6), 4: (2,5,3,6), 5: (4,3,2,6) },
        2: { 1: (4,3,6,5), 3: (1,6,4,5), 4: (6,1,3,5), 6: (3,4,1,5) },
        3: { 1: (2,5,6,4), 2: (6,1,5,4), 5: (1,6,2,4), 6: (5,2,1,4) },
        4: { 1: (5,2,6,3), 2: (1,6,5,3), 5: (6,1,2,3), 6: (2,5,1,3) },
        5: { 1: (3,4,6,2), 3: (6,1,4,2), 4: (1,6,3,2), 6: (4,3,1,2) },
        6: { 2: (4,3,5,1), 3: (2,5,4,1), 4: (5,2,3,1), 5: (3,4,2,1) }
        }

    def __init__(self, s):
        l = s.split()
        self.tbl = {}
        for c,i in zip(l, range(1,7)):
            if c in self.tbl:
                self.tbl[c].append(i)
            else:
                self.tbl[c] = [i]
        self.pip = dict(zip(range(1,7), l))

    def __call__(self, s):
        l = s.split()

        if not (l[0] in self.tbl):
            return False
        if not (l[1] in self.tbl):
            return False

        for i0 in self.tbl[l[0]]:
            for i1 in self.tbl[l[1]]:
                if i1 in self.d[i0]:
                    for i,j in zip(self.d[i0][i1], range(2,6)):
                        if self.pip[i] != l[j]:
                            break
                    else:
                        return True
        return False

def g():
    n = int(input()) - 1
    c = Checker(input())
    for _ in range(n):
        yield c(input())

if any(g()):
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
def pred(W, H, x, y, r)
    if x - r < 0 or y - r < 0 or x + r > W or y + r > H:
        return False
    else:
        return True

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

print("Yes" if pred(*a) else "No")

Fixed submission:
def pred(w, h, x, y, r):
    if x - r < 0 or y - r < 0 or x + r > w or y + r > h:
        return False
    else:
        return True

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

print("Yes" if pred(*a) else "No")
Buggy python submission (verdict: Runtime Error):
from itertools import count

for i in count(1):
    s = input()

    if s = "0":
        break
    else:
        print("Case {}: {}".format(i, s))

Fixed submission:
from itertools import count

for i in count(1):
    s = input()

    if s == "0":
        break
    else:
        print("Case {}: {}".format(i, s))

Buggy python submission (verdict: Runtime Error):
from itertools import count
??
for i in count(1):
????????s = input()
??
????????if s == "0":
????????????????break
????????else:
????????????????print("Case {}: {}".format(i, s))

Fixed submission:
from itertools import count

for i in count(1):
    s = input()

    if s == "0":
        break
    else:
        print("Case {}: {}".format(i, s))

Buggy python submission (verdict: Runtime Error):
from itertools import count

for i in count(1):
    if i == 10:
        break
    else:
        print("Case {}: {}".format(i, s))

Fixed submission:
from itertools import count

for i in count(1):
    s = input()

    if s == "0":
        break
    else:
        print("Case {}: {}".format(i, s))

Buggy python submission (verdict: Time Limit Exceeded):
from itertools import count

for i in count(1):
    if i == "0":
        break
    else:
        print(i)

Fixed submission:
from itertools import count

for i in count(1):
    s = input()

    if s == "0":
        break
    else:
        print("Case {}: {}".format(i, s))
Buggy python submission (verdict: Runtime Error):
from math import pi

r = int(input())
print("{:.6f} {:.6f}".format(pi*r*r, 2*pi*r))

Fixed submission:
from math import pi

r = float(input())
print("{:.6f} {:.6f}".format(pi*r*r, 2*pi*r))
Buggy python submission (verdict: Time Limit Exceeded):
from itertools import islice

def make_gen():
    n, m, l = list(map(int, input().split()))

    m1 = [list(map(int, input().split())) for _ in range(n)]
    m2 = [list(map(int, input().split())) for _ in range(m)]

    def g():
        for r1 in m1:
            for r2 in zip(*m2):
                yield str(sum(i*j for i, j in zip(r1, r2)))

    return (n, l, g)

n, l, g = make_gen()
for i in range(n):
    print(" ".join(islice(g(), i*l, (i+1)*l)))

Fixed submission:
from itertools import islice

def make_seq():
    n, m, l = list(map(int, input().split()))

    m1 = [list(map(int, input().split())) for _ in range(n)]
    m2 = [list(map(int, input().split())) for _ in range(m)]

    def g():
        for r1 in m1:
            for r2 in zip(*m2):
                yield str(sum(i*j for i, j in zip(r1, r2)))

    return (n, l, list(g()))

n, l, lst = make_seq()
for i in range(n):
    print(" ".join(islice(lst, i*l, (i+1)*l)))
Buggy python submission (verdict: Runtime Error):
from collections import deque

n=int(input())
command=[0 for i in range(n)]
k=[0 for i in range(n)]
k_queue= deque([])

for i in range(n):
    s=input()
    if s=="deleteFirst" or s=="deleteLast":
        command[i],k[i]=s,0
    else:
        command[i],k[i]=s.split()
    
    if command[i]=="insert":
        k_queue.appendleft(k[i])
    elif command[i]=="deleteFirst":
        k_queue.popleft()
    elif command[i]=="deleteLast":
        k_queue.pop()
    else:
        k_queue.remove(k[i])

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


Fixed submission:
from collections import deque
 
n=int(input())
command=[0 for i in range(n)]
k=[0 for i in range(n)]
k_queue= deque([])
 
for i in range(n):
    s=input()
    if s=="deleteFirst" or s=="deleteLast":
        command[i],k[i]=s,0
    else:
        command[i],k[i]=s.split()
     
for i in range(n):
    if command[i]=="insert":
        k_queue.appendleft(k[i])
    elif command[i]=="deleteFirst":
        k_queue.popleft()
    elif command[i]=="deleteLast":
        k_queue.pop()
    else:
        try: k_queue.remove(k[i])
        except ValueError: y=0
print( " ".join(map(str, k_queue)))

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque

n=int(input())
command=[0 for i in range(n)]
k=[0 for i in range(n)]
k_queue= deque([])

for i in range(n):
    s=input()
    if s=="deleteFirst" or s=="deleteLast":
        command[i],k[i]=s,0
    else:
        command[i],k[i]=s.split()
    
    if command[i]=="insert":
        k_queue.appendleft(k[i])
    elif command[i]=="deleteFirst":
        k_queue.popleft()
    elif command[i]=="deleteLast":
        k_queue.pop()
    else:
        try: k_queue.remove(k[i])
        except ValueError: y=0
print( " ".join(map(str, k_queue)))









Fixed submission:
from collections import deque
 
n=int(input())
command=[0 for i in range(n)]
k=[0 for i in range(n)]
k_queue= deque([])
 
for i in range(n):
    s=input()
    if s=="deleteFirst" or s=="deleteLast":
        command[i],k[i]=s,0
    else:
        command[i],k[i]=s.split()
     
for i in range(n):
    if command[i]=="insert":
        k_queue.appendleft(k[i])
    elif command[i]=="deleteFirst":
        k_queue.popleft()
    elif command[i]=="deleteLast":
        k_queue.pop()
    else:
        try: k_queue.remove(k[i])
        except ValueError: y=0
print( " ".join(map(str, k_queue)))
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python
# -*- coding : utf-8 -*-
while True:
    m, f, r = map(int,input().split())
    if m + f >= 80:
        print("A")
    elif m + f >= 65 and m + f < 80:
        print("B")
    elif m + f >= 50 and m + f < 65:
        print("C")
    elif m + f >= 30 and m + f < 50:
        if r >= 50:
            print("C")
        else:
            print("D")
    elif m + f < 30:
        print("F")

Fixed submission:
#! /usr/bin/env python
# -*- coding : utf-8 -*-
while True:
    m, f, r = map(int,input().split())
    if r == m == f == -1:
        break
    elif m == -1 or f == -1:
        print('F')
    elif m + f >= 80:
        print("A")
    elif m + f >= 65 and m + f < 80:
        print("B")
    elif m + f >= 50 and m + f < 65:
        print("C")
    elif m + f >= 30 and m + f < 50:
        if r >= 50:
            print("C")
        else:
            print("D")
    elif m + f < 30:
        print("F")