Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import copy
a,b,c=map(int,input().split())
d=[]
for i in range(c):
    i=int(input())
    d.append(i)
d=[i-1 for i in d]
e=[b]*a

for i in d:
    e=[i-1 for i in e]
    e[i]=e[i]+1

for i in e:
    if i>0:
        print('Yes')
    else:
        print('No')

Fixed submission:
import copy
a,b,c=map(int,input().split())
d=[]
for i in range(c):
    i=int(input())
    d.append(i)
d=[i-1 for i in d]
e=[b]*a

e=[i-len(d) for i in e]
for i in d:
    e[i]+=1
    
for i in e:
    if i>0:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
a=int(input())
n=list(range(1,a+1))
m=n
o=n
for i in n:
  for j in m:
    for q in o:
      u=list(i,j,k,sep='')
print(len(u))

Fixed submission:
a=int(input())
n=list(range(1,a+1))
m=n
o=n
count=0
for i in n:
  for j in m:
    for q in o:
        u=i,j,q
        count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
a=list(input())
b=list(input())
print(len(list(set(a)a&set(b))))


Fixed submission:
a=list(input())
b=list(input())
c=0
for i in range(3):
  if a[i]==b[i]:
    c+=1
print(c)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split()))
print(b/a)

Fixed submission:
import math
from functools import reduce
def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)
a=int(input())
b=list(map(int,input().split()))
n=lcm_list(b)
m=0
for i in b:
    m+=n//i
print(n/m)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=[a+b,a*b,a-b]
n.sorted()
print(n[-1])

Fixed submission:
a,b=map(int,input().split())
n=[a+b,a*b,a-b]
n.sort()
print(n[-1])
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print(' '.join(list(range(b-(a-1),b+(a+1)))))

Fixed submission:
a,b=map(int,input().split())
c=list(range(b-(a-1),b+(a-1)+1))
d=' '.join(map(str,c))
print(d)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=0
for i in range(1,a+1):
  if len(i)%2==1:
    b+=1
print(b)

Fixed submission:
a=int(input())
b=0
for i in range(1,a+1):
  if len(str(i))%2==1:
    b+=1
print(b)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split()))
c=b.sorted()
d=0
for i in range(a):
  b[i]!=b[i]
  d+=1
if d<=2:
  print('YES')
else:
  print('NO')

Fixed submission:
a=int(input())
b=list(map(int,input().split()))
c=sorted(b)
d=0
for i in range(a):
  if b[i]!=c[i]:
    d+=1
if d<=2:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
c=[]
for i in range(a,b+1):
  for j in range(a,b+1):
    if i<j:
        c.append((i*j)%2019)
print(min(set(c)))


Fixed submission:
a,b=map(int,input().split())
if b-a>=2019:
    print(0)
    exit()
d=[]
for i in range(a,b+1):
    if i%2019==0:
        print(0)
        exit()
    for j in range(a,b+1):
        if i<j:
            d.append((i*j)%2019)
print(min(d))

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
c=[]
for i in range(a,b+1):
  for j in range(i):
    d=(i*j)%2019
    c.append(d)
print(min(d))


Fixed submission:
a,b=map(int,input().split())
if b-a>=2019:
    print(0)
    exit()
d=[]
for i in range(a,b+1):
    if i%2019==0:
        print(0)
        exit()
    for j in range(a,b+1):
        if i<j:
            d.append((i*j)%2019)
print(min(d))
Buggy python submission (verdict: Runtime Error):
a=list(input())
b=[]
for i in range(3):
  if a[i]==a[i+1]:
      b.append(0)
  else:
      b.append(1)
if b in 0:
    print('Bad')
else:
    print('Good')




Fixed submission:
a=list(input())
if a[0]==a[1] or a[1]==a[2] or a[2]==a[3]:
  print('Bad')
else:
  print('Good')
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input(),.split())
n=[a,b,c]
d=[]
for i in range(1,len(n)):
  d.append(n[i]+n[i])
print(min(d))

Fixed submission:
a,b,c=map(int,input().split())
n=sorted([a,b,c])
print(n[0]+n[1])
Buggy python submission (verdict: Time Limit Exceeded):
import collections
a,b=map(int,input().split())
c=input()
d=[]
for _ in range(b):
    n,m=map(int,input().split())
    d.append([n,m])
n=len(d)

for i in range(n):
    r=c[d[i][0]-1:d[i][1]]
    print(r.count('AC'))

Fixed submission:
from re import finditer
from bisect import bisect_left
from bisect import bisect_right
a,b=map(int,input().split())
c=input()
d=[]
for _ in range(b):
    n,m=map(int,input().split())
    d.append([n-1,m-1])
n=len(d)
ac1=[m.start() for m in finditer('AC', c)]
ac2=[m.end()-1 for m in finditer('AC', c)]
for i in range(n):
    index1=bisect_left(ac1,d[i][0])
    index2=bisect_right(ac2,d[i][1])
    print(index2-index1)
Buggy python submission (verdict: Runtime Error):
a=[input() for i in range(4)]
for i in a:
  if i=='+':
    i=1
  else:
    i=-1
print(sum(a))

Fixed submission:
a=list(input())
c=[]
for i in a:
  if i=='+':
    i=1
    c.append(i)
  else:
    i=-1
    c.append(i)
print(sum(c))
Buggy python submission (verdict: Runtime Error):
a=input()
b=int(a)
c=list(a)
if b%(sum(c))==0:
  print('Yes')
else:
  print('No')

Fixed submission:
a=input()
b=int(a)
c=list(a)
c=[int(i) for i in c]
if b%(sum(c))==0:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a=int(input())
result=[]
for i in range(1,a+1):
    for j in range(2,a+1):
        if j>=10:
            continue
        if i**j<=a:
            result.append(i**j)
print(max(result))

Fixed submission:
a=int(input())
result=[]
for i in range(1,a+1):
    for j in range(2,a+1):
        if j>=10:
            continue
        if i**j<=a:
            result.append(i**j)
result.append(1)
print(max(result))
Buggy python submission (verdict: Runtime Error):
a=list(input())
b=[a,b,c]
if sort(a)==b:
  print('Yes')
else:
  print('No')


Fixed submission:
a=input()
if len(set(a))==3:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
a=list(input())
if sort(a)==[a,b,c]:
  print('Yes')
else:
  print('No')


Fixed submission:
a=input()
if len(set(a))==3:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a,b=map(str,input().split())
n=int(a+b)
for i in range(0,110):
  if i**2==n:
    print('Yes')
	exit()
print('No')
  

Fixed submission:
a,b=map(str,input().split())
n=int(a+b)
for i in range(0,1000):
    if i**2==n:
        print('Yes')
        exit()
print('No')

Buggy python submission (verdict: Runtime Error):
a,b=map(str,input().split())
n=int(a+b)
for i in range(0,110):
  if i**2==a:
    print('Yes')
   	exit()
print('No')
  

Fixed submission:
a,b=map(str,input().split())
n=int(a+b)
for i in range(0,1000):
    if i**2==n:
        print('Yes')
        exit()
print('No')
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,inpput().split('/'))
a=2018
print(a,'/',b,'/',c)


Fixed submission:
a,b,c=map(str,input().split('/'))
a='2018'
print(a,b,c,sep='/')
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input())
if a+b>c+d:
  print('Right')
elif (a+b)==(c+d):
  print('Balanced')
else:
  print('Left')
 

Fixed submission:
a,b,c,d=map(int,input().split())
if a+b>c+d:
  print('Left')
elif (a+b)==(c+d):
  print('Balanced')
else:
  print('Right')
Buggy python submission (verdict: Runtime Error):
a=list(input())
print(a.index(1))

Fixed submission:
a=input()
print(a.count('1'))
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())

for i in range(2**3):
  e=['+','+','+']
  for j in range(len(e)):
    if (i<<j)&1:
      e[j]='-'
  if eval(a+ls[0]+b+ls[1]+c+ls[2]+d) == 7:
    print(a+ls[0]+b+ls[1]+c+ls[2]+d+"=7")
	break

Fixed submission:
a,b,c,d = input()
for i in range(2**3):
    ls = ["+","+","+"]
    for j in range(len(ls)):
        if (i >> j) & 1:
            ls[j] = "-"
    if eval(a+ls[0]+b+ls[1]+c+ls[2]+d) == 7:
        print(a+ls[0]+b+ls[1]+c+ls[2]+d+"=7")
        break
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>b:
  print('>')
elif a==b:
  print('=')
else:
  print('<')

Fixed submission:
c,d=map(str,input().split())
n=sorted([c,d])
a=n.index(c)
b=n.index(d)
if a>b:
  print('>')
elif a==b:
  print('=')
else:
  print('<')

Buggy python submission (verdict: Runtime Error):
n=['A', 'B', 'C', 'D', 'E', 'F']
a,b=map(int,input().split())
c,d=n.index(a),n.index(b)
if c>d:
  print('>')
elif c<d:
  print('<')
else:
  print('=')

Fixed submission:
c,d=map(str,input().split())
n=sorted([c,d])
a=n.index(c)
b=n.index(d)
if a>b:
  print('>')
elif a==b:
  print('=')
else:
  print('<')
Buggy python submission (verdict: Runtime Error):
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
  print('YES')
else:
  print('NO')

Fixed submission:
a=list(input())
b=list(input())

if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
import Collections
a,b,c=map(int,input().split())
n=[a,b,c]
d,e=zip(*n.most_common())
d=list(d)
print(d[-1])

Fixed submission:
a,b,c=map(int,input().split())
if a-b==0:
  print(c)
elif a-c==0:
  print(b)
elif b-c==0:
  print(a)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=[]
for _ in range(a):
  b.append(list(map(int,input().split())))
ans=0
for i in range(a):
  ans+=n[i][1]-n[i][0]+1
print(ans)


Fixed submission:
a=int(input())
b=[]
for _ in range(a):
  b.append(list(map(int,input().split())))
ans=0
for i in range(a):
  ans+=b[i][1]-b[i][0]+1
print(ans)
Buggy python submission (verdict: Runtime Error):
a=input()
n=[]
for i in range(len(a)):
  if i%2==1:
    n.append(i)
ans=''
for i in n:
  ans+=i
print(ans)

Fixed submission:
a=input()
n=[]
for i in range(len(a)):
  if i%2==0:
    n.append(i)
ans=''
for i in n:
  ans=ans+a[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if abs(a-b)<abs(a-c):
  prinnt('A')
else:
  print('B')

Fixed submission:
a,b,c=map(int,input().split())
if abs(a-b)<abs(a-c):
  print('A')
else:
  print('B')
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=[1,3,5,7,8,10,12]
m=[4,6,9,11]
o=[2]
p=[n,m,o]
if count(a)==count(b):
  print('Yes')
else:
  print('No')

Fixed submission:
a,b=map(int,input().split())
n=[1,3,5,7,8,10,12]
m=[4,6,9,11]
o=[2]
p=[n,m,o]
if (a in n and b in n) or (a in m and b in m) or (a in o and b in o):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a,b,c=map(str,input().split())
print(a[0],b[0],c[0],sep='',capitalize())


Fixed submission:
a,b,c=map(str,input().split())
d=str(a[0]+b[0]+c[0])
print(d.upper())
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if b-c==c=b:
  print('YES')
else:
  print('NO')

Fixed submission:
a,b,c=map(int,input().split())
if b-a==c-b:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a==b:
  print('H')
else:
  print('D')

Fixed submission:
a,b=map(str,input().split())
if a==b:
  print('H')
else:
  print('D')
Buggy python submission (verdict: Runtime Error):
    a,b = map(int,input().split())
    if a != 1 and b != 1:
        if a > b :
            print("Alice")
        elif a < b:
            print("Bob")
        else:
            print("Draw")
    elif a == 1 and b != 1:
        print("Alice")
    elif a != 1 and b == 1:
        print("Bob")
    else:
        print("Draw")

Fixed submission:
a,b = map(int,input().split())
if a != 1 and b != 1:
  if a > b :
   	  print("Alice")
  elif a < b:
      print("Bob")
  else:
      print("Draw")
elif a == 1 and b != 1:
      print("Alice")
elif a != 1 and b == 1:
      print("Bob")
else:
      print("Draw")
Buggy python submission (verdict: Runtime Error):
a=input()
print(a.replace(',',' ')

Fixed submission:
a=input()
print(a.replace(',',' '))
Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
ans=0
for i in range(a+1):
    for j in range(a+1):
        for k in range(a+1):
            if i+j+k==b:
                ans+=1
print(ans)

Fixed submission:
a,b=map(int,input().split())
c=0
for i in range(a+1):
  for j in range(a+1):
    z=b-(i+j)
    if 0<=z<=a:
      c+=1
print(c)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
c=0
for i in range(a+1):
  for j in range(a+1):
    z=k-(i+j)
    if 0<=z<=a:
      c+=1
print(c)

Fixed submission:
a,b=map(int,input().split())
c=0
for i in range(a+1):
  for j in range(a+1):
    z=b-(i+j)
    if 0<=z<=a:
      c+=1
print(c)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(str,input().split())
if b=='-':
  print(int(a)-int(c))
else:
  print(int(a)+int(b))

Fixed submission:
a,b,c=map(str,input().split())
if b=='-':
  print(int(a)-int(c))
else:
  print(int(a)+int(c))
Buggy python submission (verdict: Time Limit Exceeded):
a,b,c=map(int,input().split())
ans=0
for i in range(a,b+1):
    if i%c==0:
        ans+=1
print(ans)

Fixed submission:
a,b,c=map(int,input().split())
n=a//c
m=b//c
o=0
if a%c==0:
    o=1
print(m-n+o)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print(len(set(a,b,c)))

Fixed submission:
a,b,c=map(int,input().split())
print(len(set([a,b,c])))

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
n=[a,b,c]
if a!=b!=c:
  print(3)
elif a=b!=c or a!=b=c or b=a!=c:
  print(2)
else:
  print(1)

Fixed submission:
a,b,c=map(int,input().split())
print(len(set([a,b,c])))
Buggy python submission (verdict: Runtime Error):
a,b,c=[int(input()) for i range(3)]
print(((a+b)*c)/2)

Fixed submission:
a,b,c=[int(input()) for i in range(3)]
print(((a+b)*c)//2)
Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
c=1
for i in range(a,b+1):
    if i==0:
        print('Zero')
        exit()
    c*=i

if c>0:
    print('Positive')
else:
    print('Negative')


Fixed submission:
a,b=map(int,input().split())
if a<=0<=b:
    print('Zero')
elif a<0 and b<0:
    n=abs(a-b)+1
    if n%2==0:
        print('Positive')
    else:
        print('Negative')
else:
    print('Positive')

Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
c=1
for i in range(a,b+1):
    c*=i

if c>0:
    print('Positive')
elif c==0:
    print('Zero')
else:
    print('Negative')


Fixed submission:
a,b=map(int,input().split())
if a<=0<=b:
    print('Zero')
elif a<0 and b<0:
    n=abs(a-b)+1
    if n%2==0:
        print('Positive')
    else:
        print('Negative')
else:
    print('Positive')

Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
c=1
for i in range(a,b+1):
    c*=i

if c>0:
    print('Positive')
elif c==0:
    print('Zero')
else:
    print('Negative')


Fixed submission:
a,b=map(int,input().split())
if a<=0<=b:
    print('Zero')
elif a<0 and b<0:
    n=abs(a-b)+1
    if n%2==0:
        print('Positive')
    else:
        print('Negative')
else:
    print('Positive')
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=sorted([input() for i in range(a)])
print(*n,sep='')


Fixed submission:
a,b,c=map(int,input().split())
n=[a,b,c]
m=len([i for i in n if i==5])
p=len([i for i in n if i==7])
if m==2 and p==1:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=sorted([input() for i in range(a)])
print(*s,sep='')


Fixed submission:
a,b=map(int,input().split())
n=sorted([input() for i in range(a)])
print(*n,sep='')

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=sorted([input() for i in range(b)])
print(*s,sep='')


Fixed submission:
a,b=map(int,input().split())
n=sorted([input() for i in range(a)])
print(*n,sep='')

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=list([input() for i in range(b)])
for i in n:
    p=sorted(n)
    q=''.join(p)
print(q)

Fixed submission:
a,b=map(int,input().split())
n=sorted([input() for i in range(a)])
print(*n,sep='')

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=list([str(input()) for i in range(b)])
for i in n:
    p=sorted(n)
    q=''.join(p)
print(q)

Fixed submission:
a,b=map(int,input().split())
n=sorted([input() for i in range(a)])
print(*n,sep='')

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n=list([str(input()) for i in range(b)])
p=sorted(n)
q=''.join(p)
print(q)

Fixed submission:
a,b=map(int,input().split())
n=sorted([input() for i in range(a)])
print(*n,sep='')
Buggy python submission (verdict: Runtime Error):
d, t, s = map(int,input())
print('Yes' if t*s >=d else 'No')

Fixed submission:
d, t, s = map(int,input().split())
print('Yes' if t*s >=d else 'No')
Buggy python submission (verdict: Runtime Error):
s, t = input(), input()

ls = len(s)
lt= len(t)
print(ls,lt)
is_double = False

for i in range(0,lt):
  size = lt-i
  for j in range(0,lt-size+1):
    jps = (j+size)
    # 0 j (j+size) lt
    _t = t[j:jps]
    print(i,j,size,_t, f'\t{s[j:ls-(lt-(j+size))]}')
    if _t in s[j:ls-(lt-(j+size))]:
      is_double = True
      break
  if is_double:
    print(i)
    break

if not is_double:
  print(lt)



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

ls = len(s)
lt= len(t)
is_double = False
c = len(s)
for i in range(ls-lt+1):
  _c = 0 
  for j in range(lt):
    if not s[i+j] == t[j]:
      _c +=1
  if c > _c:
    c = _c
    
print(c)

Buggy python submission (verdict: Runtime Error):
s, t = input(), input()

lt= len(t)
for i in range(lt):
  is_double = True
  size = lt-i
  for j in range(0,i+1):
    _t = t[j:j+size]
    print(i,j,size,_t)
    if _t in s:
      is_double = False
      break
  if not is_double:
    print(lt-1)
    break
    

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

ls = len(s)
lt= len(t)
is_double = False
c = len(s)
for i in range(ls-lt+1):
  _c = 0 
  for j in range(lt):
    if not s[i+j] == t[j]:
      _c +=1
  if c > _c:
    c = _c
    
print(c)
Buggy python submission (verdict: Runtime Error):
# 入力
R, C, K = map(int, input().split())
point_map = [[0 for _ in range(C+1)] for _ in range(R+1)]
max_point = [[[0 for _ in range(4)] for _ in range(C + 1)]
             for _ in range(R + 1)]
maxmax_point = [[0 for _ in range(C + 1)] for _ in range(R + 1)]


for i in range(K):
    _r, _c, _k = map(int, input().split())
    point_map[_r][_c] = _k

for i in range(1, R+1):
    itemss = [[]]
    im = i-1
    for j in range(1, C + 1):
        jm = j - 1
        mxi = max_point[i]
        mxij = mxi[j]
        mxijm = mxi[jm]
        point = point_map[i][j]
        mxij[0] = max(
            mxijm[0], maxmax_point[im][j])
        if point == 0:
            mxij[1] = mxijm[1]
            mxij[2] = mxijm[2]
            mxij[3] = mxijm[3]
        else:
            itemss = [[]] + [items + [point]
                             for items in itemss]  # items[1] アイテム一つ
            itemss_len = len(itemss)
            #print(i, j, itemss)

            mxij[1] = max(
                mxijm[0] + point, maxmax_point[i - 1][j]+point)
            mxij[2] = mxijm[1] + point

            if itemss_len > 4:
                items = itemss[4]  # 4 こアイテムがあるやつ
                del_item = min(items)
                items.remove(del_item)
                sa = mxijm[3] - del_item
                #print("aaaaa", sa, mxijm[2])
                if sa > mxijm[2]:
                    mxij[3] = sa + point
                    itemss = itemss[:3] + [items]
                else:
                    mxij[3] = mxijm[2] + point
                    itemss = itemss[:4]
            else:
                mxij[3] = mxijm[2] + point

            #print(i, j, itemss)

        #[print(i, j, n, mxij[n])
        # for n in range(len(mxij))]
        maxmax_point[i][j] = max(mxij)
        #print(i, j, maxmax_point[i][j])

print(maxmax_point[R][C])


Fixed submission:
ss = input().split('S')
m = 0
for li in ss:
  m = max(m,len(li))
  
print(m)
Buggy python submission (verdict: Runtime Error):
l = map(int, input().split())
for i in range(5):
  if not i+1 == l[i]:
    print(i+1)
  

Fixed submission:
l = list(map(int, input().split()))
for i in range(5):
  if not i+1 == l[i]:
    print(i+1)
Buggy python submission (verdict: Runtime Error):
import math

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

f = math.floor
min8, max8 = f(a*12.5), f((a+1)*12.5)
min10, max10 = f(b*10), f((b+1)*10)

l8, l10 = list(range(min8, max8)), list(range(min10, max10))
s8, s10 = set(l8), set(l10)

ss = s8 & s10
print(min(ss))

Fixed submission:
import math

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

c = math.ceil
min8, max8 = c(a*12.5), c((a+1)*12.5)
min10, max10 = c(b*10), c((b+1)*10)

l8, l10 = list(range(min8, max8)), list(range(min10, max10))
s8, s10 = set(l8), set(l10)

ss = s8 & s10
#print(min8, max8, min10, max10)
print(min(ss) if len(ss) >0 else -1)
#print(238*0.08)
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(input().split())
print(max(A)-min(A))

Fixed submission:
n = int(input())
A = [int(m) for m in input().split()]
print(max(A)-min(A))
Buggy python submission (verdict: Runtime Error):
s = input()
di = {}
for c in s:
  di[c] = 0
for c in s:
  di[c] +=1
  
is_beautiful = True
for c in s:
  if di[c] %2 ==1:
    is_beautiful = False

print('Yes' is is_beautiful else 'No')

Fixed submission:
s = input()
di = {}
for c in s:
  di[c] = 0
for c in s:
  di[c] +=1
  
is_beautiful = True
for c in s:
  if di[c] %2 ==1:
    is_beautiful = False

print('Yes' if is_beautiful else 'No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = [int(m) for m in input().split()]
print(max(A)-min(A))

Fixed submission:
s = input()
di = {}
for c in s:
  di[c] = 0
for c in s:
  di[c] +=1
  
is_beautiful = True
for c in s:
  if di[c] %2 ==1:
    is_beautiful = False

print('Yes' if is_beautiful else 'No')
Buggy python submission (verdict: Runtime Error):
a = input()
print a*(a+1)/2


Fixed submission:
a = input()
print a*(a+1)/2
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = input()

hash = {}
for bit in range(1 << n):
    red, blue = "", ""
    for i in range(n):
        if (bit & (1 << i)) > 0:
            red += s[i]
        else:
            blue += s[i]
    hash[(red, blue)] = hash.get((red, blue), 0)+1

t = s[n:][::-1]
cnt = 0
for bit in range(1 << n):
    red, blue = "", ""
    for i in range(n):
        if (bit & (1 << i)) > 0:
            red += t[i]
        else:
            blue += t[i]
    cnt += hash.get((blue, red), 0)

print(cnt)


Fixed submission:
n = int(input())
s = input()

hash = {}
for bit in range(1 << n):
    red, blue = "", ""
    for i in range(n):
        if (bit & (1 << i)) > 0:
            red += s[i]
        else:
            blue += s[i]
    hash[(red, blue)] = hash.get((red, blue), 0)+1

t = s[n:][::-1]
cnt = 0
for bit in range(1 << n):
    red, blue = "", ""
    for i in range(n):
        if (bit & (1 << i)) > 0:
            red += t[i]
        else:
            blue += t[i]
    cnt += hash.get((blue, red), 0)

print(cnt)