Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = [sorted((input())) for i in range(N)]
count = 0

for i in range(N):
    for j in range(N):
        if(i<j):
            if(s[i]==s[j]):
                
                count += 1
print(count)

Fixed submission:
N = int(input())
s = sorted(["".join(sorted((input()))) for i in range(N)])
count = 0

num=1
for i in range(N-1):
    if(s[i]==s[i+1]):
        num += 1
    elif(num>1):
        count += num*(num-1)/2
        num = 1
    
if(num>1):
    count += num*(num-1)/2
print(int(count))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = [sorted((input())) for i in range(N)]
count = 0

s = [sorted(s_) for s_ in s]
for i in range(N):
    for j in range(N):
        if(i<j):
            if(s[i]==s[j]):
                
                count += 1
print(count)

Fixed submission:
N = int(input())
s = sorted(["".join(sorted((input()))) for i in range(N)])
count = 0

num=1
for i in range(N-1):
    if(s[i]==s[i+1]):
        num += 1
    elif(num>1):
        count += num*(num-1)/2
        num = 1
    
if(num>1):
    count += num*(num-1)/2
print(int(count))
Buggy python submission (verdict: Runtime Error):
A,B,C = intput().split()
A,B,C = int(A),int(B),int(C)

print(max([C-(A-B),0])

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

print(max([C-(A-B),0]))

Buggy python submission (verdict: Runtime Error):
A,B,C = intput().split()
A,B,C = int(A),int(B),int(C)

print(C-(A-B))

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

print(max([C-(A-B),0]))
Buggy python submission (verdict: Runtime Error):
import math
N,L = input().split()
N,L = int(N),int(L)
c = math.gcd(6,8)

if(L>=0):
    print(int(0.5*N*(N+1)+N*L-N-(L)))
else:
    n = min([-L,N-1])
    print(int(0.5*N*(N+1)+N*L-N-(L+n)))

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


if(L>=0):
    print(int(0.5*N*(N+1)+N*L-N-(L)))
else:
    n = min([-L,N-1])
    print(int(0.5*N*(N+1)+N*L-N-(L+n)))

Buggy python submission (verdict: Runtime Error):
import math
N,L = input().split()
N,L = int(N),int(L)
c = math.gcd(N,L)

if(L>=0):
    print(int(0.5*N*(N+1)+N*L-N-(L)))
else:
    n = min([-L,N-1])
    print(int(0.5*N*(N+1)+N*L-N-(L+n)))

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


if(L>=0):
    print(int(0.5*N*(N+1)+N*L-N-(L)))
else:
    n = min([-L,N-1])
    print(int(0.5*N*(N+1)+N*L-N-(L+n)))
Buggy python submission (verdict: Runtime Error):
a,b,c,d = input().split()
a,b,c,d = int(a),int(b),int(c),int(d)

import math

def div(x):
    if(a%x == 0):
        return (b//x-a//x)*(x-1)+(b%x)
    else:
        return (b//x-a//x)*(x-1)+(b%x)-(a%x-1)

ans = div(c)+div(d)-div(int(c*d/math.gcd(c,d)))
print(ans)

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

from fractions import gcd

def div(x):
    if(a%x == 0):
        return (b//x-a//x)*(x-1)+(b%x)
    else:
        return (b//x-a//x)*(x-1)+(b%x)-(a%x-1)

ans = div(c)+div(d)-div(int(c*d//gcd(c,d)))
print(ans)

Buggy python submission (verdict: Runtime Error):
a,b,c,d = input().split()
a,b,c,d = int(a),int(b),int(c),int(d)

import math

def div(x):
    #print("{}:{},{},{}".format(x,(b//x-a//x)*(x-1),(b-b//x*x),(a-a//x*x)))
    if(a%x == 0):
        return (b//x-a//x)*(x-1)+(b%x)
    else:
        return (b//x-a//x)*(x-1)+(b%x)-(a%x-1)


print(div(c)+div(d)-div(int(c*d/math.gcd(c,d))))

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

from fractions import gcd

def div(x):
    if(a%x == 0):
        return (b//x-a//x)*(x-1)+(b%x)
    else:
        return (b//x-a//x)*(x-1)+(b%x)-(a%x-1)

ans = div(c)+div(d)-div(int(c*d//gcd(c,d)))
print(ans)
Buggy python submission (verdict: Runtime Error):
W,H,x,y = input().split()
W,H,x,y = int(W),int(H),int(x),int(y)

cw = W/2
cH = H/2

if(cw==x):
    print(W*H/2)
    if(cH==y):
        print(1)
    else:
        print(0)

else:
    y0 = y-((y-cJ)/(x-cW))*x
    y1 = y-((y-cJ)/(x-cW))*(x-W)
    print((y0+y1)*W/2)
    print(0)

Fixed submission:
W,H,x,y = input().split()
W,H,x,y = int(W),int(H),int(x),int(y)

cw = W/2
cH = H/2

if(cw==x):
    print(W*H/2)
    if(cH==y):
        print(1)
    else:
        print(0)

else:
    y0 = y-((y-cH)/(x-cw))*x
    y1 = y-((y-cH)/(x-cw))*(x-W)
    print((y0+y1)*W/2)
    print(0)

Buggy python submission (verdict: Runtime Error):
W,H,x,y = input().split()
W,H,x,y = int(W),int(H),int(x),int(y)

cw = W//2
cH = H//2

if(cw==x):
    print(W*H//2)
    if(cH==y):
        print(1)
    else:
        print(0)
else:
    y0 = y-((y-cJ)/(x-cW))*x
    y1 = y-((y-cJ)/(x-cW))*(x-W)
    print((y0+y1)*W//2)
    print(0)

Fixed submission:
W,H,x,y = input().split()
W,H,x,y = int(W),int(H),int(x),int(y)

cw = W/2
cH = H/2

if(cw==x):
    print(W*H/2)
    if(cH==y):
        print(1)
    else:
        print(0)

else:
    y0 = y-((y-cH)/(x-cw))*x
    y1 = y-((y-cH)/(x-cw))*(x-W)
    print((y0+y1)*W/2)
    print(0)
Buggy python submission (verdict: Time Limit Exceeded):
N,Q = input().split()
N,Q = int(N),int(Q)
S = input()
l,r = [],[]
for i in range(Q):
    l_,r_ = input().split()
    l_,r_ = int(l_)-1,int(r_)-1
    l.append(l_)
    r.append(r_)
    
for i in range(Q):
    print(S[l[i]:r[i]+1].count("AC"))

Fixed submission:
N,Q = input().split()
N,Q = int(N),int(Q)
S = input()
l,r = [],[]
for i in range(Q):
    l_,r_ = input().split()
    l_,r_ = int(l_)-1,int(r_)-1
    l.append(l_)
    r.append(r_)
    
A = [0]
sum_ = 0
for i in range(1,N):
    if(S[i-1]=="A" and S[i]=="C"):
        sum_ += 1
    A.append(sum_)

for i in range(Q):
    if(l[i]==0):
        num = r[i]
        print(A[r[i]])
    else:
        sa = A[r[i]]-A[l[i]]
        print(sa)
Buggy python submission (verdict: Runtime Error):
a  = int(input())
if a == 2:
    a1, a2 = map(int, input().split())
    b1, b2 = map(int, input().split())
    print()
elif a == 3:
    a1, a2, a3 = map(int, input().split())
    a1, a2, a3 = map(int, input().split())
    print(1,3)
elif a == 5:
    a1, a2, a3, a4, a5 = map(int, input().split())
    a1, a2, a3, a4, a5 = map(int, input().split())
    print(a1,a2)
    print(a1+1,a2)
    print(a1+2,a2)
    print(a1+3,a2)
    print(a1+4,a2)
elif a == 6:
    a1, a2, a3, a4, a5, a6 = map(int, input().split())
    a1, a2, a3, a4, a5, a6 = map(int, input().split())
    print(2,2)
    print(5,5)

Fixed submission:
K, X = map(int, input().split())
result = K*500
if result >= X:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
K, X = map(int, input().split())
result = K*500
if result >= X:
    print("yes")
elif result < X:
    print("no")

Fixed submission:
K, X = map(int, input().split())
result = K*500
if result >= X:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
result = a*500
if result >= b:
    print("yes")
else: 
    print("no")

Fixed submission:
K, X = map(int, input().split())
result = K*500
if result >= X:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a  = int(input())
if a == 3:
    a1, a2, a3 = map(int, input().split())
    b1, b2, b3 = map(int, input().split())
    print(3)
elif a == 8:
    a1, a2, a3, a4, a5, a6, a7, a8 = map(int, input().split())
    b1, b2, b3, b4, b5, b6, b7, b8 = map(int, input().split())
    print(17517)
elif a == 5:
    a1, a2, a3 = map(int, input().split())
    if a==1 or b==2 or c==3:
        b1, b2, b3 = map(int, input().split())
        print(0)
    

Fixed submission:
N = int(input()) 
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
A = list(range(1,N+1))
Alist=[]
import itertools
for v in itertools.permutations(A):
        Alist.append(v)
a_num = Alist.index(P)+1
b_num = Alist.index(Q)+1
print(abs(b_num - a_num))
Buggy python submission (verdict: Runtime Error):

Copy
Copy
a  = int(input())
if a == 2:
    a1, a2 = map(int, input().split())
    b1, b2 = map(int, input().split())
    print()
elif a == 3:
    a1, a2, a3 = map(int, input().split())
    b1, b2, b3 = map(int, input().split())
    print(1,3)
elif a == 5:
    a1, a2, a3, a4, a5 = map(int, input().split())
    b1, b2, b3, b4, b5 = map(int, input().split())
    print(a1,a2)
    print(a1+1,a2)
    print(a1+2,a2)
    print(a1+3,a2)
    print(a1+4,a2)
elif a == 6:
    a1, a2, a3, a4, a5, a6 = map(int, input().split())
    b1, b2, b3, b4, b5, b6 = map(int, input().split())
    print(2,2)
    print(5,5)


Fixed submission:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# (a,b,c,d) -> (ab,bc,cd,da) と変換
# xor x で不変量になる

N = int(readline())

A = list(map(int,readline().split()))
B = list(map(int,readline().split()))

def convert(A):
    return [x ^ y for x,y in zip(A,A[1:])] + [A[-1] ^ A[0]]

C = convert(A); D = convert(B)

def Z_algorithm(S):
    # 共通接頭辞の長さを返す
    N=len(S)
    arr = [0]*N
    arr[0] = N
    i,j = 1,0
    while i<N:
        while i+j<N and S[j]==S[i+j]:
            j += 1
        arr[i]=j
        if not j:
            i += 1
            continue
        k = 1
        while i+k<N and k+arr[k]<j:
            arr[i+k] = arr[k]
            k += 1
        i += k; j -= k
    return arr

Z = Z_algorithm(D + [-1] + C + C)[N+1:N+N+1]

K = [i for i,x in enumerate(Z) if x == N]
X = [A[k] ^ B[0] for k in K]

print('\n'.join('{} {}'.format(k,x) for k,x in zip(K,X)))
Buggy python submission (verdict: Runtime Error):
K, X = [int(K), int(X) for K, X in input().split()]

if K*500 >= X:
  print("Yes")
else:
  print("No")

Fixed submission:
K, X = [int(x) for x in input().split()]

if K*500 >= X:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
  
def prod(n):
  result = 1
  for x in n:
    result *= x
  return result
  
a = prime_factorize(n)
b = [a.pop(-1)]

while prod(a) > prod(b):
  prev_result = prod(a) + prod(b)
  b.append(a.pop(0))

  if prev_result < prod(a) + prod(b):
    a.append(b.pop(-1))
    break
  
print(prod(a)-1 +prod(b)-1)


Fixed submission:
a, b = [int(x) for x in input().split()]
if a <= 9 and b <= 9:
  print(a*b)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
if n <= 81:
  for i in range(1, 10):
    if n%i == 0:
      for j in range(1, 10):
        if (n/i)%j == 0 and (n/i)/j == 1:
          print("Yes")
          exit()

print("No")

Fixed submission:
n = int(input())
if n <= 81:
  for i in range(1, 10):
    if n%i == 0:
      for j in range(1, 10):
        if (n/i)%j == 0 and (n/i)/j == 1:
          print("Yes")
          exit()
print("No")

Buggy python submission (verdict: Runtime Error):
if n <= 81:
  for i in range(1, 10):
    if n%i == 0:
      for j in range(1, 10):
        if (n/i)%j == 0 and (n/i)/j == 1:
          print("Yes")
          exit()

print("No")

Fixed submission:
n = int(input())
if n <= 81:
  for i in range(1, 10):
    if n%i == 0:
      for j in range(1, 10):
        if (n/i)%j == 0 and (n/i)/j == 1:
          print("Yes")
          exit()
print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
order = [int(x) for x in input().split()]
order_sorted = sorted(range(len(order)), key=lambda k: order[k])
order_sorted = [x+1 for in x order_sorted]
print(*order_sorted)

Fixed submission:
N = int(input())
order = [int(x) for x in input().split()]
order_sorted = sorted(range(len(order)), key=lambda k: order[k])
order_sorted = [x+1 for x in order_sorted]
print(*order_sorted)
Buggy python submission (verdict: Time Limit Exceeded):
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

a, b = [int(x) for x in input().split()]

d = 1
d_list = []
while(d <= a and d <= b):
  if a % d == 0 and b % d == 0:
    d_list.append(d)
  d += 1

length = len(d_list)

x = prime_factorize(d_list[-1])
print(len(set(x))+1)

Fixed submission:
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

a, b = [int(x) for x in input().split()]
from fractions import gcd

x = gcd(a,b)

x = prime_factorize(x)
print(len(set(x)) + 1)
Buggy python submission (verdict: Runtime Error):
import sys

ans = 0
input = sys.stdin.readline
N = int(input())
S = input().rstrip()

list_S = list(S)

for i in range(N):
    if list_S[i] == 'A':
        if list_S[i + 1] == 'B':
            if list_S[i + 2] == 'C':
                ans += 1
print(ans)

Fixed submission:
import sys

ans = 0
input = sys.stdin.readline
N = int(input())
S = input().rstrip()

list_S = list(S)

for i in range(N - 2):
    if list_S[i] == 'A':
        if list_S[i + 1] == 'B':
            if list_S[i + 2] == 'C':
                ans += 1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
students = input().split()
turns = [str(students.index(str(x)) + 1) for x in range(1, N + 1) ]
print(' '.join(turns))

Fixed submission:
# coding: utf-8
N = int(input())
student_list = [0] * (N + 1)
turn_list = [int(x) for x in input().split()]

for i, s in enumerate(turn_list):
    student_list[s] = i + 1
student_list.pop(0)
for s in student_list:
    print(str(s), end=' ')
print()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
students = [int(x) for x in input().split()]
turns = [str(students.index(x) + 1) for x in range(1, N + 1) ]
print(' '.join(turns))

Fixed submission:
# coding: utf-8
N = int(input())
student_list = [0] * (N + 1)
turn_list = [int(x) for x in input().split()]

for i, s in enumerate(turn_list):
    student_list[s] = i + 1
student_list.pop(0)
for s in student_list:
    print(str(s), end=' ')
print()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
students = [int(x) for x in input().split()]
for i in range(1, N + 1):
    trun = students.index(i) + 1
    print(str(trun) + ' ', end ='')
print()

Fixed submission:
# coding: utf-8
N = int(input())
student_list = [0] * (N + 1)
turn_list = [int(x) for x in input().split()]

for i, s in enumerate(turn_list):
    student_list[s] = i + 1
student_list.pop(0)
for s in student_list:
    print(str(s), end=' ')
print()
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
import numpy as np

N, point, correct = [int(x) for x in input().split()]
r_list = [int(1) for x in range(1, N + 1)]
p_list = [point for x in range(1, N + 1)]
range_list = np.array(r_list)
points_list = np.array(p_list)

for i in range(correct):
    answer = int(input()) - 1
    points_list = points_list - range_list
    points_list[answer] += 1
#    print(points_list)

for p in points_list:
    if p <= 0:
        print('No')
    else:
        print('Yes')

Fixed submission:
# coding: utf-8
import numpy as np

N, point, q = [int(x) for x in input().split()]
r_list = [q] * N
p_list = [point] * N
reduce_list = np.array(r_list)
points_list = np.array(p_list)

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

points_list = points_list - reduce_list

for p in points_list:
    if p <= 0:
        print('No')
    else:
        print('Yes')
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
import math
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
item_list = list(map(int, input().split()))

for i in range(M):
    item_list.sort()
    item_list[-1] = math.floor(item_list[-1] / 2)

total = 0
for p in item_list:
    total += p

print(total)


Fixed submission:
# coding: utf-8
from heapq import heapify, heappop, heappush
import sys

input = sys.stdin.readline
N, M = map(int, input().split())
item_list = [int(x) * (-1) for x in input().split()]

heapify(item_list)

for i in range(M):
    price = heappop(item_list)
    price = int(price / 2)
    heappush(item_list, price)

total = -sum(item_list)
print(total)
Buggy python submission (verdict: Runtime Error):
inputs = []
for x in range 3:
    inputs.append(input("Input: "))
indices = [0,2]
if(a[indices].sum() >= 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: Runtime Error):
K = int(input())
X = int(input())
K = K *500
if K >= X:
  print("Yes")
else:
  print("No")


Fixed submission:
k,x = [int(x) for x in input().split()]

k = k * 500 

if k >= x:
  print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
K = int(input().split())
X = int(input().split())
K = K *500
if K >= X:
  print("Yes")
else:
  print("No")


Fixed submission:
k,x = [int(x) for x in input().split()]

k = k * 500 

if k >= x:
  print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
K = int(input().split())
X = int(input().split())
K = K *2
if K >= X:
  print("Yes")
else:
  print("No")


Fixed submission:
k,x = [int(x) for x in input().split()]

k = k * 500 

if k >= x:
  print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
K = int(input())
X = int(input())
K = K *2
if K >= X:
  print("Yes")
else:
  print("No")


Fixed submission:
k,x = [int(x) for x in input().split()]

k = k * 500 

if k >= x:
  print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
K = int(input())
X = int(input())
K = K *2
if K >= X:
  print("Yes")
if K < X:
  print("No")


Fixed submission:
k,x = [int(x) for x in input().split()]

k = k * 500 

if k >= x:
  print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
K = 500
num = int(input())
coin = num * K
print (coin)
X = int(input())
if coin >= X:
  print("Yes")
if coin < X:
  print("No")

Fixed submission:
k,x = [int(x) for x in input().split()]

k = k * 500 

if k >= x:
  print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
a=input()
b=input()

ans={1,2,3}
ans.remove(a)
ans.remove(b)

if ans == {a}
    print("a")
if ans == {b}
    print("b")
if ans == {c}
    print("c")

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

a = int(a)
b = int(b)

print(6-a-b)

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()

ans={1,2,3}
ans.remove(a)
ans.remove(b)
print(ans)


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

a = int(a)
b = int(b)

print(6-a-b)
Buggy python submission (verdict: Runtime Error):
n = input("")
s = input("")
t = input("")
n = int(n)
ans = ""

for i in range(n):
    ans = ans + s[i]
    ans = ans + t[i]
    
print(ans)

Fixed submission:
n = input("")
s,t= input("").split()
n = int(n)
ans = ""

for i in range(n):
    ans = ans + s[i]
    ans = ans + t[i]
    
print(ans)
Buggy python submission (verdict: Runtime Error):
k, x = input().split()
k = int(k) * 500
if (k >= int(x)):
    print("Yes")
else:
    print("No")

Fixed submission:
n = input()
s = input()
if (len(s) == int(n)):
    print(s.count("ABC"))
Buggy python submission (verdict: Runtime Error):
aw = 0
for i in map(int, input().split()):
    if i == 1:
        s+=300000
    elif i ==2 :
        s+= 200000
    elif i ==3 :
        s+= 100000
if aw== 600000:
    aw= 1000000
print(aw)

Fixed submission:
aw = 0
for i in map(int, input().split()):
    if i == 1:
        aw+=300000
    elif i ==2 :
        aw+= 200000
    elif i ==3 :
        aw+= 100000
if aw== 600000:
    aw= 1000000
print(aw)
Buggy python submission (verdict: Runtime Error):
k = input()
x = input()
cal = k*500

if cal<=x:
    print("Yes")
else:
    print("No")

Fixed submission:
import sys
# input=sys.stdin.readline

val = []
val = input()

arrays = val.split(' ')
a = int(arrays[0])*500

if a>=int(arrays[1]):
    print("Yes")
elif a<int(arrays[1]):
    print("No")

sys.exit()

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

k = input()
x = input()

if k*500<=x:
    print("Yes")
else:
    print("No")

Fixed submission:
import sys
# input=sys.stdin.readline

val = []
val = input()

arrays = val.split(' ')
a = int(arrays[0])*500

if a>=int(arrays[1]):
    print("Yes")
elif a<int(arrays[1]):
    print("No")

sys.exit()

Buggy python submission (verdict: Runtime Error):
k = input()
x = input()

if k*500<=x:
    print("Yes")
else:
    print("No")



Fixed submission:
import sys
# input=sys.stdin.readline

val = []
val = input()

arrays = val.split(' ')
a = int(arrays[0])*500

if a>=int(arrays[1]):
    print("Yes")
elif a<int(arrays[1]):
    print("No")

sys.exit()

Buggy python submission (verdict: Runtime Error):
k = input()
x = input()

if k*500<=x:
    print("Yes")
else:
    print("No")

Fixed submission:
import sys
# input=sys.stdin.readline

val = []
val = input()

arrays = val.split(' ')
a = int(arrays[0])*500

if a>=int(arrays[1]):
    print("Yes")
elif a<int(arrays[1]):
    print("No")

sys.exit()

Buggy python submission (verdict: Runtime Error):
k = input()
x = input()

if k*500<x:
	print("Yes")
else:
	print("No")	

Fixed submission:
import sys
# input=sys.stdin.readline

val = []
val = input()

arrays = val.split(' ')
a = int(arrays[0])*500

if a>=int(arrays[1]):
    print("Yes")
elif a<int(arrays[1]):
    print("No")

sys.exit()
Buggy python submission (verdict: Runtime Error):
S = []
for _ in range(2):
    S.append(input())

if S == [1, 2]
  print('3')
elif S == [1, 3]:
  print('2')
elif S == [2, 3]:
  print('1')

Fixed submission:
a = int(input())
b = int(input())
c = a + b

if c == 3:
  print('3')
elif c == 4:
  print('2')
else:
  print('1')

Buggy python submission (verdict: Runtime Error):
S = []
for _ in range(2):
    S.append(input())

if S == [1, 2]
  print('3')
elif S == [2, 1]:
  print('3')
elif S == [1, 3]:
  print('2')
elif S == [3, 1]:
  print('2')
elif S == [2, 3]:
  print('1')
elif S == [3, 2]:
  print('1')

Fixed submission:
a = int(input())
b = int(input())
c = a + b

if c == 3:
  print('3')
elif c == 4:
  print('2')
else:
  print('1')
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
import sys

VALUE = 500

num = int(sys.argv[1])
if num < 1 or num > 100:
    assert False, 'Invalid value'

threshold = int(sys.argv[2])
if threshold < 1 or threshold > 10**5:
    assert False, 'Invalid value'

result = 'Yes' if num * VALUE >= threshold else 'No'
print(result)


Fixed submission:
#!/usr/bin/env python

VALUE = 500

stdin = input()
args = stdin.split(' ')

num = int(args[0])
if num < 1 or num > 100:
    assert False, 'Invalid value'

threshold = int(args[1])
if threshold < 1 or threshold > 10**5:
    assert False, 'Invalid value'

result = 'Yes' if num * VALUE >= threshold else 'No'
print(result)

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

VALUE = 500

num = int(sys.argv[1])
if num < 1 or num > 100:
    assert False, 'Invalid value'

threshold = int(sys.argv[2])
if threshold < 1 or threshold > 10**5:
    assert False, 'Invalid value'

result = 'Yes' if num * VALUE >= threshold else 'No'
print(result)


Fixed submission:
#!/usr/bin/env python

VALUE = 500

stdin = input()
args = stdin.split(' ')

num = int(args[0])
if num < 1 or num > 100:
    assert False, 'Invalid value'

threshold = int(args[1])
if threshold < 1 or threshold > 10**5:
    assert False, 'Invalid value'

result = 'Yes' if num * VALUE >= threshold else 'No'
print(result)

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

VALUE = 500

num = int(sys.argv[1])
if 1 < num > 100:
    assert False, 'Invalid value'

threshold = int(sys.argv[2])
if 1 < threshold > 10**5:
    assert False, 'Invalid value'

result = 'Yes' if num * VALUE >= threshold else 'No'
print(result)


Fixed submission:
#!/usr/bin/env python

VALUE = 500

stdin = input()
args = stdin.split(' ')

num = int(args[0])
if num < 1 or num > 100:
    assert False, 'Invalid value'

threshold = int(args[1])
if threshold < 1 or threshold > 10**5:
    assert False, 'Invalid value'

result = 'Yes' if num * VALUE >= threshold else 'No'
print(result)