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

Fixed submission:
X=int(input())
if X>=400 and X<=599:
  print('8')
if X>=600 and X<=799:
  print('7')
if X>=800 and X<=999:
  print('6')
if X>=1000 and X<=1199:
  print('5')
if X>=1200 and X<=1399:
  print('4')
if X>=1400 and X<=1599:
  print('3')
if X>=1600 and X<=1799:
  print('2')
if X>=1800 and X<=1999:
  print('1')

Buggy submission (verdict: Runtime Error):
X=input()
if X>=400 and X<=599:
    print('8')
if X>=600 and X<=799:
    print('7')
if X>=800 and X<=999:
    print('6')
if X>=1000 and X<=1199:
    print('5')
if X>=1200 and X<=1399:
    print('4')
if X>=1400 and X<=1599:
    print('3')
if X>=1600 and X<=1799:
    print('2')
if X>=1800 and X<=1999:
    print('1')

Buggy submission (verdict: Runtime Error):
X=input()
if X>=400 and X<=599:
  print('8')
if X>=600 and X<=799:
  print('7')
if X>=800 and X<=999:
  print('6')
if X>=1000 and X<=1199:
  print('5')
if X>=1200 and X<=1399:
  print('4')
if X>=1400 and X<=1599:
  print('3')
if X>=1600 and X<=1799:
  print('2')
if X>=1800 and X<=1999:
  print('1')

Buggy submission (verdict: Runtime Error):
X=input()
if X>=400 and X<=599:
    print(8)
if X>=600 and X<=799:
    print(7)
if X>=800 and X<=999:
    print(6)
if X>=1000 and X<=1199:
    print(5)
if X>=1200 and X<=1399:
    print(4)
if X>=1400 and X<=1599:
    print(3)
if X>=1600 and X<=1799:
    print(2)
if X>=1800 and X<=1999:
    print(1)

Buggy submission (verdict: Runtime Error):
X=input()
if X>=400 and X<=599:
  print(8)
if X>=600 and X<=799:
  print(7)
if X>=800 and X<=999:
  print(6)
if X>=1000 and X<=1199:
  print(5)
if X>=1200 and X<=1399:
  print(4)
if X>=1400 and X<=1599:
  print(3)
if X>=1600 and X<=1799:
  print(2)
if X>=1800 and X<=1999:
  print(1)

Buggy submission (verdict: Runtime Error):
X=input()
if X>=400 and X<=599:
  print(8)
elif X>=600 and X<=799:
  print(7)
elif X>=800 and X<=999:
  print(6)
elif X>=1000 and X<=1199:
  print(5)
elif X>=1200 and X<=1399:
  print(4)
elif X>=1400 and X<=1599:
  print(3)
elif X>=1600 and X<=1799:
  print(2)
elif X>=1800 and X<=1999:
  print(1)

Buggy submission (verdict: Runtime Error):
X=input()
if X>=400 and X<=599:
  print(8)
elif X>=600 and X<=799:
  print(7)
elif X>=800 and X<=999:
  print(6)
elif X>=1000 and X<=1199:
  print(5)
elif X>=1200 and X<=1399:
  print(4)
elif X>=1400 and X<=1599:
  print(3)
elif X>=1600 and X<=1799:
  print(2)
elif X>=1800 and X<=1999:
  print(1)
else:
  print()
Problem p02946 (python)

Fixed submission:
K,X=map(int,input().split())
print(*[x for x in range(X-K+1,X+K)])

Buggy submission (verdict: Runtime Error):
k,x=map(int,input().split())
print(*[x for x in range(X-K+1,X+K)])
Problem p03455 (python)

Fixed submission:
a,b = map(int,input().split())
if (a*b) % 2 == 0:
  print('Even')
else:
  print('Odd')

Buggy submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a*b%2=0:
  print('Even')
else:
   print('Odd')
Problem p03777 (python)

Fixed submission:
a,b=input().split()
print("DH"[a==b])

Buggy submission (verdict: Runtime Error):
a,_,b=input().split()
print("DH"[a==b])
Problem p04044 (python)

Fixed submission:
n,l=map(int,input().split())
s=sorted([input() for i in range(n)])
print(*s,sep="")

Buggy submission (verdict: Runtime Error):
n,l=map(int,input().split)
s=sorted([input() for i in range(n)])
print(*s,sep="")
Problem p02608 (python)

Fixed submission:
N = int(input())
num = [0]*N
for i in range(1,10**2 + 1):
    for j in range(1,10**2 + 1):
        for k in range(1,10**2 + 1):
            ans = i**2 + j**2 + k**2 + i*j + j*k + k*i
            if ans <= N:
                num[ans - 1] += 1
for i in range(N):
    print(num[i])

Buggy submission (verdict: Runtime Error):
N = int(input())
num = [0]*N
for i in range(1,10**2 + 1):
    for j in range(1,10**2 + 1):
        for k in range(1,10**2 + 1):
            ans = i**2 + j**2 + k**2 + i*j + j*k + k*i
            if ans <= N:
                num[ans] += 1
for i in range(N):
    print(num[i])
Problem p02658 (python)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
x = 1
if 0 in A:
    x = 0
else:
    for i in range(N):
        x *= A[i]
        if x > 10**18:
            x = -1
            break
print(x)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
x = 1
if A in 0:
    x = 0
else:
    for i in range(N):
        x *= A[i]
        if x > 10**18:
            x = -1
            break
print(x)
Problem p02717 (python)

Fixed submission:
x,y,z=map(int,input().split())
print(z,x,y)

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

Fixed submission:
#!usr/bin/env python3
import sys
import math
import string
import collections
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

sys.setrecursionlimit(10 ** 8)

List = [str(i) for i in range(0, 10)]
prev_num = 10
K = int(input())
if K <= 9:
    print(List[K])
else:
    while True:
        List2 = []
        for i in List:
            if i != "0":
                List2.append(i + str(i[-1]))
                if i[-1] != "9":
                    List2.append(i + str(int(i[-1]) + 1))
                if i[-1] != "0":
                    List2.append(i + str(int(i[-1]) - 1))
        List = List2
        if prev_num + len(List)-1 >= K:
            List = list(map(int, List))
            List.sort()
            print(List[K - prev_num])
            sys.exit()
        prev_num += len(List)

Buggy submission (verdict: Runtime Error):
#!usr/bin/env python3
import sys
import math
import string
import collections
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

sys.setrecursionlimit(10 ** 8)

List = [str(i) for i in range(0, 10)]
prev_num = 10
K = int(input())
if K <= 9:
    print(List[K])
else:
    while True:
        List2 = []
        for i in List:
            if i != "0":
                List2.append(i + str(i[-1]))
                if i[-1] != "9":
                    List2.append(i + str(int(i[-1]) + 1))
                if i[-1] != "0":
                    List2.append(i + str(int(i[-1]) - 1))
        List = List2
        if prev_num + len(List) >= K:
            List = list(map(int, List))
            List.sort()
            print(List[K - prev_num])
            sys.exit()
        prev_num += len(List)

Buggy submission (verdict: Runtime Error):
#!usr/bin/env python3
import sys
import math
import string
import collections
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

sys.setrecursionlimit(10 ** 8)

List = [str(i) for i in range(0, 10)]
prev_num = 10
K = int(input())
if K <= 10:
    print(List[K])
else:
    while True:
        List2 = []
        for i in List:
            if i != "0":
                List2.append(i + str(i[-1]))
                if i[-1] != "9":
                    List2.append(i + str(int(i[-1]) + 1))
                if i[-1] != "0":
                    List2.append(i + str(int(i[-1]) - 1))
        List = List2
        if prev_num + len(List) >= K:
            List = list(map(int, List))
            List.sort()
            print(List[K - prev_num])
            sys.exit()
        prev_num += len(List)
Problem p02761 (python)

Fixed submission:
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect

MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()

N, M = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(M)]

ans = []
if N == 1:
    for i in range(0, 10 ** N):
        ii = str(i)
        p = 0
        for l in sc:
            if int(ii[l[0] - 1]) != l[1]:
                p = 1
        if p == 0:
            ans.append(i)
    if len(ans) == 0:
        print(-1)
        sys.exit()
    print(min(ans))

else:
    for i in range(10 ** (N - 1), 10 ** N):
        ii = str(i)
        p = 0
        for l in sc:
            if int(ii[l[0] - 1]) != l[1]:
                p = 1
        if p == 0:
            ans.append(i)
    if len(ans) == 0:
        print(-1)
        sys.exit()
    print(min(ans))

Buggy submission (verdict: Runtime Error):
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect

MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()

N, M = map(int, input().split())
s, c = [0 for _ in range(M)], [0 for _ in range(M)]
for i in range(M):
    s[i], c[i] = map(int, input().split())
if max(s) > N:
    print(-1)
    sys.exit()
ans = ["0" for _ in range(N)]
for i in range(len(s) - 1):
    for l in range(i + 1, len(s)):
        if s[i] == s[l] and c[i] != c[l]:
            print(-1)
            sys.exit()
for i in range(M):
    ans[s[i] - 1] = str(c[i])
if ans == ["0"]:
    print(0)
    sys.exit()
if ans[0] == "0":
    print(-1)
    sys.exit()
for i in ans:
    if len(i) > 1 or int(i) < 0:
        print(-1)
        sys.exit()
print(int("".join(ans)))

Buggy submission (verdict: Runtime Error):
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect

MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()

N, M = map(int, input().split())
s, c = [0 for _ in range(M)], [0 for _ in range(M)]
for i in range(M):
    s[i], c[i] = map(int, input().split())
if max(s) > N:
    print(-1)
    sys.exit()
ans = ["0" for _ in range(N)]
for i in range(len(s)-1):
    for l in range(i+1, len(s)):
        if s[i] == s[l] and c[i] != c[l]:
            print(-1)
            sys.exit()
for i in range(M):
    ans[s[i]-1] = str(c[i])
if ans[0] == "0":
    print(-1)
    sys.exit()
for i in ans:
    if len(i) > 1:
        print(-1)
        sys.exit()
print(int("".join(ans)))
Problem p02803 (python)

Fixed submission:
import sys
import math
from collections import deque
import copy

H, W = map(int, input().split())
maps2 = deque([deque(["#" for _ in range(W + 2)])])
MAX = 0

for _ in range(H):
    temp = deque(input())
    temp.appendleft("#")
    temp.append("#")
    maps2.append(temp)
maps2.append(deque(["#" for _ in range(W + 2)]))

for i in range(1, H + 1):
    for l in range(1, W + 1):
        if maps2[i][l] != "#":
            maps = copy.deepcopy(maps2)
            pos = [[i, l, 0]]
            maps[i][l] = "a"
            while len(pos) > 0:

                y, x, depth = pos.pop(0)
                if depth > MAX:
                    MAX = depth

                if maps[y + 1][x] == ".":
                    pos.append([y + 1, x, depth + 1])
                    maps[y + 1][x] = "a"
                if maps[y][x + 1] == ".":
                    pos.append([y, x + 1, depth + 1])
                    maps[y][x + 1] = "a"
                if maps[y - 1][x] == ".":
                    pos.append([y - 1, x, depth + 1])
                    maps[y - 1][x] = "a"
                if maps[y][x - 1] == ".":
                    pos.append([y, x - 1, depth + 1])
                    maps[y][x - 1] = "a"
print(MAX)

Buggy submission (verdict: Runtime Error):
import sys
import math
from collections import deque
import copy

H, W = map(int, input().split())
maps2 = deque([deque(["#" for _ in range(W + 2)])])
MAX = 0

for _ in range(H):
    temp = deque(input())
    temp.appendleft("#")
    temp.append("#")
    maps2.append(temp)
maps2.append(deque(["#" for _ in range(W + 2)]))

for i in range(1, H + 1):
    for l in range(1, W + 1):
        if maps2[i][l] != "#":
            maps = copy.deepcopy(maps2)
            pos = [[i, l, 0]]
            while len(pos) > 0:

                y, x, depth = pos.pop(0)
                if depth > MAX:
                    MAX = depth

                if maps[y + 1][x] == ".":
                    pos.append([y + 1, x, depth + 1])
                    map[y + 1][x] = "a"
                if maps[y][x + 1] == ".":
                    pos.append([y, x + 1, depth + 1])
                    map[y][x + 1] = "a"
                if maps[y - 1][x] == ".":
                    pos.append([y - 1, x, depth + 1])
                    map[y - 1][x] = "a"
                if maps[y][x - 1] == ".":
                    pos.append([y, x - 1, depth + 1])
                    map[y][x - 1] = "a"
print(MAX)
Problem p02838 (python)

Fixed submission:
import sys
mod = 10**9+7
N = int(sys.stdin.readline())
A = tuple(map(int, sys.stdin.readline().split()))
B = []
ans = 0
C = [0 for i in range(60)]
for i in A:
    for l in range(60):
        if ((i >> l) & 1) == 1:
            C[l] += 1
for i in range(60):
    t = C[i]
    ans = (ans + t*(N-t)*(2**i)) % mod
print(ans)

Buggy submission (verdict: Runtime Error):
import sys

N = int(sys.stdin.readline())
A = tuple(map(int, sys.stdin.readline().split()))
B = []
ans = 0
for i in A:
    B.append(list(bin(i)[2:]))
C = (0 for i in range(60))
for i in B:
    for l in range(len(i)):
        if i[-(l+1)] == '1':
            C[l] += 1
for i in range(60):
    ans = (ans + C[i]*(N-C[i])*(2**i))%(10**9+7)
print(ans)
Problem p02861 (python)

Fixed submission:
import sys
import copy
input = sys.stdin.readline
N = int(input())
ans = 0
xy = [list(map(int, input().split())) for i in range(N)]


def maken(n):
    s = 1
    for i in range(1, n+1):
        s *= i
    return s


for i in range(N):
    xy2 = copy.deepcopy(xy)
    c = xy2[i]
    del xy2[i]
    for l in xy2:
        ans += (((c[0]-l[0])**2+(c[1]-l[1])**2)**(1/2))*(maken(N-1))
print(ans/maken(N))

Buggy submission (verdict: Runtime Error):
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect
from scipy.special import comb
from scipy.special import perm

MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()

N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
L = list(itertools.permutations(xy, 2))
num = math.factorial(N-1) / comb(N, 2)
ans = 0
for i in range(N-1):
    for l in range(i+1, N):
        ans += math.sqrt((xy[i][0]-xy[l][0])**2+(xy[i][1]-xy[l][1])**2)
ans *= num
print(ans)
Problem p02934 (python)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = []
C = 0
for i in range(0,N):
    B.append(1/A[i])
for i in range(0,N):
    C += B[i]
print(1/C)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
B = 0
C = A[0]
for i in range(0,N):
    B += A[i]
for i in range(1,N):
    C *= A[i]
print(C/(N-1)/B)
Problem p02936 (python)

Fixed submission:
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

N, Q = map(int, input().split())
info = [[] for _ in range(N)]
ans = [0 for _ in range(N)]
check = [1 for _ in range(N)]

for _ in range(N - 1):
    a, b = map(int, input().split())
    info[a - 1].append(b - 1)
    info[b - 1].append(a - 1)


def plus(n, val):
    ans[n] += val
    check[n] = 0
    for i in info[n]:
        if check[i]:
            plus(i, val + Query[i])


Query = [0 for _ in range(N)]
for _ in range(Q):
    p, x = map(int, input().split())
    Query[p - 1] += x
plus(0, Query[0])
ans = list(map(str, ans))
print(" ".join(ans))

Buggy submission (verdict: Runtime Error):
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

N, Q = map(int, input().split())
info = [[] for _ in range(N)]
sum = [0 for _ in range(N)]

for _ in range(N - 1):
    a, b = map(int, input().split())
    info[a - 1].append(b - 1)


def plus(n, val):
    sum[n] += val
    for i in info[n]:
        plus(i, val)


for _ in range(Q):
    p, x = map(int, input().split())
    plus(p - 1, x)
for i in range(N):
    sum[i] = str(sum[i])
print(" ".join(sum))

Buggy submission (verdict: Runtime Error):
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

N, Q = map(int, input().split())
info = [[] for _ in range(N)]
sum = [0 for _ in range(N)]

for _ in range(N-1):
    a, b = map(int, input().split())
    info[a - 1].append(b - 1)


def plus(n, val):
    sum[n] += val
    for i in info[n]:
        plus(i, val)


for _ in range(Q):
    p, x = map(int, input().split())
    plus(p-1, x)
for i in sum:
    print(i)
Problem p02946 (python)

Fixed submission:
K,X = map(int,input().split())
A = []
for i in range(-K+1,K):
    A.append(int(X+i))
print(*A)

Buggy submission (verdict: Runtime Error):
K,X = map(int,input().split())
A = []
for i in range(-K+1,K):
    A.append(int(X+i))
print(*A)
K,X = map(int,input().split())
A = []
for i in range(-K+1,K):
    A.append(int(X+i))
print(*A)
Problem p02969 (python)

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

Buggy submission (verdict: Runtime Error):
N = int(input())
L=[]
i = 0
s = 0
M2 = 0
a = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
for s in range(0,N):
    if L[s] == M:
        a += 1
    else:
        if L[s] > M2:
            M2 = L[s]
for i in range(0,N):
    if L[i] == M and a < 2:
        print(M2)
    else:
        print(M)

Buggy submission (verdict: Runtime Error):
N = int(input())
L=[]
i = 0
s = 0
M2 = 0
a = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
for s in range(1,N):
    if L[s] == M:
        a += 1
        continue
    else:
        if L[s] > M2:
            M2 = L[s]
for i in range(0,N):
    if L[i] == M and a != 1:
        print(M2)
    else:
        print(M)

Buggy submission (verdict: Runtime Error):
N = int(input())
L=[]
i = 0
s = 0
M2 = 0
a = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
for s in range(1,N):
    if L[s] == M:
        a += 1
        continue
    else:
        if L[s] > M2:
            M2 = L[s]
for i in range(0,N):
    if L[i] == M and a != 1:
        print(M2)
    else:
        print(M)
Problem p02971 (python)

Fixed submission:
N = int(input())
L=[]
i = 0
s = 0
M2 = 0
a = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
for s in range(0,N):
    if L[s] == M:
        a += 1
    else:
        if L[s] > M2:
            M2 = L[s]
for i in range(0,N):
    if L[i] == M and a < 2:
        print(M2)
    else:
        print(M)

Buggy submission (verdict: Runtime Error):
N = int(input())
L=[]
i = 0
s = 0
M2 = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
for s in range(1,N):
    if L[s] == M:
        continue
    else:
        if L[s] > M2:
            M2 = L[s]
for i in range(0,N):
    if L[i] == M:
        print(M2)
    else:
        print(M)
N = int(input())
L=[]
i = 0
s = 0
M2 = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
for s in range(1,N):
    if L[s] == M:
        continue
    else:
        if L[s] > M2:
            M2 = L[s]
for i in range(0,N):
    if L[i] == M:
        print(M2)
    else:
        print(M)

Buggy submission (verdict: Runtime Error):
N = int(input())
L=[]
i = 0
s = 0
for i in range (0,N):
    L.append(int(input()))
M = L[0]
for s in range(1,N):
    if  L[s] > M:
        M = L[s]
i = 0
for i in range(0,N):
    F = L[0]
    for s in range(1,N):
        if f == M:
            continue
        else:
            if L[s] == L[i]:
                continue
            else:
                if L[s] > F:
                    F = L[s]
    print(F)
Problem p02981 (python)

Fixed submission:
N, A, B = map(int,input().split())
if B<N*A :
    print(B)
else :
    print(N*A)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
B1 = 0
B = []
for i in range(0,N):
    if i%2 == 0:
        B1 += A[i]
    else:
        B1 -= A[i]
B.append(B1)
XX = B1
for i in range (0,N-1) :
    X = 2*A[i]-XX
    B.append(X)
    XX = X
print(B)

Buggy submission (verdict: Runtime Error):
L,R=map(int,input().split())
M=2019
import sys
for i in range(L,R):
    for j in range(i+1,R+1) :
        if (i*j)%2019 < M :
            M = (i*j)%2019
            if M == 0:
                sys,exit()
print (M)

Buggy submission (verdict: Runtime Error):
N,D = map(int,input().split())
A=[]
C=0
D=0
E=0
for i in range (1,N+1):
    A.append(i)
for i in range (0,N):
    A[i]=list(map(int,input().split()))
for i in range (0,N-1):
    for j in range(i,N-1):
        for k in range(0,D):
            B=(A[j][k]-A[j+1][k])**2
            C+=B
        D=C
        C=0
        if ((D)**(1/2))%1 ==  (D)**(1/2):
            E+=1
print(E)

Buggy submission (verdict: Runtime Error):
L,R=map(int,input().split())
M=2019
for i in range(L,R):
    for j in range(i+1,R+1) :
        if (i*j)%2019 < M :
            M = (i*j)%2019
print (M)
Problem p02983 (python)

Fixed submission:
L,R=map(int,input().split())
M=2019
import sys
for i in range(L,R):
    for j in range(i+1,R+1) :
        if (i*j)%2019 < M :
            M = (i*j)%2019
            if M == 0:
                print(M)
                sys.exit()
print (M)

Buggy submission (verdict: Runtime Error):
L,R=map(int,input().split())
M=2019
import sys
for i in range(L,R):
    for j in range(i+1,R+1) :
        if (i*j)%2019 < M :
            if M=0:
                sys.exit()
            M = (i*j)%2019
    
 print(M)

Buggy submission (verdict: Runtime Error):
L,R=map(int,input().split())
M=2019
for i in range(L,R):
    for j in range(i+1,R+1) :
        if (i*j)%2019 < MOD :
            M = (i*j)%2019
print (M)
Problem p02988 (python)

Fixed submission:
n=int(input())
b=list(map(int,input().split()))
c=0
d=0
while c<=n-3 :
    if (b[c+1]>b[c] and b[c+1]<b[c+2]) or (b[c+1]<b[c] and b[c+1]>b[c+2]):
        d +=1
        c +=1
    else:
        c+=1

print(d)

Buggy submission (verdict: Runtime Error):
n=int(input())
b=list(map(int,input().split()))
c=0
d=0
while c<=n-2 :
    if b[c+1]>b[c] and b[c+1]<b[c+2] or b[c+1]<b[c] and b[c+1]>b[c+2]:
        d +=1
        c +=1
    else:
        c+=1

print(d)
Problem p02993 (python)

Fixed submission:
A=str(input () )
B=0
while B!=3:
    if A[B]==A[B+1]:
        print('Bad')
        break
    else:    
        B=B+1
else:
    print('Good')

Buggy submission (verdict: Runtime Error):
n, L = map(int, input().split())
N = 0
G = 999
for i in range(1, n+1):
    N += (i + L - 1)
NN = N
for i in range(1, n+1):
    DD = NN - (L + i - 1)
    if abs(NN-DD)< G :
        G = abs(NN-DD)
        ZZ = DD
print(ZZ)

Buggy submission (verdict: Runtime Error):
n,L = map(int,input().split())
N=0
G=0
for i in range(1,n):
    N +=(i+L-1)
NN = N
for i in range(1,n):
        DD = NN - (L+i-1)
        if DD>G :
            G = DD
print(G)

Buggy submission (verdict: Runtime Error):
A=str(input () )
B=0
while True:
    if A[B]==A[B+1]:
        print('Bad')
        break
    else:    
        B=B+1
else:
    print('Good')

Buggy submission (verdict: Runtime Error):
A=str(input () )
B=0
while B ==!2:
if A[B] == A[B+1]:
    print ('Bad')
    B += 1 
    break  
    print('Good')

Buggy submission (verdict: Runtime Error):
A=str(input () )
B=0
while B =!2:
if A[B] == A[B+1]:
    print ('Bad')
    B += 1 
    break  
    print('Good')

Buggy submission (verdict: Runtime Error):
A=input ()
B=0
while B =!2:
if A[B] == A[B+1]:
    print ('Bad')
    break
else:
    B +=1
else:
    print('Good')