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

Fixed submission:
n = int(input())
p = [int(x) for x in input().split()]

cnt = 0
for i in range(n):
    if p[i] == i + 1:
        cnt += 1
        if i != n - 1:
            p[i], p[i+1] = p[i+1], p[i]
else:
    print(cnt)

Buggy submission (verdict: Runtime Error):
n = int(input())
p = [int(x) for x in input().split()]

cnt = 0
for i in range(n):
    if p[i] == i + 1:
        cnt += 1
        if i != n:
            p[i], p[i+1] = p[i+1], p[i]
else:
    print(cnt)

Buggy submission (verdict: Runtime Error):
_ = input()
p = [int(x) for x in input().split()]

lenp = len(p)
cnt = 0
for i in range(lenp):
    if p[i] == i + 1:
        cnt += 1
        if i != lenp:
            p[i], p[i+1] = p[i+1], p[i]
else:
    print(cnt)

Buggy submission (verdict: Runtime Error):
_ = input()
p = [int(x) for x in input().split()]

cnt = 0
for i in range(len(p)):
    if p[i] == i + 1:
        p[i], p[i+1] = p[i+1], p[i]
        cnt += 1
else:
    print(cnt)
Problem p03681 (python)

Fixed submission:
from math import factorial as f

n, m = map(int, input().split())

if n == m:
    print((f(n) ** 2 * 2) % (10 ** 9 + 7))
elif abs(n - m) == 1:
    print((f(n) * f(m)) % (10 ** 9 + 7)) 
else:
    print(0)

Buggy submission (verdict: Runtime Error):
from math import factorial as f

n, m = map(int(), input().split())

if n == m:
    print((f(n) ** 2 * 2) % (10 ** 9 + 7))
elif abs(n - m) == 1:
    print((f(n) * f(m)) % (10 ** 9 + 7)) 
else:
    print(0)
Problem p03695 (python)

Fixed submission:
_ = input()
a = [int(x) for x in input().split()]

p = [False] * 8
q = 0
for i in a:
    if 3199 < i:
        q += 1
    else:
        for j in range(8):
            if 400 * j <= i < 400 * (j + 1):
                p[j] = True
else:
    s = sum(p)
    print(max(s, 1), s + q)

Buggy submission (verdict: Runtime Error):
n = input()
a = [int(x) for x in input().split() if x < 3200]
c = len(set([x // 400 for x in a]))
print(max(c, 1), c + n - len(a))
Problem p03759 (python)

Fixed submission:
a, b, c = map(int, input().split())
if b - a == c - b:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().aplit())
if b - a == c - b:
    print("YES")
else:
    print("NO")
Problem p03760 (python)

Fixed submission:
o = input()
e = input()

pw = ""
lene = len(e)
for i in range(lene):
    pw += o[i] + e[i]
else:
    if lene < len(o):
        pw += o[-1]
    print(pw)

Buggy submission (verdict: Runtime Error):
o = input()
e = input()

pw = ""
for i in range(len(o)):
    pw += o[i] + e[i]
else:
    print(pw)
Problem p03846 (python)

Fixed submission:
n = int(input())
a = [int(x) for x in input().split()]
line = [abs(i - (n - i- 1)) for i in range(n)]
if sorted(a) == sorted(line):
    print((2 ** (n // 2)) %  (10 ** 9 + 7))
else:
    print(0)

Buggy submission (verdict: Runtime Error):
def index(n:int, a: int):
    if a % 2 == 0:
        i = n // 2 - a // 2
        j = (i + 1) * -1
        return (i, j) if i != n // 2 else (i,)
    else:
        i = (n // 2 - 1) - (a - 1) // 2
        j = (i + 1) * -1
        return (i, j)
 
n = int(input())
line = [0 for _ in range(n)]
for a in map(int, input().split()):
    for i in index(n, a):
        line[i] += 1
else:
    if n % 2 == 0 and set(line) == {2}:
        print(2 ** (n // 2) % (10 ** 9 + 7))
    elif n % 2 == 1 and set(line) == {1, 2} and line[n//2] == 1:
        print(2 ** ((n - 1) // 2) % (10 ** 9 + 7))
    else:
        print(0)
def index(n:int, a: int):
    if a % 2 == 0:
        i = n // 2 - a // 2
        j = (i + 1) * -1
        return (i, j) if i != n // 2 else (i,)
    else:
        i = (n // 2 - 1) - (a - 1) // 2
        j = (i + 1) * -1
        return (i, j)

n = int(input())
line = [0 for _ in range(n)]
for a in map(int, input().split()):
    for i in index(n, a):
        line[i] += 1
else:
    if n % 2 == 0 and set(line) == {2}:
        print(2 ** (n // 2) % (10 ** 9 + 7))
    elif n % 2 == 1 and set(line) == {1, 2} and line[n//2] == 1:
        print(2 ** ((n - 1) // 2) % (10 ** 9 + 7))
    elif n == 1 and line == [1]:
        print(1)
    else:
        print(0)
Problem p03852 (python)

Fixed submission:
print("vowel" if input() in "aeiou" else "consonant")

Buggy submission (verdict: Runtime Error):
print("vowel" if c in "aeiou" else "consonant")

Buggy submission (verdict: Runtime Error):
print("vowel" if c in "aeiou" else "consonant"))
Problem p03385 (python)

Fixed submission:
S = input()
if S == 'abc':
    print('Yes')
elif S == 'acb':
    print('Yes')
elif S == 'acb':
    print('Yes')
elif S == 'bac':
    print('Yes')
elif S == 'bca':
    print('Yes')
elif S == 'cab':
    print('Yes')
elif S == 'cba':
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
S = input()
if S == 'abc':
    return 'Yes'
elif S == 'acb':
    return 'Yes'
elif S == 'acb':
    return 'Yes'
elif S == 'bac':
    return 'Yes'
elif S == 'bca':
    return 'Yes'
elif S == 'cab':
    return 'Yes'
elif S == 'cba':
    return 'Yes'
else:
    return 'NO'

Buggy submission (verdict: Runtime Error):
S = input()
if S == 'abc':
    return Yes
elif S == 'acb':
    return Yes
elif S == 'acb':
    return Yes
elif S == 'bac':
    return Yes
elif S == 'bca':
    return Yes
elif S == 'cab':
    return Yes
elif S == 'cba':
    return Yes
else:
    return NO
Problem p03385 (python)

Fixed submission:
S = input()
if (S=="abc") or (S=="acb") or (S=="bca") or (S=="cba") or (S=="bac") or (S=="cab"):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
if B-A+1 >= 2*K: 
    res_list = [i for i in range(A, A+K)] + [i for i in range(B-K+1, B+1)]
else: 
    res_list = [i for i in range(A, B+1)]
for i in res_list:
    print(i)

Buggy submission (verdict: Runtime Error):
S = input()
if (S=="abc") or (S=="acb") or (S=="bca") or (S=="cba") or (S=="bac") or (S=="cab"):
  print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
input = S()
if (S=="abc") or (S=="acb") or (S=="bca") or (S=="cba") or (S=="cab") or (S=="bac"):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
input = S()
if (S=="abc") or (S=="acb") or (S=="bca") or (S=="cba") or (S=="cab"):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
import java.util.Scanner;
class Rp1ABC093{
  static public void main(String args[]){
    String S;
    Scanner sc = new Scanner(System.in);
    
  if (S=="abc") or (S=="bca") or (S=="cba") or (S=="acb") or (S=="bac") or (S=="cab")
    System.out.println("Yes");
  else
    System.out.println("No");
  }
}

Buggy submission (verdict: Runtime Error):
S = input()
  if (S=="abc") or (S=="bca") or (S=="cba") or (S=="acb") or (S=="bac") or (S=="cab")
    print("Yes")
  else
    print("No")

Buggy submission (verdict: Runtime Error):
S = input()
  if (S=="abc") or (S=="bca") or (S=="cba") or (S=="acb") or (S=="bac") or (S=="cab")
    print("Yes")
  else
    print("No")
Problem p03388 (python)

Fixed submission:
t= int(input())
for i in range(t):
    k=input().split()
    a=int(k[0])
    b=int(k[1])
    c=a*b
    d=int(c**.5)
    print(2*d-1-((d*(d+1))>=c)-(c==d*d and a!=b))

Buggy submission (verdict: Runtime Error):
t= int(input())
for i in range(t):
    k=input().split()
    a=int(k[0])
    b=int(k[1])
    c=a*b
    d=int(c**.5)
    print(2*d-1-((d*(d+1)>=c)-(c==d*d and a!=b))

Buggy submission (verdict: Runtime Error):
t= int(input())
for i in range(t):
    k=input().split()
    a=int(k[0])
    b=int(k[1])
	c=a*b
    d=int(c**.5)
    print(2*d-1-((d*d)==c)-(c==d*d and a!=b))
Problem p03385 (python)

Fixed submission:
S = input()
if (S[0] == S[1]) or (S[1] == S[2]) or (S[2] == S[0]):
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
S = raw_input()
if (S[0] == S[1]) or (S[1] == S[2]) or (S[2] == S[0]):
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
S = raw_input()
if (S[0] != S[1]) and (S[1] != S[2]) and (S[2] != S[0]):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
S = raw_input()
if S[0] != S[1] and S[1] != S[2] and S[2] != S[0]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
S = raw_input()
if S[0] != S[1] and S[1] != S[2] and S[2] != S[0]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
S = raw_input()
if S[0] != S[1] && S[1] != S[2] && S[2] != S[0]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
S = input()
if S[0] != S[1] && S[1] != S[2] && S[2] != S[0]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
S = input()
if(S[0] != S[1] && S[1] != S[2] && S[2] != S[0]):
    print("Yes")
else:
    print("No")
Problem p03386 (python)

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

if b-a+1 > 2*c:
    for i in range(a,a+c):
        print(i)
    for i in range(b-c+1,b+1):
        print(i)
else:
    for i in range(a,b+1):
        print(i)

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())

if b-a+1 > 2*c:
    for i in range(a,a+c):
    print(i)
    for i in range(b-c+1,b):
    print(i)
else:
    for i in range(a,b+1):
    print(i)
Problem p03407 (python)

Fixed submission:
#coding: UTF-8

A,B,C = list(map(int, input().split()))

if sum([A, B]) >= C:
    print ('Yes')
else:
    print ('No')

Buggy submission (verdict: Runtime Error):
#coding: UTF-8

A = int(input())
B = int(input())
C = int(input())

if sum([A, B]) >= C:
    print ('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
#coding: UTF-8

A = int(input())
B = int(input())
C = int(input())

if sum([A, B]) > C:
    print ('Yes')
else:
    print('No')
Problem p03473 (python)

Fixed submission:
m = int(input())
n = 48 - m
print(n)

Buggy submission (verdict: Runtime Error):
m = input()
n = 48 - m
print(n)
Problem p03385 (python)

Fixed submission:
# -*- coding: utf-8 -*-
# 文字列の入力
a = input()

if (a.count("a") and a.count("b") and a.count("c") ):
    print("Yes")
# 出力
else:
    print("No")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 文字列の入力
a = input()

if (a.count("a") + a.count("b") + a.count("c") ) == 3):
    print("Yes")
# 出力
else:
    print("No")
Problem p03386 (python)

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

c=b-a+1

a1=[]
b1=[]

for i in range(k):
    a1.append(a+i)
    b1.append(b-i)

if c>2*k-1:
    for i in range(k):
        print(a1[i])
    for i in range(k):
        print(b1[k-i-1])

else:
    for i in range(a,b+1):
        print(i)

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

c=b-a+1

a1=[]
b1=[]

for i in range(k):
    a1.append(a+i)
    b1.append(b-i)

if c>2*k-1:
    for i in range(k):
        print(a1[i])
    for i in range(k):
        print(b1[k-i-1])

else:
    for i in range(a,b+1):
        print(i)

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

c=b-a+1

aa=[]
bb=[]

for i in range(k):
    aa.append(a+i)
    bb.append(b-i)

if c>2*k-1:
    for i in range(k):
        print(aa[i])
    for i in range(k):
        print(bb[k-i-1])

else:
    for i in range(a,b+1):
        print(i)

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

c=b-a+1

aa=[]
bb=[]

for i in range(k):
    aa.append(a+i)
    bb.append(b-i)

if c>2*k-1:
    for i in range(k):
        print(aa[i])
    for i in range(k):
        print(bb[k-i-1])

else:
    for i in range(a,b+1):
        print(i)
Problem p03409 (python)

Fixed submission:
N = int(input())

red_points = [[int(i) for i in input().split()] for j in range(N)]

blue_points = [[int(i) for i in input().split()] for j in range(N)]

red_points.sort()
blue_points.sort()
count = 0
distance = 9999
for blue_point in blue_points:
    tmp = [i for i in red_points if blue_point[0] > i[0] and blue_point[1] > i[1]]
    if tmp:
        for j in tmp:
            if (blue_point[1] - j[1]) < distance:
                distance = blue_point[1] - j[1]
                min_red = j
        count = count + 1
        red_points.remove(min_red)
        distance = 9999

print(count)

Buggy submission (verdict: Runtime Error):
N = int(input())

red_points = [[int(i) for i in input().split()] for j in range(N)]

blue_points = [[int(i) for i in input().split()] for j in range(N)]

red_points.sort()
blue_points.sort()
count = 0
distance = 9999
for blue_point in blue_points:
    for red_point in red_points:
        if (blue_point[0] > red_point[0]) and (blue_point[1] > red_point[1]):
            if blue_point[1] - red_point[1] < distance:
                distance = blue_point[1] - red_point[1]
                tmp = red_point
    if tmp in red_points:
        red_points.remove(tmp)
        tmp.clear()
        count = count + 1
    distance = 9999
print(count)

Buggy submission (verdict: Runtime Error):
N = int(input())

red_points = [[int(i) for i in input().split()] for j in range(N)]

blue_points = [[int(i) for i in input().split()] for j in range(N)]

red_points.sort()
blue_points.sort()
count = 0
distance = 9999
for blue_point in blue_points:
    for red_point in red_points:
        if blue_point[0] > red_point[0]:
            if blue_point[1] > red_point[1]:
                if blue_point[1] - red_point[1] < distance:
                    distance = blue_point[1] - red_point[1]
                    tmp = red_point
        else:
            distance = 9999
            break
    if tmp in red_points:
        red_points.remove(tmp)
        count = count + 1
    distance = 9999
print(count)

Buggy submission (verdict: Runtime Error):
red_points.sort()
blue_points.sort()
count = 0
distance = 9999
for blue_point in blue_points:
    for red_point in red_points:
        if blue_point[0] > red_point[0]:
            if blue_point[1] > red_point[1]:
                if blue_point[1] - red_point[1] < distance:
                    distance = blue_point[1] - red_point[1]
                    tmp = red_point
        else:
            distance = 9999
            break
    print(tmp, blue_point)
    print(red_points)
    if tmp in red_points:
        red_points.remove(tmp)
        count = count + 1
    distance = 9999
print(count)
Problem p03493 (python)

Fixed submission:
masu = input()
sum = 0
for n in masu:
    sum = sum + int(n)
print(sum)

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

N = int(input())
array = np.array(list(map(int, input().split())))
c = 0
check = True
while check:
    for n in array:
        if n % 2 == 1:
            check = False

    array = array / 2
    c = c + 1
print(c-1)
Problem p03424 (python)

Fixed submission:
N = int(input())
a = input().split()
if 'Y' in a:
    print('Four')
else:
    print('Three')

Buggy submission (verdict: Runtime Error):
a = input().split()
if 'Y' in a:
    print(four)
else:
    print(three)

Buggy submission (verdict: Runtime Error):
a = input().split()
if Y in a:
    print(4)
else:
    print(3)
Problem p03425 (python)

Fixed submission:
N = int(input())
_M = [] 
_A = [] 
_R = [] 
_C = [] 
_H = [] 

for i in range(N):
    x = input()
    if x[0] == 'M':
        _M.append(x)
    elif x[0] == 'A':
        _A.append(x)
    elif x[0] == 'R':
        _R.append(x)
    elif x[0] == 'C':
        _C.append(x)
    elif x[0] == 'H':
        _H.append(x)

m = len(_M)
a = len(_A)
r = len(_R)
c = len(_C)
h = len(_H)

x = m*a*r + m*a*c + m*a*h + m*r*c + m*r*h + m*c*h + a*r*c + a*r*h + a*c*h + r*c*h

print(x)

Buggy submission (verdict: Runtime Error):
import itertools
letters = ['M','A','R','C','H']
N = int(input())
a = []
com_s = []

for i in range(N):
    x = input()
    if x[0] in letters:
        a.append(x)

coms = list(itertools.combinations(a,3))
for com in coms:
    if com[0][0] != com[1][0] and com[1][0] != com[2][0] and com[2][0] != com[0]com[0]:
        com_s.append(com)

print(len(com_s))
Problem p03471 (python)

Fixed submission:
n,y=map(int,input().split())
flag=False
if 10000*n<y:
    print('-1 -1 -1')
elif 10000*n==y:
    print(n,0,0)
else:
    for i in range(n+1):
        if flag:
            break
        for j in range(n-i+1):
            if 10000*i+5000*j+1000*(n-i-j)==y:
                print(i,j,n-i-j)
                flag=True
                break
    else:
        print('-1 -1 -1')

Buggy submission (verdict: Runtime Error):
n,y=map(int,input().split())
flag=False
if 10000*n<y:
    print(-1 -1 -1)
elif 10000*n==y:
    print(n 0 0)
else:
    for i in range(n+1):
        if flag:
            break
        for j in range(n+1):
            if flag:
                brake
            for k in range(n+1):
                if 10000*i+5000*j+1000*k==y:
                    print(str(i) str(j) str(k))
                    flag=True
                    break
    if flag==False:
        print(-1 -1 -1)
Problem p03385 (python)

Fixed submission:
a = [i for i in input()]
b = set(a)
print(["No", "Yes"][len(a) == 3 and len(b) == 3])

Buggy submission (verdict: Runtime Error):
a = [i for i in input()]
b = set(a)
print(["No", "Yes"][len(a) == 3 and b == 3]
Problem p03385 (python)

Fixed submission:
from collections import Counter
 
print("Yes" if Counter(input()) == Counter("abc") else "No")

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

queue = [np.array([ int(n) for n in input().split() ] + [0])]

while queue:
    now = queue.pop(0)

    if now[0] == now[1] == now[2]:
        print(now[3])
        break

    min = np.argmin(now[:3])
    
    if(np.max(now[:3])-np.min(now[:3]) > 2):
        now[min] += 2
        now[3] += 1
        queue.append(now)

    else:
        queue.append(now+[1, 1, 0, 1])
        queue.append(now+[1, 0, 1, 1])
        queue.append(now+[1, 1, 0, 1])
        queue.append(now+[0, 1, 1, 1])
        queue.append(now+[1, 0, 1, 1])
        queue.append(now+[0, 1, 1, 1])

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

queue = [np.array([ int(n) for n in input().split() ] + [0])]

while queue:
    now = queue.pop(0)
    print(now)

    if now[0] == now[1] == now[2]:
        print(now[3])
        break

    min = np.argmin(now[:3])
    
    if(np.max(now[:3])-np.min(now[:3]) > 2):
        now[min] += 2
        now[3] += 1
        queue.append(now)

    else:
        queue.append(now+[1, 1, 0, 1])
        queue.append(now+[1, 0, 1, 1])
        queue.append(now+[1, 1, 0, 1])
        queue.append(now+[0, 1, 1, 1])
        queue.append(now+[1, 0, 1, 1])
        queue.append(now+[0, 1, 1, 1])
Problem p03385 (python)

Fixed submission:
#!/bin/python
data = input()
 
if data.find('a') != -1 and data.find('b') != -1 and data.find('c') != -1:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
data = input()

if data.find('a') != -1 and data.find('b') != -1 and data.find('c') != -1:
	print 'Yes'
else:
  	print 'No'
Problem p03455 (python)

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

Buggy submission (verdict: Runtime Error):
def blackSum(x,y,x2,y2):
    return bs[y2][x2] - bs[y2][x-1] - bs[y-1][x2] + bs[y-1][x-1]

n,k = [int(i) for i in input().split()]
black = [[0 for i in range(2*k+2)] for j in range(2*k+2)]
for i in range(n):
    xi,yi,ci = list(input().split())
    x = int(xi)%(2*k)
    if ci == "W":
        y = (int(yi) + k)%(2*k)
    else:
        y = int(yi)%(2*k)
    black[y+2][x+2] += 1
bs = [[0 for i in range(2*k+2)] for j in range(2*k+2)]
for i in range(1,2*k+2):
    for j in range(1,2*k+2):
        bs[i][j] = black[i][j] + bs[i-1][j] + bs[i][j-1] - bs[i-1][j-1]
max = 0
#左上の黒の位置を指定する。
for i in range(2,k+2):
    for j in range(2,k+2):
        sum = blackSum(j,i,j+k-1,i+k-1) + \
              blackSum(1,1,j-1,i-1) + \
              blackSum(1,i+k,j-1,2*k+1) + \
              blackSum(j+k,1,2*k+1,i-1) + \
              blackSum(j+k,i+k,2*k+1,2*k+1)
        if sum>max:
            max=sum
print(max)
Problem p03423 (python)

Fixed submission:
n = int(input())
group = 0
if n%3==0:
    group = n/3
elif n%3==1:
    group = (n-1)/3
else:
    group = (n-2)/3
print(int(group))

Buggy submission (verdict: Runtime Error):
n = int(print())
group = 0
if n%3==0:
    group = n/3
elif n%3==1:
    group = (n-1)/3
else:
    group = (n-2)/3
print(int(group))
Problem p03385 (python)

Fixed submission:
S = input()
if 'a' in S and 'b' in S and 'c' in S:
    print ('Yes')
else:
    print ('No')

Buggy submission (verdict: Runtime Error):
S = raw_input()
if 'a' in S and 'b' in S and 'c' in S:
    print 'true'
else:
    print 'false'
Problem p03469 (python)

Fixed submission:
s = input()
s = s.replace('7','8',1)
print(s)
#print(s[0:3] + "8" + s[4:])

Buggy submission (verdict: Runtime Error):
s = input()
s[3] = '8'
print(s)
Problem p03473 (python)

Fixed submission:
print("{}".format(24 - int(input()) + 24))

Buggy submission (verdict: Runtime Error):
import math

def isPrime(num):
    if num < 2:
        return False
    else:
        rootNum = math.floor(math.sqrt(num))
        for i in range(2,rootNum+1):
            if num % i == 0:
                return False
    return True

def solve():
    lst = []
    count = int(input())
    for i in range(count):
        ans = 0
        l, r = map(int, input().split())
        t = l
        while k <= r
            if isPrime(k) and isPrime((k+1)/2):
                ans += 1
            k += 2
        lst.append(str(ans))
    print('\n'.join(lst))
solve()

Buggy submission (verdict: Runtime Error):
i = input()
i = 24+i
print("{}".format(i))

Buggy submission (verdict: Runtime Error):
i = input()
print(24+i)
Problem p03386 (python)

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

x = list()
for i in range(a, a+min([k,b+1-a])):
  #print(i)
  x.append(i)
#print('---')
for i in range(b-min([k,b+1-a])+1, b+1):
  #print(i)
  x.append(i)
#print('---')

for xx in sorted(set(x)):
  print(xx)

Buggy submission (verdict: Runtime Error):

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

l = list(range(a,b+1))

x = list()
for i in range(0, min([k,len(l)])):
  x.append(l[i])
  x.append(l[-i-1])

for xx in sorted(set(x)):
  print(xx)
Problem p03386 (python)

Fixed submission:
A, B, K = map(int, input().split())

list2 = [ A + K - 1 , B - K + 1]
if A + K - 1 >= B - K +1 or A > B - K:
    i = A
    while i <= B:
        print(i)
        i += 1
else:
    i = A
    while i <= A + K - 1:
        print(i)
        i += 1
    i = B - K + 1
    while i <= B:
        print(i)
        i += 1

Buggy submission (verdict: Runtime Error):
A, B, K = map(int, input().split())

list2 = [ A + K - 1 , B - K + 1]
if min(list2) == max(list2):
    list3 = ["-1"]
else:
    list3 = list(range(min(list2)+1,max(list2)))
i = A
while i <= B:
    if i not in list3:
        print(i)
    elif A > B - K:
        print(i)
    i += 1

Buggy submission (verdict: Runtime Error):
A, B, K = map(int, input().split())

list2 = [ A + K , B - K]
list3 = list(range(min(list2),max(list2)+1))
i = A
while i <= B:
    if i not in list3:
        print(i)
    elif A > B - K:
        print(i)
    i += 1
Problem p03385 (python)

Fixed submission:
s = str(input())

b = s.find("a")
v = s.find("b")
t = s.find("c")

m = int(b) + int(v) + int(t)

if m == 3:
    print("Yes")
if m != 3:
    print("No")

Buggy submission (verdict: Runtime Error):
s = str(input())

b = s.find("a")
v = s.find("b")
t = s.find("c")

m = int(b) + int(a) + int(c)

if m == 3:
    print("Yes")
if m != 3:
    print("No")