Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n, w = (int(x) for x in input().split())
wv = [[0, 0]]
for _ in range(n):
    wv.append([int(x) for x in input().split()])
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(w + 1):
    dp[0][i] = 0
for i in range(1, n + 1):
    for j in range(1, w + 1):
        if j - wv[i][0] >= 0:
            dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - wv[i][0]] + wv[i][1])
        else:
            dp[i][j] = dp[i - 1][j]
print(dp[n][w])

Fixed submission:
n, w = (int(x) for x in input().split())
wv = [[0, 0]]
for _ in range(n):
    wv.append([int(x) for x in input().split()])
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(w + 1):
    dp[0][i] = 0
for i in range(1, n + 1):
    for j in range(1, w + 1):
        if j - wv[i][0] >= 0:
            dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - wv[i][0]] + wv[i][1])
        else:
            dp[i][j] = dp[i - 1][j]
print(dp[n][w])
Buggy python submission (verdict: Time Limit Exceeded):
from bisect import bisect_left
s = input()
t = input()
dp = [[0] * (len(t) + 1) for _ in range(len(s) + 1)]
for i in range(len(s)):
    dp[i][0] = 0
for j in range(len(t)):
    dp[0][j] = 0
for i in range(0, len(s)):
    for j in range(0, len(t)):
        if s[i] == t[j]:
            dp[i + 1][j + 1] = dp[i][j] + 1
        else:
            dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])
dpt = list(map(list, zip(*dp)))
i = len(s)
j = len(t)
ans = ''
for a in range(dp[len(s)][len(t)], 0, -1):
    jj = bisect_left(dp[i], a)
    ii = bisect_left(dpt[j], a)
    ans += t[jj - 1]
    i = ii - 1
    j = jj - 1
print(ans[::-1])

Fixed submission:
s = input()
t = input()
dp = [[0] * (len(t) + 1) for _ in range(len(s) + 1)]
for i in range(len(s)):
    dp[i][0] = 0
for j in range(len(t)):
    dp[0][j] = 0
for i in range(0, len(s)):
    for j in range(0, len(t)):
        if s[i] == t[j]:
            dp[i + 1][j + 1] = dp[i][j] + 1
        else:
            dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1])
i = len(s)
j = len(t)
ans = ''
while True:
    if s[i - 1] == t[j - 1]:
        ans = s[i - 1] + ans
        i -= 1
        j -= 1
    if dp[i][j] == dp[i][j - 1]:
        j -= 1
    elif dp[i][j] == dp[i - 1][j]:
        i -= 1
    if i <= 0 or j <= 0:
        break
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = [int(x) for x in input().split(" ")]

if N ==0 or K==1:
  print(0)
else:
  while N>abs(N-K):
    N = abs(N%K-K)
  print(N)


Fixed submission:
N, K = [int(x) for x in input().split(" ")]

if N ==0 or K==1 or N == K:
  print(0)
else:
  while N>abs(N-K):
    N = abs(N%K-K)
  print(N)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = [int(x) for x in input().split(" ")]

if K == 1:
  print(0)
else:
  while N>abs(N-K):
    N = abs(N%K-K)
  print(N)


Fixed submission:
N, K = [int(x) for x in input().split(" ")]

if N ==0 or K==1 or N == K:
  print(0)
else:
  while N>abs(N-K):
    N = abs(N%K-K)
  print(N)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = [int(x) for x in input().split(" ")]

if K == 1:
  print(0)
else:
  while N>abs(N-K):
    N = abs(N-K)
  print(N)

Fixed submission:
N, K = [int(x) for x in input().split(" ")]

if N ==0 or K==1 or N == K:
  print(0)
else:
  while N>abs(N-K):
    N = abs(N%K-K)
  print(N)
Buggy python submission (verdict: Runtime Error):
L = int(input())

print((l/3)**(3))

Fixed submission:
L = int(input())

print((L/3)**(3))
Buggy python submission (verdict: Runtime Error):
a, b, c = [int(x) for x in input().split(" ")]

if a + b + (a*B)**(1/2) < c:
  print(Yes)
else:
  print(No)

Fixed submission:
a, b, c = [int(x) for x in input().split(" ")]

if a*a+b*b+c*c > 2*a*b+2*b*c+2*c*a and c-a-b > 0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N, A, B  = [int(x) for x in input().split(" ")]

print(int(N/(A+B))*A)+int(min(N%(A+B),A))


Fixed submission:
N, A, B  = [int(x) for x in input().split(" ")]

print(int(N/(A+B))*A+int(min(N%(A+B),A)))

Buggy python submission (verdict: Runtime Error):
N, A, B  = [int(x) for x in input().split(" ")]


if N%(A+B) == 0:
  print(int(N/(A+B))*A)
else:
  print(int(N/(A+B))*A)+int(min(N%(A+B),A))


Fixed submission:
N, A, B  = [int(x) for x in input().split(" ")]

print(int(N/(A+B))*A+int(min(N%(A+B),A)))

Buggy python submission (verdict: Runtime Error):
N, A, B  = [int(x) for x in input().split(" ")]

str = ""
b = 0
r = 0

while b + r <= N:
  for i in range(0,A):
    str = str + "b"*A
    b = b + A
    str = str + "r"*B
    r = r + B

print(list(str)[:N].count("b"))



Fixed submission:
N, A, B  = [int(x) for x in input().split(" ")]

print(int(N/(A+B))*A+int(min(N%(A+B),A)))

Buggy python submission (verdict: Time Limit Exceeded):
N, A, B  = [int(x) for x in input().split(" ")]

lst = []
b = 0
r = 0

while b + r <= N:
  for i in range(0,A):
    lst.append("b")
    b += 1
  for i in range(0,B):
    lst.append("r")
    r += 1
    
print(lst[:N].count("b"))

Fixed submission:
N, A, B  = [int(x) for x in input().split(" ")]

print(int(N/(A+B))*A+int(min(N%(A+B),A)))
Buggy python submission (verdict: Runtime Error):
N, K = [int(x) for x in input().split(" ")]

i=1
x=K

while x =< N:
  x *= K
  i += 1

print(i)

Fixed submission:
N, K = [int(x) for x in input().split(" ")]

i=1
x=K

while x <= N:
  x *= K
  i += 1

print(i)
Buggy python submission (verdict: Runtime Error):
if len(set([int(x) for x in input().split("")])) = 2:
  print("Yes")
else:
  print("No")

Fixed submission:
lst = [int(i) for i in input().split(" ")]

if len(set(lst)) == 2:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
if len(set([int(x) for x in input().split("")])) = 2:
  print("yes")
else:
  print("No")

Fixed submission:
lst = [int(i) for i in input().split(" ")]

if len(set(lst)) == 2:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lst = []
dic = {}
for i in range(0,N):
  inp = input()
  if inp not in dic:
    dic[inp] = 1
  else:
    dic[inp] +=1

keys = [k for k,v in dic.items() if v == max(dic.values())]

keys.sort()

for i in range(0,len(keys)):
  print(keys[i])


Fixed submission:
N = int(input())
dic = {}
for i in range(0,N):
  inp = input()
  if inp not in dic:
    dic[inp] = 1
  else:
    dic[inp] +=1

m = max(dic.values())

keys = [k for k,v in dic.items() if v == m]

keys.sort()

for i in range(0,len(keys)):
  print(keys[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lst = []
dic = {}
for i in range(0,N):
  lst.append(input())

for i in list(set(lst)):
  dic[i] = lst.count(i)

keys = [k for k,v in dic.items() if v == max(dic.values())]

keys.sort()

for i in range(0,len(keys)):
  print(keys[i])


Fixed submission:
N = int(input())
dic = {}
for i in range(0,N):
  inp = input()
  if inp not in dic:
    dic[inp] = 1
  else:
    dic[inp] +=1

m = max(dic.values())

keys = [k for k,v in dic.items() if v == m]

keys.sort()

for i in range(0,len(keys)):
  print(keys[i])
Buggy python submission (verdict: Time Limit Exceeded):
N, K = [int(n) for n in input().split(" ")]
lst = [int(n) for n in input().split(" ")]

sum_max = 0

for i in range(0,N-K+1):
    temp = 0
    for j in range(i,i+K):
        temp += (lst[j]+1)/2
    if temp > sum_max:
        sum_max = temp
print(sum_max)
  

Fixed submission:
N, K = [int(n) for n in input().split(" ")]
lst = [int(n) for n in input().split(" ")]

sum_max = 0
temp = 0

for i in range(K):
    temp += (lst[i]+1)/2
    sum_max = temp
for j in range(0,N-K):
        temp += (lst[j+K]-lst[j])/2
        if temp > sum_max:
            sum_max = temp
            
print(sum_max)
Buggy python submission (verdict: Runtime Error):
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=True)
sum_a = sum(HP[K:N])
print(sum_a)

Fixed submission:
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=True)
sum_a = sum(HP[K:])
print(sum_a)

Buggy python submission (verdict: Runtime Error):
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=Ture)
sum_a = sum(HP[K:N])
print(sum_a)

Fixed submission:
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=True)
sum_a = sum(HP[K:])
print(sum_a)

Buggy python submission (verdict: Runtime Error):
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.reverse()
sum_a = sum(HP[K:N])
print(sum_a)

Fixed submission:
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=True)
sum_a = sum(HP[K:])
print(sum_a)

Buggy python submission (verdict: Runtime Error):
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.reverse()
sum_a = sum(HP[K:N])
print(sum_a)

Fixed submission:
HK = list(map(int,input().split(" ")))
HP = list(map(int,input().split(" ")))
H = HK[0]
K = HK[1]
HP.sort(reverse=True)
sum_a = sum(HP[K:])
print(sum_a)
Buggy python submission (verdict: Runtime Error):
N = input().split("")
if N[0] == N[1]:
  print("Yes")
else:
  print("No")

Fixed submission:
test = input().split(" ")
if int(test[0])== int(test[1]):
	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
lis = input().split(" ")
cnt = 1
for i in range(int(N)+1):
    for j in range(i-1,-1,-1):
        if int(lis[i])>int(lis[j]):
            break
        else:
            cnt +=1
        break
print(cnt)

Fixed submission:
test = input().split(" ")
if int(test[0])== int(test[1]):
	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
test = input().split(" ")
if int(test[0])== int(test[1]):
  print("Yes")
else
 print("No")

Fixed submission:
test = input().split(" ")
if int(test[0])== int(test[1]):
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
inp = input().split("")
lis = [,]
for i in range(inp[0]):
  lis[1] += inp[1]
for i in range(inp[1]):
  lis[0] += inp[0]
lis.sort()
print(lis[0])

Fixed submission:
hoge = input().split(" ")
a=""
b=""
for i in range(int(hoge[1])):
  a += hoge[0]
for i in range(int(hoge[0])):
  b += hoge[1]
txt = [a,b]
txt.sort()
print(txt[0])

Buggy python submission (verdict: Runtime Error):
hoge = input().split(" ")
for i in range(int(hoge[1])):
  a += hoge[0]
for i in range(int(hoge[0])):
  b += hoge[1]
txt = [a,b]
txt.sort
print(a[0])

Fixed submission:
hoge = input().split(" ")
a=""
b=""
for i in range(int(hoge[1])):
  a += hoge[0]
for i in range(int(hoge[0])):
  b += hoge[1]
txt = [a,b]
txt.sort()
print(txt[0])

Buggy python submission (verdict: Runtime Error):
txt = input().split(" ")
txt.sort
print(a[0])

Fixed submission:
hoge = input().split(" ")
a=""
b=""
for i in range(int(hoge[1])):
  a += hoge[0]
for i in range(int(hoge[0])):
  b += hoge[1]
txt = [a,b]
txt.sort()
print(txt[0])
Buggy python submission (verdict: Runtime Error):
N = input()
lis = input().split(" ")
cnt = 1
for i in range(int(N+1)):
    for j in range(i-1,-1,-1):
        if int(lis[i])>int(lis[j]):
            break
        else:
            cnt +=1
        break
print(cnt)

Fixed submission:
N = int(input())
lst = list(map(int,input().split()))
 
cnt = 0
m = lst[0]
 
for i in lst:
  if i <= m:
    cnt +=1
    m = i
print(cnt)

Buggy python submission (verdict: Runtime Error):
N = input()
lis = input().split(" ")
cnt = 0
for i in range(int(N)):
  for j in range(int(N),-1,-1)
  if lis[i]>lis[j]
    cnt += 1
    break
print(cnt)


Fixed submission:
N = int(input())
lst = list(map(int,input().split()))
 
cnt = 0
m = lst[0]
 
for i in lst:
  if i <= m:
    cnt +=1
    m = i
print(cnt)
Buggy python submission (verdict: Runtime Error):
in_char = input()

alpha_bete = {"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"}

for cnt, charct in enumerate(alpha_bete):
	if charact == in_char
  		print(alpha_bete[cnt+1])

Fixed submission:
char = ord(input())
char += 1
print(chr(char))
Buggy python submission (verdict: Runtime Error):
char = input().split(" ")
if int(char[0])*500 >= (char[1]):
    print("Yes")
else: 
    print("No")

Fixed submission:
char = input().split(" ")
if int(char[0])*500 >= int(char[1]):
    print("Yes")
else: 
    print("No")

Buggy python submission (verdict: Runtime Error):
char = input().split(" ")
if char[0]*500 >= char[1]:
    print("Yes")
else 
    print("No")

Fixed submission:
char = input().split(" ")
if int(char[0])*500 >= int(char[1]):
    print("Yes")
else: 
    print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = lst(input())

cnt = 0

for i in range(0,4):
  if S[i] == "A" and S[i+1] == "C" and S[i+2] == "C":
    cnt += 1
    
print(cnt)

Fixed submission:
N = int(input())
S = list(input())

cnt = 0

for i in range(0,N-2):
  if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":
    cnt += 1
    
print(cnt)
Buggy python submission (verdict: Runtime Error):
chars = input.split(" ")
print(chars[1]+chars[0])

Fixed submission:
chars = input().split(" ")
print(chars[1]+chars[0])

Buggy python submission (verdict: Runtime Error):
chars = input.split(" ")
print(chars[1]+char[0])


Fixed submission:
chars = input().split(" ")
print(chars[1]+chars[0])
Buggy python submission (verdict: Runtime Error):
A, B, K = [int(x) for x in input().split(" ")]

if A >= K:
  print("{} {}".format(A-K, B))
elif A < K and A+B >= K:
  print("{} {}".format(0, (A-K/2)+(B-K/2))
else:
  print(0)


Fixed submission:
A, B, K = [int(x) for x in input().split(" ")]

if A >= K:
  print("{} {}".format(A-K, B))
elif A < K and A+B >= K:
  print("{} {}".format(0, int(A-K/2+B-K/2)))
else:
  print(0, 0)

Buggy python submission (verdict: Runtime Error):
A, B, K = [int(x) for x in input().split(" ")]

if A >= K:
  print("{} {}".format(A-K, B))
elif A < K and A+B => K:
  print("{} {}".format(0, A+B-K))
else:
  print(0)

Fixed submission:
A, B, K = [int(x) for x in input().split(" ")]

if A >= K:
  print("{} {}".format(A-K, B))
elif A < K and A+B >= K:
  print("{} {}".format(0, int(A-K/2+B-K/2)))
else:
  print(0, 0)
Buggy python submission (verdict: Runtime Error):
N = int(input())

for i in range(1:10):
  for j in range(1:10):
    if N == i*j:
      print("Yes")
    elif i*j ==81:
      print("No")

Fixed submission:
N = int(input())

flag =0

for i in range(1,10):
  for j in range(1,10):
    if N == i*j:
      flag = 1

if flag == 1:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = input()
S = input()
temp = ""
for cnt in S
	if temp != cnt:
    	temp = cnt
        lst += cnt
n = len(lst)
print("n")

Fixed submission:
N = input()
S = input()
temp = ""
lst = ""
for cnt in S:
    if temp != cnt:
        temp = cnt
        lst += cnt
print(len(lst))

Buggy python submission (verdict: Runtime Error):
N = input()
S = input()
temp = ""
for cnt in N
	if temp != cnt:
    	temp = cnt
        lst += cnt
n = len(lst)
print("n")

Fixed submission:
N = input()
S = input()
temp = ""
lst = ""
for cnt in S:
    if temp != cnt:
        temp = cnt
        lst += cnt
print(len(lst))
Buggy python submission (verdict: Runtime Error):
if input() == "Sunny":
  print("Cloudy")
elif input() == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Fixed submission:
S = input()

if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")
Buggy python submission (verdict: Runtime Error):
S = list(input())
T = list(input())

cnt = 0

for i in range(0,3):
  if S[i] == T[i]:
    cnt += 1

pirn(cnt)
  


Fixed submission:
S = list(input())
T = list(input())

cnt = 0

for i in range(0,3):
  if S[i] == T[i]:
    cnt += 1

print(cnt)

Buggy python submission (verdict: Runtime Error):
S = input()
T = input()

cnt = 0

for i in range(0,3):
  if S[i] == T[i]:
    cnt += 1

pirn(cnt)
  


Fixed submission:
S = list(input())
T = list(input())

cnt = 0

for i in range(0,3):
  if S[i] == T[i]:
    cnt += 1

print(cnt)

Buggy python submission (verdict: Runtime Error):
S = list(input())
T = list(input())

cnt = 0

for i in range(0,3):
  if S[i] == T[i]:
    cnt += 1

pirn(cnt)
  

Fixed submission:
S = list(input())
T = list(input())

cnt = 0

for i in range(0,3):
  if S[i] == T[i]:
    cnt += 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
lst = list(map(int,input().split("")))
n = (list[1]-1)/list[0]
print("n")

Fixed submission:
lst = list(map(int,input().split(" ")))
socket_n = 1
tap = 0
while socket_n < lst[1]:
  tap += 1
  socket_n = socket_n-1+lst[0]
print("%d" % tap)
Buggy python submission (verdict: Time Limit Exceeded):
A, B = [int(x) for x in input().split(" ")]

out = "IMPOSSIBLE"

for k in range(0,10**9):
  if abs(A-k) == abs(B-k):
    out = k

print(out)


Fixed submission:
A, B = [int(x) for x in input().split(" ")]

if (A+B)%2 == 0:
  print(int((A+B)/2))
else:
  print("IMPOSSIBLE")

Buggy python submission (verdict: Time Limit Exceeded):
A, B = [int(x) for x in input().split(" ")]

for k in range(0,10**9):
  if abs(A-k) == abs(B-k):
    print(k)
  else:
    print("IMPOSSIBLE")


Fixed submission:
A, B = [int(x) for x in input().split(" ")]

if (A+B)%2 == 0:
  print(int((A+B)/2))
else:
  print("IMPOSSIBLE")

Buggy python submission (verdict: Runtime Error):
A, B = [int(x) for x in input().split(" ")]

for k in range(0,10**9):
  if abs(A-k) == abs(B-k):
    print(k)
  else:
    print(IMPOSSIBLE)

Fixed submission:
A, B = [int(x) for x in input().split(" ")]

if (A+B)%2 == 0:
  print(int((A+B)/2))
else:
  print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
S = list(input())

out = "Good"

for i in range(0,4):
  if S[i] == S[i+1]:
    out = "Bad"
    
print(out)


  


Fixed submission:
S = list(input())

out = "Good"

for i in range(0,3):
  if S[i] == S[i+1]:
    out = "Bad"
    
print(out)

Buggy python submission (verdict: Runtime Error):
S = list(input())

out = Good

for i in range(0,4):
  if S[i] == S[i+1]:
    out = "Bad"
    
print(out)


  

Fixed submission:
S = list(input())

out = "Good"

for i in range(0,3):
  if S[i] == S[i+1]:
    out = "Bad"
    
print(out)
Buggy python submission (verdict: Runtime Error):
N = int(input())
T, A = [int(i) for i in input().split(" ")]
temp = [int(T-0.006*h) for h in int(input().split(" "))]

place = 0
diff_min = 0

for cnt, t in enumerate(temp):
  if abs(T-t) < diff_min:
    diff_min = abs(T-t)
    place = cnt

print(place)
  

Fixed submission:
N = int(input())
T, A = [int(i) for i in input().split(" ")]
temp = [T-0.006*int(h) for h in input().split(" ")]

place = 1
diff_min = abs(temp[0]-A)

for cnt, t in enumerate(temp,1):
  if abs(A-t) < diff_min:
    diff_min = abs(A-t)
    place = cnt

print(place)
Buggy python submission (verdict: Runtime Error):
N, x = [int(i) for i in input().split(" ")]
lst = [int(i) for i in input().split(" ")]

lst.sort(reverse = True)
cnt = 0

while x > lst[cnt]:
  x -= lst[cnt]
  cnt += 1
  
print(cnt)

Fixed submission:
N, x = [int(i) for i in input().split(" ")]
lst = [int(i) for i in input().split(" ")]
 
lst.sort()
cnt = 0
 
for i in range(0,N-1):
  if x >= lst[i]:
    x -= lst[i]
    cnt += 1
  else:
    break

if x == lst[N-1]:
    cnt +=1
    
print(cnt)
Buggy python submission (verdict: Runtime Error):
N = int(input())

flag = 0

for i in range(26):
    for j in range(16):
      if j*4+j*7 == N:
        flag = 1

if flag == 1:
    print("Yes")
else
    print("No")


Fixed submission:
N = int(input())

flag = 0

for i in range(26):
    for j in range(16):
      if i*4+j*7 == N:
        flag = 1

if flag == 1:
    print("Yes")
else:
    print("No")

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

for i in (26):
	for j in(16):
  		if j*4+J*7 == N:
      		print("Yes")
        else:
          print("No")

Fixed submission:
N = int(input())

flag = 0

for i in range(26):
    for j in range(16):
      if i*4+j*7 == N:
        flag = 1

if flag == 1:
    print("Yes")
else:
    print("No")

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

for i in (26)
	for j in(16)
  		if j*4+J*7 == N:
      		print("Yes")
        else:
          print("No")


Fixed submission:
N = int(input())

flag = 0

for i in range(26):
    for j in range(16):
      if i*4+j*7 == N:
        flag = 1

if flag == 1:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
lst = [int(n) for n in input().split(" ")]
val_max = 0
val_min = 0
for i in range(0,N):
  if val_max < i:
    val_max = i
  elseif val_min > i:
    val_min = i
print(val_max-val_min)

Fixed submission:
N = int(input())
lst = [int(n) for n in input().split(" ")]
   
print(max(lst)-min(lst))
Buggy python submission (verdict: Runtime Error):
lst_blue = []
lst_red = []

N = int(input())
for i in range(0,N):
  lst_blue.append(input())
M = int(input())
for i in range(0,M):
  lst_red.append(input())

for i in list(set(lst_blue)):
  dic = {lst_bule[i]:int(lst_blue.count(i))}
for i in list(set(lst_red)):
  if i in dic:
    dic[i] -= 1

print(max(dic.values()))


Fixed submission:
lst_blue = []
lst_red = []
dic = {}

N = int(input())
for i in range(0,N):
  lst_blue.append(input())
M = int(input())
for i in range(0,M):
  lst_red.append(input())

for i in list(set(lst_blue)):
  dic[i] = int(lst_blue.count(i))

for i in lst_red:
  if i in dic:
    dic[i] -= 1
    
print(max(0,max(dic.values())))
Buggy python submission (verdict: Runtime Error):
a, b = map(int,iput().split(" "))
print("{}".format((a+b-1)/b))

Fixed submission:
a, b = map(int,input().split(" "))
print("{}".format(int((a+b+2-1)/2)))
Buggy python submission (verdict: Runtime Error):
s = list(input()).sort()
t = list(input()).sort()

if s < t
  print("Yes")
else:
  print("No")

Fixed submission:
s = sorted(input())
t = sorted(input(),reverse = True)

if "".join(s) < "".join(t):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N, K = [int(x) for x in input().split(" ")]
lst = [int(x) for x in input().split(" ")]

dic= {}
cnt = 0 
swap = 0
prep = len(set(lst))-K

for i in range(1,N+1):
	dic["{}".format(i)] = 0
	dic["{}".format(lst[i-1])] += 1

sorted_dic = sorted(dic.items(), key = lambda x : x[1])
    
for i in range(0,N):
  swap += sorted_dic[i][1]
  if sorted_dic[i][1] != 0:
    cnt +=1
  if cnt >= prep:
    break
      
print(swap)

Fixed submission:
N, K = [int(x) for x in input().split(" ")]
lst = [int(x) for x in input().split(" ")]

dic= {}
cnt = 0 
swap = 0
prep = len(set(lst))-K

for i in range(1,N+1):
	dic["{}".format(i)] = 0

for i in range(0,N):
	dic["{}".format(lst[i])] += 1

sorted_dic = sorted(dic.items(), key = lambda x : x[1])
    
for i in range(0,N):
  swap += sorted_dic[i][1]
  if sorted_dic[i][1] != 0:
    cnt +=1
  if cnt >= prep:
    break
      
print(swap)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = [int(x) for x in input().split(" ")]
lst = [int(x) for x in input().split(" ")]

dic= {}
cnt = 0 
swap = 0

for i in range(1,N+1):
	dic["{}".format(i)] = 0

for i in range(0,N):
	dic["{}".format(lst[i])] += 1

sorted_dic = sorted(dic.items(), key = lambda x : x[1])
    
for i in range(0,N):
  swap += sorted_dic[i][1]
  if sorted_dic[i][1] != 0:
    cnt +=1
  if cnt >= len(set(lst))-K:
    break
      
print(swap)

Fixed submission:
N, K = [int(x) for x in input().split(" ")]
lst = [int(x) for x in input().split(" ")]

dic= {}
cnt = 0 
swap = 0
prep = len(set(lst))-K

for i in range(1,N+1):
	dic["{}".format(i)] = 0

for i in range(0,N):
	dic["{}".format(lst[i])] += 1

sorted_dic = sorted(dic.items(), key = lambda x : x[1])
    
for i in range(0,N):
  swap += sorted_dic[i][1]
  if sorted_dic[i][1] != 0:
    cnt +=1
  if cnt >= prep:
    break
      
print(swap)
Buggy python submission (verdict: Runtime Error):
s = list(input())
out = []

i=0
while s[i]:
  out.append(s[i])
  i +=2

print(out)




Fixed submission:
s = list(input())
out = []

cnt =0

for i in s:
    if cnt%2 == 0:
        out.append(i)
    cnt += 1
 
print("".join(out))