Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())

L = input().split()

mountain = int(1)
for i in range(n):
    for j in range(i):
            if int(L[j]) > int(L[i]):
          			break
            else:
                    mountain += 1
print(mountain)


Fixed submission:
a, b = map(int, input().split())
if a == b:
    print(a + b)
elif a > b:
    print(a + a - 1)
elif a < b:
    print(b + b - 1)
Buggy python submission (verdict: Runtime Error):
n = int(input())

L = list(int,input().split())

mountain = int(1)
for i in range(1,n):
    for j in range(i):
            if int(L[j]) >= int(L[i]):
          			break
            else:
                    mountain += 1
                
print(mountain)


Fixed submission:
n = int(input())

L = list(map(int,input().split()))

mountain = int(1)
for i in range(1, n):
    for j in range(i):
        if int(L[j]) > int(L[i]):
            break
        if int(L[j]) <= int(L[i]) and j == i-1:
            mountain += 1
            break
        if int(L[j]) <= int(L[i]):
            continue

print(mountain)

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

L = list(int,input().split())

mountain = int(1)
for i in range(n):
    for j in range(i):
            if int(L[j]) >= int(L[i]):
          			continue
            else:
                    mountain += 1
                
print(mountain)


Fixed submission:
n = int(input())

L = list(map(int,input().split()))

mountain = int(1)
for i in range(1, n):
    for j in range(i):
        if int(L[j]) > int(L[i]):
            break
        if int(L[j]) <= int(L[i]) and j == i-1:
            mountain += 1
            break
        if int(L[j]) <= int(L[i]):
            continue

print(mountain)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())

d = dict()
for i in range(n):
  a,*b = list(map(int,input().split()))
  d[i] = b

x = 0
ans = 0
for j in range(1,m+1):
  for i in range(n):
    if j in d[i]:
      x += 1
    else:
      x = 0
      break
  if x == n:
    ans += 1
  else:
    ans = 0

print(ans)

Fixed submission:
a,b = map(int,input().split())
if b%a == 0:
  print(a+b)
else:
  print(b-a)
Buggy python submission (verdict: Runtime Error):
n = int(input())

L = [map(int,input().split())]

sum = int(0)
a = max(L)

for i in range(n):
  sum += L[i]
  
if 2*a > sum:
  print("Yes")
else:
  print("No")

Fixed submission:
n = int(input())

L = list(map(int,input().split()))

sum = int(0)
a = max(L)

for i in range(n):
  sum += L[i]
  
if 2*a < sum:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
x=int(input())
if(x>=30):
  print("Yes")
else:
  prinit("No")

Fixed submission:
x=int(input())
if(x>=30):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
p=a+a**2+a**3
print(p)

Fixed submission:
a=int(input())
p=a+a**2+a**3
print(p)
Buggy python submission (verdict: Runtime Error):
n=list(map(int,input()))
p=sum(n)
f=15
ans=(f-p)
print(ans)

Fixed submission:
n=list(map(int,input().split()))
p=sum(n)
f=15
ans=(f-p)
print(ans)

Buggy python submission (verdict: Runtime Error):
n=list(map(input()))
p=sum(n)
ans=(15-p)
print(ans)

Fixed submission:
n=list(map(int,input().split()))
p=sum(n)
f=15
ans=(f-p)
print(ans)
Buggy python submission (verdict: Runtime Error):
N, D = map(int, input().split())

count = 0

for i in range(N):
  x, y = map(int, input().split())
  if D > pow(x**2+y**2, 0.5):
    count += 1
  else:
    continue
    
print(count)

Fixed submission:
x = input()
if int(x) >= 30:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N, D = map(int, input().split())

count = 0

for i in N:
  x, y = map(int, input().split())
  if D > pow(x**2+y**2, 0.5):
    count += 1
  else:
    continue
    
print(count)

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

count = 0

for i in range(N):
    x, y = map(int, input().split())
    if D >= pow(x**2+y**2, 0.5):
        count += 1
    
print(count)
Buggy python submission (verdict: Runtime Error):
S,T = input().split()
A,B = input().split()
U = input()

if U = S:
  print(A-1)
else:
  print(B-1)


Fixed submission:
S,T = input().split()
A,B = input().split()
U = input()

if U == S:
  print(int(A)-1, B)
else:
  print(A, int(B)-1)
Buggy python submission (verdict: Runtime Error):
S = input()

l = len(S)
K = ""
for x in l:
  K += x
  
print(K)

Fixed submission:
S = len(input())
print("x" * S)
Buggy python submission (verdict: Runtime Error):
K, X = int(input().split())
if 500 * K >= X:
    print("Yes")
elif 500 * K < X:
    print("No")

Fixed submission:
K, X = (int(x) for x in input().split())
if 500 * K >= X:
    print("Yes")
elif 500 * K < X:
    print("No")
Buggy python submission (verdict: Runtime Error):
import sys
import math

input = sys.stdin.readline

def can(arr, m, K):
  need = 0
  for x in arr:
    need += int(x // m)
  return need <= K

N, K = map(int, input().split())
arr = list(map(int, input().split()))
arr = sorted(arr)

lo = 0.0
hi = 1e9

while (abs(lo - hi) > 1e-5):
  m = (lo + hi) / 2.0
  if (can(arr, m, K)):
    hi = m
  else:
    lo = m
ans = lo

print(int(math.ceil(lo)))
  
  



Fixed submission:
n = int(input())
if n >= 30:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
    n = int(input())
    if n >= 30:
      s = 'Yes'
    else:
      s = 'No'
    print(s)

Fixed submission:
n = int(input())
if n >= 30:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
n = int(input())
s = input()
ans = 0
for i in range(n - 1):
  idx = n - 1 - i
  if s[idx] == 'W' and s[idx + 1] == 'R':
    ans += 1
    s[idx] = 'R'
print(ans)


Fixed submission:
import sys
input = sys.stdin.readline
n = int(input())
s = input()
ans = 0
r = [0] * n
w = [0] * n
for i in range(n):
  if s[i] == 'W':
    w[i] += 1
  else:
    r[i] += 1
for i in range(1, n):
  w[i] += w[i - 1]
  r[i] += r[i - 1]
rn = r[n - 1]
ans = n
if rn == 0:
  ans = 0
for i in range(n):
  c = (i + 1)
  ri = r[i]
  left = rn - ri
  need = c - ri
  ans = min(ans, max(left, need))  

print(ans)
Buggy python submission (verdict: Runtime Error):
import sys
import math

input = sys.stdin.readline

def can(arr, m, K):
  need = 0
  for x in arr:
    if x > m:
      need += int(x // m)
  return need <= K

N, K = map(int, input().split())
arr = list(map(int, input().split()))

lo = 0
hi = int(1e9) + 1

while (lo < hi):
  m = int((lo + hi) // 2)
  if (can(arr, m, K)):
    hi = m
  else:
    lo = m + 1
print(lo)


Fixed submission:
import sys
import math

input = sys.stdin.readline

def can(arr, m, K):
  need = 0
  for x in arr:
    if x > m:
      need += int(x // m)
  return need <= K

N, K = map(int, input().split())
arr = list(map(int, input().split()))

lo = 1
hi = int(1e9) + 1

while (lo < hi):
  m = int((lo + hi) // 2)
  if (can(arr, m, K)):
    hi = m
  else:
    lo = m + 1
print(lo)

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

input = sys.stdin.readline

def can(arr, m, K):
  need = 0
  for x in arr:
    if x > m:
      need += x // m
  return need <= K

N, K = map(int, input().split())
arr = list(map(int, input().split()))

lo = 0
hi = int(1e9) + 1

while (lo < hi):
  m = (lo + hi) // 2
  if (can(arr, m, K)):
    hi = m
  else:
    lo = m + 1
print(lo)


Fixed submission:
import sys
import math

input = sys.stdin.readline

def can(arr, m, K):
  need = 0
  for x in arr:
    if x > m:
      need += int(x // m)
  return need <= K

N, K = map(int, input().split())
arr = list(map(int, input().split()))

lo = 1
hi = int(1e9) + 1

while (lo < hi):
  m = int((lo + hi) // 2)
  if (can(arr, m, K)):
    hi = m
  else:
    lo = m + 1
print(lo)
Buggy python submission (verdict: Runtime Error):
import sys


a = int(input())

cur = 0
for i in range(1, 10 ** 7):
	b = sum([(7 * (10**x)) for x in range(i + 1)])
    cur %= b
    if cur == 0:
        print(i)
        sys.exit()
print(-1)

Fixed submission:
import sys


a = int(input())

cur = 0
for i in range(1, 10 ** 7):
	#b = sum([(7 * (10**x)) for x in range(i + 1)])
    cur *= 10
    cur += 7
    cur %= a
    if cur == 0:
        print(i)
        sys.exit()
print(-1)

Buggy python submission (verdict: Time Limit Exceeded):
import sys


a = int(input())

cur = 0
for i in range(1, 10 ** 7):
	#b = sum([(7 * (10**x)) for x in range(i + 1)])
    cur *= 10
    cur += 7
    cur %= a
    if cur == 0:
        print(i)
        sys.exit()
print(-1)

Fixed submission:
import sys


a = int(input())

cur = 0
for i in range(1, 10 ** 7):
	#b = sum([(7 * (10**x)) for x in range(i + 1)])
    cur *= 10
    cur += 7
    cur %= a
    if cur == 0:
        print(i)
        sys.exit()
print(-1)

Buggy python submission (verdict: Time Limit Exceeded):
import sys


a = int(input())

if a % 2 == 0:
	print('-1')
	sys.exit()

n = 7
i = 0
for f in range(a):
	b = sum([(7 * (10**x)) for x in range(i + 1)])
	if b % a == 0:
		print(i + 1)
		sys.exit()
	else:
		i = i + 1

Fixed submission:
import sys


a = int(input())

cur = 0
for i in range(1, 10 ** 7):
	#b = sum([(7 * (10**x)) for x in range(i + 1)])
    cur *= 10
    cur += 7
    cur %= a
    if cur == 0:
        print(i)
        sys.exit()
print(-1)

Buggy python submission (verdict: Time Limit Exceeded):
a = int(input())

if a % 2 == 0:
	print('-1')
	exit()

n = 7
i = 0
while True:
	b = sum([(7 * (10**x)) for x in range(i + 1)])
	if b % a == 0:
		print(i + 1)
		exit()
	else:
		i = i + 1

Fixed submission:
import sys


a = int(input())

cur = 0
for i in range(1, 10 ** 7):
	#b = sum([(7 * (10**x)) for x in range(i + 1)])
    cur *= 10
    cur += 7
    cur %= a
    if cur == 0:
        print(i)
        sys.exit()
print(-1)
Buggy python submission (verdict: Runtime Error):
mod=10**9+7
n,k=map(int,input().split())
arr=list(map(int,input().split()))
arr=sorted(arr,reverse=True,key=lambda x:abs(x)) #絶対値の順にソートする
if k==n: #k=nのときはすべてを掛け合わせるほかない
 ans=1
 for i in range(n):
   ans*=arr[i]
   ans%=mod
 print(ans)
else:
 if k%2==1 and max(arr)<0: #答えが負になる場合は絶対値の小さい順にK個掛け合わせる
   ans=1
   for i in range(k):
     ans*=arr[n-1-i]
     ans%=mod
   print(ans)
 else:
   ans=1
   cnt=0
   for i in range(k): #絶対値の大きい順にK個掛け合わせる
     if arr[i]<0: #負数を掛けた回数を数えておく
       cnt+=1
     ans*=arr[i]
     ans%=mod
   if cnt%2==0: #負数を偶数回掛けていれば答えは非負なのでそのまま出力
     print(ans)
   else: #そうでなければ調整を行う
     min_plus=-1
     min_minus=1
     for i in range(k): #絶対値の大きい順にK個を見て最小の非負の数・負の数を探す
       if arr[i]>=0:
         min_plus=arr[i]
       else:
         min_minus=arr[i]
     max_plus=-1
     max_minus=1
     for i in range(k,n): #残るN-K個を見て最大の非負の数・負の数を探す
       if arr[i]>=0 and max_plus==-1:
         max_plus=arr[i]
       if arr[i]<0 and max_minus==1:
         max_minus=arr[i]
     if min_plus==-1: #もし最小の非負の数がなければ、最小の負の数を取り除くしかない
       arr.remove(min_minus)
       ans=1
       for i in range(k-1):
         ans*=arr[i]
         ans%=mod
       ans*=max_plus
       ans%=mod
     elif min_minus==1: #もし最小の負の数がなければ、最小の非負の数を取り除くしかない
       arr.remove(min_plus)
       ans=1
       for i in range(k-1):
         ans*=arr[i]
         ans%=mod
       ans*=max_minus
       ans%=mod
     elif min_plus*max_plus>=min_minus*max_minus: #そうでなければより倍率の大きいほうを選ぶ
       arr.remove(min_minus)
       ans=1
       for i in range(k-1):
         ans*=arr[i]
         ans%=mod
       ans*=max_plus
       ans%=mod
     else:
       arr.remove(min_plus)
       ans=1
       for i in range(k-1):
         ans*=arr[i]
         ans%=mod
       ans*=max_minus
       ans%=mod
     print(ans)

Fixed submission:
n=int(input())
ans=0
for i in range(1,n+1): #頂点数の総和を求める
 ans+=i*(n-i+1)
for _ in range(n-1): #各辺についてu*(n-v+1)を頂点数の総和から引く
 u,v=map(int,input().split())
 if u>v: #上記ではu<vを仮定しているのでu>vのときuとvを入れ替える
   u,v=v,u
 ans-=u*(n-v+1)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
ans = 1
lim = 10**18
for i in range(n):
	ans = ans * a[i]

if ans > lim:
	print(-1)
else:
	print(ans)

Fixed submission:
import sys
n = int(input())
a = list(map(int,input().split()))
ans = 1

if 0 in a:
	print(0)
	sys.exit()

for i in range(n):
	ans = ans * a[i]
	if ans > 1000000000000000000:
		print(-1)
		sys.exit()

print(ans)

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

if ans > 10**18:
	print(-1)
else:
	print(ans)


Fixed submission:
import sys
n = int(input())
a = list(map(int,input().split()))
ans = 1

if 0 in a:
	print(0)
	sys.exit()

for i in range(n):
	ans = ans * a[i]
	if ans > 1000000000000000000:
		print(-1)
		sys.exit()

print(ans)

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

if ans > 10**18:
	print(-1)
else:
	print(ans)


Fixed submission:
import sys
n = int(input())
a = list(map(int,input().split()))
ans = 1

if 0 in a:
	print(0)
	sys.exit()

for i in range(n):
	ans = ans * a[i]
	if ans > 1000000000000000000:
		print(-1)
		sys.exit()

print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
if n>=30:
  print("Yes)
else:
  print("No")

Fixed submission:
n=int(input())
if n>=30:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
num = 7
k = int(input())
count=1
# i=1
while(True):
    if(num%k==0):
        print(count)
        break
    if(count>k):
        print(-1)
        break
    num = num*10+7
    count+=1
    



Fixed submission:
num = 7
k = int(input())
count=1
# i=1
while(True):
    if((num%k)==0):
        print(count)
        break
    if(count>k):
        print(-1)
        break
    num = (num*10+7)%k
    count+=1
Buggy python submission (verdict: Runtime Error):
m,n=map(int,raw_input().split())
a=[]*m
b=[]*n
p=0
q=0
while(q<m):
	q+=1
	a.append(raw_input())
while(p<n):
	p+=1
	b.append(raw_input())
flag=False
# print a
# print b
for i in xrange(n):
	if not b[i] in (a[i]):
		flag=True
		break
if flag:
	print "No"
else:
	print "Yes"

Fixed submission:
a,b=map(int,raw_input().split())
if a==1:
	a=14
if b==1:
	b=14
 
def val():

	if(a>b):
		return "Alice"
	elif b>a:
		return "Bob"
	return "Draw"
print (val())

Buggy python submission (verdict: Runtime Error):
a,b=map(int,raw_input().split())

def val():
	if a==1 or (a>b and b!=1):
		return "ALICE"
	else:
		return "BOB"
print (val())	

Fixed submission:
a,b=map(int,raw_input().split())
if a==1:
	a=14
if b==1:
	b=14
 
def val():

	if(a>b):
		return "Alice"
	elif b>a:
		return "Bob"
	return "Draw"
print (val())
Buggy python submission (verdict: Time Limit Exceeded):
# http://abc051.contest.atcoder.jp/tasks/abc051_b
K,N=map(int,raw_input().split())
count=0
for i in range(K+1):
	for j in range(K+1):
		for k in range(K+1):
			if i+j+k==N:
				count+=1
print count

Fixed submission:
# http://abc051.contest.atcoder.jp/tasks/abc051_b
K,N=map(int,raw_input().split())
count=0
for i in range(K+1):
	for j in range(K+1):
		# print i,j,(N-(i+j))
		if 0<=(N-(i+j))<=K:
			count+=1
print count
Buggy python submission (verdict: Time Limit Exceeded):
import sys

k = int(input())
result = -1
count = 0
seven = 0
remainder = 0
aryRemainder = []

if k%2 == 0:
  print(result)
  sys.exit()

while not(remainder in aryRemainder):
  aryRemainder.append(remainder)
  seven = seven*10+7
  count += 1
  remainder = seven % k
  if remainder == 0:
    result = count
    break
  

print(result)

Fixed submission:
k = int(input())
cnt = 1
num = 7

if k%2 == 0 or k%5 == 0:
  print(-1)
  exit()

while 1:
  num %= k
  if num == 0:
    break
  num = num*10+7
  cnt += 1
  
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
S = input()[::-1]

modCount = [0]*2019
modCount[0] = 1
mod = 0
result = 0

for i in range(len(S)):
  mod = (int(S[i:i+1])*(10**i)+mod)%2019
  result += modCount[mod]
  modCount[mod] += 1

print(result)

Fixed submission:
S = input()[::-1]

modCount = [0]*2019
modCount[0] = 1
mod = 0
dig = 1
result = 0

for i in range(len(S)):
  mod = (int(S[i:i+1])*dig+mod)%2019
  dig = (dig*10)%2019
  result += modCount[mod]
  modCount[mod] += 1

print(result)

Buggy python submission (verdict: Time Limit Exceeded):
S = input()

mods = [0]*2019
result = 0

for i in range(len(S)+1):
  x = int(S[len(S)-i: len(S)])%2019 if i>0 else 0
  result += mods[x]
  mods[x] += 1

print(result)

Fixed submission:
S = input()[::-1]

modCount = [0]*2019
modCount[0] = 1
mod = 0
dig = 1
result = 0

for i in range(len(S)):
  mod = (int(S[i:i+1])*dig+mod)%2019
  dig = (dig*10)%2019
  result += modCount[mod]
  modCount[mod] += 1

print(result)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

for i in range(1, n+1):
  print(a.count(i))


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
ary = [0]*n

for x in a:
  ary[x-1] += 1

print('\r'.join(map(str, ary)))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = input()
result = 0
r = g = b = []

for x in range(n):
  if s[x]=='R':
    r.append(x)
  if s[x]=='G':
    g.append(x)
  if s[x]=='B':
    b.append(x)

for i in r:
  si = s[i]
  for j in g:
    sj = s[j]
    if i>j or sj==si:
      continue
    for k in b:
      sk = s[k]
      if j>k or sk==si or sk==sj:
        continue
      if j-i != k-j:
        result += 1

print(result)

Fixed submission:
import math

n = int(input())
s = input()
ex = 0

for i in range(n-2):
  for x in range(1, int(math.ceil((n-i)/2))):
    if s[i] != s[i+x] and s[i] != s[i+2*x] and s[i+x] != s[i+2*x]:
      ex += 1

print(s.count("R") * s.count("G") * s.count("B")-ex)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = input()
result = 0

for i in range(0, n-2):
  si = s[i]
  for j in range(i+1, n-1):
    sj = s[j]
    if sj==si:
      continue
    for k in range(j+1, n):
      sk = s[k]
      if sk==si or sk==sj:
        continue
      if j-i != k-j:
        result += 1

print(result)

Fixed submission:
import math

n = int(input())
s = input()
ex = 0

for i in range(n-2):
  for x in range(1, int(math.ceil((n-i)/2))):
    if s[i] != s[i+x] and s[i] != s[i+2*x] and s[i+x] != s[i+2*x]:
      ex += 1

print(s.count("R") * s.count("G") * s.count("B")-ex)
Buggy python submission (verdict: Runtime Error):
x = input()

if -40 <= x and x <= 40:
    if x >= 30:
        print("Yes")
    else:
        print("No")

Fixed submission:
x = int(input())

if -40 <= x and x <= 40:
    if x >= 30:
        print("Yes")
    else:
        print("No")

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

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

Fixed submission:
x = int(input())

if -40 <= x and x <= 40:
    if x >= 30:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
import sys


input = list()
N, D = sys.stdin
for item in sys.stdin:
    input.append(item)

count = 0
for item in input:
    if 1 <= N and N <= 2*10**5:
        if 0 <= D and D <= 2*10**5:
            if abs(item[0]) <= 2*10**5 and abs(item[1]) <= 2*10**5:
                if D >= (int(item[0])**2 + int(item[1])**2)**(1/2):
                    count += 1
print(count)

Fixed submission:
import sys


input_array = list()
N, D = map(int, input().split())
if 1 <= N and N <= 2*10**5:
    for _ in range(N):
        input_array.append(map(int, input().split()))

count = 0
for x0, x1 in input_array:
    if 0 <= D and D <= 2*10**5:
        if abs(x0) <= 2*10**5 and abs(x1) <= 2*10**5:            
            if D >= (int(x0)**2 + int(x1)**2)**(1/2):
                count += 1
print(count)

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


input = list()
N, D = sys.stdin
for item in sys.stdin:
    input.append(item)

count = 0
for item in input:
    if 1 <= N and N <= 2*10**5:
        if D <= 0 and D <= 2*10**5:
            if abs(item[0]) <= 2*10**5 and abs(item[1]) <= 2*10**5:            
                if D >= (int(item[0])**2 + item(item[1])**2)**1/2:
                    count += 1
print(count)

Fixed submission:
import sys


input_array = list()
N, D = map(int, input().split())
if 1 <= N and N <= 2*10**5:
    for _ in range(N):
        input_array.append(map(int, input().split()))

count = 0
for x0, x1 in input_array:
    if 0 <= D and D <= 2*10**5:
        if abs(x0) <= 2*10**5 and abs(x1) <= 2*10**5:            
            if D >= (int(x0)**2 + int(x1)**2)**(1/2):
                count += 1
print(count)

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


input = list()
N, D = sys.stdin

for item in sys.stdin:
    input.append(item)

count = 0
for item in input:
    if 1 <= N and N <= 2*10**5:
        if D <= 0 and D <= 2*10**5:
            if abs(item[0]) <= 2*10**5 and abs(item[1]) <= 2*10**5:            
                if D >= (int(item[0])**2 + item(item[1])**2)**1/2:
                    count += 1
print(count)
    

Fixed submission:
import sys


input_array = list()
N, D = map(int, input().split())
if 1 <= N and N <= 2*10**5:
    for _ in range(N):
        input_array.append(map(int, input().split()))

count = 0
for x0, x1 in input_array:
    if 0 <= D and D <= 2*10**5:
        if abs(x0) <= 2*10**5 and abs(x1) <= 2*10**5:            
            if D >= (int(x0)**2 + int(x1)**2)**(1/2):
                count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
S=input()
if S ="ABC":
    print("ARC")
else:
    print("ABC")


Fixed submission:
# coding: utf-8
S=input()
if S =="ABC":
    print("ARC")
else:
    print("ABC")
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
N = int(input())
A = int(input())

c = N%A

if c > A:
    print("No")
else:
    print("Yes")

Fixed submission:
# coding: utf-8
N = int(input())
A = int(input())

c = N%500

if c > A:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
N, A, B= map(int, input().split())
re += N//(A+B) *A
re += min(N%(A+B),A)
print(re)

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

result = 0
result += N // (A + B) * A
result += min(N % (A + B), A)
print(result)

Buggy python submission (verdict: Runtime Error):
N, A, B= map(int, input().split())
re += N//(A+B) 
re += min(N%(A+B),A)
print(re)

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

result = 0
result += N // (A + B) * A
result += min(N % (A + B), A)
print(result)

Buggy python submission (verdict: Runtime Error):
N, A, B= map(int, input().split())
a = [1]*A + [0]*B
li = []
while len(li) < N:
  li.extend(a)
li_N = li[0:N-1]
print(sum(li_N))

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

result = 0
result += N // (A + B) * A
result += min(N % (A + B), A)
print(result)

Buggy python submission (verdict: Runtime Error):
N, A, B= map(int, input().split())
a = [1]*A + [0]*B
li = []
while len(li) < N:
  li.extend(a)
li_N = li[:N-1]
print(sum(li_N))

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

result = 0
result += N // (A + B) * A
result += min(N % (A + B), A)
print(result)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
C = []
D = []
for i in range(100):
  if math.floor(i*0.08) == a:
    C.append(i)
  if math.floor(i*0.1) == b:
    D.append(i)
if list(set(C) & set(D)):
  print('-1')
else:
  print(list(set(C) & set(D)))

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

for i in range(1300):
  if math.floor(i*0.08) == a and math.floor(i*0.1) == b:
    print(i)
    exit()
print('-1')
Buggy python submission (verdict: Runtime Error):
N, R = map(int, input().split())
if N < 10:
    print(100*(10-K) + R)
else:
    print(R)


Fixed submission:
N, R = map(int, input().split())
if N < 10:
    print(100*(10-N) + R)
else:
    print(R)