Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
from sys import stdin

x = [int(input()) for i in range(10)]
x.sort().reverse()
for i in range(3):
    print(i)

Fixed submission:
from sys import stdin

x = [int(input()) for i in range(10)]
x.sort(reverse=True)
for i in range(3):
    print(x[i])
Buggy python submission (verdict: Runtime Error):
import re

while True:
    n = int(raw_input())
    for i in range(n):
        print re.sub("Hoshino", "Hoshina", raw_input())

Fixed submission:
n = int(raw_input())
for i in range(n):
    print raw_input().replace("Hoshino", "Hoshina")
Buggy python submission (verdict: Runtime Error):
DIR = {">": (0, 1), "<": (0, -1), "^": (-1, 0), "v": (1, 0)}

while True:
    w, h = m(int, raw_input().split())
    if w == 0 and h == 0:
        break

    m = []
    for i in range(w):
        m.append([c for c in raw_input().strip()])

    x = 0
    y = 0
    while m[x][y] != '.':
        i = m[x][y]
        if i == 'x':
            break
        m[x][y] = 'x'
        x += DIR[i][0]
        y += DIR[i][1]

    if m[x][y] == '.':
        print("{} {}".format(y, x))
    else:
        print("LOOP")

Fixed submission:
DIR = {'>': (0, 1),
       '<': (0, -1),
       '^': (-1, 0),
       'v': (1, 0)}

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

    m = [[] for i in range(w)]
    for i in range(w):
        m[i] = [c for c in raw_input().strip()]

    x = 0
    y = 0
    while m[x][y] != '.':
        if m[x][y] == 'x':
            break
        else:
            d = m[x][y]
            m[x][y] = 'x'
            x += DIR[d][0]
            y += DIR[d][1]

    if m[x][y] == '.':
        print("{} {}".format(y, x))
    else:
        print("LOOP")

Buggy python submission (verdict: Runtime Error):
DIR = {">": (0, 1), "<": (0, -1), "^": (-1, 0), "v": (1, 0)}

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

    m = [[] in i for range(w)]
    for i in range(w):
        m[i] = [c for c in raw_input().strip()]

    x = 0
    y = 0
    while m[x][y] != '.':
        i = m[x][y]
        if i == 'x':
            break
        m[x][y] = 'x'
        x += DIR[i][0]
        y += DIR[i][1]

    if m[x][y] == '.':
        print("{} {}".format(y, x))
    else:
        print("LOOP")

Fixed submission:
DIR = {'>': (0, 1),
       '<': (0, -1),
       '^': (-1, 0),
       'v': (1, 0)}

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

    m = [[] for i in range(w)]
    for i in range(w):
        m[i] = [c for c in raw_input().strip()]

    x = 0
    y = 0
    while m[x][y] != '.':
        if m[x][y] == 'x':
            break
        else:
            d = m[x][y]
            m[x][y] = 'x'
            x += DIR[d][0]
            y += DIR[d][1]

    if m[x][y] == '.':
        print("{} {}".format(y, x))
    else:
        print("LOOP")
Buggy python submission (verdict: Runtime Error):
from sys import stdout

cs = {
    1: [None] + list("abcde"),
    2: [None] + list("fghij"),
    3: [None] + list("klmno"),
    4: [None] + list("pqrst"),
    5: [None] + list("uvwxy"),
    6: [None] + list("z.?! "),
}

while True:
    try:
        it = iter(raw_input().strip())
    except ValueError:
        break

    try:
        r = c = None
        s = []
        while True:
            r = int(it.next())
            c = int(it.next())
            s += [cs[r][c]]
            r = c = None
    except IndexError:
        stdout.write("NA\n")
    except StopIteration:
        if not r and not c:
            stdout.write(''.join(s) + "\n")
        else:
            stdout.write("NA\n")
        continue

Fixed submission:
from sys import stdout

cs = {
    1: [None] + list("abcde"),
    2: [None] + list("fghij"),
    3: [None] + list("klmno"),
    4: [None] + list("pqrst"),
    5: [None] + list("uvwxy"),
    6: [None] + list("z.?! "),
}

while True:
    try:
        it = iter(raw_input().strip())
    except EOFError:
        break

    try:
        r = c = None
        s = []
        while True:
            r = int(it.next())
            c = int(it.next())
            s += [cs[r][c]]
            r = c = None
    except KeyError:
        stdout.write("NA\n")
    except IndexError:
        stdout.write("NA\n")
    except StopIteration:
        if not r and not c:
            stdout.write(''.join(s) + "\n")
        else:
            stdout.write("NA\n")
        continue

Buggy python submission (verdict: Runtime Error):
from sys import stdout

cs = {
    1: [None] + list("abcde"),
    2: [None] + list("fghij"),
    3: [None] + list("klmno"),
    4: [None] + list("pqrst"),
    5: [None] + list("uvwxy"),
    6: [None] + list("z.?! "),
}

while True:
    try:
        it = iter(raw_input().strip())
    except ValueError:
        break

    try:
        r = c = None
        s = []
        while True:
            r = int(it.next())
            c = int(it.next())
            s += [cs[r][c]]
            r = c = None
    except KeyError:
        stdout.write("NA\n")
    except IndexError:
        stdout.write("NA\n")
    except StopIteration:
        if not r and not c:
            stdout.write(''.join(s) + "\n")
        else:
            stdout.write("NA\n")
        continue

Fixed submission:
from sys import stdout

cs = {
    1: [None] + list("abcde"),
    2: [None] + list("fghij"),
    3: [None] + list("klmno"),
    4: [None] + list("pqrst"),
    5: [None] + list("uvwxy"),
    6: [None] + list("z.?! "),
}

while True:
    try:
        it = iter(raw_input().strip())
    except EOFError:
        break

    try:
        r = c = None
        s = []
        while True:
            r = int(it.next())
            c = int(it.next())
            s += [cs[r][c]]
            r = c = None
    except KeyError:
        stdout.write("NA\n")
    except IndexError:
        stdout.write("NA\n")
    except StopIteration:
        if not r and not c:
            stdout.write(''.join(s) + "\n")
        else:
            stdout.write("NA\n")
        continue
Buggy python submission (verdict: Runtime Error):
while True:
    n = raw_input()
    if not n:
        break
    else:
        n = int(n)
        print "3C{0:0>2}".format(n % 39)

Fixed submission:
while True:
    try:
        n = int(raw_input())
        m = n % 39
        print "3C{0:0>2}".format(m if m != 0 else 39)
    except:
        break
Buggy python submission (verdict: Runtime Error):
import math


def check(a):
    for i, v in enumerate(a):
        if v != i + 1:
            return False
        else:
            if i == len(a) - 1:
                return True


while True:
    n = int(raw_input())
    if n == 0:
        break

    a = map(int, raw_input().split())
    if sum(a) != (lambda s: s * (s + 1) // 2)(int(math.sqrt(sum(a) * 2))):
        print -1
    else:
        c = 0
        while not check(a):
            c += 1
            a = [x - 1 for x in a if x - 1 != 0].append(len(a))
            if c == 10000:
                c = -1
                break

        print c

Fixed submission:
import math


def check(a):
    for i, v in enumerate(a):
        if v != i + 1:
            return False
        else:
            if i == len(a) - 1:
                return True


while True:
    n = int(raw_input())
    if n == 0:
        break

    a = map(int, raw_input().split())
    if sum(a) != (lambda s: s * (s + 1) // 2)(int(math.sqrt(sum(a) * 2))):
        print -1
    else:
        c = 0
        while not check(a):
            c += 1
            a = [x - 1 for x in a if x - 1 != 0] + [len(a)]
            if c == 10000:
                c = -1
                break

        print c
Buggy python submission (verdict: Runtime Error):
print map(int,raw_input().split(' ')).sort().join(' ')

Fixed submission:
a = sorted(map(int, raw_input().split(' ')))
for i in a:
    print i,
Buggy python submission (verdict: Runtime Error):
def act(t,m,l):
    t = (t+m) % len(l);
    del l[t-1]
    return (t-1) % (len(l)+1)

while True:
    i = raw_input().split()

    n = int(i[0])
    m = int(i[1])

    if n == 0 and m == 0:
        break
    else:
        l = range(1,n+1)
        t = 0
        for i in range(n-1):
            tt = act(t,m,l);
            t = tt;
        print l[0]

Fixed submission:
def act(t,m,l):
    t = (t+m) % len(l);
    del l[t-1]
    return (t-1) % (len(l)+1)

while True:
    i = raw_input().split()

    n = int(i[0])
    m = int(i[1])

    if n == 0 and m == 0:
        break
    else:
        l = range(1,n+1)
        t = 0
        for i in range(n-1):
            tt = act(t,m,l);
            t = tt;
        print l[0]
Buggy python submission (verdict: Time Limit Exceeded):
[n,q] = map(int,input().split())

t = [ 0 for _ in range(n) ]
for _ in range(q):
    [a,v] = map(int,input().split())
    t[a-1] += v

    p = t.index(max(t))

    print("{} {}".format(p+1,t[p]))

Fixed submission:
[n,q] = map(int,input().split())

t = [ 0 for _ in range(n) ]

max_idx = 0
max_val = 0

for _ in range(q):
    [a,v] = map(int,input().split())
    t[a-1] += v

    if max_idx == a-1:
        if v > 0:
            max_val = t[a-1]
        else:
            max_val = max(t)
            max_idx = t.index(max_val)
    elif t[a-1] > max_val:
        max_val = t[a-1]
        max_idx = a-1
    elif t[a-1] == max_val:
        if a-1 < max_idx:
            max_val = t[a-1]
            max_idx = a-1

    print("{} {}".format(max_idx+1,max_val))
Buggy python submission (verdict: Runtime Error):
def search(n,d,t):
    b = 0
    e = n
    r = 0
    while True:
        r += 1
        if b > e:
            return r
        else:
            i = (b+e)//2
            if t == d[i]:
                return r
            elif t < d[i]:
                e = i - 1
            else:
                b = i + 1
while True:
    n = int(input())
    if n == 0:
        break
    d = [int(input()) for i in range(n)]
    t = int(input())

    m = search(n,d,t)
    print(m)
    

Fixed submission:
def search(n,d,t):
    b = 0
    e = n-1
    r = 0
    while True:
        if b > e:
            return r
        else:
            r += 1
            i = (b+e)//2
            if t == d[i]:
                return r
            elif t < d[i]:
                e = i - 1
            else:
                b = i + 1
while True:
    n = int(input())
    if n == 0:
        break
    d = [int(input()) for i in range(n)]
    t = int(input())

    m = search(n,d,t)
    print(m)

Buggy python submission (verdict: Runtime Error):
def search(n,d,t):
    b = 0
    e = n
    r = 0
    while True:
        r += 1
        if b > e:
            return r
        else:
            i = (b+e)//2
            if t == d[i]:
                return r
            elif t < d[i]:
                e = i - 1
            else:
                b = i + 1
while True:
    n = int(input())
    if n == 0:
        break
    d = [int(input()) for i in range(n)]
    t = int(input())

    m = search(n,d,t)
    print(m)

Fixed submission:
def search(n,d,t):
    b = 0
    e = n-1
    r = 0
    while True:
        if b > e:
            return r
        else:
            r += 1
            i = (b+e)//2
            if t == d[i]:
                return r
            elif t < d[i]:
                e = i - 1
            else:
                b = i + 1
while True:
    n = int(input())
    if n == 0:
        break
    d = [int(input()) for i in range(n)]
    t = int(input())

    m = search(n,d,t)
    print(m)
Buggy python submission (verdict: Time Limit Exceeded):
def mul(v,u):
    s = 0
    for i in range(len(v)):
        s += v[i]*u[i]
    return s

[n,m] = list(map(int,input().split()))

t = [ list( 0 for i in range(m) ) for j in range(n) ]

while True:
    d = list(map(int,input().split()))
    if d == [0,0,0]:
        break
    else:
        t[d[0]-1][d[1]-1] = d[2]

c = int(input())
p = [ list(map(int,input().split())) for i in range(c) ]

for i in range(c):
    r = []
    for j in range(n):
        r.append( mul(p[i],t[j]) )
    print(" ".join(map(str,r)))

Fixed submission:
def mul(v,u):
    s = 0
    for i in range(len(u)):
        s += v[u[i][0]] * u[i][1]
    return s

[n,m] = list(map(int,input().split()))

t = [ [] for j in range(n) ]

while True:
    d = list(map(int,input().split()))
    if d == [0,0,0]:
        break
    else:
        t[d[0]-1].append([d[1]-1,d[2]])

c = int(input())
p = [ list(map(int,input().split())) for i in range(c) ]

for i in range(c):
    r = []
    for j in range(n):
        r.append( mul(p[i],t[j]) )
    print(" ".join(map(str,r)))
Buggy python submission (verdict: Time Limit Exceeded):
N,M,Q = map(int,input().split())

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

t = [ 1 for i in range(N) ]
i = 0
for m in range(M):
    if a[m] % 2 == 1:
        s = -1
    else:
        s =  1
    aa = a[m]

    while aa > 0:
        i = (i + s) % N
        if t[i] == 1:
            aa -= 1
    t[i] = 0
    while True:
        i = (i + 1) % N
        if t[i] == 1:
            break;
for i in q:
    print(t[i])



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

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

t = [ i for i in range(N) ]
n = N
i = 0
for aa in a:
    if aa % 2 == 1:
        i = (i - aa) % n
    else:
        i = (i + aa) % n
    del t[i]
    n -= 1
    
for i in q:
    if i in t:
        print(1)
    else:
        print(0)
Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
u = raw_input()
q = int(raw_input())

def cmd_set(q,u):
    x = int(q[0])
    y = int(q[1])
    z = q[2]

    h = u[:x-1]
    t = u[y:]
    zz= z*(y-x+1)

    return h+zz+t

def cmd_comp(q, u):
    a = int(q[0])
    b = int(q[1])
    c = int(q[2])
    d = int(q[3])

    s = u[a-1:b]
    t = u[c-1:d]
    if s < t:
        print "s"
    elif s > t:
        print "t"
    else:
        print "e"

for i in range(q):
    q = raw_input().split()
    cmd = q[0]
    q.pop(0)

    if cmd == 'comp':
        cmd_comp(q, u)
    elif cmd == 'set':
        u = cmd_set(q, u)

Fixed submission:
n = int(raw_input())
u = raw_input()
q = int(raw_input())

def cmd_set(q,u):
    x = int(q[0])
    y = int(q[1])
    z = q[2]

    h = u[:x-1]
    t = u[y:]
    zz= z*(y-x+1)

    return h+zz+t

def cmd_comp(q, u):
    a = int(q[0])
    b = int(q[1])
    c = int(q[2])
    d = int(q[3])

    s = u[a-1:b]
    t = u[c-1:d]
    if s < t:
        print "s"
    elif s > t:
        print "t"
    else:
        print "e"

for i in range(q):
    q = raw_input().split()
    cmd = q[0]
    q.pop(0)

    if cmd == 'comp':
        cmd_comp(q, u)
    elif cmd == 'set':
        u = cmd_set(q, u)
Buggy python submission (verdict: Runtime Error):
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
#include <set>
#include <iostream>
#include <map>
#include <functional>
#include <cstdlib>
#include <numeric>
#include <queue>
#include <complex>
#include <sstream>
#include <stack>

using namespace std;

#define reep(i, f, n) for (int i = f; i < n; ++i)
#define rep(i, n) reep(i, 0, n)


int main(){
    float x1,x2,x3,y1,y2,y3,gx,gy,G,Xc,Yc,r;
    int n;
    scanf("%d", &n);
    for (int i=0;i<n;i++) {
        scanf("%f %f %f %f %f %f", &x1, &y1, &x2, &y2, &x3, &y3);
        gx = (x1+x2+x3)/3;
        gy = (y1+y2+y3)/3;
        G =( y2*x1-y1*x2 +y3*x2-y2*x3 +y1*x3-y3*x1 );
        Xc = ((x1*x1+y1*y1)*(y2-y3)+(x2*x2+y2*y2)*(y3-y1)+(x3*x3+y3*y3)*(y1-y2))/(2*G);
        Yc =-((x1*x1+y1*y1)*(x2-x3)+(x2*x2+y2*y2)*(x3-x1)+(x3*x3+y3*y3)*(x1-x2))/(2*G);
        r = sqrt( (x1 - Xc) * (x1 - Xc) + (y1 - Yc) * (y1 - Yc) );
        printf("%.3f %.3f %.3f\n", Xc, Yc, r);
    }
    return EXIT_SUCCESS;
}


Fixed submission:
n = int(input())
for _ in range(n):
    x1,y1,x2,y2,x3,y3 = map(float, input().split())
    gx = (x1+x2+x3)/3
    gy = (y1+y2+y3)/3
    G=( y2*x1-y1*x2 +y3*x2-y2*x3 +y1*x3-y3*x1 )
    Xc= ((x1*x1+y1*y1)*(y2-y3)+(x2*x2+y2*y2)*(y3-y1)+(x3*x3+y3*y3)*(y1-y2))/(2*G)
    Yc=-((x1*x1+y1*y1)*(x2-x3)+(x2*x2+y2*y2)*(x3-x1)+(x3*x3+y3*y3)*(x1-x2))/(2*G)
    r = ( (x1 - Xc) * (x1 - Xc) + (y1 - Yc) * (y1 - Yc) )**0.5
    print("%.3f %.3f %.3f"%(Xc,Yc,r))
Buggy python submission (verdict: Time Limit Exceeded):
from itertools import product
while(True):
    H,W = map(int,input().split())
    if not H: break
    ma = 0
    for i in range(H):
        ma |= (int(input().replace(".","0").replace("*","1"),2) << ((H-i-1)*W))
    flag = False
    hw = [[h,w] for h,w in product(range(H,0,-1),range(W,0,-1))]
    hw = sorted(hw,key=lambda x: -x[1]*x[0])
    ans = 0
    for h,w in hw:
        for i,j in product(range(H-h+1),range(W-w+1)):
            b = (sum([((2**w-1) << j) << k*W for k in range(h)]) ) << i*W
            c = ma&b
            if not c :flag = True; ans = max(ans,h*w); break
        else:
            continue
        if flag: break
    print(ans)



Fixed submission:
# ref: http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=924554#1
from itertools import product
while(True):
    H,W = map(int,input().split())
    if not H: break
    ma = [list(map(int,input().replace(".","1").replace("*","0")))+[0] for _ in range(H)]
    for i,j in product(range(1,H),range(W)):
        if ma[i][j]: ma[i][j] += ma[i-1][j]
    ans = 0
    for i in range(H):
        stk = []
        for j in range(W+1):
            cur = ma[i][j]
            if (not stk) or stk[-1][1] < cur:
                stk.append([j,cur])
            elif stk[-1][1] > cur:
                idx = j
                while stk and stk[-1][1] >= cur:
                    idx = stk[-1][0]
                    ans = max(ans,stk[-1][1]*(j-stk[-1][0]))
                    stk.pop()
                stk.append([idx,cur])
    print(ans)
Buggy python submission (verdict: Runtime Error):
while(True):
    m,n = map(int,input().split())
    if not m: break
    a = list(range(1,m+1))
    b = [input() for _ in range(n)]
    t = [str(i+1) for i in range(n)]
    t[2::3]   = ["Fizz"]*len(t[2::3])
    t[4::5]   = ["Buzz"]*len(t[4::5])
    t[14::15] = ["FizzBuzz"]*len(t[14::15])
    i=0
    for j in range(n):
        if len(a) <2: break
        if b[j] != t[j]: del a[i]; continue
        i += 1
        i = i%len(a)
    print(" ".join(str(e) for e in a))


Fixed submission:
while(True):
    m,n = map(int,input().split())
    if not m: break
    a = list(range(1,m+1))
    b = [input() for _ in range(n)]
    t = [str(i+1) for i in range(n)]
    t[2::3]   = ["Fizz"]*len(t[2::3])
    t[4::5]   = ["Buzz"]*len(t[4::5])
    t[14::15] = ["FizzBuzz"]*len(t[14::15])
    i=0
    for j in range(n):
        if len(a) <2: break
        if b[j] != t[j]: del a[i]; i = 0 if i >= len(a) else i; continue
        i += 1
        i = i%len(a)
    print(" ".join(str(e) for e in a))
Buggy python submission (verdict: Time Limit Exceeded):
from math import sqrt, ceil

N = 10100000
temp = [True]*(N+1)
temp[0] = temp[1] = False
for i in range(2, ceil(sqrt(N+1))):
    if temp[i]:
        temp[i+i::i] = [False]*(len(temp[i+i::i]))

quadruplet = [True, False, True, False, False, False, True, False,True]
ans = [0]*N
for i in range(8,N):
    if temp[i] and temp[i-8:i+1] == quadruplet: ans[i] = i
while True:
    n = int(input())
    if not n: break
    print(max(ans[:n+1]))


Fixed submission:
from math import sqrt, ceil

N = 10100000
temp = [True]*(N+1)
temp[0] = temp[1] = False
for i in range(2, ceil(sqrt(N+1))):
    if temp[i]:
        temp[i+i::i] = [False]*(len(temp[i+i::i]))

quadruplet = [True, False, True, False, False, False, True, False,True]
ans = [0]*N
for i in range(8,N):
    if temp[i] and temp[i-8:i+1] == quadruplet: ans[i] = i
    else: ans[i] = ans[i-1]
while True:
    n = int(input())
    if not n: break
    print(ans[n])
Buggy python submission (verdict: Runtime Error):
import math
def combination(p, q):
    if q < 0 or p < q:
        return 0
    return math.factorial(p) / math.factorial(q) / math.factorial(p - q)
a, b, c = map(int, input().split())
c -= a * b
print(int(combination(c + a - 1, c)))

Fixed submission:
import math
def combination(p, q):
    if q < 0 or p < q:
        return 0
    return math.factorial(p) // math.factorial(q) // math.factorial(p - q)
a, b, c = map(int, input().split())
c -= a * b
print(combination(c + a - 1, c))
Buggy python submission (verdict: Runtime Error):
#include<stdio.h>
char a, b;int main(){for(a=1;a<=9;a++)for(b=1;b<=9;b++)printf("%dx%d=%d\n",a,b,a*b);return 0;}

Fixed submission:
for i in range(1,10):
    for j in range(1,10):
        print str(i) + "x" + str(j) + "=" + str(i * j)

Buggy python submission (verdict: Runtime Error):
#include<stdio.h>
char a, b;int main(){for(a=1;a<=9;a++)for(b=1;b<=9;b++)printf("%dx%d=%d\n",a,b,a*b);return 0;}

Fixed submission:
for i in range(1,10):
    for j in range(1,10):
        print str(i) + "x" + str(j) + "=" + str(i * j)

Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
for i in range(1,10):
    for j in range(1,10):
        print str(i) + "x" + str(j) + "=" + str(i * j)

Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
for i in range(1,10):
    for j in range(1,10):
        print str(i) + "x" + str(j) + "=" + str(i * j)

Buggy python submission (verdict: Runtime Error):

for i in range(9):
    for j  in range(9):
        print "%dx%d=%d", %(i+1, j+1, (i+1)*(j+1)

Fixed submission:
for i in range(9):
    for j in range(9):
        print "%dx%d=%d" %(i+1,j+1, (i+1)*(j+1))
Buggy python submission (verdict: Runtime Error):
import math

print math.pow(input(),3)

Fixed submission:
n = int(input())
print(n ** 3)

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

print(math.pow(input(),3))

Fixed submission:
n = int(input())
print(n ** 3)

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

x = parseInt(input())

print(math.pow(x,3))

Fixed submission:
n = int(input())
print(n ** 3)

Buggy python submission (verdict: Runtime Error):
print(input()**3)

Fixed submission:
n = int(input())
print(n ** 3)
Buggy python submission (verdict: Runtime Error):
data = list(map(int,input.split()))
print data[0] * data[1]

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

print("{} {}".format(a * b , (a + b) * 2))
Buggy python submission (verdict: Runtime Error):


[a,b,c] = map(int,intput().split())

print({True: 'Yes', False: 'No'}[a < b < c])
  

Fixed submission:
def lessthen (a, b):
    return a < b
    
def range (a, b, c):
    return lessthen(a, b) and lessthen(b, c)

a, b, c = map(int, input().split())

if range(a, b, c):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())

print(' {}'.format(' '.join([str(c) for c in range(1, N + 1) 
  if c % 3 == 0 or '3' in str(c)])

Fixed submission:
N = int(input())

print(' {}'.format(' '.join([str(c) for c in range(1, N + 1) 
  if c % 3 == 0 or '3' in str(c)])))
Buggy python submission (verdict: Runtime Error):
n = int(raw_input())

for i in range(0,n);
    a = int(raw_input())
    b = int(raw_input())
    ans = str(a+b)

    if len(ans) > 80;
        print 'overflow'
    else:
        print sum  

Fixed submission:
n = int(raw_input())

for i in range(0,n):
    a = int(raw_input())
    b = int(raw_input())
    ans = str(a+b)

    if len(ans) > 80:
        print 'overflow'
    else:
        print ans
Buggy python submission (verdict: Runtime Error):
n = input()
print(n**3)

Fixed submission:
n = input()
print(n**3)
Buggy python submission (verdict: Runtime Error):
a=input()
b=input()

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

Fixed submission:
x,y = map(int,raw_input().split())
print x*y,2*(x+y)

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

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

Fixed submission:
x,y = map(int,raw_input().split())
print x*y,2*(x+y)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,raw_input().split(' ')
print a*b, 2*(a+b)

Fixed submission:
x,y = map(int,raw_input().split())
print x*y,2*(x+y)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,raw_input().split())

if a > b:
print "a > b"

elif a < b:
print "a < b"

else:
print "a == b"

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

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