Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
a = map(int, input().split())
a = sorted(a)
a.reverse()
min_sum = 0
ti = 0
if m % 2 == 1:
  ti = m // 2 + 1
else:
  ti = m // 2

for _a in a:
  if m > 0:
    min_sum += _a // (2 ** ti)
    ti -= 1
  else:
    min_sum += _a

print(min_sum)

Fixed submission:
# 最小金額を求める
# 一番高い商品に割引を適用して半額（小数点以下切り捨て）にする作業の繰り返し
# 問題詳細：https://atcoder.jp/contests/abc141/tasks/abc141_d
# 優先度付きキューを利用する
import heapq

def main():
  n, m = map(int, input().split())
  a = list(map(int, input().split()))
  pq = to_priorityqueue(a)
  pq = use_ticket(pq, m)
  print(-sum(pq))


# 優先度付きキューを作成
# heapqモジュールを利用
# pythonのheapqの場合、pop(取り出し)を行った際に最小のものから取り出される
# 今回は大きい順に取り出して利用したいため、-1を掛けてpushする（最大の値が最小になる）
def to_priorityqueue(list):
  rtn = []
  for el in list:
    heapq.heappush(rtn, -el)
  return rtn

# チケットの利用（割引の適用）
# チケットがなくなるまで、その時点で最も価格が高い商品にわりびきを適用する
# 最大まで割引を適用した結果できたキューを返す
def use_ticket(pq, t_num):
  while t_num and pq:
    el = -(heapq.heappop(pq))
    el //= 2
    heapq.heappush(pq, -el)
    t_num -= 1
  return pq

if __name__ == "__main__":
  main()
Buggy python submission (verdict: Runtime Error):
n = int(input())

max_i = int(n / 2) + 1
max_mod = n % max_i

sum = ((n - 1) * n) / 2

if max_mod > max_i:
  sum = (sum - max_i-1) + max_mod

print(int(sum))



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

cnt = 0

for i in range(3):
  if s[i] == t[i]:
    cnt += 1

print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

sum = ((n - 1) * n) / 2

max_mod = 0
iw = 0
for i in range(n):
  if i == 0:
    continue
  mod_i = n % i
  if mod_i > max_mod:
    max_mod = mod_i
    iw = i

if max_mod > iw:
  sum = (sum - iw) + max_mod

print(int(sum))



Fixed submission:
n = int(input())

sum = ((n - 1) * n) // 2

print(sum)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

s = list(input())

l = len(s)

goodFlag = False
for i in range(l-1):
    if s[i] == s[i+1]:
        ggoodFlag = True

if goodFlag == True:
    print ("Good")
else:
    print ("Bad")

Fixed submission:
# -*- coding: utf-8 -*-

s = list(raw_input())

l = len(s)

badFlag = False
for i in range(l-1):
    if s[i] == s[i+1]:
        badFlag = True

if badFlag == True:
    print ("Bad")
else:
    print ("Good")
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

n = input()

l = []

for i in range(n):
    inpt = raw_input().split()
    l.append((inpt[0], inpt[1]), i)

l.sort(key=lambda xrange:(x[0], -x[1]))

for i in l:
    print (l[2] + 1)


Fixed submission:
# -*- coding: utf-8 -*-

n = input()

l = []

for i in range(n):
    inpt = raw_input().split()
    l.append((inpt[0], int(inpt[1]), i + 1))

l.sort(key=lambda x:(x[0], -x[1]))

for i in l:
    print (i[2])
Buggy python submission (verdict: Time Limit Exceeded):
N,K,Q = map(int,input().split())
p = [K]*N

for i in range(Q):
    A = int(input())
    p = [n-1 for n in p]
    p[A-1] = p[A-1] + 1
for i in p:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Fixed submission:
N,K,Q = map(int,input().split())
p = [K-Q]*N

for i in range(Q):
    A = int(input())
    p[A-1] = p[A-1] + 1
for i in p:
    if i <= 0:
        print("No")
    else:
        print("Yes")
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split)
 
if a*b <= c:
  print(a:b)
else:
  print(c)

Fixed submission:
a,b,c = map(int,input().split())
if a*b < c:
  print(a*b)
else:
  print(c)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
 
if a*b < c:
  print(a:b)
else:
  print(c)

Fixed submission:
a,b,c = map(int,input().split())
if a*b < c:
  print(a*b)
else:
  print(c)

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

if a*b < c:
  print(a:b)
else:
  print(c)

Fixed submission:
a,b,c = map(int,input().split())
if a*b < c:
  print(a*b)
else:
  print(c)
Buggy python submission (verdict: Runtime Error):
s = list(map(int,input().split()))
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
  print("Bad")
else:
  print("Good")
    

Fixed submission:
s = list(input())
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
  print("Bad")
else:
  print("Good")
Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
L = list(map(int,input().split()))
d = 0
ans = 1
for i in range(1,N+2):
  d += L[i-1]
  if d <= X:
    ans += 1
print(ans)

Fixed submission:
N,X = map(int,input().split())
L = list(map(int,input().split()))
d = 0
ans = 1
for i in range(1,N+1):
  d += L[i-1]
  if d <= X:
  	ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
L = list(map(int,input().split()))
d = 0
ans = 1
for i in range(1,N+2):
  d += L[i-1]
  if d <= X:
    ans += 1
  else:
    break
print(ans)

Fixed submission:
N,X = map(int,input().split())
L = list(map(int,input().split()))
d = 0
ans = 1
for i in range(1,N+1):
  d += L[i-1]
  if d <= X:
  	ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
s = list(input())
lst = []
ans = 0
for i in s:
    if i == "A" or i == "C" or i == "G" or i == "T":
        ans += 1
    else:
        lst.append(ans)
        ans = 0
print(max(lst))

Fixed submission:
s = list(input())
lst = []
ans = 0
c = 0
for i in s:
    if i == "A" or i == "C" or i == "G" or i == "T":
        ans += 1
        c = max(c,ans)
    else:
        ans = 0
print(c)

Buggy python submission (verdict: Runtime Error):
s = list(input())
lst = []
ans = 0
for i in s:
    if i == "A" or i == "C" or i == "G" or i == "T":
        ans += 1
    else:
        lst.append(ans)
        ans = 0
print(max(lst))

Fixed submission:
s = list(input())
lst = []
ans = 0
c = 0
for i in s:
    if i == "A" or i == "C" or i == "G" or i == "T":
        ans += 1
        c = max(c,ans)
    else:
        ans = 0
print(c)
Buggy python submission (verdict: Runtime Error):
N,M,C = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
lst = []
for i in range(N):
  A = list(map(int,input().split()))
  lst.append(A[i]*B[i])
for i in lst:
    if i > 0:
      ans += 1
print(ans)

Fixed submission:
N,M,C = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
total = 0
lst = []
for i in range(N):
  A = list(map(int,input().split()))
  for j in range(M):
    total += A[j]*B[j]
  lst.append(total)
  total = 0
for i in lst:
    if i +C > 0:
      ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
N,M,C = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
lst = []
for i in range(M):
    A = list(map(int,input().split()))
    lst.append(A[i]*B[i])
for i in lst:
    if i > 0:
      ans += 1
print(ans)

Fixed submission:
N,M,C = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
total = 0
lst = []
for i in range(N):
  A = list(map(int,input().split()))
  for j in range(M):
    total += A[j]*B[j]
  lst.append(total)
  total = 0
for i in lst:
    if i +C > 0:
      ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
N,M,C = list(map(int,input().split()))
B = list(map(int,input().split()))
total = 0
ans = 0
for i in range(N):
    A = list(map(int,input().split()))
    for j in range(N):
        total += A[i]*B[i]
if total > 0:
    ans += 1
print(ans)

Fixed submission:
N,M,C = list(map(int,input().split()))
B = list(map(int,input().split()))
ans = 0
total = 0
lst = []
for i in range(N):
  A = list(map(int,input().split()))
  for j in range(M):
    total += A[j]*B[j]
  lst.append(total)
  total = 0
for i in lst:
    if i +C > 0:
      ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N,M = [int(x) for x in input().split()]
k = [0] * (M+1)
for i in range(N):
    a = [int(x) for i in input().split()]
    del a[0]
    for j in a:
        k[j] += 1
print(k.count(N))

Fixed submission:
n,m = map(int, input().split())
ans = list(input().split())
ans = set(ans[1:])
for i in range(n-1):
    b = list(input().split())
    b = set(b[1:])
    ans = ans & b
print(len(ans))

Buggy python submission (verdict: Runtime Error):
N,M = list(map(int,input().split()))
lst = list(map(int,input().split()))
for i in range(N-1):
    k = list(map(int,input().split()))
    for j in k[1:]:
        if j in lst:
            continue
        else:
            lst.remove(j)
print(len(lst))

Fixed submission:
n,m = map(int, input().split())
ans = list(input().split())
ans = set(ans[1:])
for i in range(n-1):
    b = list(input().split())
    b = set(b[1:])
    ans = ans & b
print(len(ans))
Buggy python submission (verdict: Runtime Error):
N = int(input())
l = list(map(int.input().split()))

if 2 * max(l) < sum(l):
    print("Yes")
else:
    print("No")

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

if 2 * max(l) < sum(l):
    print("Yes")
else:
    print("No")
Buggy python 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")

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 python submission (verdict: Runtime Error):
N = int(input())
print(lst)
for i in range(1000):
    if N in lst:
        print(N)
        break
    else:
        N += 1

Fixed submission:
N = int(input())
lst = [i*100+i*10+i for i in range(1,10)]
for i in range(1000):
    if N in lst:
        print(N)
        break
    else:
        N += 1
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input.split())
print((a-1)*(b-1))

Fixed submission:
a,b = map(int,input().split())
print((a-1)*(b-1))
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
if n%k == 0:
    print(0)
else:
    prinnt(1)

Fixed submission:
n,k = map(int,input().split())
if n%k == 0:
    print(0)
else:
    print(1)
Buggy python submission (verdict: Runtime Error):
a = [map(int,input().split())]
a.sort()
print(abs(a[0]-a[1])+abs(a[1]-a[2])

Fixed submission:
a = list(map(int,input().split()))
a.sort()
print(abs(a[0]-a[1])+abs(a[1]-a[2]))
Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))
a.sort()
print(abs(a[0]-a[1])+abs(a[1]-a[2]))

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

for i in range(len(s)):
    a = s[-1]
    s.pop(-1)
    s.insert(0,a)
    a = []
    if s == t:
        print("Yes")
        exit()
print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
for i in range(N,10000000000):
    if i%2 == 0 and i%N == 0:
        print(i)
        break

Fixed submission:
N = int(input())
 
if N % 2 == 0:
  print(N)
else:
  print(2 * N)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
for i in range(1,10000000000):
    if i%2 == 0 and i%N == 0:
        print(i)
        break

Fixed submission:
N = int(input())
 
if N % 2 == 0:
  print(N)
else:
  print(2 * N)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
df = b-a
nums = []
cnt = 0
for i in range(1,1000):
    cnt += i
    nums.append(cnt)
    if nums[i] - nums[i-1] == df:
        print(nums[i] - b)
        exit()

Fixed submission:
x,y = map(int,input().split())
h=y-x
a=0
for i in range(h-1):
   a+=i+1
print(a-x)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

ans = 0
c = 0
for i in range(N):
    c = len(set(list(S[:i]))&set(list(S[i:])))
    ans = max(ans,c)
print(ans)

Fixed submission:
a,b = map(int,input().split())
print(max(a+b,a-b,a*b))
Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
cnt = 0
for x in range(0,k+1):
    for y in range(0,k+1):
        for z in range(0,k+1):
            if x+y+z == s:
                cnt += 1
print(cnt)

Fixed submission:
k,s = map(int,input().split())
ans = 0
for x in range(k+1):
    for y in range(k+1):
        if 0 <= s-(x+y) <= k:
            ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
a, b = list(map(int, input().split()))
number = 0
if a == 1:
    number = 0
elif b >  a:
    number = math.ceil((b - a) / (a - 1))
else:
    number = 0
number += 1
print(number)

Fixed submission:
forecasts     = input()
real_weathers = input()

correct_number = 0
for date in range(len(forecasts)):
    if forecasts[date] == real_weathers[date]:
        correct_number += 1
print(correct_number)

Buggy python submission (verdict: Runtime Error):
a, b = list(map(int, input().split()))
number = 1
outlet_number = a
while outlet_number <= b:
    outlet_number += a - 1
    number += 1
print(number)

Fixed submission:
forecasts     = input()
real_weathers = input()

correct_number = 0
for date in range(len(forecasts)):
    if forecasts[date] == real_weathers[date]:
        correct_number += 1
print(correct_number)

Buggy python submission (verdict: Runtime Error):
a, b = list(map(int, input().split()))
number = 1
outlet_number = a
while outlet_number < b:
    outlet_number += a - 1
    number += 1
print(number)

Fixed submission:
forecasts     = input()
real_weathers = input()

correct_number = 0
for date in range(len(forecasts)):
    if forecasts[date] == real_weathers[date]:
        correct_number += 1
print(correct_number)

Buggy python submission (verdict: Runtime Error):
a, b = list(map(int, input().split()))
number = 1
while a =< b:
    a += a - 1
    number += 1
print(number)

Fixed submission:
forecasts     = input()
real_weathers = input()

correct_number = 0
for date in range(len(forecasts)):
    if forecasts[date] == real_weathers[date]:
        correct_number += 1
print(correct_number)

Buggy python submission (verdict: Runtime Error):
a, b = list(map(int, input().split()))
number = 1
while a <= b:
    a += a - 1
    number += 1
print(number)

Fixed submission:
forecasts     = input()
real_weathers = input()

correct_number = 0
for date in range(len(forecasts)):
    if forecasts[date] == real_weathers[date]:
        correct_number += 1
print(correct_number)
Buggy python submission (verdict: Runtime Error):
n = int(input())
h = tuple(map(int, input().split()))
max_step = []
for m in range(n-1):
    step = 0
    for k in range(m, n-1):
        if h[k] >= h[k + 1]:
            step += 1
        else:
            break
    max_step.append(step)
print(max(max_step))

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
a = 0
for i in range(1,n):
    if h[i] <= h[i-1]:
        a += 1
    else:
        ans.append(a)
        a = 0
ans.append(a)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = tuple(map(int, input().split()))
max_step = []
for m in range(n-1):
    step = 0
    for k in range(m, n-1):
        if h[k] >= h[k + 1]:
            step += 1
        else:
            break
    max_step.append(step)
print(max(max_step))

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
a = 0
for i in range(1,n):
    if h[i] <= h[i-1]:
        a += 1
    else:
        ans.append(a)
        a = 0
ans.append(a)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = tuple(map(int, input().split()))
max_step = []
for m in range(n-1):
    step = 0
    for k in range(m, n-1):
        if h[k] >= h[k + 1]:
            step += 1
        else:
            break
    max_step.append(step)
print(max(max_step))

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
a = 0
for i in range(1,n):
    if h[i] <= h[i-1]:
        a += 1
    else:
        ans.append(a)
        a = 0
ans.append(a)
print(max(ans))

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = list(map(int, input().split()))
max_step = []
for m in range(n-1):
    step = 0
    for k in range(m, n-1):
        if h[k] >= h[k + 1]:
            step += 1
        else:
            break
    max_step.append(step)
print(max(max_step))

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
ans = []
a = 0
for i in range(1,n):
    if h[i] <= h[i-1]:
        a += 1
    else:
        ans.append(a)
        a = 0
ans.append(a)
print(max(ans))
Buggy python submission (verdict: Runtime Error):
n = int(input())
L = list(map(int, input().split())
L.sort()
array_L = []
for m in [i * 2 for i in range(n)]:
    array_L.append(L[m])
print(sum(array_L))
    

Fixed submission:
n = int(input())
L = list(map(int, input().split()))
L.sort()
array_L = []
for m in [i * 2 for i in range(n)]:
    array_L.append(L[m])
print(sum(array_L))
Buggy python submission (verdict: Runtime Error):
l = int(raw_input())
print (len(set(map(int, raw_input().split())))//2)*2

Fixed submission:
r = int(raw_input())
print ("ABC" if r<1200 else "ARC")
Buggy python submission (verdict: Runtime Error):
x = int(raw_input())
print 2*(x//11) + (2 if x%11>6 else 1)

Fixed submission:
s = raw_input()
print s.rfind("Z")-s.find("A")+1
Buggy python submission (verdict: Runtime Error):
x = int(raw_input)
print 2*(x//11) + (2 if x%11>6 else 1)

Fixed submission:
x = int(raw_input())
out = 2*(x//11)
if x%11 == 0: pass
elif x%11 <= 6: out += 1
else: out += 2
print out
Buggy python submission (verdict: Runtime Error):
int(raw_input())
print len(set(map(int, raw_input().strip())))

Fixed submission:
a = int(raw_input())
print ((len(set(map(int, raw_input().split())))-1)//2)*2+1
Buggy python submission (verdict: Runtime Error):
a = int(input())
print(math.ceil(a/2) / a)

Fixed submission:
import math
a = int(input())
print(math.ceil(a/2) / a)
Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]

score = [k]*n
for i in A:
    score = list(map(lambda x: x-1, score))
    score[i-1] = score[i-1]+1

for s in score:
    if s > 0:
        print('Yes')
    else:
        print('No')

Fixed submission:
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]

score = [k-q]*n
for i in A:
    score[i-1] = score[i-1]+1

for s in score:
    if s > 0:
        print('Yes')
    else:
        print('No')

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]

score = [k]*n
for i in A:
    score = list(map(lambda x: x-1, score))
    score[i-1] = score[i-1]+1

for s in score:
    if s > 0:
        print('Yes')
    else:
        print('No')

Fixed submission:
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]

score = [k-q]*n
for i in A:
    score[i-1] = score[i-1]+1

for s in score:
    if s > 0:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())
A = list((map(int, input().split())))
for _ in range(m):
    A.sort()
    A[-1] = A[-1] // 2
print(sum(A))

Fixed submission:
import heapq
import math

n, m = map(int, input().split())
A = list(map(lambda x: -x, map(int, input().split())))
heapq.heapify(A)
for _ in range(m):
    tmp = heapq.heappop(A)
    tmp = math.ceil(tmp / 2)
    heapq.heappush(A, tmp)
print(-sum(A))

Buggy python submission (verdict: Runtime Error):
import numpy as np
n, m = map(int, input().split())
A = np.array(list((map(int, input().split()))))
for _ in range(m):
    A.sort()
    A[-1] = A[-1] // 2
print(sum(A))

Fixed submission:
import heapq
import math

n, m = map(int, input().split())
A = list(map(lambda x: -x, map(int, input().split())))
heapq.heapify(A)
for _ in range(m):
    tmp = heapq.heappop(A)
    tmp = math.ceil(tmp / 2)
    heapq.heappush(A, tmp)
print(-sum(A))

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
n, m = map(int, input().split())
A = np.array(list((map(int, input().split()))))
for _ in range(m):
    A.sort()
    A[-1] = A[-1] // 2
print(sum(A))

Fixed submission:
import heapq
import math

n, m = map(int, input().split())
A = list(map(lambda x: -x, map(int, input().split())))
heapq.heapify(A)
for _ in range(m):
    tmp = heapq.heappop(A)
    tmp = math.ceil(tmp / 2)
    heapq.heappush(A, tmp)
print(-sum(A))
Buggy python submission (verdict: Runtime Error):
x = input().split(' ')
a, b, c = x[0], x[1], x[2]
ans = c - (a-b)
if ans > 0:
  print(ans)
else:
  print(0)


Fixed submission:
x = input().split(' ')
n = list(map(int, x))
ans = n[2] - (n[0]-n[1])
if ans > 0:
  print(ans)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
x = input().split(' ')
a, b, c = x[0], x[1], x[2]
ans = c - (a-b)
if ans > 0:
  print(ans)
else:
  print 0


Fixed submission:
x = input().split(' ')
n = list(map(int, x))
ans = n[2] - (n[0]-n[1])
if ans > 0:
  print(ans)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
x = input().split(' ')
a, b, c = x[0], x[1], x[2]
ans = c - (a-b)
if c > 0:
  print(c)
else:
  print(0)


Fixed submission:
x = input().split(' ')
n = list(map(int, x))
ans = n[2] - (n[0]-n[1])
if ans > 0:
  print(ans)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
x = input().split(' ')
a, b, c = x[0], x[1], x[2]
ans = c - (a-b)
if c > 0:
  print(c)
else:
  print 0


Fixed submission:
x = input().split(' ')
n = list(map(int, x))
ans = n[2] - (n[0]-n[1])
if ans > 0:
  print(ans)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):

s = input()
c = collections.Counter(s)

if [2,2] == [x for x in c.values()]:
  print('Yes')
else:
  print('No')

Fixed submission:
import collections
s = input()
c = collections.Counter(s)

if [2,2] == [x for x in c.values()]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
input = str(input()).split(" ")
input = [int(x) for x in input]

a=input[0]
b=input[1]
x=input[2]

import math

##check situation
height = x/a/a
if height <= b/2:
    teihen_height = 2*x/a/b
    print(math.degrees(math.atan(b/teihen_height)))
else:
    nokori_height = b - height
    print(90-math.degrees(math.atan(0.5*a/nokori_height)))

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

a=input[0]
b=input[1]
x=input[2]

import math

##check situation
height = x/a/a
if height <= b/2:
    teihen_height = 2*x/a/b
    print(math.degrees(math.atan(b/teihen_height)))
elif height == b:
    print(0)
else:
    nokori_height = b - height
    print(90-math.degrees(math.atan(0.5*a/nokori_height)))
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
print(max(0,A-2*B)

Fixed submission:
A,B=input().split()
ans=int(A)-int(B)*2
if ans > 0:
  print(ans)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
A,B=input().sp;it()
print(int(A)-int(B)*2)


Fixed submission:
A,B=input().split()
ans=int(A)-int(B)*2
if ans > 0:
  print(ans)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
A,B=input()
print(int(A)-int(B)*2)


Fixed submission:
A,B=input().split()
ans=int(A)-int(B)*2
if ans > 0:
  print(ans)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
A,B=Imput()
print(int(A)-int(B)*2)


Fixed submission:
A,B=input().split()
ans=int(A)-int(B)*2
if ans > 0:
  print(ans)
else:
  print(0)
Buggy python submission (verdict: Time Limit Exceeded):
N, Q = map(int, input().split())

S=input()


for i in range(Q):
    L,R=map(int, input().split())
    s=S[L-1:R]
    print(s.count('AC'))


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

S=input()
old=''
count=0
data=[0]*len(S)

for i  in range(len(S)):
    if old =='A' and S[i] =='C':
        count+=1
    data[i]=count
    old=S[i]

for i in range(Q):
    L,R=map(int, input().split())
    print(abs(data[L-1]-data[R-1]))
Buggy python submission (verdict: Runtime Error):
K,A,B=map(int,input().split())


ans=1+K
count=0
count=(K-(A))//2
ANS=1+(K-2*count)+abs(A-B)*count

print(max(ANS,ans))


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

ans='NO'

if N%2==0 and K<=(N/2):
    ans='YES'
if N%2==1 and K<=((N+1)/2) :
    ans='YES'

print(ans)

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


ans=1+K
count=0
count=(K-(A-1))//2
ANS=(K-2*count)+abs(A-B)*count

print(max(ANS,ans))

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

ans='NO'

if N%2==0 and K<=(N/2):
    ans='YES'
if N%2==1 and K<=((N+1)/2) :
    ans='YES'

print(ans)