Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
x = input()
l = { 25: "Christmas", 24: "Christmas Eve", 23: "Christmas Eve Eve", 22: "Christmas Eve Eve Eve" }
return l[int(x)]

Fixed submission:
x = input()
l = { 25: "Christmas", 24: "Christmas Eve", 23: "Christmas Eve Eve", 22: "Christmas Eve Eve Eve" }
print(l[int(x)])
Buggy python submission (verdict: Runtime Error):
# At Beginner Contest 042 B (200)
n, l = map(int, input().split())
S = []
for _ in range(n):
    S.append(input())

out = []
min_ = float("inf")
min_idxs = list(range(len(S)))
pos = 0
while S:
    new_min = []
    for i in min_idxs:
        s = S[i]
        ch = ord(s[pos])
        if ch < min_:
            min_ = ord(s[pos])
            new_min = [ i ]
        elif ch == min_:
            new_min.append(i)
    if len(new_min) == 1:
        out.append(S[new_min[0]])
        del S[new_min[0]]
        min_idxs = list(range(len(S)))
        pos = 0
    else:
        pos += 1
        min_idxs = new_min
    min_ = float("inf")

r = "".join(out)
print(r)


Fixed submission:
# At Beginner Contest 042 B (200)
n, l = map(int, input().split())
S = []
for _ in range(n):
    S.append(input())

out = []
min_ = float("inf")
min_idxs = list(range(len(S)))
pos = 0
while S:
    new_min = []
    for i in min_idxs:
        s = S[i]
        ch = ord(s[pos])
        if ch < min_:
            min_ = ord(s[pos])
            new_min = [ i ]
        elif ch == min_:
            new_min.append(i)
    if len(new_min) == 1 or pos == l - 1:
        for i in range(len(new_min)):
            out.append(S[new_min[i]])
        for i in range(len(new_min) - 1, -1, -1):
            del S[new_min[i]]
        min_idxs = list(range(len(S)))
        pos = 0
    else:
        pos += 1
        min_idxs = new_min
    min_ = float("inf")

r = "".join(out)
print(r)
Buggy python submission (verdict: Runtime Error):
# 整数の入力
A = int(input())
cnt = 0
for i in range(1, A):
  for j in range(1, A):
    x = str(i)
    y = str(j)

    first_x = x[0]
    last_x = x[-1]
    first_y = y[0]
    last_y = y[-1]
    
    if(first_x ==  last_y and last_x == first_y):
      cnt = cnt + 1
      continue
      
print(cnt)

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

if(N == M):
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
if(N == M):
  print('YES')
else:
  print('No')

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

if(N == M):
  print('Yes')
else:
  print('No')

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

ans = 0
for i in range(N):
  isOK = True
  for j in range(i):
    if P[i] > P[j]:
      isOK = False
      break
  if isOK:
    ans += 1

print(ans)

Fixed submission:
N, M = map(int, input().split())
if M<N:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
if m<n:
  print("No")
 else:
 	print("Yes")

Fixed submission:
N, M = map(int, input().split())
if M<N:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

ans = 1
for i in range(1,N):
  if min(P[0:i]) >= P[i]:
    ans += 1

print(ans)

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

ans = 1
tempmin = P[0]
for i in range(1,N):
  if tempmin >= P[i]:
    tempmin = P[i]
    ans += 1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

ans = 0
for i in range(N):
  isOK = True
  for j in range(i):
    if P[i] > P[j]:
      isOK = False
      break
  if isOK:
    ans += 1

print(ans)

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

ans = 1
tempmin = P[0]
for i in range(1,N):
  if tempmin >= P[i]:
    tempmin = P[i]
    ans += 1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

ans = 0
for i in range(N):
  isOK = True
  for j in range(i):
    if P[i] > P[j]:
      isOK = False
      break
  if isOK:
    ans += 1

print(ans)

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

ans = 1
tempmin = P[0]
for i in range(1,N):
  if tempmin >= P[i]:
    tempmin = P[i]
    ans += 1

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int (input ())
M = int (input ())

if N == M :
    print ("Yes")
else :
    print ("No")

Fixed submission:
S = input()
S = S.split(" ")
N = S[0]
M = S[1]

if N == M :
    print ("Yes")
else :
    print ("No")

Buggy python submission (verdict: Runtime Error):
if N == M :
    print ("Yes")
else :
    print ("No")

Fixed submission:
S = input()
S = S.split(" ")
N = S[0]
M = S[1]

if N == M :
    print ("Yes")
else :
    print ("No")
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
print("{}{}".format(t,s))

Fixed submission:
s, t = input().split()
print("{}{}".format(t,s))
Buggy python submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
for i in range(k):
  if a > 0:
    a = a - 1
  elif b > 0:
    b = b - 1
  else:
    none
print(a, b)

Fixed submission:
a, b, k = map(int, input().split())
if a >= k:
  print(a-k, b)
elif k-a <= b:
  print(0, b-k+a)
else:
  print(0, 0)
Buggy python submission (verdict: Runtime Error):
N = int(input())
an = list(map(int, input().split()))

if not 1 in an:
  print(-1)

count = 1
for i in an:
  if i == an[i]:
    count += 0
  elif i != an[i]:
    count += 1
print(count) 

Fixed submission:
N = int(input())
an = list(map(int, input().split()))
enable = 0

if not 1 in an:
  enable = 1
  
count = 0
block = 1
for i in range(N):
  if an[i] != block:
    count += 1
  else:
    block += 1
    
if enable == 1:    
  print(-1)
else:
  print(count)
Buggy python submission (verdict: Runtime Error):
N=(input())
A=(input())
B=(input())

a=N*A
b=B
if N*A<=B:
	print(a)
else:
	print(b)

Fixed submission:
N,A,B=(int(i) for i in input().split())

a=N*A
b=B

if a<=b:
  print(a)
else:
  print(b)
Buggy python submission (verdict: Runtime Error):
def execute(key: int, base: str) -> str:
  s = ""
  for i in range(key):
    s += str(base)
  return s

a, b = input().split()
c = [execute(a, b), execute(b, a)]
print(sorted(c)[0])

Fixed submission:
def execute(key: int, base: str) -> str:
  s = ""
  for i in range(key):
    s += str(base)
  return s

a, b = input().split()
c = [execute(int(a), b), execute(int(b), a)]
print(sorted(c)[0])
Buggy python submission (verdict: Runtime Error):
i = map(int, input().split())

if i[0] == i[1]:
  print("Yes")
else:
  print("No")

Fixed submission:
i,j = map(int, input().split())

if i == j:
  print("Yes")
else:
  print("No")

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

if i[0] == i[1]:
  print("Yes")
else:
  print("No")

Fixed submission:
i,j = map(int, input().split())

if i == j:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
i = list(map(int, input().split()))

print(str(np.sort(i)[0]) * np.sort(i)[1])



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

print(str(sorted(i)[0]) * sorted(i)[1])
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
def code(n,p):
    curmin = np.inf
    ans = 0
    for idx in range(1,len(p)+1):
        curmin = np.min(p[:idx])
        if curmin == p[idx-1]:
          ans+=1
    
    return ans

n = int(input())
p = list(map(int, input().split()))

idx = code(n,p)
if idx == None:
    print(n)
else:
    print(idx)


Fixed submission:
n=int(input())
plist = list(map(int,input().split()))
cnt = 0
pmax=plist[0]
for i in range(n):
    if plist[i]<=pmax:
        pmax=plist[i]
        cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
def code(n,p):
    mins = []
    for idx in range(1,len(p)+1):
        mins.append(np.min(p[:idx]))
        
    
    return sum(np.array(mins)==p)

n = int(input())
p = list(map(int, input().split()))

idx = code(n,p)
if idx == None:
    print(n)
else:
    print(idx)


Fixed submission:
n=int(input())
plist = list(map(int,input().split()))
cnt = 0
pmax=plist[0]
for i in range(n):
    if plist[i]<=pmax:
        pmax=plist[i]
        cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
def code(n,p):
    flg = 1

    for idx in range(1,n):
        if min(p[0:idx]) >= p[idx]:
            flg+=1
    return flg

n = int(input())
p = list(map(int, input().split()))

idx = code(n,p)
if idx == None:
    print(n)
else:
    print(idx)


Fixed submission:
n=int(input())
plist = list(map(int,input().split()))
cnt = 0
pmax=plist[0]
for i in range(n):
    if plist[i]<=pmax:
        pmax=plist[i]
        cnt += 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
def code(n,p):
    flg = 1

    for idx in range(1,n):
        if min(p[0:idx]) >= p[idx]:
            flg+=1
            print(p[idx])
    return flg

idx = code(n,p)
if idx == None:
    print(n)
else:
    print(idx)


Fixed submission:
n=int(input())
plist = list(map(int,input().split()))
cnt = 0
pmax=plist[0]
for i in range(n):
    if plist[i]<=pmax:
        pmax=plist[i]
        cnt += 1
print(cnt)

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

def code(n,p)
  for idx, pp in enumerate(p):
    if pp>n:
      return idx

idx = code(n,p)
print(idx)
    

Fixed submission:
n=int(input())
plist = list(map(int,input().split()))
cnt = 0
pmax=plist[0]
for i in range(n):
    if plist[i]<=pmax:
        pmax=plist[i]
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
r = int(input)

print(r**2)

Fixed submission:
r = int(input())

print(r**2)

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

return r^2

Fixed submission:
r = int(input())

print(r**2)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

if 1 <= a and a <= 9 and <= b and b <= 9:
  print(a*b)
else:
  print(-1

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

if 1 <= a and a <= 9 and 1<= b and b <= 9:
  print(a*b)
else:
  print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())

for i in range(k):
    if a > 0:
        a -= 1
    else:
        b -= 1

print(a,b)

Fixed submission:

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

if a + b <= k:
    print(0,0)
else:
    if a >=  k:
        print(a-k,b)
    else:
        print(0,b-(k-a))

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

for i in range(k):
    if a > 0:
        a -= 1
    else:
        b -= 1

print(a,b)

Fixed submission:

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

if a + b <= k:
    print(0,0)
else:
    if a >=  k:
        print(a-k,b)
    else:
        print(0,b-(k-a))
Buggy python submission (verdict: Runtime Error):
import numpy as np

if __name__ == "__main__":
    x,y = [int(x) for x in input().split()]
    print(np.lcm(x,y))

Fixed submission:
if __name__ == "__main__":
    x,y = [int(x) for x in input().split()]
    if x < y:
        tmp = x
        x = y
        y = tmp
    a = x * y
    
    r = x % y;
    while(r!=0):
        x = y
        y = r
        r = x % y;
    
    print(int(a/y))

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

if __name__ == "__main__":
    x,y = [int(x) for x in input().split()]
    print(x*y // math.gcd(x, y))

Fixed submission:
if __name__ == "__main__":
    x,y = [int(x) for x in input().split()]
    if x < y:
        tmp = x
        x = y
        y = tmp
    a = x * y
    
    r = x % y;
    while(r!=0):
        x = y
        y = r
        r = x % y;
    
    print(int(a/y))
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
if __name__ =="__main__":
    N = input()
    status = np.array([float(N), 0, 0, 0, 0])
    cap = np.zeros(5)
    for x in range(5):
        a = input()
        cap[x]=int(a)
    time=0
    move=np.zeros(5)
    while(True):
        pre_move = 0
        for x in range(4):
            move[x+1] = min(cap[x],status[x])
        status -= cap
        status=np.where(status<0,0,status)
        status+=move
        time+=1
        if sum(status)==0:
            break
    print(time)

Fixed submission:
import math
if __name__ =="__main__":
    N = input()
    N = float(N)
    cap_min=10.0**16
    for x in range(5):
        a = input()
        cap_min = min(float(a),cap_min)
    time = math.ceil(N/cap_min)+4
    print(time)
Buggy python submission (verdict: Runtime Error):
if __name__ == "__main__":
    NQ = input().split(" ")
    N ,Q = int(NQ[0]),int(NQ[1])

    S = input()
    stack =[]
    for x in range(Q):
        lr = input()
        lr = lr.split(" ")
        l ,r = int(lr[0]),int(lr[1])
        target = S[l-1:r]
        num = target.split("AC")
        stack.append(num)
    for x in [len(y)-1 for y in stack]:
        print(x)

Fixed submission:
if __name__ == "__main__":
    first = {'A','T'}
    second = {'C','G'}

    N = input()

    for x in [first,second]:
        if len(x - {N}) == 1:
            print(list(x-{N})[0])
Buggy python submission (verdict: Time Limit Exceeded):
import re
if __name__ =="__main__":
    string = input()
    pattern=["A","G","C","T"]
    point = 0
    max_len = 0
    while(True):
        stack_max = 0
        if max_len>(len(string)-point):
            break
        for x in range(point,len(string)):
            if string[x] in pattern:
                stack_max += 1
            else:
                point = x+1
                max_len = max(max_len,stack_max)
                break
        if point == len(string):
            break
        
    print(max_len)

Fixed submission:
if __name__ =="__main__":
    S = input()
    N = len(S)
    ans=0

    for i in range(N):
        for j in range(i,N):
            if all('ACGT'.count(c)==1 for c in S[i:j+1]):
                ans = max(ans,j-i+1)
    print(ans)
Buggy python submission (verdict: Runtime Error):
N,M=map(int, input().split())
if N==M:
  print 'Yes'
else:
  print 'No'


Fixed submission:
a=raw_input()
m=a.split()
N,M=map(int,m)
if N==M:
  print 'Yes'
else:
  print 'No'

Buggy python submission (verdict: Runtime Error):
a=input()
m=a.split()
N,M=map(int,m)
if N==M:
  print 'Yes'
else:
  print 'No'


Fixed submission:
a=raw_input()
m=a.split()
N,M=map(int,m)
if N==M:
  print 'Yes'
else:
  print 'No'

Buggy python submission (verdict: Runtime Error):
a=input()
m=a.split()
N=int(m[0])
M=int(m[2])
if N==M:
  print 'Yes'
else:
  print 'No'


Fixed submission:
a=raw_input()
m=a.split()
N,M=map(int,m)
if N==M:
  print 'Yes'
else:
  print 'No'

Buggy python submission (verdict: Runtime Error):
a=input()
m=a.split()
N=int(m[0])
M=int(m[1])
if N==M:
  print 'Yes'
else:
  print 'No'

Fixed submission:
a=raw_input()
m=a.split()
N,M=map(int,m)
if N==M:
  print 'Yes'
else:
  print 'No'

Buggy python submission (verdict: Runtime Error):
a=input()
m=a.split()
N=m[0]
M=m[1]
if M==N:
  print 'Yes'
else:
  print 'No'

Fixed submission:
a=raw_input()
m=a.split()
N,M=map(int,m)
if N==M:
  print 'Yes'
else:
  print 'No'

Buggy python submission (verdict: Runtime Error):
N=input()
M=input()
if N==M:
  print 'Yes'
else:
  print 'No'

Fixed submission:
a=raw_input()
m=a.split()
N,M=map(int,m)
if N==M:
  print 'Yes'
else:
  print 'No'

Buggy python submission (verdict: Runtime Error):
if N==M:
  print 'Yes'
else:
  print 'No'

Fixed submission:
a=raw_input()
m=a.split()
N,M=map(int,m)
if N==M:
  print 'Yes'
else:
  print 'No'
Buggy python submission (verdict: Runtime Error):
a,b=map(int,raw_input().split())
if a<b:
  print b*str(a)
else b<a:
   print b*str(a)
  

Fixed submission:
a,b=map(int,raw_input().split())
if a<b:
  print b*str(a)
else:
   print a*str(b)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,raw_input().split())
if a<b:
  print int(b*str(a))
else b<a:
   print int(b*str(a))
  

Fixed submission:
a,b=map(int,raw_input().split())
if a<b:
  print b*str(a)
else:
   print a*str(b)
Buggy python submission (verdict: Runtime Error):
n = int(input())
m = input().split()
ppp = list(map(int, m))
max = 2*10**5+1
ans = 0
for p in ppp:
    if p < max:
        ans += 1
        max = p
print(ans)

Fixed submission:
inp1 = input().split()
a = int(inp1[0])
b = int(inp1[1])

if b ==0:
  print("No")
else:
  c = a%b
  if c == 0:
    print("Yes")
  else:
    print("No")

Buggy python submission (verdict: Runtime Error):
inp1 = input().split()
inp2 = input().split()
a = int(inp1[0])
b = inp2
b = [int(s) for s in inp2]
ansno = a
maxno = b[0]

ii = 0
for i in b:
  if ii ==0:
    ii+=1
    continue
  bslice = b[:ii+1]
#  print(ii)
#  print(bslice)
  if min(bslice) != i:
#    print("min(bslice)",min(bslice)," i ",i)
    ansno -=1
  ii+=1
#  print("ansno: ",ansno)
print(ansno)


Fixed submission:
inp1 = input().split()
a = int(inp1[0])
b = int(inp1[1])

if b ==0:
  print("No")
else:
  c = a%b
  if c == 0:
    print("Yes")
  else:
    print("No")

Buggy python submission (verdict: Runtime Error):
inp1 = input().split()
inp2 = input().split()
a = int(inp1[0])
b = inp2
b = [int(s) for s in inp2]
ansno = a
maxno = b[0]

ii = 0
for i in b:
  if i ==0:
    continue
  if maxno < i:
    maxno = i
    ansno -= 1
    continue
  bslice = b[:ii]
  b[:ii].sort(reverse=True)
  bsort = b[:ii]
  if bslice != bsort:
    ansno -=1
    print(bslice,bsort)
    print("sort")
  ii+=1
print(ansno)


Fixed submission:
inp1 = input().split()
a = int(inp1[0])
b = int(inp1[1])

if b ==0:
  print("No")
else:
  c = a%b
  if c == 0:
    print("Yes")
  else:
    print("No")

Buggy python submission (verdict: Runtime Error):
inp1 = input().split()
a = int(inp1[0])
b = int(inp1[1])

c = a%b
if c == 0:
  print("Yes")
else:
  print("No")

Fixed submission:
inp1 = input().split()
a = int(inp1[0])
b = int(inp1[1])

if b ==0:
  print("No")
else:
  c = a%b
  if c == 0:
    print("Yes")
  else:
    print("No")

Buggy python submission (verdict: Runtime Error):
inp1 = input().split()
a = int(inp1[0])
b = int(inp1[1])

c = a%b
if c == 0:
  print("Yes")
else:
  print("No")
  

Fixed submission:
inp1 = input().split()
a = int(inp1[0])
b = int(inp1[1])

if b ==0:
  print("No")
else:
  c = a%b
  if c == 0:
    print("Yes")
  else:
    print("No")
Buggy python submission (verdict: Runtime Error):
x,y=map(int(),input().split())
if(x==y):
  print("Yes")
else:
  print("No")

Fixed submission:
x,y=map(int,input().split())
if(x==y):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
li = list(map(int,input().split()))
count=1
li2=[]
if(len(li)!=1):
    for i in range(1,n):
        li2=li[0:i]
        if(min(li2)>=li[i]):
            count+=1
print(count)


Fixed submission:
n=int(input())
li = list(map(int,input().split()))
count=1
m=n
for i in range(1,n):
    m=min(m,li[i-1])
    if(m==1):
        break
    if(m>=li[i]):
        count+=1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
li = list(map(int,input().split()))
count=1
li2=[]
if(len(li)!=1):
    for i in range(1,n):
        if(i==1):
            if(li[0]>=li[1]):
                count+=1
            continue
       # print(i)
        li2=li[0:i]
        if(min(li2)>=li[i]):
            count+=1
        #print(li2,count)
print(count)


Fixed submission:
n=int(input())
li = list(map(int,input().split()))
count=1
m=n
for i in range(1,n):
    m=min(m,li[i-1])
    if(m==1):
        break
    if(m>=li[i]):
        count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Your code here!
n=int(input())
li = list(map(int,input().split()))
count=1
li2=[]
if(len(li)!=1):
    for i in range(1,n):
        if(i==1):
            if(li[0]>=li[1]):
                count+=1
            continue
        li2=li[0,i-1]
        if(max(li2)>=li[i]):
            count+=1
print(count)


Fixed submission:
n=int(input())
li = list(map(int,input().split()))
count=1
m=n
for i in range(1,n):
    m=min(m,li[i-1])
    if(m==1):
        break
    if(m>=li[i]):
        count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
n=int(input())
li = list(map(int,input().split()))
count=1
li2=[]
for i in range(1,n):
  li2=li[0,i-1]
  if(max(li2)>=li[i]):
    count+=1
print(count)


Fixed submission:
n=int(input())
li = list(map(int,input().split()))
count=1
m=n
for i in range(1,n):
    m=min(m,li[i-1])
    if(m==1):
        break
    if(m>=li[i]):
        count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
import sys
from fractions import gcd
input = sys.stdin.readline

n = input()
arr = list(map(int, input().split()))
tmp = arr[0]
for i in arr:
    tmp = tmp*i//gcd(tmp,i)
ans = sum(tmp//a for a in arr)
ans = ans % (10**9+7)
print(ans)

Fixed submission:
txt = input().split(' ')
if txt[0] == txt[1]:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
import sys
sys.stdin.readline() 

n = int(input())
arr = list(map(int,input().split()))
count = 0
minimum = arr[0]
for num in arr:
  if num <= minimum:
    minimum = num
    count += 1
print(count)

Fixed submission:
txt = input().split(' ')
if txt[0] == txt[1]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
arr = input().split(' ')
arr = [int(i) for i in arr]
count = 0
for idx in range(n):
  num = arr[idx]
  comp = min(arr[:idx+1])
  if num <= comp:
    count += 1
print(count)

Fixed submission:
n = int(input())
arr = input().split(' ')
arr = [int(i) for i in arr]
count = 0
minimum = arr[0]
for idx in range(n):
  num = arr[idx]
  if num <= minimum:
    minimum = num
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
def main():
    a = input()
    l = list(map(int,input().split()))
    ans = check(int(a),l)
    print(ans)

def check(a,l):
    num = 0
    for i in range(a):
        for j in range(i):
            if l[i] > l[j]:
                break
        else:
            num = num + 1
    return num

main()

Fixed submission:
def main():
  a,b = map(int,input().split())
  ans = check(a,b)
  print(ans)
  
def check(n,m):
  if n == m:
    return "Yes"
  else:
    return "No"
main()

Buggy python submission (verdict: Runtime Error):
def main():
    a = input()
    #if int(a) > 100000:
    #    exit
    l = list(map(int,input().split()))
    #if len(l) > int(a):
    #    exit
    ans = check(int(a),l)
    print(ans)

def check(a,l):
    num = 0
    for i in range(a):
        for j in range(i):
            if l[i] > l[j]:
                break
        else:
            num = num + 1
    return num

main()

Fixed submission:
def main():
  a,b = map(int,input().split())
  ans = check(a,b)
  print(ans)
  
def check(n,m):
  if n == m:
    return "Yes"
  else:
    return "No"
main()

Buggy python submission (verdict: Runtime Error):
def main():
  i = list(map(int, input().split()))
  ans = check(i[0],i[1])
  print ans
  
def check(int n, int m):
  if n == m:
    return true
  else:
    return false

Fixed submission:
def main():
  a,b = map(int,input().split())
  ans = check(a,b)
  print(ans)
  
def check(n,m):
  if n == m:
    return "Yes"
  else:
    return "No"
main()

Buggy python submission (verdict: Runtime Error):
def main():
  n = input()
  m = input()
  ans = check(n,m)
  print ans
  
def check(int n, int m):
  if(n == m):
    return true
  else:
    return false

Fixed submission:
def main():
  a,b = map(int,input().split())
  ans = check(a,b)
  print(ans)
  
def check(n,m):
  if n == m:
    return "Yes"
  else:
    return "No"
main()

Buggy python submission (verdict: Runtime Error):
from fractions import *
n,*a=map(int,open(0).read().split())
b=1
for i in a:b*=i//gcd(b,i)
print(sum(b//i for i in a)%(10**9+7)) 


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

if n==m: print("Yes")
else: print("No")