Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
from collections import Counter
c = Counter(input())
if c.most_commons(1)[0][1] >= 3:
  print('YES')
else:
  print('NO')
  

Fixed submission:
s = input().rstrip()
if all((s[0] == i for i in s[:-1])) or all((s[1] == i for i in s[1:])):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

a = sorted(list(map(int, input().split())))
b = sorted(list(map(int, input().split())))
c = sorted(list(map(int, input().split())))

sum = 0
for i in range(n):
    bs = [bi for bi in b if a[i] < bi]
    if len(bs) == 0:
        continue
    for j in range(len(bs)):
        cs = [ci for ci in c if bs[j] < ci]
        sum += len(cs)

print(sum)



Fixed submission:
import bisect

n = int(input())

a = sorted(list(map(int, input().split())))
b = sorted(list(map(int, input().split())))
c = sorted(list(map(int, input().split())))

sum = 0
for i in range(len(b)):
    ai = bisect.bisect_left(a, b[i])
    ci = bisect.bisect_right(c, b[i])
    sum += ai * (n - ci)

print(sum)
Buggy python submission (verdict: Runtime Error):
a, b, c = int(input().split())
print(sum((a,b,c)) - max(a, b, c))

Fixed submission:
a, b, c = map(int, input().split())
print(sum((a,b,c)) - max(a, b, c))

Buggy python submission (verdict: Runtime Error):
a, b, c = int(input().split())
print(sum(a,b,c) - max(a, b, c))


Fixed submission:
a, b, c = map(int, input().split())
print(sum((a,b,c)) - max(a, b, c))
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
r = [0] * n
for _ in range(m):
  a, b = map(int, input().split())
  r[a] += 1
  r[b] += 1
for i in range(n):
  print(r[i])


Fixed submission:
n, m = map(int, input().split())
r = [0] * n
for _ in range(m):
  a, b = map(int, input().split())
  r[a - 1] += 1
  r[b - 1] += 1
for i in range(n):
  print(r[i])
Buggy python submission (verdict: Time Limit Exceeded):
from bisect import insort
n, k = map(int, input().split())
array = []

for _ in range(n):
    a, b = map(int, input().split())
    insort(array, (a, b))

for a, b in array:
    k -= b
    if k <= 0:
        break

print(a)


Fixed submission:
from collections import Counter

n, k = map(int, input().split())
counter = Counter()
for _ in range(n):
    a, b = map(int, input().split())
    counter[a] += b

for key in sorted(counter.keys()):
    k -= counter[key]
    if k <= 0:
        break
print(key)
Buggy python submission (verdict: Runtime Error):
o = input().rstrip()
e = input().rstrip()
if len(e) < len(o):
  e.append('')

ans = ''
for l1, l2 in zip(o, e):
  ans = ''.join([ans, l1, l2])

print(ans)

Fixed submission:
o = input().rstrip()
e = input().rstrip()
 
ans = ''
for l1, l2 in zip(o, e):
  ans = ''.join([ans, l1, l2])
 
if len(o) > len(e):
  ans += o[-1]
 
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
x = int(input())
que = deque()
count = 0

que.append((count, 0, 0, 0))

while len(que) > 0:
    depth, v1, v2, v3 = que.popleft()
    if any([val == x for val in (v1, v2, v3)]):
        break
    depth += 1
    for v in (v1, v2, v3):
        que.append((depth, v - depth, v, v + depth))

print(depth)


Fixed submission:
x = int(input())

t = 0
s = 0
while s < x:
    t += 1
    s += t
print(t)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input())
if a == 1:
  a = 14
if b == 1:
  b = 14
if a > b:
  print('Alice')
elif a == b:
  print('Draw')
else:
  print('Bob')

Fixed submission:
a, b = map(int, input().split())
if a == 1:
  a = 14
if b == 1:
  b = 14
if a > b:
  print('Alice')
elif a == b:
  print('Draw')
else:
  print('Bob')

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input())
if a == 1:
  a == 14
if b == 1:
  b == 14
if a > b:
  print('Alice')
elif a == b:
  print('Draw')
else:
  print('Bob')

Fixed submission:
a, b = map(int, input().split())
if a == 1:
  a = 14
if b == 1:
  b = 14
if a > b:
  print('Alice')
elif a == b:
  print('Draw')
else:
  print('Bob')
Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input())
print(max(a * b, c * d))

Fixed submission:
a, b, c, d = map(int, input().split())
print(max(a * b, c * d))
Buggy python submission (verdict: Runtime Error):
s = input().split()
if s in "aeiou":
  print('vowel')
else:
  print('consonant')
  

Fixed submission:
s = input().rstrip()
if s in "aeiou":
  print('vowel')
else:
  print('consonant')
Buggy python submission (verdict: Runtime Error):
s = input()
ans = 'No'
c = s.find('C')
if c != -1:
	f = s[c:].find('F')
    if f != -1:
      ans = 'Yes'
print(ans)

Fixed submission:
s = input()
ans = 'No'
c = s.find('C')
if c != -1:
  f = s[c:].find('F')
  if f != -1:
    ans = 'Yes'
print(ans)

Buggy python submission (verdict: Runtime Error):
s = input()
ans = 'No'
c = s.find('C')
if c != -1:
	f = s.find('F', c)
    if f != -1:
      ans = 'Yes'
print(ans)

 

Fixed submission:
s = input()
ans = 'No'
c = s.find('C')
if c != -1:
  f = s[c:].find('F')
  if f != -1:
    ans = 'Yes'
print(ans)
Buggy python submission (verdict: Runtime Error):
from collections import Counter
abc = input().rstrip()
c = COunter(abc)
if c['5'] == 2 and c['7'] == 1:
  print('YES')
else:
  print('NO')
  

Fixed submission:
from collections import Counter
abc = input().rstrip()
c = Counter(abc)
if c['5'] == 2 and c['7'] == 1:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Time Limit Exceeded):
n,m=(int(i) for i in input().split())
l=[[] for i in range(n+1)]
for i in range(m):
  a,b=(int(i) for i in input().split())
  l[a].append(b)
  l[b].append(a)
queue = []
visited = [] 
visited = [0 for i in range(n+1)]
ans=[None for i in range(n+1)]
queue.append([1,0])
visited[1]=1
while len(queue)>0:
  now=queue.pop(0)
  for i in l[now[0]]:
    if visited[i]==0:
      visited[i]=1
      queue.append([i,now[0]])
  ans[now[0]]=now[1]
print('Yes')
for i in range(n-1):
  print(ans[i+2])

Fixed submission:
n,m=(int(i) for i in input().split())
l=[[] for i in range(n+1)]
for i in range(m):
  a,b=(int(i) for i in input().split())
  l[a].append(b)
  l[b].append(a)
queue = []
visited = [] 
visited = [0 for i in range(n+1)]
ans=[None for i in range(n+1)]
queue.append([1,0])
visited[1]=1
while len(queue)>0:
  now=queue.pop(0)
  for i in l[now[0]]:
    if visited[i]==0:
      visited[i]=1
      queue.append([i,now[0]])
  ans[now[0]]=now[1]
print('Yes')
for i in range(n-1):
  print(ans[i+2])
Buggy python submission (verdict: Runtime Error):
n,k=(int(i) for i in input().split())
r=[0 for i in range(n)]
l=[int(i) for i in input().split()]
wazap=[]
count=1
saver=None
temp=0
while r[temp]==0:
  r[temp]=count
  wazap.append(temp)
  temp=l[temp]-1
start=wazap[-1]
for i in range(len(wazap)):
  if wazap[i]==start-1:
    left=i
    break
loop=len(wazap)-left
if k<left:
  print(wazap[k]+1)
else:
  print(wazap[(k-left)%loop+left]+1)

Fixed submission:
n,k=(int(i) for i in input().split())
r=[0 for i in range(n)]
l=[int(i) for i in input().split()]
wazap=[]
count=1
saver=None
temp=0
while r[temp]==0:
  r[temp]=count
  wazap.append(temp)
  temp=l[temp]-1
start=l[wazap[-1]]
left=None
for i in range(len(wazap)):
  if wazap[i]==start-1:
    left=i
    break
loop=len(wazap)-left
if k<left:
  print(wazap[k]+1)
else:
  print(wazap[(k-left)%loop+left]+1)
Buggy python submission (verdict: Runtime Error):
n,m,k=(int(i) for i in input().split())
l=[0 for i in range(k+2)]
l[k]=m
for i in range(n-1):
  r=[]
  for j in range(k+1):
    r.append(l[j]*(m-1)+l[j+1])
  r.append(0)
  l=r
print(sum(r)%998244353)

Fixed submission:
n,m,k=(int(i) for i in input().split())
mod = 998244353
fac=[1]
inv=[]
for i in range(n-1):
  fac.append(fac[-1]*(i+2)%mod)
for i in range(n):
  inv.append(pow(fac[i],mod-2,mod))
def modcom(n,k,fac,inv):
  if k>n or k<0:
    return 0
  elif k==n or k==0:
    return 1
  else:
    return((fac[n-1]*inv[k-1]*inv[n-k-1])%mod)
r=0
for i in range(0,k+1):
  r+=(m%mod)*pow(m-1,n-1-i,mod)*modcom(n-1,i,fac,inv)
print(r%mod)
Buggy python submission (verdict: Runtime Error):
import math
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors
x=int(input())
l=make_divisors(x)
if x==0:
  answer=[0,0]
for i in range(math.ceil(pow(x,0.2))):
  for j in l:
    if pow(i,5)-pow(i-j,5)==x:
      answer=[i,i-j]
      break
print(answer[0],answer[1])

Fixed submission:
import math
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors
x=int(input())
l=make_divisors(x)
if x==0:
  answer=[0,0]
for i in range(math.ceil(2*pow(x,0.2))):
  for j in l:
    if pow(i,5)-pow(i-j,5)==x:
      answer=[i,i-j]
      break
print(answer[0],answer[1])

Buggy python submission (verdict: Runtime Error):
import math
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors
x=int(input())
l=make_divisors(x)
for i in range(math.ceil(pow(x,0.2))):
  for j in l:
    if pow(i,5)-pow(i-j,5)==x:
      answer=[i,i-j]
      break
print(answer[0],answer[1])

Fixed submission:
import math
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors
x=int(input())
l=make_divisors(x)
if x==0:
  answer=[0,0]
for i in range(math.ceil(2*pow(x,0.2))):
  for j in l:
    if pow(i,5)-pow(i-j,5)==x:
      answer=[i,i-j]
      break
print(answer[0],answer[1])
Buggy python submission (verdict: Runtime Error):
n=int(input())
l=[0 for i in range(2*10**5)]
r=[0 for i in range(2*10**5)]
c=1
a=0
if n!=0:
  k=[int(i) for i in input().split()]
for i in range(n):
  if k[i]+c<=2*10**5:
    l[k[i]+c]+=1 
  if -k[i]+c>=0 and -k[i]+c<=2*10**5:
    r[-k[i]+c]+=1
  c+=1
for i in range(n):
  a+=l[i]*r[i]
print(a)

Fixed submission:
n=int(input())
l=[0 for i in range(2*10**5+1)]
r=[0 for i in range(2*10**5+1)]
c=1
a=0
if n!=0:
  k=[int(i) for i in input().split()]
for i in range(n):
  if k[i]+c<=2*10**5:
    l[k[i]+c]+=1 
  if -k[i]+c>=0 and -k[i]+c<=2*10**5:
    r[-k[i]+c]+=1
  c+=1
for i in range(n):
  a+=l[i]*r[i]
print(a)

Buggy python submission (verdict: Runtime Error):
n=int(input())
l=[0 for i in range(2*10**5)]
r=[0 for i in range(2*10**5)]
c=1
a=0
if n!=0:
  k=[int(i) for i in input().split()]
for i in range(n):
  l[k[i]+c]+=1 
  if -k[i]+c>=0 and -k[i]+c<=2*10**5:
    r[-k[i]+c]+=1
  c+=1
for i in range(n):
  a+=l[i]*r[i]
print(a)

Fixed submission:
n=int(input())
l=[0 for i in range(2*10**5+1)]
r=[0 for i in range(2*10**5+1)]
c=1
a=0
if n!=0:
  k=[int(i) for i in input().split()]
for i in range(n):
  if k[i]+c<=2*10**5:
    l[k[i]+c]+=1 
  if -k[i]+c>=0 and -k[i]+c<=2*10**5:
    r[-k[i]+c]+=1
  c+=1
for i in range(n):
  a+=l[i]*r[i]
print(a)

Buggy python submission (verdict: Runtime Error):
n=int(input())
l=[0 for i in range(2*n)]
r=[0 for i in range(2*n)]
c=1
a=0
if n!=0:
  k=[int(i) for i in input().split()]
for i in range(n):
  l[abs(c-k[i])]+=1
  r[c+k[i]]+=1
  c+=1
for i in range(2*n):
  a+=l[i]*r[i]
print(a)

Fixed submission:
n=int(input())
l=[0 for i in range(2*10**5+1)]
r=[0 for i in range(2*10**5+1)]
c=1
a=0
if n!=0:
  k=[int(i) for i in input().split()]
for i in range(n):
  if k[i]+c<=2*10**5:
    l[k[i]+c]+=1 
  if -k[i]+c>=0 and -k[i]+c<=2*10**5:
    r[-k[i]+c]+=1
  c+=1
for i in range(n):
  a+=l[i]*r[i]
print(a)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n,m,q=(int(i) for i in input().split())
l=[]
r=[i+1 for i in range(m)]
point=0
def checker(x,l):
  p=0
  for i in range(len(l)):
    a,b,c,d=(l[i][j] for j in range(4))
    if x[b]-x[a]==c:
      p+=d
  return p
for i in range(q):
  a,b,c,d=(int(i) for i in input().split())
  a-=1
  b-=1
  l.append([a,b,c,d])
for i in itertools.combinations_with_replacement(r,n):
  p=checker(i,l)
  if p>point:
    point=p
print(point)


Fixed submission:
import itertools
n,m,q=(int(i) for i in input().split())
l=[]
r=[i+1 for i in range(m)]
point=0
def checker(x,l):
  p=0
  for i in range(len(l)):
    if x[l[i][1]]-x[l[i][0]]==l[i][2]:
      p+=l[i][3]
  return p
for i in range(q):
  a,b,c,d=(int(i) for i in input().split())
  a-=1
  b-=1
  l.append([a,b,c,d])
for i in itertools.combinations_with_replacement(r,n):
  p=checker(i,l)
  if p>point:
    point=p
print(point)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n,m,q=(int(i) for i in input().split())
l=[]
r=[i+1 for i in range(m)]
g=itertools.combinations_with_replacement(r,n)
point=0
def checker(x,l):
  p=0
  for i in range(len(l)):
    a,b,c,d=(l[i][j] for j in range(4))
    if x[b]-x[a]==c:
      p+=d
  return p
for i in range(q):
  a,b,c,d=(int(i) for i in input().split())
  a-=1
  b-=1
  l.append([a,b,c,d])
for i in g:
  p=checker(i,l)
  if p>point:
    point=p
print(point)


Fixed submission:
import itertools
n,m,q=(int(i) for i in input().split())
l=[]
r=[i+1 for i in range(m)]
point=0
def checker(x,l):
  p=0
  for i in range(len(l)):
    if x[l[i][1]]-x[l[i][0]]==l[i][2]:
      p+=l[i][3]
  return p
for i in range(q):
  a,b,c,d=(int(i) for i in input().split())
  a-=1
  b-=1
  l.append([a,b,c,d])
for i in itertools.combinations_with_replacement(r,n):
  p=checker(i,l)
  if p>point:
    point=p
print(point)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n,m,q=(int(i) for i in input().split())
l=[]
r=[i+1 for i in range(m)]
g=itertools.combinations_with_replacement(r,n)
point=0
def checker(x,l):
  p=0
  for i in range(len(l)):
    a,b,c,d=(l[i][j] for j in range(4))
    if x[b]-x[a]==c:
      p+=d
  return p
def mini(x):
  m=0
  for i in range(len(x)):
    if x[i]!=None:
      if x[i]<m:
        m=x[i]
  return m
def maxe(x):
  m=0
  for i in range(len(x)):
    if x[i]!=None:
      if x[i]>m:
        m=x[i]
  return m
for i in range(q):
  a,b,c,d=(int(i) for i in input().split())
  a-=1
  b-=1
  l.append([a,b,c,d])
l.sort(key=lambda x:x[3])
for i in g:
  p=checker(i,l)
  if p>point:
    point=p
print(point)

Fixed submission:
import itertools
n,m,q=(int(i) for i in input().split())
l=[]
r=[i+1 for i in range(m)]
point=0
def checker(x,l):
  p=0
  for i in range(len(l)):
    if x[l[i][1]]-x[l[i][0]]==l[i][2]:
      p+=l[i][3]
  return p
for i in range(q):
  a,b,c,d=(int(i) for i in input().split())
  a-=1
  b-=1
  l.append([a,b,c,d])
for i in itertools.combinations_with_replacement(r,n):
  p=checker(i,l)
  if p>point:
    point=p
print(point)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
r=0
l=[]
for i in range(n):
  s=input()
  if s not in l:
    r+=1
    l.append(s)
print(r)

Fixed submission:
n=int(input())
r=1
l=[]
for i in range(n):
  l.append(input())
l.sort()
for i in range(n-1):
  if l[i]!=l[i+1]:
    r+=1
  
print(r)
Buggy python submission (verdict: Runtime Error):
import math
print(math.pi()*int(input()))

Fixed submission:
import math
print(math.pi*2*int(input()))
Buggy python submission (verdict: Runtime Error):
n,m=(int(i) for i in input().split())
a=[int(i) for i in input().split()]
s=sum(a)
if n-a>=0:
  print(n-a)
else:
  print(-1)

Fixed submission:
n,m=(int(i) for i in input().split())
a=[int(i) for i in input().split()]
s=sum(a)
if n-s>=0:
  print(n-s)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)
  
k=int(input())
r=0
l=[]

for i in range(k):
  for j in range(k):
    for l in range(k):
      if i<=j and j<=k:
        l.append([i+1,j+1,k+1])
for s in l:
  r+=gcd(s[0],s[1],s[2])
print(r)


Fixed submission:
import math
  
k=int(input())
r=0
ls=[]

for i in range(k):
  for j in range(k):
    a=math.gcd(i+1,j+1)
    for l in range(k):
      r+=math.gcd(a,l+1)
print(r)

Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)
  
k=int(input())
r=0
for i in range(k):
  for j in range(k):
    for l in range(k):
      r+=gcd(i+1,j+1,l+1)
print(r)


Fixed submission:
import math
  
k=int(input())
r=0
ls=[]

for i in range(k):
  for j in range(k):
    a=math.gcd(i+1,j+1)
    for l in range(k):
      r+=math.gcd(a,l+1)
print(r)

Buggy python submission (verdict: Runtime Error):
import math
k=int(input())
r=0
for i in range(k):
  for j in range(k):
    for l in range(k):
      r+=math.gcd(i+1,j+1,l+1)
print(r)

Fixed submission:
import math
  
k=int(input())
r=0
ls=[]

for i in range(k):
  for j in range(k):
    a=math.gcd(i+1,j+1)
    for l in range(k):
      r+=math.gcd(a,l+1)
print(r)
Buggy python submission (verdict: Runtime Error):
n,m=(int(i) for i in input.split())
l=[None,None,None]
answer='unknown'
for i in range(m):
  a,b=(int(i) for i in input().split())
  if l[a-1]==None:
    l[a-1]=b
  elif l[a-1]!=b:
    answer='-1'
    break
for i in range(3):
  if l[i]==None:
    if i!=3-n:
      l[i]=0
    else:
      l[i]=1
r=l[0]*10**2+l[1]*10+l[2]
if len(str(r))!=n:
  answer='-1'
if answer=='-1':
  print('-1')
else:
  print(r)


Fixed submission:
n,m=(int(i) for i in input().split())
l=[None,None,None]
answer='unknown'
for i in range(m):
  a,b=(int(i) for i in input().split())
  if l[n-a]==None:
    l[n-a]=b
  elif l[n-a]!=b:
    answer='-1'
    break
if l[0]==None:
  l[0]=0
for i in range(3):
  if l[i]==None:
    if i!=n-1:
      l[i]=0
    else:
      l[i]=1
r=l[2]*10**2+l[1]*10+l[0]
if len(str(r))!=n:
  answer='-1'
if answer=='-1':
  print('-1')
else:
  print(r)
Buggy python submission (verdict: Runtime Error):
s=input()
a=""
for i i range(len(s)):
  a+="x"
print(a)

Fixed submission:
s=input()
a=""
for i in range(len(s)):
  a+="x"
print(a)
Buggy python submission (verdict: Time Limit Exceeded):
n,m=(int(i) for i in input().split())
a=[0 for i in range(n+m)]
b=[int(i) for i in input().split()]
for i in range(n):
  k=(b[i]+1)/2
  for j in range(m):
    a[i+j]+=k
print(max(a))

Fixed submission:
n,m=(int(i) for i in input().split())
l=[]
for i in input().split():
  l.append((int(i)+1)/2)
s=sum(l[0:m])
maxe=s
for i in range(n-m):
  s+=l[m+i]
  s-=l[i]
  if s>maxe:
    maxe=s
print(maxe)

Buggy python submission (verdict: Runtime Error):
n,m=(int(i) for i in input().split())
a=[0 for i in range(n-m+1)]
for i in input().split():
  a[i:i+m]+=((int(i)+1)/2)
print(max(a))


Fixed submission:
n,m=(int(i) for i in input().split())
l=[]
for i in input().split():
  l.append((int(i)+1)/2)
s=sum(l[0:m])
maxe=s
for i in range(n-m):
  s+=l[m+i]
  s-=l[i]
  if s>maxe:
    maxe=s
print(maxe)

Buggy python submission (verdict: Time Limit Exceeded):
n,m=(int(i) for i in input().split())
a=[]
b=[]
for i in input().split():
  a.append((int(i)+1)/2)
for i in range(n-m+1):
  l=sum(a[i:i+m])
  b.append(l)
print(max(b))

Fixed submission:
n,m=(int(i) for i in input().split())
l=[]
for i in input().split():
  l.append((int(i)+1)/2)
s=sum(l[0:m])
maxe=s
for i in range(n-m):
  s+=l[m+i]
  s-=l[i]
  if s>maxe:
    maxe=s
print(maxe)

Buggy python submission (verdict: Time Limit Exceeded):
n,m=(int(i) for i in input().split())
a=[]
max=0
for i in input().split():
  a.append((int(i)+1)/2)
for i in range(n-m+1):
  l=sum(a[i:i+m])
  if l>max:
    max=l
print(max)

Fixed submission:
n,m=(int(i) for i in input().split())
l=[]
for i in input().split():
  l.append((int(i)+1)/2)
s=sum(l[0:m])
maxe=s
for i in range(n-m):
  s+=l[m+i]
  s-=l[i]
  if s>maxe:
    maxe=s
print(maxe)
Buggy python submission (verdict: Runtime Error):
h,a=int(input().split())
if h//a==h/a:
  prinnt(h//a)
else:
  print(h//a+1)

Fixed submission:
h,a=(int(i) for i in input().split())
if h//a==h/a:
  print(h//a)
else:
  print(h//a+1)
Buggy python submission (verdict: Runtime Error):
h,n = (int(i) for i in input().split())
a=input().split()
if sum(a)>=h:
  print('Yes')
else:
  print('No')

Fixed submission:
h,n = (int(i) for i in input().split())
a=[]
for i in input().split():
  a.append(int(i))
if sum(a)>=h:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n,k=(int(i) for i in input().split())
h=[0 for i in range(k)]
p=0
for i in input().split():
  p+=int(i)
  try:
      if h[0]<int(i):
        h[0]=int(i)
        h.sort()
  except IndexError:
    continue
print(p-sum(h))

Fixed submission:
n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
  h.append(int(i))
h.sort()
if k!=0:
	for i in range(min(n,k)):
 	  h.pop(-1)
print(sum(h))

Buggy python submission (verdict: Runtime Error):
n,k=(int(i) for i in input().split())
h=[0 for i in range(k)]
p=0
for i in input().split():
  p+=int(i)
  try:
      if h[0]<i:
        h[0]=int(i)
        h.sort()
  except IndexError:
    continue
print(p-sum(h))

Fixed submission:
n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
  h.append(int(i))
h.sort()
if k!=0:
	for i in range(min(n,k)):
 	  h.pop(-1)
print(sum(h))

Buggy python submission (verdict: Runtime Error):
n,k=(int(i) for i in input().split())
h=[0 for i in range(k)]
p=0
for i in input().split():
  p+=i
  if h[0]<i:
    h[0]=i
    h.sort()
print(p-sum(h))

Fixed submission:
n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
  h.append(int(i))
h.sort()
if k!=0:
	for i in range(min(n,k)):
 	  h.pop(-1)
print(sum(h))

Buggy python submission (verdict: Runtime Error):
n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
  h.append(int(i))
h.sort()
if k!=0:
	for i in range(k):
 	  h.pop(-1)
print(sum(h))

Fixed submission:
n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
  h.append(int(i))
h.sort()
if k!=0:
	for i in range(min(n,k)):
 	  h.pop(-1)
print(sum(h))

Buggy python submission (verdict: Runtime Error):
n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
  h.append(int(i))
h.sort()
for i in range(k):
  h.pop(-1)
print(sum(h)+k)

Fixed submission:
n,k=(int(i) for i in input().split())
h=[]
for i in input().split():
  h.append(int(i))
h.sort()
if k!=0:
	for i in range(min(n,k)):
 	  h.pop(-1)
print(sum(h))