Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
li=list(map(int,input().split()))
for i in range(1,n+1):
  print(li.count(i))

Fixed submission:
import collections

n= int(input())
li=list(map(int,input().split()))
c=collections.Counter(li)

for i in range(1,n+1):
  print(c[i])

Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
li=list(map(int,input().split()))
ans=[]
for i in range(n):
  print(li.count(i+1))

Fixed submission:
import collections

n= int(input())
li=list(map(int,input().split()))
c=collections.Counter(li)

for i in range(1,n+1):
  print(c[i])

Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
li=list(map(int,input().split()))
ans=[]
for i in range(n):
  print(li.count(i+1))

Fixed submission:
import collections

n= int(input())
li=list(map(int,input().split()))
c=collections.Counter(li)

for i in range(1,n+1):
  print(c[i])

Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
li=list(map(int,input().split()))
ans=[]
for i in range(n):
  ans.append(li.count(i+1))
for i in ans:
  print(i)

Fixed submission:
import collections

n= int(input())
li=list(map(int,input().split()))
c=collections.Counter(li)

for i in range(1,n+1):
  print(c[i])
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
i=0
x=1
while i < x:
  if n > abs(n-k):
    n = abs(n-k)
    x=x+1
  else:
    break  
  i=i+1
print(n)

Fixed submission:
n,k = map(int,input().split())
s = n%k
t= abs(s-k)
if s<t:
  print(s)
else:
  print(t)

Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
for i in range(n):
  if n > abs(n-k):
    n = abs(n-k)
  else:
    break
print(n)

Fixed submission:
n,k = map(int,input().split())
s = n%k
t= abs(s-k)
if s<t:
  print(s)
else:
  print(t)
Buggy python submission (verdict: Runtime Error):
inport math
n=int(input())
print(math.ceil(n/2))

Fixed submission:
import math
n=int(input())
print(math.ceil(n/2))
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a+b+c=>22:
  print("bust")
else:
  print("win")

Fixed submission:
a,b,c=map(int,input().split())
if a+b+c >=22:
  print("bust")
else:
  print("win")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
li=list(input())
ln=[]
for i in range(n-1):
  if li[i]==li[i+1]:
    ln.append(i)
dellist = lambda items, indexes: [item for index, item in enumerate(items) if index not in indexes]
listn=dellist(li,ln)
print(len(listn))

Fixed submission:
n=int(input())
li=list(input())
ln=0
for i in range(n-1):
  if li[i]==li[i+1]:
    ln=ln+1
print(n-ln)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l=list(map(int,input().split()))
la=[]
for i in range(1,n+1):
  la.append(l.index(i)+1)
ans=[str(j) for j in la]
ans=" ".join(ans)
print(ans)

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
la=[0]*n
for i in range(n):
  la[l[i]-1]=i+1
ans=[str(j) for j in la]
ans=" ".join(ans)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
ls=[int(input()) for i in range(n)]
ans=[]
for i in range(n):
  ls2 = ls.copy()
  del ls2[i]
  ans.append(max(ls2))
a='\n'.join(map(str,ans))
print(a)


Fixed submission:
n = int(input())
ls=[int(input()) for i in range(n)]
maxn = max(ls)
ans=[maxn]*n
nma = ls.index(maxn)
ls2=ls.copy()
ls2.remove(maxn) 
maxcel= max(ls2)
del ans[nma]
ans.insert(nma,maxcel)
a='\n'.join(map(str,ans))
print(a)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
ls=[int(input()) for i in range(n)]
ans=[]
for i in range(n):
  ls2 = ls.copy()
  del ls2[i]
  ans.append(max(ls2))
for i in range(n):
  print(ans[i])


Fixed submission:
n = int(input())
ls=[int(input()) for i in range(n)]
maxn = max(ls)
ans=[maxn]*n
nma = ls.index(maxn)
ls2=ls.copy()
ls2.remove(maxn) 
maxcel= max(ls2)
del ans[nma]
ans.insert(nma,maxcel)
a='\n'.join(map(str,ans))
print(a)
Buggy python submission (verdict: Runtime Error):
import functools
import operator

n,m= map(int,input().split())
li=[int(input()) for i in range(m)]
l=len(li)
a=0
b=0
c=[]
for i in range(l):
  b=li[i]-1
  c.append(b-a)
  a=li[i]+1
c.append(n-(li[-1]+1))
c2=[i for i in c if i<0]
if sum(c2)<0:
  print(0)
else:
  def fib(n):
    x,y=1,2
    if n==1 or n==0:
      return x
    elif n==2:
      return y
    else:
      for i in range(n-2):
        x, y = y,x+y
      return y
  ans=list(map(fib,c))

  result = functools.reduce(operator.mul, ans)
  print(result%1000000007)

Fixed submission:
import functools
import operator

n,m= map(int,input().split())
def fib(n):
  x,y=1,2
  if n==1 or n==0:
    return x
  elif n==2:
    return y
  else:
    for i in range(n-2):
      x, y = y,x+y
    return y
if m==0:
  print(fib(n)%1000000007)
else:
  li=[int(input()) for i in range(m)]
  l=len(li)
  a=0
  b=0
  c=[]
  for i in range(l):
    b=li[i]-1
    c.append(b-a)
    a=li[i]+1
  c.append(n-(li[-1]+1))
  c2=[i for i in c if i<0]
  if sum(c2)<0:
    print(0)
  else:
    ans=list(map(fib,c))
    result = functools.reduce(operator.mul, ans)
    print(result%1000000007)
Buggy python submission (verdict: Runtime Error):
n=int(input())
b=[input() for i in range(n)]
m=int(input())
r=[input() for i in range(m)]
ans=[0]
for i in set(b)
    ans.append(b.count(i)-r.count(i))
print(max(ans))

Fixed submission:
import collections

n=int(input())
lb=[input() for i in range(n)]
m=int(input())
lr=[input() for i in range(m)]

for i in range(len(lr)):
    if lr[i] in lb:
        lb.remove(lr[i])
    else:
        pass
if lb==[]:
    ans=0
else:
    s=collections.Counter(lb)
    ans=s.most_common()[0][1]      

print(ans)
Buggy python submission (verdict: Runtime Error):
n=input()
l=sorted(n)
li=list(set(l))
li.sort()
la=[chr(ord('a') + i) for i in range(26)]
ans=""
for i in range(26):
    if li[i]!=la[i]:
        ans=la[i]
        break
    else:
        pass

if ans=="":
  print("None")
else:
  print(ans)

Fixed submission:
n=input()

la=[chr(ord('a') + i) for i in range(26)]
for i in la:
    if i not in n:
      print(i)
      exit()
print("None")
Buggy python submission (verdict: Runtime Error):
x,s=map(int(input().split()))
n=x+1
a=0
for i in range(n):
    for j in range(n):
        if 0<=s-(i+j)<=x:
            a+=1
print(a)

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

Buggy python submission (verdict: Time Limit Exceeded):
x,s=map(int,input().split())
n=x+1
a=0
for i in range(n):
    for j in range(n):
        for k in  range(n):
            if i+j+k==s:
                a+=1
print(a)

Fixed submission:
x,s=map(int,input().split())
n=x+1
a=0
for i in range(n):
    for j in range(n):
        if 0<=(s-(i+j))<=x:
            a+=1
print(a)
Buggy python submission (verdict: Runtime Error):
N=int(N)
S=[input() for i in range(N)]

A=S.count('AC')
B=S.count('WA')
C=S.count('TLE')
D=S.count('RE')

print('AC x',A)
print('WA x',B)
print('TLE x',C)
print('RE x',D)


Fixed submission:
N=int(input())
S=[input() for i in range(N)]

A=S.count('AC')
B=S.count('WA')
C=S.count('TLE')
D=S.count('RE')

print('AC x',A)
print('WA x',B)
print('TLE x',C)
print('RE x',D)

Buggy python submission (verdict: Runtime Error):
N=int(N)
S=[input() for i in range(N)]

A=S.count('AC')
B=S.count('WA')
C=S.count('TLE')
D=S.count('RE')

print('AC x'+ A)
print('WA x'+ B)
print('TLE x'+ C)
print('RE x'+ D)

Fixed submission:
N=int(input())
S=[input() for i in range(N)]

A=S.count('AC')
B=S.count('WA')
C=S.count('TLE')
D=S.count('RE')

print('AC x',A)
print('WA x',B)
print('TLE x',C)
print('RE x',D)
Buggy python submission (verdict: Runtime Error):
s=input()
t=input()
l=len(s)
count=0
if(s==t):
  break
else:
  for i in range(l):
    if(s[i]==t[i]):
      continue
    else:
      count+=1

print(count)

Fixed submission:
s=input()
t=input()
l=len(s)
count=0
if(s==t):
  print(count)
  
else:
  for i in range(l):
    if(s[i]==t[i]):
      continue
    else:
      count+=1

  print(count)

Buggy python submission (verdict: Time Limit Exceeded):
s=input()
t=input()
l=len(s)
count=0
for i in range(l):
  if(s[i]==t[i]):
    continue
  else:
    s.replace(s[i],t[i])
    count+=1

print(count)

Fixed submission:
s=input()
t=input()
l=len(s)
count=0
if(s==t):
  print(count)
  
else:
  for i in range(l):
    if(s[i]==t[i]):
      continue
    else:
      count+=1

  print(count)
Buggy python submission (verdict: Runtime Error):
X,Y=map(int,input.split())

if(Y%2==0 and 2*X<=Y<=4*X):
  print('Yes')
else:
  print('No')


Fixed submission:
X,Y=map(int,input().split())

if(Y%2==0 and 2*X<=Y<=4*X):
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
X,Y=map(int,input.split())

if(Y%2 & 2*X<=Y<=4*X):
  print('Yes')
else:
  print('No')

Fixed submission:
X,Y=map(int,input().split())

if(Y%2==0 and 2*X<=Y<=4*X):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
A,B=input().split()
C=A*B
print(C)

Fixed submission:
A,B=input().split()
C=int(A)*int(B)
print(C)
Buggy python submission (verdict: Runtime Error):
import numpy as np

i=[int(input()) for i in range(3)]
print(i)
if i[0]==i[1]&i[1]!=i[2]:
  print('Yes')
elif i[0]==i[2]&i[1]!=i[2]:
  print('Yes')
elif i[1]==i[2]&i[0]!=i[1]:
  print('Yes')
else:
  print('no')


Fixed submission:
A,B,C=input().split()

if  A==B==C:
    print('No')
elif A!=B and A!=C and B!=C:
    print('No')
else:
    print('Yes')

Buggy python submission (verdict: Runtime Error):
i=[int(input()) for i in range(3)]
print(i)
if i[0]==i[1]&&i[1]!=i[2]:
  print('Yes')
else if i[0]==i[2]&&i[1]!=i[2]:
  print('Yes')
else if i[1]==i[2]&&i[0]!=i[1]:
  print('Yes')
else:
  print('no')
  

Fixed submission:
A,B,C=input().split()

if  A==B==C:
    print('No')
elif A!=B and A!=C and B!=C:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
n = int(input())
num = list(map(int, input().split()))

cnt = 0
for i in range( n // 2 + 1):
    print((2*i + 1))
    if num[2*i] % 2 == 1:
        cnt += 1
print(cnt)

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

cnt = 0
for i in range((n + 1)// 2):
    if num[2*i] % 2 == 1:
        cnt += 1
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
lis = list(map(int, input().split()))
 
for a, b in enumerate(lis):
    if b != min(lis[:a+1]) :
        n -= 1
print(n)

Fixed submission:
n = int(input())
lis = list(map(int, input().split()))
inf = 10 ** 15
ans = 0
for i in lis:
    if i < inf:
        ans += 1
        inf = i
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
lis = list(map(int, input().split()))
 
for i in range(n):
    for j in range(i):
        if lis[i] > lis[j]:
            n -= 1
            break
print(n)

Fixed submission:
n = int(input())
lis = list(map(int, input().split()))
inf = 10 ** 15
ans = 0
for i in lis:
    if i < inf:
        ans += 1
        inf = i
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
lis = list(map(int, input().split()))
cnt = 0

for i in range(n):
    for j in range(i):
        if lis[i] > lis[j]:
            cnt += 1
            break
print(n - cnt)

Fixed submission:
n = int(input())
lis = list(map(int, input().split()))
inf = 10 ** 15
ans = 0
for i in lis:
    if i < inf:
        ans += 1
        inf = i
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
lis = list(map(int, input().split()))
cnt = 0

for a,b in enumerate(lis):
    for i in range(a+1):
        if b > lis[i]:
            cnt += 1
            break
print(n-cnt)

Fixed submission:
n = int(input())
lis = list(map(int, input().split()))
inf = 10 ** 15
ans = 0
for i in lis:
    if i < inf:
        ans += 1
        inf = i
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n,k,q = map(int,input().split())
import numpy as np
p_list = np.zeros(n) +  k

for i in range(q):
    a_i = int(input())
    p_list = p_list-1
    p_list[a_i-1] += 1
    

for i in range(n):
    if p_list[i] <= 0:
        print("No")
    else:
        print("Yes")

Fixed submission:
n,k,q = map(int,input().split())
p_list =[k-q]*n

for i in range(q):
    a_i = int(input())
    p_list[a_i-1] += 1  

for i in range(n):
    if p_list[i] <= 0:
        print("No")
    else:
        print("Yes")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a_lis = list(map(int,input().split()))
b_lis = list(map(int,input().split()))
c_lis = list(map(int,input().split()))

s = 0

for i in range(n):
  if a_lis[i+1] - a_lis[i] == 1:
    s += c_lis[a_lis[i]]
print(sum(b_lis)+s)

Fixed submission:
n = int(input())
a_lis = list(map(int,input().split()))
b_lis = list(map(int,input().split()))
c_lis = list(map(int,input().split()))
 
s = 0
 
for i in range(n-1):
  if a_lis[i+1] - a_lis[i] == 1:
    s += c_lis[a_lis[i]-1]
print(sum(b_lis)+s)
Buggy python submission (verdict: Runtime Error):
from itertools import groupby
n = int(input())
h = list(map(int,input().split()))

h_diff = []
for i in range(len(h)-1):
    h_diff.append(h[i+1] - h[i])
    
result = [sum(item) for val, item in groupby([1 if x > 0 else -1 for x in h_diff])]
print(-min(result))

Fixed submission:
from itertools import groupby
n = int(input())
h = list(map(int,input().split()))

h_diff = []
for i in range(len(h)-1):
    h_diff.append(h[i+1] - h[i])
    
result = [sum(item) for val, item in groupby([1 if x > 0 else -1 for x in h_diff])] + [0]
print(-min(result))
Buggy python submission (verdict: Runtime Error):
n = int(input())
l =[]
inv =[]
s = 0
for i in range(n):
    l.append(int(input()))

for i in l:
    i_inv = 1/i
    s += i_inv
print(1/s)

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
s = 0 
for i in l:
    i_inv = 1/i
    s += i_inv
print(1/s)

Buggy python submission (verdict: Runtime Error):
n = int(input())
l =[]
inv =[]
s = 0
for i in range(n):
    l.append(int(input()))

for i in l:
    i_inv = 1/i
    inv.append(i_inv)

for i in inv:
    s += i
print(1/s)
  

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
s = 0 
for i in l:
    i_inv = 1/i
    s += i_inv
print(1/s)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l =[]
for i in range(n):
    l.append(int(input()))
l = sorted(l)
 
for i in range(n-1):
    ave = (l[0] + l[1])/2
    l[0:2] = []
    l.insert(0,ave)
    
print(l[0])

Fixed submission:
n = int(input())
l =list(map(int,input().split()))
l = sorted(l)
 
for i in range(n-1):
    ave = (l[0] + l[1])/2
    l[0:2] = []
    l.insert(0,ave)
    
print(l[0])

Buggy python submission (verdict: Runtime Error):
n = int(input())
l =[]
for i in range(n):
    l.append(int(input()))
l.sort()

for i in range(n-1):
    ave = (l[0] + l[1])/2
    l[0:2] = []
    l.insert(0,ave)
    
print(l[0])

Fixed submission:
n = int(input())
l =list(map(int,input().split()))
l = sorted(l)
 
for i in range(n-1):
    ave = (l[0] + l[1])/2
    l[0:2] = []
    l.insert(0,ave)
    
print(l[0])
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())
SUM = a+b
SUB = a-b
PRO = a*b
print(max(SUM,SUB,PRO)

Fixed submission:
a,b = map(int, input().split())
SUM = a+b
SUB = a-b
PRO = a*b
print(max(SUM,SUB,PRO))
Buggy python submission (verdict: Runtime Error):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
ans = 0
for i in range(n):
    A = list(map(int,input().split()))
    for j in range(m):
        ans += A[j]*b[j]
    ans = ans + c
    if ans > 0:
        tmp += 1
print(tmp)

Fixed submission:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    ans = 0
    for j in range(m):
        ans += A[j]*b[j]
    ans = ans + c
    if ans > 0:
        count+= 1
print(count)

Buggy python submission (verdict: Runtime Error):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    for j in range(m):
        ans = A[j]*b[j]
        ans = ans+ c
    if ans > 0:
        tmp += 1
print(tmp)

Fixed submission:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    ans = 0
    for j in range(m):
        ans += A[j]*b[j]
    ans = ans + c
    if ans > 0:
        count+= 1
print(count)

Buggy python submission (verdict: Runtime Error):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    for j in range(m):
        ans = A_i[j]*b[j] + c
    if ans > 0:
        tmp += 1
print(tmp)

Fixed submission:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    ans = 0
    for j in range(m):
        ans += A[j]*b[j]
    ans = ans + c
    if ans > 0:
        count+= 1
print(count)

Buggy python submission (verdict: Runtime Error):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    for j in range(len(m)):
        ans = A_i[j]*b[j] + c
    if ans > 0:
        tmp += 1
print(tmp)


Fixed submission:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    ans = 0
    for j in range(m):
        ans += A[j]*b[j]
    ans = ans + c
    if ans > 0:
        count+= 1
print(count)

Buggy python submission (verdict: Runtime Error):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
tmp = 0
for i in range(n):
    A_i = list(map(int,input().split()))
    for _ in range(len(m)):
        ans = A_i[_]*b[_] + c
    if ans >= 0:
        tmp = tmp + 1
print(tmp)

Fixed submission:
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    A = list(map(int,input().split()))
    ans = 0
    for j in range(m):
        ans += A[j]*b[j]
    ans = ans + c
    if ans > 0:
        count+= 1
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
l = list()

for i in range(N):
  n = int(input())
  l.append(n)
  
m = max(l)
SUM = sum(l) - m
 
if m < SUM:
  print('Yes')
else:
  print('No')

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

m = max(l)
SUM = sum(l) - m

if m < SUM:
  print('Yes')
else:
  print('No')

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

for i in range(N):
  n = int(input())
  l.append(n)
 
m = max(l)
SUM = sum(l) - m
 
if m < SUM:
  print("Yes")
else:
  print("No")

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

m = max(l)
SUM = sum(l) - m

if m < SUM:
  print('Yes')
else:
  print('No')

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

for i in range(N):
  n = int(input())
  l.append(n)
 
m = max(l)
SUM = sum(l) - m
 
if m > SUM:
  print("Yes")
else:
  print("No")

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

m = max(l)
SUM = sum(l) - m

if m < SUM:
  print('Yes')
else:
  print('No')

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

for i in range(N):
  n = int(input())
  l.append(n)
 
m = max(l)
SUM = sum(l) - m
 
if m > SUM:
  print("YES")
else:
  print("NO")

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

m = max(l)
SUM = sum(l) - m

if m < SUM:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
l = list[]

for i in N:
  n = int(input())
  l.append(n)

m = l.max()
SUM = l.sum() - m

if m > SUM:
  print("YES")
else:
  print("NO")


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

m = max(l)
SUM = sum(l) - m

if m < SUM:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = [int(input()) for i in range(n)].sort()
print(int(0.5*l[-1] + sum(l[-1])))

Fixed submission:
n = int(input())
l = list()
for i in range(n):
  a = int(input())
  l.append(a)

l.sort()
p = 0.5*l[-1] + sum(l[:-1])
print(int(p))
Buggy python submission (verdict: Runtime Error):
n, T = map(int, input().split())
a = 1001
for i in range(n):
  c, t = map(int, input().split())
  if t < T:
    a = min(a.c)
if a == 1001:
  print("TLE")
else:
  print(a)

Fixed submission:
n, T = map(int, input().split())
a = 1001
for i in range(n):
    c, t = map(int, input().split())
    if t <= T:
        a = min(a,c)
if a == 1001:
    print("TLE")
else:
    print(a)
Buggy python submission (verdict: Runtime Error):
l = map(int,input().split())
l.sort()
print(10*l[0] + l[1] + l[2])

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


Fixed submission:
l= list(map(int, input().split()))
l.sort()
print(l[2] - l[0])
Buggy python submission (verdict: Runtime Error):
n, x = map(int, input().split())
l = []
for i in range(n):
    l.append(int(input())
print(int((x- sum(l)) // min(l)))

Fixed submission:
n,x=map(int,input().split())
l=[int(input()) for _ in range(n)]
print(n+((x-sum(l))//min(l)))
Buggy python submission (verdict: Runtime Error):
n = int(input())
sum = 0
for i in range(n):
  l, r = map(int, input().split())
  sum + = r-l+1
print(sum)

  

Fixed submission:
n = int(input())
sum = 0
for i in range(n):
  l, r = map(int, input().split())
  sum += r-l+1
print(sum)
Buggy python submission (verdict: Runtime Error):
n = input()
if n[0] == n[2]:
  print("Yes)
else:
  print("No")

Fixed submission:
n = input()
if n[0] == n[2]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
 
prod = 1
for i in range(1,n+1):
    prod *= i
    ans = ans%(10**9+7)
print(ans)

Fixed submission:
n=int(input())
ans=1
for i in range(1,n+1):
  ans*=i
  ans%=10**9+7
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
prod = 1
for i in range(1,n+1):
  prod *= i
print(int(prod%(10**9+7)))

Fixed submission:
n=int(input())
ans=1
for i in range(1,n+1):
  ans*=i
  ans%=10**9+7
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
prod = 1
for i in range(1,n+1):
  prod *= i
print(prod%(10**9+7))

Fixed submission:
n=int(input())
ans=1
for i in range(1,n+1):
  ans*=i
  ans%=10**9+7
print(ans)
Buggy python submission (verdict: Runtime Error):
n = input()
s=input()
c,m=0,0
for i in range(n):
    if s[i]=="I":
        c+=1
        m=max(c,m)
    if s[i]=="D":
        c-=1
        m=max(c,m)
print(m)

Fixed submission:
n = int(input())
s = input()
x = 0
l = [0]
for i in range(n):
  if s[i] == "I":
    x += 1
    l.append(x)
  else:
    x -= 1
    l.append(x)
print(max(l))

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
x = 0
l = [0]
for i in range(n):
  if s[i] == "I":
    x += 1
  	l.append(x)
  else:
    x -= 1
    l.append(x)
print(max(l))

Fixed submission:
n = int(input())
s = input()
x = 0
l = [0]
for i in range(n):
  if s[i] == "I":
    x += 1
    l.append(x)
  else:
    x -= 1
    l.append(x)
print(max(l))

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
x = 0
l = [0]
for n in range(n):
  if s[n] == "I":
    x += 1
  	l.append(x)
  else:
    x -= 1
    l.append(x)
print(max(l))

Fixed submission:
n = int(input())
s = input()
x = 0
l = [0]
for i in range(n):
  if s[i] == "I":
    x += 1
    l.append(x)
  else:
    x -= 1
    l.append(x)
print(max(l))