Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
W,H,x,y = map(int,input().split())
print(W*H*0.5, int(x=W*0.5 and y=H*0.5))

Fixed submission:
W,H,x,y = map(int,input().split())
print(W*H*0.5, int(x==W*0.5 and y==H*0.5))

Buggy python submission (verdict: Runtime Error):
W,H,x,y = map(int,input().split())
print(W*H*0.5, end="")
if x=W*0.5 and y=H*0.5:
  print(1)
else:
  print(0)

Fixed submission:
W,H,x,y = map(int,input().split())
print(W*H*0.5, int(x==W*0.5 and y==H*0.5))

Buggy python submission (verdict: Runtime Error):
W,H,x,y = map(int,input().split())
print(W*H*0.5, end="")
print(1 if x=W*0.5 and y=H*0.5: 0)

Fixed submission:
W,H,x,y = map(int,input().split())
print(W*H*0.5, int(x==W*0.5 and y==H*0.5))
Buggy python submission (verdict: Runtime Error):
n = int(input())
mlist = list(map(int,input().split()))
nlist =[]
for i in range(n):
  nlist.append(abs(mlist[:i]-mlist[i:]))
print(min(nlist))

Fixed submission:
n = int(input())
mlist = list(map(int,input().split()))
nlist =[]
for i in range(n):
  nlist.append(abs(sum(mlist[:i])-sum(mlist[i:])))
print(min(nlist))
Buggy python submission (verdict: Runtime Error):
n = input()
x = []
for i in range(n):
  s,p=input().split()
  x.append([s,int(p),i+1])
x.sort(key=lambda x:(x[0],-x[1]))
for i in x:
  print(i[2])

Fixed submission:
n = int(input())
x = []
for i in range(n):
  s,p=input().split()
  x.append([s,int(p),i+1])
x.sort(key=lambda x:(x[0],-x[1]))
for i in x:
  print(i[2])
Buggy python submission (verdict: Runtime Error):
n = input()

counta = 0
countb = 0
if N%2==0:
  for i in range(0,len(n)-2,2):
    if n[i]=="0":
      counta+=1
    elif n[i]=="1":
      countb+=1
  for i in range(1,len(n)-1,2):
    if n[i]=="1":
      counta+=1
    elif n[i]=="0":
      countb+=1
  print(min(counta,countb))

counta = 0
countb = 0
if N%2==1:
  for i in range(0,len(n)-1,2):
    if n[i]=="0":
      counta+=1
    elif n[i]=="1":
      countb+=1
  for i in range(1,len(n)-2,2):
    if n[i]=="1":
      counta+=1
    elif n[i]=="0":
      countb+=1
  print(min(counta,countb))

Fixed submission:
n = input()
s = n[::2].count("0")+n[1::2].count("1")
print(min(s,len(n)-s))
Buggy python submission (verdict: Runtime Error):
sum = 0
r =[]
for i in range(5):
  if a[i] % 10 ==0:
    sum+=a[i]
  elif a[i] % 10 !=0:
    sum+= (10*math.ceil(a[i]/10))
    r.append(int(a[i]%10))
print(sum-10+min(r))

Fixed submission:
import math
a = []
for i in range(5):
    a.append(int(input()))
sum = 0
r =10
for i in range(5):
  if a[i] % 10 ==0:
    sum+=a[i]
  elif a[i] % 10 !=0:
    r = min(r,a[i]%10)
    sum+= (10*math.ceil(a[i]/10))
print(sum-10+r)

Buggy python submission (verdict: Runtime Error):
import math
a = [int(input()) for i in range(5)]
sum = 0
r =[]
for i in range(5):
  if a[i] % 10 ==0:
    sum+=a[i]
  elif a[i] % 10 !=0:
    r.append(a[i]%10)
    sum+= (10*math.ceil(a[i]/10))
print(sum-10+min(r))

Fixed submission:
import math
a = []
for i in range(5):
    a.append(int(input()))
sum = 0
r =10
for i in range(5):
  if a[i] % 10 ==0:
    sum+=a[i]
  elif a[i] % 10 !=0:
    r = min(r,a[i]%10)
    sum+= (10*math.ceil(a[i]/10))
print(sum-10+r)

Buggy python submission (verdict: Runtime Error):
import math
a = [int(input()) for i in range(5)]
sum = 0
r =[]
for i in range(5):
  if a[i] % 10 =0:
    sum+=a[i]
  elif a[i] % 10 !=0:
    r.append(a[i]%10)
    sum+= (math.ceil(a[i]/10)*10)
print(sum-10+min(r))

Fixed submission:
import math
a = []
for i in range(5):
    a.append(int(input()))
sum = 0
r =10
for i in range(5):
  if a[i] % 10 ==0:
    sum+=a[i]
  elif a[i] % 10 !=0:
    r = min(r,a[i]%10)
    sum+= (10*math.ceil(a[i]/10))
print(sum-10+r)
Buggy python submission (verdict: Runtime Error):
n = int(input().split())
x = [int(input()) for i in range(5)]
d = n // min(x)
print(d+5)

Fixed submission:
n = int(input())
x = [int(input()) for i in range(5)]
d = n // min(x)
if n%min(x)==0:
  print(d+4)
else:
  print(d+5)

Buggy python submission (verdict: Runtime Error):
n = int(input().split())
x = [int(intpu()) for i in range(5)]
d = n // min(x)
print(d+5)

Fixed submission:
n = int(input())
x = [int(input()) for i in range(5)]
d = n // min(x)
if n%min(x)==0:
  print(d+4)
else:
  print(d+5)
Buggy python submission (verdict: Runtime Error):
a = input()
print("A" if a = "T" else "T" if a ="A" else "G" if a ="C" else "C")

Fixed submission:
a = input()
print("A" if a =="T" else "T" if a =="A" else "G" if a =="C" else "C")
Buggy python submission (verdict: Runtime Error):
n = input()
count=0
m = 0
for i in n:
  if s =="A" or s == "C" or s == "G" or s== "T" :
    count+=1
  else:
    m =max(m,count)
    count=0
print(m)

Fixed submission:
n = input()
count=0
m = 0
for s in n:
  if s =="A" or s == "C" or s == "G" or s== "T" :
    count+=1
    m =max(m,count)
  else:
    count=0
print(m)
Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
n = input()
for i in range(b):
  s,t=map(int,input().split())
  print(n[s-1:t].count("AC"))

Fixed submission:
a,b=map(int,input().split())
n = input()
m = [0]*a
for i in range(1,a):
  if n[i-1:i+1]=="AC":
    m[i]=m[i-1]+1
  else:
    m[i]=m[i-1]
for j in range(b):
  s,t=map(int,input().split())
  print(m[t-1]-m[s-1])

Buggy python submission (verdict: Time Limit Exceeded):
a,b=map(int,input().split())
n = input()
for i in range(b):
  s,t=map(int,input().split())
  count=0
  for j in range(s-1,t-1):
    if n[j:j+2]=="AC":
      count+=1
  print(count)

Fixed submission:
a,b=map(int,input().split())
n = input()
m = [0]*a
for i in range(1,a):
  if n[i-1:i+1]=="AC":
    m[i]=m[i-1]+1
  else:
    m[i]=m[i-1]
for j in range(b):
  s,t=map(int,input().split())
  print(m[t-1]-m[s-1])

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
n = input()
for i in range(b):
  s,t=input().split()
  count=0
  for j in range(s-1,t-1):
    if n[j:j+2]=="AC":
      count+=1
  print(count)


Fixed submission:
a,b=map(int,input().split())
n = input()
m = [0]*a
for i in range(1,a):
  if n[i-1:i+1]=="AC":
    m[i]=m[i-1]+1
  else:
    m[i]=m[i-1]
for j in range(b):
  s,t=map(int,input().split())
  print(m[t-1]-m[s-1])
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):
  P = C  
  P += B[j]*a[j]
  if P>0:
    count+=1
print(count)

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()))
  P = C  
  for j in range(M):
    P += B[j]*a[j]
  if P>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(int,input().split())
  for j in range(M):
  P = C  
  P += B[j]*a[j]
  if P>0:
    count+=1
print(count)

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()))
  P = C  
  for j in range(M):
    P += B[j]*a[j]
  if P>0:
    count+=1
print(count)

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

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()))
  P = C  
  for j in range(M):
    P += B[j]*a[j]
  if P>0:
    count+=1
print(count)

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

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()))
  P = C  
  for j in range(M):
    P += B[j]*a[j]
  if P>0:
    count+=1
print(count)

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

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()))
  P = C  
  for j in range(M):
    P += B[j]*a[j]
  if P>0:
    count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
N,M,C = map(int,input().split())
B = list(int,input().split())
count = -
for i in range(N):
  a = list(int,input().split())
  for i in range(M)
  if sum(B[i]*a[i])+C=0:
    count+=1
print(count)

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()))
  P = C  
  for j in range(M):
    P += B[j]*a[j]
  if P>0:
    count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
s = input()
if s <= 2019/04/30:
  print("Heisei")
else:
  print("TBD")

Fixed submission:
s = input()
if s <= "2019/04/30":
  print("Heisei")
else:
  print("TBD")
Buggy python submission (verdict: Runtime Error):
n = int(input())
sum =0
for j in range(n):
  i,c = input().split()
  if c =="BTC":
    sum+=float(i)*380000
  else:
    sum+=i
print(sum)

Fixed submission:
n = int(input())
sum =0
for j in range(n):
  i,c = input().split()
  if c =="BTC":
    sum+=float(i)*380000
  else:
    sum+=int(i)
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
sum =0
for j in range(n):
  i,c = input().split()
  if c =="JPY":
    sum+=i
  else:
    sum+=float(i)*380000
print(sum)

Fixed submission:
n = int(input())
sum =0
for j in range(n):
  i,c = input().split()
  if c =="BTC":
    sum+=float(i)*380000
  else:
    sum+=int(i)
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
sum =0
for j in range(n):
  i,c = input().split()
  if c =="JPY":
    sum+=i
  else:
    sum+=i*380000
print(sum)

Fixed submission:
n = int(input())
sum =0
for j in range(n):
  i,c = input().split()
  if c =="BTC":
    sum+=float(i)*380000
  else:
    sum+=int(i)
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
l = [input().split() for i,c in range(n)]
sum =0
for i,c in l:
  if c =="JPY":
    sum+=i
  else:
    sum+=i*380000
print(sum)

Fixed submission:
n = int(input())
sum =0
for j in range(n):
  i,c = input().split()
  if c =="BTC":
    sum+=float(i)*380000
  else:
    sum+=int(i)
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
l = [list(input().split()) for i,c in range(n)]
sum =0
for i,c in l:
  if c =="JPY":
    sum+=i
  else:
    sum+=i*380000
print(sum)
  

Fixed submission:
n = int(input())
sum =0
for j in range(n):
  i,c = input().split()
  if c =="BTC":
    sum+=float(i)*380000
  else:
    sum+=int(i)
print(sum)
Buggy python submission (verdict: Runtime Error):
N,P = map(int,input().split())
List=[]
for i in range(N):
    List+=list(map(int,input().split()))
count = 0
for i in range(P+1):
  if List.count(List[i])=N:
    count +=1
print(count)

Fixed submission:
N,M = map(int,input().split())
foods = [0]*(M+1)
for i in range(N):
  line = list(map(int,input().split()))
  for j in range(1,line[0]+1):
    foods[line[j]]+=1
print(foods.count(N))
Buggy python submission (verdict: Runtime Error):
n = int(input())
xlist = list(map(int,input().split()))
a = xlist[0]
for i in range(1,n):
  a = fractions.gcd(a,xlist[i])
print(a)

Fixed submission:
from functools import reduce
from math import gcd
n = int(input())
xlist = list(map(int,input().split()))
print(reduce(gcd, xlist))
Buggy python submission (verdict: Runtime Error):
s=int(input())
G =[s]
while all(G[i]!=G[-1] for i in range(len(G)-1)):
  if G[-1] % 2==0:
    G.append(int(x/2))
  else:
    G.append(int(3*x+1))
print(len(G))

Fixed submission:
s=int(input())
G =[]
while (s not in G):
  G.append(s)
  if s % 2==0:
    s = int(s//2)
  else:
    s = int(3*s+1)
print(len(G)+1)
Buggy python submission (verdict: Runtime Error):
print("Chistmas"+" Eve"+(25-int(input())))

Fixed submission:
print("Christmas"+" Eve"*(25-int(input())))

Buggy python submission (verdict: Runtime Error):
print("Chistmas"+" Eve"+(25-input()))

Fixed submission:
print("Christmas"+" Eve"*(25-int(input())))
Buggy python submission (verdict: Runtime Error):
n=int(input())
k = [int(input()) for i in range(n)]
print(int((sum(k)-max(k)//2))

Fixed submission:
n=int(input())
k = [int(input()) for i in range(n)]
print(sum(k)-max(k)//2)
Buggy python submission (verdict: Runtime Error):
s = input()
a = []
for i in range(len(str(s))-2):
  a.extend(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Buggy python submission (verdict: Runtime Error):
s = input()
a = []
for i in range(len(str(s))-2):
  a.extend(abs(inst(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Buggy python submission (verdict: Runtime Error):
s = input()
a = []
for i in range(len(str(s))-2):
  a.extend(abs(s[i]*100+s[i+1]*10+s[i+2]-753))
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Buggy python submission (verdict: Runtime Error):
s = input()
a = []
for i in range(len(str(s))-2):
  a.append(abs(s[i]*100+s[i+1]*10+s[i+2]-753))
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Buggy python submission (verdict: Runtime Error):
s = input()
a = []
for i in range(len(str(s))-2):
  a.append(int(abs(s[i]*100+s[i+1]*10+s[i+2]-753)))
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Buggy python submission (verdict: Runtime Error):
s = input()
a = []
for i in range(len(s)-2):
  a.append(int(abs(s[i]*100+s[i+1]*10+s[i+2]-753)))
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Buggy python submission (verdict: Runtime Error):
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(s[i]*100+s[i+1]*10+s[i+2]-753))
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Buggy python submission (verdict: Runtime Error):
s = input()
a = [0]*(len(s)-2)
for i in range(len(s)-2):
  a[i]==abs(s[i]*100+s[i+1]*10+s[i+2]-753)
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))

Buggy python submission (verdict: Runtime Error):
s = input()
a = [0]*(len(s)-2)
for i in range(len(s)-2):
  a[i]==abs(a[i]*100+a[i+1]*10+a[i+2]-753)
print(min(a))

Fixed submission:
s = input()
a = []
for i in range(len(s)-2):
  a.append(abs(int(s[i])*100+int(s[i+1])*10+int(s[i+2])-753))
print(min(a))
Buggy python submission (verdict: Runtime Error):
n = input()
from itertools import product
from collectins import Counter
sum = 0
for i in range(len(n)-2):
  for j in list(product("753", repeat=i+3)):
    if int(''.join(j)) <= int(n) and len(Counter(j))==3:
      sum+=1
print(sum)

Fixed submission:
n = input()
from itertools import product
sum = 0
for i in range(len(n)-2):
  for j in list(product("753", repeat=i+3)):
    if int(''.join(j)) <= int(n) and len(set(j))==3:
      sum+=1
print(sum)

Buggy python submission (verdict: Runtime Error):
n = input()
from itertools import product
from collectins import Counter
sum = 0
for i in range(len(n)-2):
  for j in product("753", repeat=i+3):
    if int(''.join(j)) <= int(n) and len(Counter(j))==3:
      sum+=1
print(sum)

Fixed submission:
n = input()
from itertools import product
sum = 0
for i in range(len(n)-2):
  for j in list(product("753", repeat=i+3)):
    if int(''.join(j)) <= int(n) and len(set(j))==3:
      sum+=1
print(sum)
Buggy python submission (verdict: Runtime Error):
n = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
TH = []
for i in n:
  TH.append(abs(T-int(T-0.006*H[i])))
print(TH.index(min(TH))+1)

Fixed submission:
n = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
TH = []
for i in range(n):
  TH.append(abs(A-T+0.006*H[i]))
print(TH.index(min(TH))+1)
Buggy python submission (verdict: Runtime Error):
import collections
import bisect
n,m=map(int,input().split())
p = [map(int,input().splilt()) for i in range(m)]
a=collections.defaultdict(list)
for x,y in sorted(p):
    a[x]+=[y]
for x,y in p:
    z=bisect.bisect(a[x],y)
    print("%06d%06d"%(x,z))

Fixed submission:
import collections
import bisect
n,m=map(int,input().split())
p=[[int(j) for j in input().split()] for i in range(m)]
a=collections.defaultdict(list)
for x,y in sorted(p):
    a[x]+=[y]
for x,y in p:
    z=bisect.bisect(a[x],y)
    print("%06d%06d"%(x,z))

Buggy python submission (verdict: Runtime Error):
import collections
import bisect
n,m=map(int,input().split())
p = [list(map(int,input().splilt())) for i in range(m)]
a=collections.defaultdict(list)
for x,y in sorted(p):
    a[x]+=[y]
for x,y in p:
    z=bisect.bisect(a[x],y)
    print("%06d%06d"%(x,z))

Fixed submission:
import collections
import bisect
n,m=map(int,input().split())
p=[[int(j) for j in input().split()] for i in range(m)]
a=collections.defaultdict(list)
for x,y in sorted(p):
    a[x]+=[y]
for x,y in p:
    z=bisect.bisect(a[x],y)
    print("%06d%06d"%(x,z))

Buggy python submission (verdict: Runtime Error):
import collections
import bisect
n,m = map(int,input().split())
p = [list(map(int,input().splilt())) for i in range(m)]
a = collections.defaultdict(list)
for x,y in sorted(p):
  a[x]+=[y]
for x,y in p:
  z = bisect.bisect(a[x],y)
  print("%06d%06d"%(x,z))

Fixed submission:
import collections
import bisect
n,m=map(int,input().split())
p=[[int(j) for j in input().split()] for i in range(m)]
a=collections.defaultdict(list)
for x,y in sorted(p):
    a[x]+=[y]
for x,y in p:
    z=bisect.bisect(a[x],y)
    print("%06d%06d"%(x,z))

Buggy python submission (verdict: Runtime Error):
import collections
import bisect
n,m = map(int,input().split())
p = [list(map(int,input().splilt())) for i in range(m)]
a = collections.deefaultdict(list)
for x,y in sorted(p):
  a[x]+=[y]
for x,y in p:
  z = bisect.bisect(a[x],y)
  print("%06d%06d"%(x,z))

Fixed submission:
import collections
import bisect
n,m=map(int,input().split())
p=[[int(j) for j in input().split()] for i in range(m)]
a=collections.defaultdict(list)
for x,y in sorted(p):
    a[x]+=[y]
for x,y in p:
    z=bisect.bisect(a[x],y)
    print("%06d%06d"%(x,z))
Buggy python submission (verdict: Runtime Error):
n= int(input())
if n = 1:
  print("Hello World")
  exit()

a = int(input())
b = int(input())
print(a+b)

Fixed submission:
n= int(input())
if n == 1:
  print("Hello World")
  exit()
else:
  a = int(input())
  b = int(input())
  print(a+b)

Buggy python submission (verdict: Runtime Error):
n= int(input())
if n = 1:
  print("Hello World")
  exit()
else:
  a = int(input())
  b = int(input())
  print(a+b)

Fixed submission:
n= int(input())
if n == 1:
  print("Hello World")
  exit()
else:
  a = int(input())
  b = int(input())
  print(a+b)

Buggy python submission (verdict: Runtime Error):
n= int(input())
if n = 1:
  print("Hello World")
elif n = 2:
  a = int(input())
  b = int(input())
  print(a+b)

Fixed submission:
n= int(input())
if n == 1:
  print("Hello World")
  exit()
else:
  a = int(input())
  b = int(input())
  print(a+b)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,inpu().split())
meta = int(a)
for i in range(a):
  x,y = map(int,input().split())
  if b > y and a > x:
    a = x
if meta > a:
  print(a)
else:
  print("TLE")
  

Fixed submission:
N,T = map(int,input().split())
m = 1001
for i in range(N):
  c,t=map(int,input().split())
  if t<=T:
    m = min(m,c)
print("TLE" if m == 1001 else m)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,inpu().split())
x,y = [list(map(int,input().split())) for i in range(a)]
if b < max(y):
  print("TLE")
else:
  for i in range(a):
    if b > y[i] and a > x[i]:
      a = x[i]
  print(a)
    

Fixed submission:
N,T = map(int,input().split())
m = 1001
for i in range(N):
  c,t=map(int,input().split())
  if t<=T:
    m = min(m,c)
print("TLE" if m == 1001 else m)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,inpu().split())
x,y = [list(map(int,input().split())) for i in range(a)]
for i in range(a):
  if b > y[i] and a > x[i]:
    a = x[i]
print(a)

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

Fixed submission:
n = input()
n = n.replace("9","4").replace("1","9").replace("4","1")
print(n)

Buggy python submission (verdict: Runtime Error):
n=input()
print(100*(10-n[0])+10*(10-n[1])+10-n[2])

Fixed submission:
n = input()
n = n.replace("9","4").replace("1","9").replace("4","1")
print(n)