Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())
a_list = list(map(int, input().split())
              
a_sorted = sorted(a_list)
              
print(a_sorted[-1] - a_sorted[0])

Fixed submission:
n = int(input())
a_list = list(map(int, input().split()))
              
a_sorted = sorted(a_list)
              
print(a_sorted[-1] - a_sorted[0])

Buggy python submission (verdict: Runtime Error):
n = int(input())
a_list = list(map(int, input().split())
              
a_sorted = sorted(a_list)
              
print(a_sorted[-1] - a_sorted[0]

Fixed submission:
n = int(input())
a_list = list(map(int, input().split()))
              
a_sorted = sorted(a_list)
              
print(a_sorted[-1] - a_sorted[0])
Buggy python submission (verdict: Runtime Error):
n = int(input())

sum_list = []
for i in range(1, int((n + 1) / 2)):
    a = i
    b = n - i
    sum_a = 0
    for a_i in range(len(str(a))):
        sum_a += int(str(a)[a_i])
    sum_b = 0
    for b_i in range(len(str(b))):
        sum_b += int(str(b)[b_i])
    sum_list.append(sum_a + sum_b)

print(min(sum_list))

Fixed submission:
n = int(input())

sum_list = []
for i in range(1, int(n / 2) + 1):
    a = i
    b = n - i
    sum_a = 0
    for a_i in range(len(str(a))):
        sum_a += int(str(a)[a_i])
    sum_b = 0
    for b_i in range(len(str(b))):
        sum_b += int(str(b)[b_i])
    sum_list.append(sum_a + sum_b)

print(min(sum_list))

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

sum_list = []
for i in range(2, int((n + 1) / 2)):
    a = i
    b = n - i
    sum_a = 0
    for a_i in range(len(str(a))):
        sum_a += int(str(a)[a_i])
    sum_b = 0
    for b_i in range(len(str(b))):
        sum_b += int(str(b)[b_i])
    sum_list.append(sum_a + sum_b)

print(min(sum_list))

Fixed submission:
n = int(input())

sum_list = []
for i in range(1, int(n / 2) + 1):
    a = i
    b = n - i
    sum_a = 0
    for a_i in range(len(str(a))):
        sum_a += int(str(a)[a_i])
    sum_b = 0
    for b_i in range(len(str(b))):
        sum_b += int(str(b)[b_i])
    sum_list.append(sum_a + sum_b)

print(min(sum_list))
Buggy python submission (verdict: Runtime Error):
ans_min = x * a + y * b
for i in range(100000):
    ans = i * 2 * c + max(0, x - i) * a + max(0, y - i) * b
    if ans < ans_min:
        ans_min = ans
print(ans)

Fixed submission:
a, b, c, x, y = map(int, input().split())
 
ans_min = x * a + y * b
for i in range(100001):
    ans = i * 2 * c + max(0, x - i) * a + max(0, y - i) * b
    if ans < ans_min:
        ans_min = ans
 
print(ans_min)

Buggy python submission (verdict: Time Limit Exceeded):
a, b, c, x, y = map(int, input().split())

count_min = x * a + y * b
for p_a in range(x + 1):
    for p_b in range(y + 1):
        if x - p_a == y - p_b:
            p_ab = max((x - p_a), (y - p_b)) * 2
            count = p_a * a + p_b * b + p_ab * c
            if count < count_min:
                count_min = count

print(count_min)

Fixed submission:
a, b, c, x, y = map(int, input().split())
 
ans_min = x * a + y * b
for i in range(100001):
    ans = i * 2 * c + max(0, x - i) * a + max(0, y - i) * b
    if ans < ans_min:
        ans_min = ans
 
print(ans_min)

Buggy python submission (verdict: Time Limit Exceeded):
a, b, c, x, y = map(int, input().split())

count_min = x * a + y * b
for p_a in range(x + 1):
    for p_b in range(y + 1):
        for p_ab in range(max(x, y) * 2 + 1):
            if p_a + 0.5 * p_ab == x and p_b + 0.5 * p_ab == y:
                count = p_a * a + p_b * b + p_ab * c
                if count < count_min:
                    count_min = count

print(count_min)

Fixed submission:
a, b, c, x, y = map(int, input().split())
 
ans_min = x * a + y * b
for i in range(100001):
    ans = i * 2 * c + max(0, x - i) * a + max(0, y - i) * b
    if ans < ans_min:
        ans_min = ans
 
print(ans_min)
Buggy python submission (verdict: Runtime Error):
import math
 
n, a, b = map(int, input().split())
 
sum_all = 0
for i in range(1, n + 1):
    sum_n = 0
    m = i
    while(m > 0):
        sum_n += math.floor(m % 10)
        m /= 10
    if a <= sum_n <= b:
        sum_all += i
 
print(sum_all)

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

if (a + b) > (c + d):
  print('Left')
elif (a + b) < (c + d):
  print('Right')
else:
  print('Balanced')

Buggy python submission (verdict: Runtime Error):
import math

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

sum_all = 0
for i in range(1, n + 1):
    sum_n = 0
    m = i
    while(m > 0):
        sum_n += math.floor(m % 10)
        m = int(m / 10)
    if a <= sum_n <= b:
        sum_all += i

print(sum_all)

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

if (a + b) > (c + d):
  print('Left')
elif (a + b) < (c + d):
  print('Right')
else:
  print('Balanced')
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()

s_list = list(s)
t_list = list(t)

s_list.sort()
t_list.sort()
    
for i in range(min(len(s_list), len(t_list))):
  if s_list[i] < t_list[i]:
    print('Yes')
    break
  elif s_list[i] > t_list[i]
    print('No')
    break
  else:
    if i == min(len(s_list), len(t_list)):
      if len(s_list) < len(t_list):
        print('Yes')
      else
        print('No')
    else
      continue
      

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

s_list = list(s)
t_list = list(t)

s_list.sort()
t_list.sort(reverse=True)

s = "".join(s_list)
t = "".join(t_list)

if s < t:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s_list = input()
sum = int(a[0]) + int(a[1]) + int(a[2])
print(sum)

Fixed submission:
s_list = input()
sum = int(s_list[0]) + int(s_list[1]) + int(s_list[2])
print(sum)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a_list = list(map(int, input().split()))
cnt = 0
even = True
 
while(even):
	for i in range(n):
  		if a_list[i] % 2 != 0
        	even = False
            break
        else:
          a_list[i] /= 2
    cnt += 1
          
print(cnt)

Fixed submission:
n = int(input())
a_list = list(map(int, input().split()))
cnt = 0
even = True

while(even):
    for i in range(n):
        if a_list[i] % 2 != 0:
            even = False
            break
        else:
          a_list[i] /= 2
    cnt += 1

print(cnt - 1)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a_list = list(map(int, input().split()))
cnt = 0
even = True

while(even)
	for i in range(n):
  		if a_list[i] % 2 != 0
        	even = False
            break
        else:
          a_list[i] /= 2
    cnt += 1
          
print(cnt)

Fixed submission:
n = int(input())
a_list = list(map(int, input().split()))
cnt = 0
even = True

while(even):
    for i in range(n):
        if a_list[i] % 2 != 0:
            even = False
            break
        else:
          a_list[i] /= 2
    cnt += 1

print(cnt - 1)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
a_list = list(map(int, input().split()))

a_set = set(a_list)
a_set_len = len(a_set)
a_count = sorted([a_list.count(i) for i in a_set])

count = 0
for i in range(max((a_set_len - k), 0)):
    count += a_count[i]

print(count)

Fixed submission:
from collections import Counter
n, k = map(int, input().split())
a_list = list(map(int, input().split()))

counter = Counter(a_list).most_common()[::-1]

count = 0
for i in range(max((len(counter) - k), 0)):
    count += counter[i][1]

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
a_list = list(map(int, input().split()))

a_set = set(a_list)
a_set_len = len(a_set)
a_count = sorted([a_list.count(i) for i in a_set])

count = 0
for i in range(max((a_set_len - k), 0)):
    count += a_count[i]

print(count)

Fixed submission:
from collections import Counter
n, k = map(int, input().split())
a_list = list(map(int, input().split()))

counter = Counter(a_list).most_common()[::-1]

count = 0
for i in range(max((len(counter) - k), 0)):
    count += counter[i][1]

print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
a_list = list(map(int, input().split()))

a_set = set(a_list)
a_set_len = len(a_set)
a_count = sorted([a_list.count(i) for i in a_set])

count = 0
i = 0
while(a_set_len > k):
    count += a_count[i] 
    a_set_len -= 1
    i += 1

print(count)


Fixed submission:
from collections import Counter
n, k = map(int, input().split())
a_list = list(map(int, input().split()))

counter = Counter(a_list).most_common()[::-1]

count = 0
for i in range(max((len(counter) - k), 0)):
    count += counter[i][1]

print(count)
Buggy python submission (verdict: Runtime Error):
s = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'

s_set = set(s)
if len(s_set) == 26:
    print('None')
else:
    s_sorted = sorted(s_set)
    for i, a in enumerate(alpha):
        if a != s_sorted[i]:
            print(a)
            break

Fixed submission:
s = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'

s_set = set(s)
if len(s_set) == 26:
    print('None')
else:
    for a in alpha:
        if a not in s_set:
            print(a)
            break
Buggy python submission (verdict: Runtime Error):
s = input()
print(s[0] + str(len(s) + s[-1])

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

print('%s%d%s' % (s[0], l-2, s[-1]))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
 
n_max = 1
cnt_max = 0
for i in range(1, n + 1):
  cnt = 0
  a = i
  while(a % 2 == 0):
    a %= 2
    cnt += 1
  if cnt > cnt_max:
    cnt_max = cnt
    n_max = i
 
print(n_max)

Fixed submission:
n = int(input())
 
n_max = 1
cnt_max = 0
for i in range(1, n + 1):
  cnt = 0
  a = i
  while(a % 2 == 0):
    a /= 2
    cnt += 1
  if cnt > cnt_max:
    cnt_max = cnt
    n_max = i
 
print(n_max)

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

n_max = 1
cnt_max = 0
for i in range(1, n + 1):
  cnt = 0
  a = i
  while(a % 2 == 0)
    a %= 2
    cnt += 1
  if cnt > cnt_max:
    cnt_max = cnt
    n_max = i

print(n_max)

Fixed submission:
n = int(input())
 
n_max = 1
cnt_max = 0
for i in range(1, n + 1):
  cnt = 0
  a = i
  while(a % 2 == 0):
    a /= 2
    cnt += 1
  if cnt > cnt_max:
    cnt_max = cnt
    n_max = i
 
print(n_max)
Buggy python submission (verdict: Runtime Error):
n = input().split()

if int(n) % 4 == 0:
	print("YEES")
else:
	print("NO")

Fixed submission:
n = int(input().replace(' ', ''))
if n % 4 == 0:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))


if a[1] > a[0]:
    inc = True
else:
    inc = False
count = 1
for i in range(2, len(a)):
    if a[i] > a[i - 1]:
        if inc:
            pass
        else:
            count += 1
            inc = False
    elif a[i] < a[i - 1]:
        if inc:
            count += 1
            inc = True
        else:
            pass

print(count)

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

flg_inc = False
flg_dec = False

count = 1
for i in range(1, len(a)):
    if a[i] < a[i - 1]:
        flg_dec = True
        if flg_inc:
            count += 1
            flg_inc = False
            flg_dec = False
    elif a[i] > a[i - 1]:
        flg_inc = True
        if flg_dec:
            count += 1
            flg_inc = False
            flg_dec = False

print(count)

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

diff_list = [a[i] - a[i - 1]  for i in range(1, len(a))]
print(diff_list)

diff = a[1] - a[0]
count = 1
for i in range(2, len(a)):
    if a[i] - a[i - 1] != 1:
        count += 1
    elif a[i] - a[i - 1] == 1:
        if diff != 1:
            count += 1
        diff = 1
    elif a[i] - a[i - 1] == -1:
        if diff != -1:
            count += 1
        diff = -1

print(count)

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

flg_inc = False
flg_dec = False

count = 1
for i in range(1, len(a)):
    if a[i] < a[i - 1]:
        flg_dec = True
        if flg_inc:
            count += 1
            flg_inc = False
            flg_dec = False
    elif a[i] > a[i - 1]:
        flg_inc = True
        if flg_dec:
            count += 1
            flg_inc = False
            flg_dec = False

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
import math

n = int(input())

def compare_digits(a, b):
    return max(len(str(a)), len(str(b)))

ans_min = len(str(n))
for a in range(1, math.ceil(n / 2) + 1):
    if n % a == 0:
        ans = compare_digits(a, int(n / a))
        if ans < ans_min:
           ans_min = ans

print(ans_min)

Fixed submission:
import math

n = int(input())

def compare_digits(a, b):
    return max(len(str(a)), len(str(b)))

ans_min = len(str(n))
for a in range(1, int(math.sqrt(n)) + 1):
    if n % a == 0:
        ans = compare_digits(a, int(n / a))
        if ans < ans_min:
           ans_min = ans

print(ans_min)
Buggy python submission (verdict: Runtime Error):
s = input()
print(s.rindex('Z') - a.index('A') + 1)

Fixed submission:
s = input()
print(s.rindex('Z') - s.index('A') + 1)

Buggy python submission (verdict: Time Limit Exceeded):
s = input()

cnt_max = 0
for i, s_item in enumerate(s):
  if s_item == 'A':
    cnt = 1
    for ss_item in s[i+1:]:
      cnt += 1
      if ss_item == 'Z':
        if cnt > cnt_max:
          cnt_max = cnt

print(cnt_max)


Fixed submission:
s = input()
print(s.rindex('Z') - s.index('A') + 1)
Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())

cnt = 0
for i in range(k + 1):
  for j in range(k + 1):
    for l in range(k + 1):
      if i + j + l == s:
        cnt += 1

print(cnt)


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

cnt = 0
for i in range(k + 1):
  for j in range(k + 1):
      if 0 <= s - (i + j) <= k:
        cnt += 1

print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())

cnt = 0
for i in range(k + 1):
  for j in range(k + 1):
    for k in range(k + 1):
      if i + j + k == s:
        cnt += 1

print(cnt)


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

cnt = 0
for i in range(k + 1):
  for j in range(k + 1):
      if 0 <= s - (i + j) <= k:
        cnt += 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
w, h, n = map(int, input().split())
coord_list = [list(map(int, input().split())) for i in range(n)]

x_list = [i for i in range(w + 1)]
y_list = [i for i in range(h + 1)]

for a in coord_list:
    if a[-1] == 1:
        x_list = [i for i in x_list if i >= a[0]]
    elif a[-1] == 2:
        x_list = [i for i in x_list if i <= a[0]]
    elif a[-1] == 3:
        y_list = [i for i in y_list if i >= a[1]]
    elif a[-1] == 4:
        y_list = [i for i in y_list if i <= a[1]]

print((max(x_list) - min(x_list)) * (max(y_list) - min(y_list)))

Fixed submission:
w, h, n = map(int, input().split())
coord_list = [list(map(int, input().split())) for i in range(n)]

x_min = 0
y_min = 0
x_max = w
y_max = h
for a in coord_list:
    if a[2] == 1:
        x_min = max(a[0], x_min)
    elif a[2] == 2:
        x_max = min(a[0], x_max)
    elif a[2] == 3:
        y_min = max(a[1], y_min)
    elif a[2] == 4:
        y_max = min(a[1], y_max)

ans = max((x_max - x_min), 0) * max((y_max - y_min), 0)
print(ans)
Buggy python submission (verdict: Runtime Error):
S = str(input())
ans = 'Good'
for i in range(2):
  if S[i] == S[i+1]:
    ans = 'Bad'
Print(ans)

Fixed submission:
S = str(input())
ans = 'Good'
for i in range(3):
    if S[i] == S[i+1]:
        ans = 'Bad'
print(ans)

Buggy python submission (verdict: Runtime Error):
S = str(input()).split()
ans = 'Good'
for i in range(3):
  if S[i] == S[i+1]:
    ans = 'Bad'
Print(ans)
  


Fixed submission:
S = str(input())
ans = 'Good'
for i in range(3):
    if S[i] == S[i+1]:
        ans = 'Bad'
print(ans)
Buggy python submission (verdict: Runtime Error):
l1 = ['A','T']
l2 = ['C','G']
b = str(input())
print(b)
ans = ''
if b in l1:
    l1.remove(b)
    ans = t1[0]
if b in l2:
    l2.remove(b)
    ans = l2[0]
print(ans)

Fixed submission:
l1 = ['A','T']
l2 = ['C','G']
b = str(input())
ans = ''
if b in l1:
    l1.remove(b)
    ans = l1[0]
if b in l2:
    l2.remove(b)
    ans = l2[0]
print(ans)
Buggy python submission (verdict: Runtime Error):
N = set(input())
A = set('1974')
print('YES if N==A else 'NO')

Fixed submission:
N = set(input().split())
A = set('1 9 7 4'.split())
print('YES' if N==A else 'NO')
Buggy python submission (verdict: Runtime Error):
N, T = raw_input().split()
sct = []
for i in xrange(int(N)):
    ci, ti = raw_input().split()
    if int(ti) <= int(T):
        s = set()
        s.add(ci)
        s.add(ti)
        sct.append(int(ci))
print(min(sct))

Fixed submission:
N, T = raw_input().split()
sct = []
for i in xrange(int(N)):
    ci, ti = raw_input().split()
    if int(ti) <= int(T):
        s = set()
        s.add(ci)
        s.add(ti)
        sct.append(int(ci))
print('TLE' if sct ==[] else min(sct))

Buggy python submission (verdict: Runtime Error):
N, T = raw_input().split()
sct = []
for i in xrange(int(N)):
    ci, ti = raw_input().split()
    if int(ti) < int(T):
        s = set()
        s.add(ci)
        s.add(ti)
        sct.append(ci)
print(min(sct))

Fixed submission:
N, T = raw_input().split()
sct = []
for i in xrange(int(N)):
    ci, ti = raw_input().split()
    if int(ti) <= int(T):
        s = set()
        s.add(ci)
        s.add(ti)
        sct.append(int(ci))
print('TLE' if sct ==[] else min(sct))
Buggy python submission (verdict: Runtime Error):
n = list(map(str, raw_input().split()))
n.append('+')
nc = list(itertools.permutations(n))
ncc = []
vn = []
for _ in nc:
    if _[0] != '+' and _[3] != '+':
        ncc.append(_)
for __ in ncc:
    v = eval(('').join(__))
    vn.append(v)
print(max(vn))

Fixed submission:
import itertools

n = list(map(str, raw_input().split()))
n.append('+')
nc = list(itertools.permutations(n))
ncc = []
vn = []
for _ in nc:
    if _[0] != '+' and _[3] != '+':
        ncc.append(_)
for __ in ncc:
    v = eval(('').join(__))
    vn.append(v)
print(max(vn))
Buggy python submission (verdict: Runtime Error):
# -*- cording: utf-8 -*-

A,B = map(int, raw_input().split())
if A*B%2 == 0:
    print('NO')
else:
    print('YES')

Fixed submission:
a,b = map(int, raw_input().split())
if a*b%2 == 0:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
ccc=[list(map(int,input().split())) for i in range(2)]

for idx in range(2,n):
  if (ccc[1][idx-1] == ccc[1][idx]):
    continue
  elif (ccc[1][idx-1] - 1 == ccc[1][idx] ):
    ccc[1][idx] = ccc[1][idx-1]
    continue
  elif (ccc[1][idx-1] -1 > ccc[1][idx] ):
    print("No")
    break
    
  if (idx == n-1):
    print("Yes")
  

Fixed submission:

ccc=[list(map(int,input().split())) for i in range(2)]


if ccc[0][0] == 1:
  print("Yes")
else:
  for idx in range(1,ccc[0][0]):
    if (ccc[1][idx-1] <= ccc[1][idx]):
      if (idx == ccc[0][0]-1):
        print("Yes")
      continue
    elif (ccc[1][idx-1]  == ccc[1][idx] + 1 ):
      ccc[1][idx] = ccc[1][idx-1]
      if (idx == ccc[0][0]-1):
        print("Yes")
      continue
    elif (ccc[1][idx-1] -1 > ccc[1][idx] ):
      print("No")
      break
Buggy python submission (verdict: Runtime Error):
a = int(input())

l = list(map(int, input().split()))
s_l = sorted(l, reverse=True)

if s_l[0] < s_l[1] + s_l[2] + s_l[3]:
    print('Yes')
else:
    print('No')


Fixed submission:
a = int(input())

l = list(map(int, input().split()))
s_l = sorted(l)

big = s_l[a-1]
small = 0

for i in range(a-1):
  small += s_l[i]
if big < small:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
# そのまま問題文の通りにやるだけ
n = int(input())
ans = 0
for i in range(n):
    if n % i == 0:
        if n % 2 == 1:
            ans += 1
print(ans)
    



Fixed submission:
n = int(input())
ans = 0
i = 1
for i in range(1,n+1):
    eight = 0 
    if i % 2 == 1:
        for j in range(1,i+1):
            if i % j == 0:
                eight += 1

    if eight == 8:
        ans += 1

print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
sum = 0
temp = 0
for i in range(len(n)):
    sum += temp&10:
    temp /= 10
    
if n % sum == 0:
    print('Yes')
    exit(0)

print('No')

Fixed submission:
n = input()
sum = 0
temp = int(n)
for i in range(len(n)):
    sum += int(temp) % 10
    temp /= 10

if int(n) % sum == 0:
    print('Yes')
    exit(0)

print('No')
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 整数の入力
p=str(input())
if p[0] ==p[1] ==p[2] ==p[3]:
    print("No") 
elif p[0] ==p[3] and p[1] == p[2]:
    print("Yes")
elif p[0] == p[1] and p[2] == p[3]:
    print("Yes")
elif p[0] ==p[2] and p[1] == p[3]:
else:
    print("No")

Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
p=str(input())
if p[0] ==p[1] ==p[2] ==p[3]:
    print("No") 
elif p[0] ==p[3] and p[1] == p[2]:
    print("Yes")
elif p[0] == p[1] and p[2] == p[3]:
    print("Yes")
elif p[0] ==p[2] and p[1] == p[3]:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 整数の入力
p=str(input())
if p[0] ==p[1] ==p[2] ==p[3]:
    print("No") 
elif p[0] ==p[3] and p[1] == p[2]:
    print("Yes")
elif p[0] == p[1] and p[2] == p[3]:
    print("Yes")
elif p[0] ==p[2] and p[1] == p[3]
else:
    print("No")

Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
p=str(input())
if p[0] ==p[1] ==p[2] ==p[3]:
    print("No") 
elif p[0] ==p[3] and p[1] == p[2]:
    print("Yes")
elif p[0] == p[1] and p[2] == p[3]:
    print("Yes")
elif p[0] ==p[2] and p[1] == p[3]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())
print(int(b * ((t+0.5)//a)))

Fixed submission:
# -*- coding: utf-8 -*-
a, b, t = map(int, input().split())
print(int(b * ((t+0.5)//a)))

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

a, b, c = map(int, input().split())
int(b * ((t+0.5)//a))

Fixed submission:
# -*- coding: utf-8 -*-
a, b, t = map(int, input().split())
print(int(b * ((t+0.5)//a)))

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import math
# スペース区切りの整数の入力
a, b, c = map(int, input().split())
b * math.floor((t+0.5)/a)

Fixed submission:
# -*- coding: utf-8 -*-
a, b, t = map(int, input().split())
print(int(b * ((t+0.5)//a)))
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n = int(input())
v = input().split()
c = input().split()
ri = 0
for i in range(0,n):
    a  = v[i] - c[i] 
    if a>0:
        ri += a
    else:
        pass
print(ri)

Fixed submission:
# -*- coding: utf-8 -*-
n = int(input())
v = list(map(int, input().split()))
c = list(map(int, input().split()))
ri = 0
for i in range(0,n):
    a  = v[i] - c[i] 
    if a>0:
        ri += a
    else:
        pass
print(ri)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n = int(input())
v = input()
c = input()
ri = 0
for i in range(0,n):
    a  = v[i] - c[i] 
    if a > 0:
        ri += a
    else:
        pass
print(ri)

Fixed submission:
# -*- coding: utf-8 -*-
n = int(input())
v = list(map(int, input().split()))
c = list(map(int, input().split()))
ri = 0
for i in range(0,n):
    a  = v[i] - c[i] 
    if a>0:
        ri += a
    else:
        pass
print(ri)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n = int(input())
v = map(int, input().split())
c = map(int, input().split())
ri = 0
for i in range(0,n):
    a  = v[i] - c[i] 
    if a>0:
        ri += a
    else:
        pass
print(ri)

Fixed submission:
# -*- coding: utf-8 -*-
n = int(input())
v = list(map(int, input().split()))
c = list(map(int, input().split()))
ri = 0
for i in range(0,n):
    a  = v[i] - c[i] 
    if a>0:
        ri += a
    else:
        pass
print(ri)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
n = int(input())
s = str(input())
s = s.replace(".", "0").replace('#', "1")
b = s.find("1")
a = 0
for i in range(b, n):
    a+=int(s[i])
s = [int(n) for n in s]
sums = sum(list(s))
print(min(sums, n-sums, n-b-a))

Fixed submission:
# -*- coding: utf-8 -*-
 
# スペース区切りの整数の入力
a, b, c = map(int, input().split())
if a < c and c < b:
    print("Yes")
elif b < c and c < a:
    print("Yes")
else:
    print("No")