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

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

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

if (a * b) % 2 == 0:
    print("Even")
elif (a * b) % 2 != 0:
    print("Odd")
Problem p04030 (python)

Fixed submission:
a = list(input())
ans = []
for i in range(len(a)):
    if a[i] == '0':
        ans.append('0')
    elif a[i] == '1':
        ans.append('1')
    elif a[i] == 'B':
        if ans == []:
            continue
        else:
            ans.pop(-1)
print(''.join(ans))

Buggy submission (verdict: Runtime Error):
a = list(input())
ans = []
for i in range(len(a)):
    if a[i] == '0':
        ans.append('0')
    elif a[i] == '1':
        ans.append('1')
    elif a[i] == 'B':
        if ans == []:
            continue
        else:
            i -= 1
            ans.remove(ans[i])
print(''.join(ans))
Problem p04033 (python)

Fixed submission:
a, b = map(int, input().split())
c = b - a
if a <= 0 <= b:
    print("Zero")
 
elif a > 0:
    print("Positive")
 
elif b < 0:
    if c % 2 == 1:
        print("Positive")
    else:
        print("Negative")

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
c = b - a
if a <= 0 <= b:
    print("Zero")
 
elif a > 0:
    print("Positive")
 
elif b < 0:a
    if c%2 == 1:
        print("Positive")
    else:
        print("Negative")
Problem p02658 (python)

Fixed submission:
n = int(input())
arr = list(map(int, input().split()))
arr.sort()

ans = 1
for x in arr:
    ans *= x
    if ans > 10**18:
        ans = 10**19

if ans == 10**19:
  print(-1)
else:
  print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
arr = map(int, input().split())
arr.sort()

ans = 1
for x in arr:
	ans *= x
    if ans > 10**18:
    	ans = 10**19

if ans == 10**19:
  print(-1)
else:
  print(ans)
Problem p02553 (python)

Fixed submission:
a, b, c, d = map(int, input().split())
ans = max(max(a*c, a*d), max(b*c, b*d))
print(ans)

Buggy submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split)
ans = max(max(a*c, a*d), max(b*c, b*d))
print(ans)
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
x, y = map(int, input())
print(x * y)
Problem p02658 (python)

Fixed submission:
def main():
    n = int(input())
    nums = list(map(int, input().split()))
    
    if 0 in nums:
        print(0)
        return
    
    mul = 1
    for i in nums:
        mul *= i
        if mul > 1000000000000000000:
            print(-1)
            return
        
    print(mul)
    
main()

Buggy submission (verdict: Runtime Error):
def main():
    n = int(input())
    nums = list(map(int, input().split()))
    
    if 0 in nums:
        print(0)
        return
    
    mul = 1
    for i in nums:
        mul *= nums
        if mul >= 1000000000000000000:
            print(-1)
            return
        
    print(mul)
    
main()
Problem p02600 (python)

Fixed submission:
n = int(input())
a = 10 - n // 200
print(a)

Buggy submission (verdict: Runtime Error):
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define endl '\n'

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;

	int a = n / 200 - 1;
	a = 9 - a;

	cout << a << endl;
	return 0;
}
Problem p02608 (python)

Fixed submission:
n = int(input())

cnt = [0] * 10001

for i in range(1, 100):
	for j in range(1, 100):
		for k in range(1, 100):
			x = i*i + j*j + k*k + i*j + j*k + i*k
			if(x <= 10000):
				cnt[x]+=1

for i in range(1, n+1):
	print(cnt[i])

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

cnt = [0] * 1001

for i in range(1, 100):
	for j in range(1, 100):
		for k in range(1, 100):
			x = i*i + j*j + k*k + i*j + j*k + i*k
			if(x <= 1000):
				cnt[x]+=1

for i in range(1, n+1):
	print(cnt[i])
Problem p02641 (python)

Fixed submission:
x, n = input().split()
x = int(x)
n = int(n)

if n==0:
	print(x)
else:
	p = list(map(int, input().split()))

	ans = -1
	mn = 10000

	for i in range(-1, 102):
		if(p.count(i) == 0):
			d = x - i
			if d<0:
				d = -d
			if d<mn:
				ans = i
				mn = d
	print(ans)

Buggy submission (verdict: Runtime Error):
x, n = input().split()
x = int(x)
n = int(n)

if n==0:
	print(x)
else:
	p = list(map(int, input().split()))

	ans = -1
	mn = 10000

	for i in range(1, 101):
		if(p.count(i) == 0):
			d = x - i
			if d<0:
				d = -d
			if d<mn:
				ans = i
				mn = d
	if d == 10000:
		if(x <= 50):
			ans = 0
		else:
			ans = 101
	print(ans)
Problem p02718 (python)

Fixed submission:
N, M = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
minimum_votes = sum(A) * (1 / (4 * M))

eligible_products = [a for a in A if a >= minimum_votes]

if len(eligible_products) >= M:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N, M = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
total_votes = sum(A)
minimum_votes = int(total_votes / (4 * M)))
eligible_products = 0

for vote in A:
    if vote >= minimum_votes:
        eligible_products += 1

if eligible_products >= M:
    print("Yes")
else:
    print("No")
Problem p02767 (python)

Fixed submission:
N = int(input())
X = [int(i) for i in input().split()]

# X = sorted(X)
# X_undupe = list(set(X))
stamina = []
for i in range(1, 100):
    s = 0
    for ii in X:
        s = s + ((ii - i) ** 2)
    stamina.append(s)

print(min(stamina))

Buggy submission (verdict: Runtime Error):
N = int(input())
X = [int(i) for i in input().split()]

X = sorted(X)
X_undupe = list(set(X))
stamina = []
for i in range(X_undupe[0], X_undupe[len(X_undupe)-1] + 1):
    s = 0
    for ii in X:
        s = s + ((ii - i) ** 2)
    stamina.append(s)

print(min(stamina))

Buggy submission (verdict: Runtime Error):
N = int(input())
X = [int(i) for i in input().split()]

X = sorted(X)
X_undupe = list(set(X))
stamina = []
for i in range(X_undupe[0], X_undupe[len(X_undupe)-1] + 1):
    s = 0
    for ii in X:
        s = s + ((ii - i) * (ii - i))
    stamina.append(s)

print(min(stamina))
Problem p02917 (python)

Fixed submission:
def maximal():
    N = int(input())
    B = input()
    B = B.split()
    B = [int(i) for i in B]
    # length of values is N
    # any number more or equals than 0
    result = []
 
    result.append(B[0])
 
    for i in range(0, len(B) - 1):
        # if value is same put in first one
        compared = B[i]
        if B[i + 1] <= compared:
            result.append(B[i + 1])
        else:
            result.append(B[i])
 
    result.append(B[len(B) - 1])
    return sum(result)
 
 
print(maximal())

Buggy submission (verdict: Runtime Error):
def maximal():
    query = input().split('\n')
    B = query[1]
    B = B.split()
    B = [int(i) for i in B]
    # length of values is N
    # any number more or equals than 0
    result = []
 
    result.append(B[0])
 
    for i in range(0, len(B) - 1):
        # if value is same put in first one
        compared = B[i]
        if B[i + 1] <= compared:
            result.append(B[i + 1])
        else:
            result.append(B[i])
 
    result.append(B[len(B) - 1])
    return sum(result)
 
 
print(maximal())

Buggy submission (verdict: Runtime Error):
def maximal():
    query = input().split()
    B = query[1]
    B = B.split()
    B = [int(i) for i in B]
    # length of values is N
    # any number more or equals than 0
    result = []

    result.append(B[0])

    for i in range(0, len(B) - 1):
        # if value is same put in first one
        compared = B[i]
        if B[i + 1] <= compared:
            result.append(B[i + 1])
        else:
            result.append(B[i])

    result.append(B[len(B) - 1])
    return sum(result)


print(maximal())
Problem p02922 (python)

Fixed submission:
def power():
    A, B = map(int, input().split())
    socket = 1
    numberOfStrips = 0

    while socket < B:
        socket = socket + A - 1
        numberOfStrips = numberOfStrips + 1

    return numberOfStrips


print(power())

Buggy submission (verdict: Runtime Error):
import math
 
 
def power():
  	A, B= map(int, input().split())
    return math.ceil(A / B)
 
 
print(power())

Buggy submission (verdict: Runtime Error):
import math


def power():
  	A, B= map(int, input().split())
    return math.ceil(A / B)


print(power(8, 8))
Problem p02927 (python)

Fixed submission:
def calendar():
    m, d = map(int, input().split())
    res = []
 
    for month in range(1, m + 1):
        for day in range(2, 10):
            for x in range(2, 10):
                if x * day == month:
                    temp = str(day) + str(x)
                    temp = int(temp)
                    if temp <= d:
                        res.append(temp)
    return len(res)
 
 
print(calendar())

Buggy submission (verdict: Runtime Error):
def calendar():
    m, d = map(int, input().split())
    res = []

    for month in range(1, m + 1):
        for day in range(2, 9):
            for x in range(2, 9):
                if x * day == month:
                    temp = str(day) + str(x)
                    temp = int(temp)
                    if temp <= d:
                        res.append(temp)
    return len(res)


print(calendar('15 40'))

Buggy submission (verdict: Runtime Error):
def calendar(x):
    m, d = map(int, x.split())
    res = []
    for month in range(1, m + 1):
        for day in range(2, d + 1):
            for x in range(2, d + 1):
                if x * day == month:
                    temp = str(day) + str(x)
                    temp = int(temp)
                    if temp <= d:
                        res.append(temp)
    return len(res)


calendar()

Buggy submission (verdict: Runtime Error):
def calendar():
    m, d = map(int, x.split())
    res = []
    for month in range(1, m + 1):
        for day in range(2, d + 1):
            for x in range(2, d + 1):
                if x * day == month:
                    temp = str(day) + str(x)
                    temp = int(temp)
                    if temp <= d:
                        res.append(temp)
    print(len(res))


calendar()

Buggy submission (verdict: Runtime Error):
def calendar():
    m, d = map(int, x.split())
    print(m)
    res = []
    for month in range(1, m + 1):
        for day in range(2, d + 1):
            for x in range(2, d + 1):
                if x * day == month:
                    temp = str(day) + str(x)
                    temp = int(temp)
                    if temp <= d:
                        res.append(temp)
    print(len(res))


calendar()

Buggy submission (verdict: Runtime Error):
def calendar():
    m, d = map(int, input().split())
    
    res = []
    for month in range(1, m + 1):
        for day in range(2, d + 1):
            for x in range(2, d + 1):
                if x * day == month:
                    temp = str(day) + str(x)
                    temp = int(temp)
                    if temp <= d:
                        res.append(temp)
    return res


calendar(15, 40)
Problem p02946 (python)

Fixed submission:
def stones(input):
    k, x = map(int, input.split())
    if k is 1:
        print(x)
        return x
    j = [i for i in range(x - k + 1, x + k)]
    s = ' '.join(map(str, j))
    print(s)
    return
 
 
stones(input())

Buggy submission (verdict: Runtime Error):
def stones(input):
  	k = int(input[0])
    x = int(input[1])
    if k is 1:
        print(x)
        return x
    j = [i for i in range(x - k, x + k)]
    s = ' '.join(map(str, j))
    print(s)
    return


stones(input())
Problem p02958 (python)

Fixed submission:
def test(x, j):
    # X, A = map(int, input().split())
    A = j.split()
    numbers = []
    result = True
    for i in A:
        numbers.append(int(i))
    result = sorted(numbers)
    if (result == True):
        print("YES")
        return "YES"
    if (result == False):
        # numbers2 = numbers[:]
        for i in range(len(numbers)):
            for x in range(i+1, len(numbers)):
                numbers2 = numbers[:]
                if swap(numbers2, i, x) == True:
                    print("YES")
                    return "TRUE"
    print("NO")
    return "FALSE"


def sorted(list):
    result = True
    for i in range(len(list)):
        if i < len(list) - 1:
            if (list[i] > list[i+1]):
                result = False
    return result


def swap(list, pos1, pos2):
    list[pos1], list[pos2] = list[pos2], list[pos1]
    return sorted(list)


N = int(input())
p = input()
test(N, p)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = map(int, input().split())
numbers = []
result = True
for i in A:
  numbers.append(int(i))
  result = sorted(numbers)
  if (result == True):
    print("YES")
    return "YES"
  if (result == False):
    for i in range(len(numbers)):
      for x in range(i+1, len(numbers)):
        numbers2 = numbers[:]
        if swap(numbers2, i, x) == True:
          print("TRUE")
          return "TRUE"
        print("FALSE")
        return "FALSE"


def sorted(list):
    result = True
    for i in range(len(list)):
        if i < len(list) - 1:
            if (list[i] > list[i+1]):
                result = False
    return result


def swap(list, pos1, pos2):
    list[pos1], list[pos2] = list[pos2], list[pos1]
    return sorted(list)

Buggy submission (verdict: Runtime Error):
X, A = map(int, input().split("/n))
A = j.split()
numbers = []
result = True
for i in A:
  numbers.append(int(i))
  result = sorted(numbers)
  if (result == True):
    print("YES")
    return "YES"
  if (result == False):
    # numbers2 = numbers[:]
    for i in range(len(numbers)):
      for x in range(i+1, len(numbers)):
        numbers2 = numbers[:]
        if swap(numbers2, i, x) == True:
          print("TRUE")
          return "TRUE"
        print("FALSE")
        return "FALSE"


def sorted(list):
    result = True
    for i in range(len(list)):
        if i < len(list) - 1:
            if (list[i] > list[i+1]):
                result = False
    return result


def swap(list, pos1, pos2):
    list[pos1], list[pos2] = list[pos2], list[pos1]
    return sorted(list)
Problem p03239 (python)

Fixed submission:
N, T = [int(i) for i in input().split()]
C = []

for i in range(N):
    C.append([int(i) for i in input().split()])

x = T
res = []

for c in C:
    cost = c[0]
    time = c[1]
    if time <= x:
        res.append(cost)
    

if len(res) == 0:
    print("TLE")
else:
    p = min(res)
    print(p)

Buggy submission (verdict: Runtime Error):
N, T = [int(i) for i in input().split()]
C = []

for i in range(N):
    C.append([int(i) for i in input().split()])

min = T
res = []

for c in C:
    cost = c[0]
    time = c[1]
    if time <= min:
        res.append(cost)
    

if len(res) == 0:
    print("TLE")
else:
    print(min(res))
Problem p02719 (python)

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

x = n % k
print(min(x, abs(k-x)))

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())

x = n % k
print(min(x, abs(k-x))
Problem p02768 (python)

Fixed submission:
def com(n, r, mod):
    num = 1
    den = 1
    for i in range(r):
        num = (num * (n-i)) % mod
        den = (den * (i+1)) % mod
    return num * pow(den, mod-2, mod)

N, A, B = map(int, input().split())

mod = 10**9 + 7

sum = pow(2, N, mod) - 1
sum -= com(N, A, mod)
sum -= com(N, B, mod)

print(int(sum % mod))

Buggy submission (verdict: Runtime Error):
  import sys

stdin = sys.stdin

ni = lambda: int(ns())
ns = lambda: stdin.readline().rstrip()
na = lambda: list(map(int, stdin.readline().split()))

# code here
n, a, b = na()
mod = 1000000007

def c(n, r):
    nu = 1
    de = 1
    for i in range(r):
        # nCr の分子
        nu = nu * (n - i) % mod
        # nCr の分母
        de = de * (i + 1) % mod
    # フェルマーの小定理より
    return nu * pow(de, mod - 2, mod) % mod

print((pow(2, n, mod) - c(n, a) - c(n, b) - 1) % mod)
Problem p02813 (python)

Fixed submission:
import itertools
import sys

N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))

if P == Q:
    print(0)
else:
    M = [0]*N
    for i in range(N):
        M[i] = i+1

    ans = []
    for i, v in enumerate(itertools.permutations(M, N)):
        if v in [P, Q]:
            ans.append(i)

    print(abs(ans[0] - ans[1]))

Buggy submission (verdict: Runtime Error):
import itertools
import sys

N = int(input())

T = []
T.append(tuple(map(int, input().split())))
T.append(tuple(map(int, input().split())))

if T[0] == T[1]:
    print(0)
    sys.exit(0)

M = [0]*N
for i in range(N):
    M[i] = i+1

ans = []
for i, v in enumerate(itertools.permutations(M, N)):
    if v in T:
        ans.append(i)

print(abs(ans[0] - ans[1])

Buggy submission (verdict: Runtime Error):
import itertools

N = int(input())
T = []
T.append(tuple(map(int, input().split())))
T.append(tuple(map(int, input().split())))

M = [0]*N
for i in range(N):
    M[i] = i+1

ans = []
for i, v in enumerate(itertools.permutations(M, N)):
    if v in T:
        ans.append(i)

print(abs(ans[0] - ans[1]))
Problem p02995 (python)

Fixed submission:
from fractions import gcd

A, B, C, D = map(int, open(0).read().split())
k = (C*D)//gcd(C,D)

def calc(x):
    q = (x//C)+(x//D)-(x//k)
    return x-q

print(calc(B) - calc(A-1))

Buggy submission (verdict: Runtime Error):
from math import gcd

A, B, C, D = map(int, open(0).read().split())
k = (C*D)//gcd(C,D)

def calc(x):
    q = (x//C)+(x//D)-(x//k)
    return x-q

print(calc(B) - calc(A-1))
Problem p03035 (python)

Fixed submission:
A, B = map(int, open(0).read().split())
if A <= 5:
    print(0)
elif 6 <= A <= 12:
    print(B // 2)
else:
    print(B)

Buggy submission (verdict: Runtime Error):
    A, B = map(int, input().split())
    if A <= 5:
      print(0)
    elif 6 <= A <= 12:
      print(B // 2)
    else:
      print(B)

Buggy submission (verdict: Runtime Error):
A, B = map(int, input().split())
if A <= 5:
  print(0)
elif 6 <= A <= 12:
  print(B // 2)
else:
  print(B
Problem p03060 (python)

Fixed submission:
N, *V = map(int, open(0).read().split())
s = 0
for i in range(N):
    v = V[i]
    c = V[i+N]
    s += (v - c if v - c > 0 else 0)

print(s)

Buggy submission (verdict: Runtime Error):
N = int(input())
X = []
Y = []

for x in map(int, input().split()):
    X.append(x)

for y in map(int, input().split()):
    Y.append(y)

d_list = []

for i in  range(N):
    d = X[i] - Y[i]
    if d > 0:
        d_list.append(d)

if d_list:
    print(max(d_list) + min(d_list))
else:
    print(0)
Problem p03062 (python)

Fixed submission:
N, *A = map(int, open(0).read().split())
negative_num = sum(1 if a < 0 else 0 for a in A)
positive_num = list(abs(n) for n in A)

if negative_num % 2 == 0:
    print(sum(positive_num))
else:
    print(sum(positive_num) - 2*min(positive_num))

Buggy submission (verdict: Runtime Error):
N, *A = map(int, open(0).read().split())
n = N//3 + (1 if N % 3 == 0 else 2)
cur_i = []

for i in range(n):
    a = A[i]
    b = A[i+1]
    c = A[i+2]

    if a < 0 and b < 0 and c < 0:
        if A[i-1] * -1 > A[i+3] * -1:
            cur_i.append(i-1)
        else:
            cur_i.append(i+3)

ans = 0
for i, a in enumerate(A):
    if i in cur_i:
        ans += a * -1
    else:
        ans += abs(a)

print(ans)
Problem p03076 (python)

Fixed submission:
I = ["{0:03d}".format(int(n)) for n in open(0).read().split()]
c = 0
min_z = 10
for i in I:
    x, y, z = map(int, i)
    if 0 < z < min_z:
        min_z = z
    if 0 < z:
        y +=1
    if 9 < y:
        x += 1
        y -= 10
    n = x * 100 + y * 10
    c += n

print(c+min_z-10)

Buggy submission (verdict: Runtime Error):
A = list(map(int, open(0).read().split()))
A = [(a, a%10) for a in A]
zeros = list(filter((lambda x: x[1] == 0), A))
A = list(filter((lambda x: x[1] != 0), A))
m = min(A, key=(lambda x: x[1]))[0]
A = list(filter((lambda x: x[0] != m), A))

s = sum([z[0] for z in zeros])
for a in A:
    a = a[0]
    t = (a//10+1)*10
    s += t

print(s + m)
Problem p03085 (python)

Fixed submission:
A = input()
B = {'A':'T', 'T':'A', 'C':'G', 'G':'C'}
print(B[A])

Buggy submission (verdict: Runtime Error):
A = open(0).read()
B = {'A':'T', 'T':'A', 'C':'G', 'G':'C'}
print(B[A])
Problem p03206 (python)

Fixed submission:
D = int(input())
if D == 25:
  print('Christmas')
elif D == 24:
  print('Christmas Eve')
elif D == 23:
  print('Christmas Eve Eve') 
elif D == 22:
  print('Christmas Eve Eve Eve')

Buggy submission (verdict: Runtime Error):
D = int(input())
if D == 25:
  print('Christmas')
elif D == 24:
  print('Christmas Eve')
elif D == 23:
  print('Christmas Eve Eve') 
elif D == 22:
  print('Christmas Eve Eve Eve')
 D = int(input())
if D == 25:
  print('Christmas')
elif D == 24:
  print('Christmas Eve')
elif D == 23:
  print('Christmas Eve Eve') 
elif D == 22:
  print('Christmas Eve Eve Eve')
Problem p03262 (python)

Fixed submission:
import math
from functools import reduce

def gcd(ns):
    return reduce(math.gcd, ns)

N, X = map(int, input().split())
L = list(map(int, input().split()))

diff = [abs(x - X) for x in L]

if len(diff) == 1:
    print(diff[0])
else:
    print(gcd(diff))

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

min_dist = abs(X - min(L))

ans = 1

for d in range(min_dist, 0, -1):
    b = all((x - X) % d == 0 for x in L)
    if b:
        print(d)
        break

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

min_dist = abs(X - min(L))

ans = 1

for d in range(min_dist, 0, -1):
    b = all((x - X) % d == 0 for x in L)
    if b:
        print(d)
        break
Problem p02641 (python)

Fixed submission:
X, N = map(int, input().split())
p = list(map(int, input().split()))

i = 0
while True:
    if X - i not in p:
        print(X - i)
        break
    elif X + i not in p:
        print(X + i)
        break
    i += 1

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

if p:
    x = [i for i in range(1, max(p)) if i not in p]

    c = x.pop()
    a = abs(c - X)
    for i in x:
        if abs(i - X) < a:
            c = i
    print(c)
else:
    print(X)
Problem p02802 (python)

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

ac = [0] * N
wa = [0] * N
buff = [0] * N
for _ in range(M):
    p, S = input().split()
    p = int(p) - 1
    if ac[p] == 0:
        if S == 'AC':
            ac[p] = 1
            wa[p] = buff[p]
        else:
            buff[p] += 1
print(sum(ac), sum(wa))

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())

acs = set()
was = 0
for _ in range(M):
    p, S = input().split()
    p = int(p)
    if p not in acs:
        if S == 'AC':
            acs.add(p)
            wa = was
            was = 0
        else:
            was += 1
print(len(acs), wa)
Problem p02922 (python)

Fixed submission:
import math

A, B = map(int, input().split())
if B == 1:
    print(0)
else:
    ans = math.ceil(B / A)
    while A * ans - (ans - 1) < B:
        ans += 1
    print(ans)

Buggy submission (verdict: Runtime Error):
for i in range(B):
    if A * i >= B:
        print(i)
        break
Problem p02946 (python)

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

low = X - K
hight = X + K

a = set()
for x in range(low + 1, hight, 1):
    a.add(x)
a = sorted(a)
b = [str(x) for x in a]
print(' '.join(b))

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

low = X - K
hight = X + K

a = set()
for x in range(low + 1, hight, 1):
    a.add(x)
print(' '.join([str(x) for x in sorted(a)]b))