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

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

# aとcの距離の絶対値ACを定義
if (a - c) >= 0:
    AC = (a-c)
else:
    AC = (c-a)

# BがAとCの間に入る場合のみ、AB間、BC間を定義
if a < b < c:
    AB = (b - a)
    BC = (c - b)
if c < b < a:
    AB = (a-b)
    BC = (b-c)

# AとCの距離がd以下ならYes！
if AC <= d:
    print('Yes')
# AB間、BC間ともにd以下ならYes！
elif AB <= d and BC <= d:
    print('Yes')
else:
    print('No')

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

# aとcの距離の絶対値ACを定義
if (a - c) <= 0:
    AC = (a-c)
else:
    AC = (c-a)

# BがAとCの間に入る場合のみ、AB間、BC間を定義
if a < b < c:
    AB = (b - a)
    BC = (c - b)
if c < b < a:
    AB = (a-b)
    BC = (b-c)

# AとCの距離がd以下ならYes！
if AC <= d:
    print('Yes')

# AB間、BC間ともにd以下ならYes！
if AB <= d and BC <= d:
    print('Yes')
else:
    print('No')

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

# aとcの距離の絶対値ACを定義
if (a - c) <= 0:
    AC = (a-c)
else:
    AC = (c-a)

# BがAとCの間に入る場合のみ、AB間、BC間を定義
if a < b < c:
    AB = (b - a)
    BC = (c - b)
if c < b < a:
    AB = (a-b)
    BC = (b-c)

# AとCの距離がd以下ならYes！
if AC <= d:
    print('Yes')
if (AC - AB - BC) <= d:
    print('Yes')
else:
    print('No')
Problem p03399 (python)

Fixed submission:
A = int(input())
B = int(input())
C = int(input())
D = int(input())

if A <= B:
    train = A
else:
    train = B
if C <= D:
    bus = C
else:
    bus = D

answer = (train + bus)
print(answer)

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

if A <= B:
    train = A
else:
    train = B
if C <= D:
    bus = C
else:
    bus = D
    
answer = train + bus
print(answer)

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

if A <= B:
    train = A
else:
    train = B
if C <= D:
    bus = C
else:
    bus = D

print(train + bus)
Problem p03455 (python)

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

if x % 2 == 0:
    answer = 'Even'
elif x % 2 == 1:
    answer = 'Odd'

print(answer)

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

x = a * b

if x % 2 == 0:
    answer = 'Even'
elif x % 2 == 1:
    answer = 'Odd'

print(answer)
Problem p03610 (python)

Fixed submission:
s = input()
s.split()
odd = []

for i in range(len(s)):
    if i % 2 == 0:
        odd.append(s[i])
answer = ''.join(odd)

print(answer)

Buggy submission (verdict: Runtime Error):
s = input()
s.split()
odd = []

for i in range():
    if i % 2 == 0:
        odd.append(s[i])
answer = ''.join(odd)

print(answer)
Problem p02657 (python)

Fixed submission:
#169A
#A*Bを整数として出力せよ
#1.入力をプログラムで扱えるように受け取ること
a,b = map(int, input().split())
#print(a,b)
#2.受け取った入力値を使って適切に処理（計算）すること
answer = a * b

#3.計算した結果を出力すること
print(answer)

Buggy submission (verdict: Runtime Error):
a,b = map(int,int().input())
print(a * b)
Problem p03293 (python)

Fixed submission:
s = input()
t = input()

s = list(s)
t = list(t)

count = 0
judgment = 0

while count <= len(s):
    count +=1
    item = s.pop()
    s.insert(0,item)
    if s == t:
        judgment += 1

if judgment == 0:
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
英小文字からなる文字列S,Tが与えられます。Sを回転させてTに一致させられるか判定してください。
すなわち、以下の操作を任意の回数繰り返してSをTに一致させられるか判定してください。
操作:S=S1S2...S|S|のとき、SをS|S|S1S2...S|S|−1に変更する
ここで、|X|は文字列Xの長さを表します。
"""

s = input()
t = input()
# s,tをリストにする
s = list(s)
t = list(t)

# 変数count,judgementに0を代入
count = 0
judgment = 0

# sの長さだけ順番入れ替えを繰り返し
while count <= len(s)+1:
    item = s.pop()
    s.insert(0,item)
    if s == t:
        # s==tになったらjudgmentでカウントアップ
        judgment += 1
    # 回数をカウントアップ
    count +=1

# 一回もs==tになってなければNo
if judgment == 0:
    print("No")
else:
    print("Yes")
Problem p03597 (python)

Fixed submission:
# Nのますめと白に塗ったマス目Aを整数で入力
N = int(input())
A = int(input())
# N*NマスからAマス塗ったを余りを出力
print(N**2 - A)

Buggy submission (verdict: Runtime Error):
# N*Nのますめと白に塗ったマス目Aを整数で入力
N,A = map(int,input().split())
# N*NマスからAマス塗ったを余りを出力
print(N**2 - A)
Problem p03693 (python)

Fixed submission:
# 100の位r,10の位g,1の位ｂに整数を入力
r,g,b = map(int,input().split())
# 100r+10g+bが4の倍数ならYES、違うならNO
if (100 * r + 10 * g + b) % 4 == 0:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
# 100の位r,10の位g,1の位ｂに整数を入力
r,g,b = map(int,input().split())
# 100r+10g+bが4の倍数ならYES、違うならNO
if (100r + 10g +b) // 4 == 0:
    print("YES")
else:
    print("NO")
Problem p03777 (python)

Fixed submission:
# AtCoDeerくんとTopCoDeerくんが何と言ってるかを a,bで入力
a,b = input().split()
# もしa=Hでb=HならTopCoDeerくんは正直者
if a == "H" and b == "H":
    print("H")
# もしa=Dでb=HならTopCoDeerくんは正直者
elif a == "D" and b == "D":
    print("H")
# それ以外はbは嘘つき
else:
    print("D")

Buggy submission (verdict: Runtime Error):
# AtCoDeerくんとTopCoDeerくんが何と言ってるかを a,bで入力
a,b = input().split()
# もしa=Hでb=HならTopCoDeerくんは正直者
if a = "H":
    if b = "H":
        print("H")
# もしa=Dでb=HならTopCoDeerくんは正直者
elif a = "D":
    if b = "D":
        print("H")
# それ以外はbは嘘つき
else:
    print("D")
Problem p04011 (python)

Fixed submission:
# 一泊X円、N(泊数)がK泊より多ければその分だけ一泊Y円
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
# K泊より多い場合はその分だけ単価Y円を掛ける
if N >= K:
    total_price = K * X + (N - K) * Y
# K泊より少ない場合は泊数に単価X円を掛ける
else:
    total_price = N * X

print(total_price)

Buggy submission (verdict: Runtime Error):
# 一泊X円、N(泊数)がK泊より多ければその分だけ一泊Y円
N,K,X,Y = map(int,input().split())
# K泊より多い場合はその分だけ単価Y円を掛ける
if N > K:
    total_price = K * X + (N - K) * Y
# K泊より少ない場合は泊数に単価X円を掛ける
else:
    total_price = N * X

print(total_price)

Buggy submission (verdict: Runtime Error):
# 一泊X円、N(泊数)がK泊より多ければその分だけ一泊Y円
N,K,X,Y = map(int,input().split())
# K泊より多い場合はその分だけ単価Y円を掛ける
if N >= K:
    total_price = K * X + (N - K) * Y
# K泊より少ない場合は泊数に単価X円を掛ける
else:
    total_price = N * X

print(total_price)
Problem p02694 (python)

Fixed submission:
def atc_165b(X: int) -> int:
    savings = 100
    years = 0

    while savings < X:
        years += 1
        # savings += savings * 0.01 * 100 // 100
        savings += savings // 100
    return years

X = int(input())
print(atc_165b(X))

Buggy submission (verdict: Runtime Error):
import math
 
X=int(input())
def ans165(X:int):
    cash=100#当初の預金額
    count=0
    while True:
        # cash=int(cash*1.01) #元本に１パーセントの利子をつけ小数点以下切り捨て # WA
        # cash = cash * 1.01 * 100 // 100 # 1%の利子をつけて100倍した後に100で割って整数部のみ取り出す # WA
        # cash += cash * 0.01 * 100 // 100 # 1%の利子を計算して100倍した後に100で割って整数部のみ取り出す # WA
        # cash += cash // 100 # 元本に100で割った整数部を足す # AC
        # cash += math.floor(cash * 0.01) # WA
        # cash += math.floor(cash / 100) # WA
        # cash += math.floor(cash // 100) # AC
        cash += int(math.floor(cash / 100)
        count += 1#利子をつける回数だけcountを増やす
        if cash>=X:#cashがXの値以上になったらループ終了
            break
    return count
print(ans165(X))

Buggy submission (verdict: Runtime Error):
from math
X=int(input())
def ans165(X:int):
    cash=100#当初の預金額
    count=0
    while True:
        # cash=int(cash*1.01) #元本に１パーセントの利子をつけ小数点以下切り捨て
        # cash += cash // 100 # 元本に100で割った整数部を足す
        cash += math.floor(cash * 0.01)
        count += 1#利子をつける回数だけcountを増やす
        if cash>=X:#cashがXの値以上になったらループ終了
            break
    return count
print(ans165(X))
Problem p02724 (python)

Fixed submission:
def atc_160b(X: int) -> int:
    return X // 500 * 1000 + X % 500 // 5 * 5


X_input = int(input())
print(atc_160b(X_input))

Buggy submission (verdict: Runtime Error):
def atc_160b(X: int) -> int:
    return X // 500 * 1000 + X % 500 // 5 * 5

X_input = input()
print(atc_160b(X_input))
Problem p02772 (python)

Fixed submission:
# 155b

def atc_155b(input_value: str) -> str:
    N = int(input_value[0])
    Ai = [int(ai) for ai in input_value[1].split(" ")]
    for i in range(0, N):
        if Ai[i] % 2 == 0 and Ai[i] % 3 != 0 and Ai[i] % 5 != 0:
            return "DENIED"
    return "APPROVED"

N = input()
Ai = input()
print(atc_155b([N, Ai]))

Buggy submission (verdict: Runtime Error):
# 155b

def atc_155b(input_value: str) -> str:
    N = int(input_value[0])
    Ai = [int(ai) for ai in input_value[1].split(" ")]
    for i in range(0, N):
        if Ai[i] % 2 == 0 and Ai[i] % 3 != 0 and Ai[i] % 5 != 0:
            return "DENIED"
    return "APPROVED"

N = input()
Ai = input()
print(atc_155b[N, Ai])
Problem p02898 (python)

Fixed submission:
def atc_142b(NK_input: str, hi_input: str) -> int:
    N, K = map(int, NK_input.split(" "))
    hi = [int(i) for i in hi_input.split(" ")]
    hi = sorted(hi)
    for i in range(0, len(hi)):
        if hi[i] >= K:
            return len(hi) - i
    return 0


NK_input_value = input()
hi_input_value = input()
print(atc_142b(NK_input_value, hi_input_value))

Buggy submission (verdict: Runtime Error):
def atc_142b(NK_input: str, hi_input: str) -> int:
    N, K = map(int, NK_input.split(" "))
    hi = [int(i) for i in hi_input.split(" ")]
    hi = sorted(hi)
    for i in range(0, len(hi)):
        if hi[i] >= K:
            return len(hi) - i
    return 0

NK_input_value = input()
hi_input_value = input()
pritn(atc_142b(NK_input_value, hi_input_value))
Problem p03136 (python)

Fixed submission:
# 117b

def atc_117b(N: int, Li_input: str) -> str:
    Li = [int(i) for i in Li_input.split(" ")]
    Li = sorted(Li)
    max_length = Li.pop()
    if max_length < sum(Li):
        return "Yes"
    return "No"

N_input_value = int(input())
Li_input_value = input()
print(atc_117b(N_input_value, Li_input_value))

Buggy submission (verdict: Runtime Error):
# 117b

def atc_117b(N: int, Li_input: str) -> str:
    Li = [int(i) for i in Li_input.split(" ")]
    Li = sorted(Li)
    max_length = Li.pop()
    if max_length < sum(Li):
        return "Yes"
    return "No"

N_input_value = int(input())
Li_input_Value = input()
print(atc_117b(N_input_value, Li_input_value))
Problem p03555 (python)

Fixed submission:
# 077a

def atc_077a(input_value: str) -> str:
    C1 = input_value[0]
    C2 = input_value[1]

    if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]:
        return "YES"
    else:
        return "NO"


C1 = input()
C2 = input()
print(atc_077a([C1, C2]))

Buggy submission (verdict: Runtime Error):
# 077a

def atc_077a(input_value: str) -> str:
    C1 = input_value[0]
    C2 = input_value[1]

    if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]
        return "YES"
    else:
        return "NO"


C1 = input()
C2 = input()
print(atc_077a([C1, C2]))

Buggy submission (verdict: Runtime Error):
# 077a

def atc_077a(input_value: str) -> str:
    C1 = input_value[0]
    C2 = input_value[1]

    if C1[0] == C2[2] and C1[1] == C2[1]:
        return "YES"
    else:
        return "NO"

C1 = input()
C2 = input()
print(atc_077a(C1,C2))
Problem p04043 (python)

Fixed submission:
# 042a

def atc_042a(input_value: str) -> str:
    ABC = input_value.split(" ")
    if ABC.count("5") == 2 and ABC.count("7") == 1:
        return "YES"
    return "NO"

input_value_1 = input()
print(atc_042a(input_value_1))

Buggy submission (verdict: Runtime Error):
# 042a

def atc_042a(input_value: str) -> str:
    ABC = input_value.split(" ")
    if ABC.count("5") == 2 and ABC.count("7") == 1:
        return "YES"
    return "NO"

Input_value_1 = input()
print(atc_042a(input_value_1))
Problem p03351 (python)

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

if abs(c-a) <= d:
    print('Yes')
elif abs(b-a) <= d and abs(c-b) <= d:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
if abs(c-a) <= d:
    print('Yes')
elif abs(b-a) <= d and abs(c-b) <= d:
    print('Yes')
else:
    print('No')
Problem p02657 (python)

Fixed submission:
# 入力をプログラムで扱えるように受け取ること
a, b = map(int, input().split())
# print(a, b)

# 受け取った入力値を使い、適切に処理（計算）する
anser = a * b

# 計算した結果を出力する
print(anser)

Buggy submission (verdict: Runtime Error):
    # 入力をプログラムで扱えるように受け取ること
    a, b = map(int, input().split())
    # print(a, b)
     
    # 受け取った入力値を使い、適切に処理（計算）する
    answer = a * b
     
    # 計算した結果を出力する
    print(answer)
Problem p03351 (python)

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

if abs(a-b) <= d and abs(b-c) <= d or abs(a-c) <= d:
    print('Yes')
else:
    print('No')

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

if e(a-b) <= d and e(b-c) <= d or e(a-c) <= d:
    print('Yes')
else:
    print('No')

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

if ab(a-b) <= d and bc(b-c) <= d or ac(a-c) <= d:
    print('Yes')
else:
    print('No')

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

ab = a - b
bc = b - c
ac = a - c

if a <= b <= c <= or  c < b < a:
  if ab <= d and bc <= d or ac <= d:
      print("Yes")
  else:
      print("No")
else:
  if ac <= d:
    print("Yes")
  else:
    print("No")

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

ab = a - b
bc = b - c
ac = a - c

if a <= b <= c <= or  c < b < a
  if ab <= d and bc <= d or ac <= d:
      print("Yes")
  else:
      print("No")
else:
  if ac <= d
    print("Yes")
  else:
    print("No")

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

ab = a - b
bc = b - c
ac = a - c

if ab <= d and bc <= d or ac <= d:
    print("Yes")
else:
    print("No")

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

ab = a - b
bc = b - c
ac = a - c

if ab <= d and bc <= d or ac <= d:
    print("Yes")
else:
    print("No")

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

ab = a - b
bc = b - c
ac = a - c

if ab <= d and bc <= d or ac <= d:
    print("Yes")
else:
    print("No"

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

ab = a - b
bc = b - c
ac = a - c

if ab <= d and bc <= d or ac <= d:
    print("Yes")
else:
    print("No")
Problem p03447 (python)

Fixed submission:
x = int(input())
a = int(input())
b = int(input())

xa = x - a
xab = xa // b
answer = xa - (b * xab)

print(answer)

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

xa = x - a
xab = xa // b
answer = xa - (b * xab)

print(answer)
Problem p03671 (python)

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

Buggy submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
print(max(a * b, a * c, c * b))
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 = int(input())
b = int(input())
c = int(input())

ba = b - a
cb = c - b

if ba == cb:
    print("Yes")
else:
    print("No")
Problem p03795 (python)

Fixed submission:
n = int(input())

if n >= 15:
    x = n * 800
    y =( n // 15 ) * 200
    answer = x - y
    print(answer)
else:
    answer = n * 800
    print(answer)

Buggy submission (verdict: Runtime Error):
if n >= 15:
    x = n * 800
    y = ( n // 15 ) * 200
    print(x - y)
else:
    print(n * 800)
Problem p03943 (python)

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

if a == b + c or b == a + c or c == a + b:
  print("Yes")
else:
  print("No")

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

if a == b + c or b == a + c or c == a + b:
  print("Yes")
else:
  print("No")
Problem p03997 (python)

Fixed submission:
a = int(input())
b = int(input())
h = int(input())

answer = (a + b) * h // 2

print(answer)

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

answer = (a + b) * h // 2

print(answer)

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

answer = (a + b) * h / 2

print(answer)

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

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

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

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

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

answer = (a + b) * h / 2

print(answer)

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

answer = (a + b) * c / 2

print(answer)
Problem p03308 (python)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
print(max(A)-min(A))

Buggy submission (verdict: Runtime Error):
N = int(input())
A = []
for i in range(N):
    A.append(int(input()))
print(max(A)-min(A))
Problem p03351 (python)

Fixed submission:
a,b,c,d = map(int , input().split())
if abs(c -a) <= d :
    print('Yes')
elif abs(b -a) <= d and abs(c -b) <= d:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
if abs(c -a) <= d :
    print('Yes')
elif abs(b -a) <= d and abs(c -b) <= d:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
if abs(a -c) <= d :
    print('Yes')
elif abs(a - b) <= d and abs(b -c) <= d:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
if a - c <= d or c - a <= d :
    print('Yes')
elif a -c <= d or c - a <= d and b - c >= d or c - b <= d:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
if a - c <= d or c - a <= d :
    print('Yes')
else:
    print('No')
Problem p03399 (python)

Fixed submission:
A = int(input())
B = int(input())
C = int(input())
D = int(input())
print(min(A,B)+ min(C,D))

Buggy submission (verdict: Runtime Error):
A,B,C,D = map(int,input().split())
print(min(A,B)+ min(C,D))

Buggy submission (verdict: Runtime Error):
A,B,C,D = map(int,input().split())
list1 = [A,B]
list2 = [C,D]
print(min(list1)+ min(list2))

Buggy submission (verdict: Runtime Error):
A,B,C,D = map(int,input().split())
list1 = [A,B]
list2 = [C,D]
X = min(list1)
Y = min(list2)
print(Y + X)
Problem p03455 (python)

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

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a*b%2 ==0:
    print('Even')
else:
    print('Odd')

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a*b%2 ==0:
    print('Even')
else:
    print('0dd')
Problem p03555 (python)

Fixed submission:
n = str(input())
s = str(input())
if n[0]== s[2]and n[1]==s[1] and n[2]== s[0]:
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
n ,s = map(str,input().split())
if n[0]== s[2]and n[1]==s[1] and n[2]== s[0]:
    print('Yes')
else:
    print('No')
Problem p03729 (python)

Fixed submission:
A,B,C = map(str,input().split())
if A[-1] == B[0] and B[-1] == C[0]:
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
A = input()
B = input()
C = input()
if A[-1] == B[0] and B[-1] == C[0]:
    print('Yes')
else:
    print('No')
Problem p03795 (python)

Fixed submission:
n = int(input())
print(800 * n - 200 * (n // 15))

Buggy submission (verdict: Runtime Error):
N = int(input())
x = 800*N
if 15 <= N <30 :
    y = 200
elif  30<= N <45:
    y = 400
elif 45 <= N <60:
    y = 600
elif 60 <= N < 75:
    y = 800
elif 75 <= N < 90:
    y = 1000
elif 90 <= N < 100:
    y = 1200
elif N ==100:
    y = 1200
print(x - y)

Buggy submission (verdict: Runtime Error):
N = int(input())
x = 800*N
if 15 <= int(N) <30 :
    y = 200
elif  30<= int(N) <45:
    y = 400
elif 45 <= int(N) <60:
    y = 600
elif 60 <= int(N) < 75:
    y = 800
elif 75 <= int(N) < 90:
    y = 1000
elif 90 <= int(N) < 100:
    y = 1200
elif int(N) ==100:
    y = 1200
print(x - y)
Problem p03952 (python)

Fixed submission:
import sys
if __name__ == '__main__':
    N,x = list(map(int,input().split()))
    if 1 < x < 2*N - 1:
        print('Yes')
        for i in range(2*N - 1):
            print(1+ ((x-N+i)%(2*N - 1)))
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
import sys
if __name__ == '__main__':
    N,x = list(map(int,input().split()))
    if 1 < x < 2*N - 1:
        print('Yes')
        L = [i+1 for i in range(2*N - 1)]
        ANS = [-1 for i in range(2*N - 1)]
        if N != 2:
            subset = []
            if x == 2:
                subset = [x+1,x,x-1,x+2]
            else:
                subset = [x-1,x,x+2,x-2]
            for i in subset:
                L.remove(i)
            ANS[N-2:N+2] = subset
            for i in range(2*N-1):
                if ANS[i] == -1:
                    ANS[i] = L.pop()
        else:
            ANS = [1,2,3]
        for i in ANS:
            print(i)
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
import sys
if __name__ == '__main__':
    N,x = list(map(int,input().split()))
    if 1 < x < 2*N - 1:
        print('Yes')
        L = [i+1 for i in range(2*N - 1)]
        if N == 2:
            for i in L:
                print(i)
        else:
            L[L.index(x+1)],L[N-2] = L[N-2],x+1
            L[L.index(x)],L[N-1] = L[N-1],x
            L[L.index(x-1)],L[N] = L[N],x-1
            L[L.index(x+2)],L[N+1] = L[N+1],x+2
            for i in L:
                print(i)
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
import sys
if __name__ == '__main__':
    N,x = list(map(int,input().split()))
    if 1 < x < 2*N - 1:
        print('Yes')
        L = [i+1 for i in range(2*N - 1)]
        L[L.index(x+1)],L[N-2] = L[N-2],x+1
        L[L.index(x)],L[N-1] = L[N-1],x
        L[L.index(x-1)],L[N] = L[N],x-1
        L[L.index(x+2)],L[N+1] = L[N+1],x+2
        for i in L:
            print(i)
    else:
        print('No')
Problem p02837 (python)

Fixed submission:
from collections import Counter
N = int(input())
ans = 0
evidence = [[] for n in range(N)]

for n in range(N):
    A = int(input())
    for a in range(A):
        lis = list(map(int, input().split()))
        evidence[n].append(lis)

for n in range(1 << N):
    bits = [(n >> i) & 1 for i in range(N)]
    flag = True
    boolean = True
    for i in range(N):
        if (n >> i) & 1 == 0:
            continue
        for x, y in evidence[i]:
            if bits[x-1] == y:
                continue
            flag = False
    if flag:
        ans = max(ans, sum(bits))
print(ans)

Buggy submission (verdict: Runtime Error):
from collections import Counter
N = int(input())
ans = 0
evidence = [[] for n in range(N)]

for n in range(N):
    A = int(input())
    for a in range(A):
        lis = list(map(int, input().split()))
        evidence[n].append(lis)

for n in range(1 << N):
    bits = [(n >> i) & 1 for i in range(N)]
    boolean = True
    for i in range(N):
        if (n >> i) & 1 == 0:
            continue
        for x, y in evidence[i]:
            if bits[x-1] == y:
                continue
            flag = False
    if flag:
        ans = max(ans, sum(bits))
print(ans)
Problem p02882 (python)

Fixed submission:
import sys
import math
from fractions import Fraction

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

y = Fraction(x / (a ** 2))

if y == b:
    print(0)
    sys.exit()

if b - 2 * y > 0:
    a = Fraction(2 * a * y / b)
    teihen = b
else:   
    teihen = 2 * (b - y)
res = Fraction(a / teihen)
print(90 - math.degrees(math.atan(res)))

Buggy submission (verdict: Runtime Error):
import math
from fractions import Fraction

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

y = Fraction(x / (a ** 2))

if b > a:
    a = Fraction(2 * a * y / b)
    teihen = b
else:
    teihen = 2 * (b - y)
res = Fraction(a / teihen)
print(90 - math.degrees(math.atan(res)))