Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n, m = list(map(int, input().split()))
key = []

INF = 10**7
p = 1<<n
dp = [INF]*p
dp[0] = 0

for _ in range(m):
    a, _ = map(int, input().split())
    c = sum([1<<(int(i)-1) for i in input().split()])
    def k(s):
        dp[s|c] = dp[s] + a
    [k(s) for s in range(p) if dp[s|c]>dp[s]+a]
ans = dp[-1]
if ans==INF:
    ans = -1
print(ans)

Fixed submission:
n = int(input())

if n==1:
  print(1)
elif n%2==0:
  print(0.5)
else:
  print((n+1)/(2*n))
Buggy python submission (verdict: Time Limit Exceeded):
n, m = list(map(int, input().split()))
key = []

for i in range(m):
    a, _ = list(map(int, input().split()))
    s = 0

    cs = list(map(int, input().split()))
    for c in cs:
        s |= 1<<(c-1)
    key.append([s, a])

INF = 10**7
dp = [INF]*(1<<n)
dp[0] = 0

for s in range(1<<n):
    for i in range(m):
        t = s | key[i][0]
        cost = dp[s] + key[i][1]
        dp[t] = min(dp[t],cost)
ans = dp[-1]
if ans==INF:
  print(-1)
else:
  print(ans)

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

INF = 10**7
p = 1<<n
dp = [INF]*p
dp[0] = 0

for _ in range(m):
    a, _ = map(int, input().split())
    c = sum([1<<(int(i)-1) for i in input().split()])
    def k(s):
        dp[s|c] = dp[s] + a
    [k(s) for s in range(p) if dp[s|c] > dp[s] + a]
ans = dp[-1]
if ans==INF:
    ans = -1
print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input)
if a >= 30:
  print("Yes")
else:
  print("No")

Fixed submission:
a = int(input())
if a >= 30:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
K, N  = map(int,input().split())
As = list(map(int, input().split()))

distList = []

for idx, dist in enumerate(As):
  if idx == 0:
    distList.append(K - As[-1] + dist)
  else:
    distList.append(dist - As[idx - 1])

min_dist = 0
for idx, dist in enumerate(distList):
  target_dist = 0
  for i in range(N - 1):
    if idx == 0:
      target_dist += distList[idx - i]
      min_dist = target_dist
    else:
      target_dist += distList[idx - i]
  if target_dist < min_dist:
    min_dist = target_dist
print(min_dist)

Fixed submission:
K, N  = map(int,input().split())
As = list(map(int, input().split()))

As.append(K + As[0])
print(K - max([y - x for x,y in zip(As, As[1:])]))

Buggy python submission (verdict: Time Limit Exceeded):
K, N  = map(int,input().split())
As = list(map(int, input().split()))

distList = []

for idx, dist in enumerate(As):
  if idx == 0:
    distList.append(K - As[-1] + dist)
  else:
    distList.append(dist - As[idx - 1])

min_dist = 0
for idx, dist in enumerate(distList):
  target_dist = 0
  for i in range(N - 1):
    if idx == 0:
      target_dist += distList[idx - i]
      min_dist = target_dist
    else:
      target_dist += distList[idx - i]
  if target_dist < min_dist:
    min_dist = target_dist
print(min_dist)

Fixed submission:
K, N  = map(int,input().split())
As = list(map(int, input().split()))

As.append(K + As[0])
print(K - max([y - x for x,y in zip(As, As[1:])]))
Buggy python submission (verdict: Runtime Error):
import math

TAXRATE8 = 0.08
TAXRATE10 = 0.1

tax8, tax10 = map(int, input().split())

amount8_min = math.ceil(tax8 / TAXRATE8)
amount8_max = math.floor((tax8+1) / TAXRATE8)
if ((tax8+1) / TAXRATE8).is_integer():
  amount8_max -= 1


amount10_min = math.ceil(tax10 / TAXRATE10)
amount10_max = math.floor((tax10+1) / TAXRATE10)
if ((tax10+1) / TAXRATE10).is_integer():
  amount10_max -= 1

ans_set = set(range(amount8_min, amount8_max)) & set(range(amount10_min, amount10_max))

if ans_set == set({}):
  print(-1)
else:
  print(min(ans_set))

Fixed submission:
S = input()

if S == "AAA" or S == "BBB":
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
N,b,r = map(int, input().split())
 
num = int(N / (b+r))
rest = N - num * (b + r)

if rest >= b:
	print(num * b + b)
else:
	print(num * b + rest)

Fixed submission:
S = input()

if S == "AAA" or S == "BBB":
  print("No")
else:
  print("Yes")

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

num = int(N / (b+r))
rest = N - num * (b + r)
if rest >= b:
	print(num * b + b)
else:
	print(num * b + rest)

Fixed submission:
S = input()

if S == "AAA" or S == "BBB":
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
k = int(input())
a,b = map(int,input().split().split(" "))
can = False
for i in range(a,b+1):
  if k % i == 0:
    can = True
if can:
  print("OK")
else:
  print("NG")

Fixed submission:
k = int(input())
a,b = map(int,input().split(" "))
can = False
for i in range(a,b+1):
  if i % k == 0:
    can = True
if can:
  print("OK")
else:
  print("NG")
Buggy python submission (verdict: Runtime Error):
n = int(input())
sum = 0
for i in range(n):
  if i%3 == 0:
  elif i%5 == 0:
  else:
    sum += i
print(sum)


Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
  if i%3 == 0 or i%5 == 0:
    sum += 0
  else:
    sum += i
print(sum)
Buggy python submission (verdict: Runtime Error):
a,b= map(int,input().split(" "))
c=a -2＊b
if c>0:
  print(c)
else:
  print(0)

         

Fixed submission:
a,b= map(int,input().split(" "))
c=a -2*b
if c>0:
  print(c)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
a,b map(int,input().split(" ")
print(a -2＊b)

Fixed submission:
a,b= map(int,input().split(" "))
c=a -2*b
if c>0:
  print(c)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
color = ""
for i in range(len(s)):
  if color != s[i]:
    color = s[i]
    count += 1
print(count)

Fixed submission:
n = int(input())
s = input()
color = ""
count = 0
for i in range(len(s)):
  if color != s[i]:
    color = s[i]
    count += 1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split(" ")))
order = ""
for i in range(n):
    order += str(a.index(i+1)+1) + " " 
order.rstrip()
print(order)  

Fixed submission:
import numpy as np
n = int(input())
a = list(map(int,input().split(" ")))
b = [0]*n
order = ""
for i in range(n):
	b[a[i]-1]= i+1
for i in b:
  order += str(i) + " "
order.rstrip
print(order)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = input().split(" ")
order = ""
j = 1
for i in a:
  b = {j=>i}
print(b)
'''  
order.rstrip()
print(order)  
'''

Fixed submission:
import numpy as np
n = int(input())
a = list(map(int,input().split(" ")))
b = [0]*n
order = ""
for i in range(n):
	b[a[i]-1]= i+1
for i in b:
  order += str(i) + " "
order.rstrip
print(order)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = input().split(" ")
order = ""
for i in range(n):
  for j in range(n):
    if a[j] == str(i+1):
      order += str(j+1) + " " 
order.rstrip()
print(order)  

Fixed submission:
import numpy as np
n = int(input())
a = list(map(int,input().split(" ")))
b = [0]*n
order = ""
for i in range(n):
	b[a[i]-1]= i+1
for i in b:
  order += str(i) + " "
order.rstrip
print(order)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split(" "))
order = ""
for i in range(n):
  for j in a:
    if j == i+1:
      order += j + " "
print(order.rstrip)  

Fixed submission:
import numpy as np
n = int(input())
a = list(map(int,input().split(" ")))
b = [0]*n
order = ""
for i in range(n):
	b[a[i]-1]= i+1
for i in b:
  order += str(i) + " "
order.rstrip
print(order)
Buggy python submission (verdict: Runtime Error):
import mathpy as math
a,b = input().split(" ")
ab = int(a+b)
if math.sqrt(ab) = int(np.sqrt(ab)):
  print("Yes")
else:
  print("No")


Fixed submission:
a,b = input().split(" ")
ab = int(a+b)
for i in range(1,400):
  if i**2 == ab:
    print("Yes")
    exit()
print("No")

Buggy python submission (verdict: Runtime Error):
import math
a,b = input().split(" ")
ab = int(a+b)
if math.sqrt(ab) = int(np.sqrt(ab)):
  print("Yes")
else:
  print("No")


Fixed submission:
a,b = input().split(" ")
ab = int(a+b)
for i in range(1,400):
  if i**2 == ab:
    print("Yes")
    exit()
print("No")

Buggy python submission (verdict: Runtime Error):
import numpy as np
a,b = input().split(" ")
ab = int(a+b)
if np.sqrt(ab) = int(np.sqrt(ab)):
  print("Yes")
else:
  print("No")


Fixed submission:
a,b = input().split(" ")
ab = int(a+b)
for i in range(1,400):
  if i**2 == ab:
    print("Yes")
    exit()
print("No")
Buggy python submission (verdict: Runtime Error):
x = int(input().split())

if x >= 30:
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

Fixed submission:
x = int(input())
 
if x >= 30:
  ans = 'Yes'
else:
  ans = 'No'
 
print(ans)
Buggy python submission (verdict: Runtime Error):
int b
b = a + a^2 + a^3
return b

Fixed submission:
import sys

a = int(input())
print(a + a**2 + a**3)
Buggy python submission (verdict: Runtime Error):
import sys
S = input[0]
T = input[1]
leng　= len(S)
int N = 0

for i in leng:
  if S.charAt(i) == T.charAt(j):
    N = N + 1

print (N)

Fixed submission:
S = input()
T = input()
 
c = 0
 
for s,t in zip(S,T):
  if s != t:
    c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
N = input()

s = "abcdefghijklmnopqrstuvwxyz"
ans = ""
n, m = 0, 0

for i in range(1, 1000):
    m += 26 ** i
    if N <= m:
        n = i
        break

for i in range(n):
    a, b = divmod(N, 26)
    N = a
    if b == 0:
        ans += s[25]
        N -= 1
    else:
        ans += s[b-1]

ans1 = ''.join(list(reversed(ans)))
print(ans1)

Fixed submission:
if input().isupper():
  print("A")
else:
  print("a")

Buggy python submission (verdict: Runtime Error):
if input().isupper == true:
  print("A")
else:
  print("a")

Fixed submission:
if input().isupper():
  print("A")
else:
  print("a")

Buggy python submission (verdict: Runtime Error):
C = input()
 
if C.isupeer:
  print("A")
else:
  print("a")

Fixed submission:
if input().isupper():
  print("A")
else:
  print("a")

Buggy python submission (verdict: Runtime Error):
if input().isupeer == True:
  ans = "A"
else:
  ans = "a"
  
print(ans)

Fixed submission:
if input().isupper():
  print("A")
else:
  print("a")

Buggy python submission (verdict: Runtime Error):
C = input()

if C.isupeer == True:
  ans = "A"
else:
  ans = "a"
  
print(ans)

Fixed submission:
if input().isupper():
  print("A")
else:
  print("a")
Buggy python submission (verdict: Runtime Error):
x,y = map(int, input().split()))

ymax = 4 * x
ymin = 2 * x

if y >= ymin and y <= ymax and y % 2 == 0:
  print('Yes')
else:
  print('No')

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

ymax = 4 * x
ymin = 2 * x

if y >= ymin and y <= ymax and y % 2 == 0:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
 
ans = 1

if 0 in A:
  ans = 0
  break    
else:
  for i in A:
    ans = ans*i
    if ans > 10**18:
      ans = -1
      break
      
print(ans)

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

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split()))
 
int ans = 1
 
for i in A:
  ans = ans*i
  if ans > 10**18:
    ans = -1
    break
    
print(ans)

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
 
ans = 1
 
if 0 in A:
  ans = 0
else:
  for i in A:
    ans = ans*i
    if ans > 10**18:
      ans = -1
      break
print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())
if (a >= 30):  
    print("Yes")
else
	print("No")

Fixed submission:
a = int(input())
if a>=30:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
X = int(input())
If X >= 30:
print("Yes")
else:
print("No")

Fixed submission:
X= int(input())
if X >= 30:
 print("Yes")
else:
 print("No")

Buggy python submission (verdict: Runtime Error):
X = int(input())
If X >= 30:
print ('Yes')
else:
print('No')


Fixed submission:
X= int(input())
if X >= 30:
 print("Yes")
else:
 print("No")

Buggy python submission (verdict: Runtime Error):
X = int(input())
If X => 30:
print ('Yes')
else:
print('No')


Fixed submission:
X= int(input())
if X >= 30:
 print("Yes")
else:
 print("No")

Buggy python submission (verdict: Runtime Error):
X = int(input())
If X =< 30:
print ('Yes')
else:
print('No')

Fixed submission:
X= int(input())
if X >= 30:
 print("Yes")
else:
 print("No")
Buggy python submission (verdict: Runtime Error):
N, D = map(int, input().split())
ans = 0
for i in range(N)
  X, Y = map(int, input().split())
  if X*X+Y*Y<=D:
    ans += 1
print(ans)


Fixed submission:
N, D = map(int, input().split())
ans = 0
for i in range(N):
  X, Y = map(int, input().split())
  if X*X+Y*Y<=D*D:
    ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
n, d = map(int, input().split())
cnt = 0
for ti in n :
  x, y = map(int, input().split())
  dist = (x**2 + y**2)**0.5
  if(dist >= d):
    cnt += 1
    
print(cnt)

Fixed submission:
n, d = map(int, input().split())
cnt = 0
for ti in range(n) :
  x, y = map(int, input().split())
  dist = (x**2 + y**2)**0.5
  if(dist <= d):
    cnt += 1
    
print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
if n < 600:
    ans = 8
elif  n < 800:
    ans = 7
elif n < 1000:
    ans = 6
elif n < 1200:
    ans = 5
elif  n < 1400:
    ans = 4
elif  n < 1600:
    ans = 3
elif  n < 1800:
    ans = 2
else:
    ans = 1
print(str(ans) + '-kyu')
n = int(input())
if n < 600:
    ans = 8
elif  n < 800:
    ans = 7
elif n < 1000:
    ans = 6
elif n < 1200:
    ans = 5
elif  n < 1400:
    ans = 4
elif  n < 1600:
    ans = 3
elif  n < 1800:
    ans = 2
else:
    ans = 1
print(ans)


Fixed submission:
n = int(input())
if n < 600:
    ans = 8
elif  n < 800:
    ans = 7
elif n < 1000:
    ans = 6
elif n < 1200:
    ans = 5
elif  n < 1400:
    ans = 4
elif  n < 1600:
    ans = 3
elif  n < 1800:
    ans = 2
else:
    ans = 1
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
if n < 600:
  ans = 8
else if n < 800:
  ans = 7
else if n < 1000:
  ans = 6
else if n < 1200:
  ans = 5
else if n < 1400:
  ans = 4
else if n < 1600:
  ans = 3
else if n < 1800:
  ans = 2
else :
  ans = 1
print(str(ans) + '-kyu')

Fixed submission:
n = int(input())
if n < 600:
    ans = 8
elif  n < 800:
    ans = 7
elif n < 1000:
    ans = 6
elif n < 1200:
    ans = 5
elif  n < 1400:
    ans = 4
elif  n < 1600:
    ans = 3
elif  n < 1800:
    ans = 2
else:
    ans = 1
print(ans)
Buggy python submission (verdict: Runtime Error):
tep = input()
if tep<-40 or tep>40:
  break
elif tep >=30:
  print('Yes')
else:
  print('No')

Fixed submission:
temp = input()
temp = int(temp)
if temp<-40 or temp>40:
    print('Out')    
elif temp >=30: 
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
tep = input()
if tep>=30:
  print('Yes')
else :
  print('No')

Fixed submission:
temp = input()
temp = int(temp)
if temp<-40 or temp>40:
    print('Out')    
elif temp >=30: 
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
tep = input()
if tep>=30:
	print('Yes')
else:
	print('No')

Fixed submission:
temp = input()
temp = int(temp)
if temp<-40 or temp>40:
    print('Out')    
elif temp >=30: 
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
import numpy as np
# 行数
N,D = input().strip().split()
N = int(N)
D = int(D)
# 2次元配列
grid = []
for i in range(N):
    array = list(map(int, input().strip().split()))
    grid.append(array)
    
count = 0
for i in range(0,N):
  dist = sqrt(grid[i][0]^2+grid[i][1]^2)
  if dist <= D:
    count += 1
print(count)

Fixed submission:
import numpy as np
N,D = input().strip().split()
N = int(N)
D = int(D)
count = 0
for i in range(N):
    x,y = input().strip().split()
    x = int(x)
    y = int(y)
    #print(x**2)
    dist = np.sqrt((x)**2+(y)**2)
    #print(dist)
    if dist <= D:
        count +=1
print(count)

Buggy python submission (verdict: Runtime Error):
x,y = int(input())
N = x[0]
D = y[0]
count = 0
for i in range(1,N):
  dist = sqrt(x[i]^2+y[i]^2)
  if dist <= D:
    count += 1
print(count)
    

Fixed submission:
import numpy as np
N,D = input().strip().split()
N = int(N)
D = int(D)
count = 0
for i in range(N):
    x,y = input().strip().split()
    x = int(x)
    y = int(y)
    #print(x**2)
    dist = np.sqrt((x)**2+(y)**2)
    #print(dist)
    if dist <= D:
        count +=1
print(count)
Buggy python submission (verdict: Runtime Error):
def gcd(x,y):
    if y==0:
        return x
    else:
        return gcd(y,x%y)

n=int(input())
a_array=[int(a) for a in input().split()]

for i in range(1, n-1):
    a=gcd(a,a_array[i])
    left_gcd.append(a)

right_gcd=[a_array[-1]]
for i in range(n-2,0,-1):
    b=gcd(b,a_array[i])
    right_gcd.append(b)

ans_gcd=[right_gcd[n-2],left_gcd[n-2]]

for i in range(n-2):
    ans_gcd.append(gcd(left_gcd[i],right_gcd[n-i-3]))

print(max(ans_gcd))


Fixed submission:

# 最大公約数を求める
def gcd(x,y):
    if y==0:
        return x
    else:
        return gcd(y,x%y)

n=int(input())
a_array=[int(a) for a in input().split()]

# 累積GCDの計算(A1, A2, ... Ai-1の最大公約数)
left_gcd=[a_array[0]] # 
a=a_array[0] # 最初のループはgcd(a_array[0], a_array[1])になる
for i in range(1, n-1):
    a=gcd(a,a_array[i])
    left_gcd.append(a)

# 累積GCDの計算(Ai, Ai+1, ... ANの最大公約数)
right_gcd=[a_array[-1]]
b=a_array[-1] # 最初のループはgcd(a_array[-1], a_array[-2])になる
for i in range(n-2,0,-1):
    b=gcd(b,a_array[i])
    right_gcd.append(b)

# i番目の数値以外の最大公約数を格納
ans_gcd=[right_gcd[n-2],left_gcd[n-2]]

for i in range(n-2):
    ans_gcd.append(gcd(left_gcd[i],right_gcd[n-i-3]))

print(max(ans_gcd))
Buggy python submission (verdict: Runtime Error):
n = int(input())
h_list = [int(_) for _ in input().split()]
ans = 0
while sum(h_list) != 0:
    # 0で区切られた、1以上の数のかたまりを数える
    # 要素が全て1以上ならansに+1して次のループ
    if h_list.count(0) == 0:
        ans += 1
    else:
        for i in range(1, n):
            # 1以上から0に下がった時にかたまりをカウント
            if h_list[i] == 0 and h_list[i - 1] != 0:
                ans += 1
            elif i == n - 1 and h_list[i] != 0:
                ans += 1
    # 1以上の箇所を1段ずつ落とす
    for i in range(n):
        if h_list[i] != 0:
            h_list[i] -= 1

print(ans)

Fixed submission:
ab,bc,ca = map(int, input().split())

print(bc * ab // 2)

Buggy python submission (verdict: Runtime Error):
n = int(input())
h_list = [int(_) for _ in input().split()]
ans = 0 
while sum(h_list) != 0:
    # 0で区切られた、1以上の数のかたまりを数える
    # 要素が全て1以上ならansに+1して次のループ
    if h_list.count(0) == 0:
        ans += 1
    else:
        for i in range(0,n):
            # 1以上から0に下がった時にかたまりをカウント
            if i != 0 and h_list[i] == 0 and h_list[i - 1] != 0:
                ans += 1
            elif i == n and h_list[i] != 0:
                ans += 1
    # 1以上の箇所を1段ずつ落とす
    for j in range(n):
        if h_list[j] != 0:
            h_list[j] -= 1

print(ans)

Fixed submission:
ab,bc,ca = map(int, input().split())

print(bc * ab // 2)
Buggy python submission (verdict: Runtime Error):
s = input()
correct_count = 0
wrong_char_index_list = []

for i in range(len(s)):
    if s[i] == "keyence"[correct_count]:
        correct_count += 1
        if correct_count == len("keyence"):
            break
    else:
        wrong_char_index_list.append(i)

# 全部間違い
if len(wrong_char_index_list) == len(s):
    print("NO")
    exit()

# 間違い箇所が飛んでたらダメ
if len(wrong_char_index_list) >= 2:
    for i in range(1, len(wrong_char_index_list) + 1):
        if wrong_char_index_list[i] - wrong_char_index_list[i-1] != 1:
            print("NO")
            exit()

print("YES")
exit()

Fixed submission:
s = input()
l = len(s)

for i in range(l):
    for j in range (i, l):
        if 'keyence' == (s[:i] + s[j:]):
            print("YES")
            exit()

print("NO")
Buggy python submission (verdict: Runtime Error):
if n < 4:
    print('No')
    exit()
                                                                                                                
for i in range(1, n % 7):
    tmp = n - 7 * i
    if tmp % 4 == 0:
        print('Yes')
        exit()
for i in range(1, n & 4):
    tmp = n - 4 * i
    if tmp % 7 == 0:
        print('Yes')
        exit()

print('No')

Fixed submission:
n = int(input())

if n < 4:
    print('No')
    exit()
elif n % 7 == 0 or n % 4 == 0:
    print('Yes')
    exit()
elif n % 7 % 4 == 0 or n % 4 % 7 == 0:
    print('Yes')
    exit()
else:
    for i in range(1, n % 7):
        tmp = n - 7 * i
        if tmp < 0:
            break
        elif tmp % 4 == 0:
            print('Yes')
            exit()
    for i in range(1, n & 4):
        tmp = n - 4 * i
        if tmp < 0:
            break
        elif tmp % 7 == 0:                                                                                      
            print('Yes')
            exit()

print('No')
Buggy python submission (verdict: Runtime Error):
A, B = input().split()
a = int(A)
ans = 0

for i in range(a - 1):
    ans += i

print(ans)


Fixed submission:
N=int(input())

if N < 1000:
    print("ABC")
else:
    print("ABD")
Buggy python submission (verdict: Runtime Error):
a,b = map(input().split())

y = b - a - 1
w_hight = 0

for i in range(1, y):
    w_hight += i

print(w_hight - a)

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

y = b - a - 1
w_hight = 0

for i in range(1, y + 1):
    w_hight += i

print(w_hight - a)
Buggy python submission (verdict: Runtime Error):
c_list = []
for i in range(3):
    c_list.append(input().split())

print(c_list[0] + c_list[3] + c_list[6])

Fixed submission:
c_list = []
for i in range(3):
    c_list.append(input())

print(c_list[0][0] + c_list[1][1] + c_list[2][2])

Buggy python submission (verdict: Runtime Error):
c_list = []
for i in range(3):
    c_list.append(input().split())
    
print(c_list[0] + c_list[3] + c_list[5])

Fixed submission:
c_list = []
for i in range(3):
    c_list.append(input())

print(c_list[0][0] + c_list[1][1] + c_list[2][2])
Buggy python submission (verdict: Runtime Error):
print(input() // 3)

Fixed submission:
print(int(input()) // 3)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a_list = list(map(int, input().split()))
alice = 0
bob = 0
tmp_value = 0
tmp_index = 0

while len(a_list) > 0:
    for i in range(len(a_list)):
        if tmp_value < a_list[i]:
            tmp_value = a_list[i]
            tmp_index = i
    alice += tmp_value
    del a_list[tmp_index]
    tmp_value, tmp_index = 0, 0
    if len(a_list) == 0:
        break
    for k in range(len(a_list)):                                                                                  
        if tmp_value < a_list[k]:
            tmp_value = a_list[k]
            tmp_index = k
    bob += tmp_value
    del a_list[tmp_index]

print(str(alice - bob))


Fixed submission:
n = int(input())
a_list = list(map(int, input().split()))
alice = 0
bob = 0


for i in range(len(a_list)):
    if i % 2:
        bob += sorted(a_list, reverse=True)[i]
    else:
        alice += sorted(a_list, reverse=True)[i]

print(str(alice - bob))
Buggy python submission (verdict: Runtime Error):
list = int(input().split)

if a * b % 2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
list = input().split()
a, b = int(list[0]), int(list[1])

if a * b % 2 == 0:
    print("Even")
else:
    print("Odd")

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

if a * b % 2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
list = input().split()
a, b = int(list[0]), int(list[1])

if a * b % 2 == 0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
if int(input()) % 2 == 0:
    print("Even")
else:
    print("Odd")

Fixed submission:
list = input().split()
a, b = int(list[0]), int(list[1])

if a * b % 2 == 0:
    print("Even")
else:
    print("Odd")