Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# number of balls
N = input()
# ball values
K = list(map(int, input().split()))

# get ball counts
ball_counts = {}
for i in range(len(K)):
    ball_value = K[i]
    if ball_value in ball_counts:
        ball_counts[ball_value] += 1
    else:
        ball_counts[ball_value] = 1

for i in range(len(K)):
    ball_value = K[i]
    two_equal_values_count = 0
    for value, count in ball_counts.items():
        # check if we can even come up with a pair
        if count > 1:
            if value == ball_value:
                # if we have three balls [1, 1, 1] and the current ball is 1, we want to remove our current 1 and only look at [1, 1]
                two_equal_values_count += (count - 1) * (count - 2) / 2
            else:
                two_equal_values_count += count * (count - 1) / 2

    print(int(two_equal_values_count))

Fixed submission:
# number of balls
N = input()
# ball values
K = list(map(int, input().split()))

# get ball counts
# ball_counts = {}
# for i in range(len(K)):
#     ball_value = K[i]
#     if ball_value in ball_counts:
#         ball_counts[ball_value] += 1
#     else:
#         ball_counts[ball_value] = 1

# for i in range(len(K)):
#     ball_value = K[i]
#     two_equal_values_count = 0
#     for value, count in ball_counts.items():
#         # check if we can even come up with a pair
#         if count > 1:
#             if value == ball_value:
#                 # if we have three balls [1, 1, 1] and the current ball is 1, we want to remove our current 1 and only look at [1, 1]
#                 two_equal_values_count += (count - 1) * (count - 2) / 2
#             else:
#                 two_equal_values_count += count * (count - 1) / 2

# get ball counts
ball_counts = {}
for i in range(len(K)):
    ball_value = K[i]
    if ball_value in ball_counts:
        ball_counts[ball_value] += 1
    else:
        ball_counts[ball_value] = 1

# get sums
total_sum = 0
for value, count in ball_counts.items():
    total_sum += (count * (count - 1)) / 2

# remove extra
for i in range(len(K)):
    ball_value = K[i]
    print(int(total_sum - (ball_counts[ball_value] - 1)))
Buggy python submission (verdict: Runtime Error):
    # N: number of balls to take, A: blue, B: red
    N, A, B = list(map(int, input().split()))

    if N == 0:
        print(0)

    if A + B < N:
        # want to know how much A + B blocks can we place such that A + B < N (i.e. solve x(A+B) < N)
        blocks = int(N/(A+B))
        # for each block, there are A blue balls, plus potentially some reamining slots to fill the remaining space of N
        remaining_slots = N % (A+B)
        if A <= remaining_slots:
            # if it can fit A, place A more balls in the row
            print(blocks*A + A) 
        else:
            print(blocks*A + remaining_slots)
    else:
        if A + B == N:
            print(A)
        else:
            print(A-N)

Fixed submission:
# N: number of balls to take, A: blue, B: red
N, A, B = list(map(int, input().split()))

if N == 0:
    print(0)

if A + B < N:
    # want to know how much A + B blocks can we place such that A + B < N (i.e. solve x(A+B) < N)
    blocks = int(N/(A+B))
    # for each block, there are A blue balls, plus potentially some reamining slots to fill the remaining space of N
    remaining_slots = N % (A+B)
    if A <= remaining_slots:
        # if it can fit A, place A more balls in the row
        print(blocks*A + A) 
    else:
        print(blocks*A + remaining_slots)
else:
    if A < N:
        print(A)
    else:
        print(N)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
ans=[]
for i in range(N):
    S=input()
    if S in ans:
        continue
    else:
        ans.append(S)
print(len(ans))

Fixed submission:
N=int(input())
ans=[]
for i in range(N):
    ans.append(input())
ans_l=set(ans)

print(len(ans_l))
Buggy python submission (verdict: Time Limit Exceeded):
N,K=map(int,input().split())
A=N
for i in range(N+1):
    A=min(A,abs(N-K*i))
print(A)

Fixed submission:
N,K=map(int,input().split())
B=int(N/K)
A=abs(N-(B-1)*K)
while A>=K/2:
    A=min(abs(A-K),abs(A+K),A)
print(A)

Buggy python submission (verdict: Time Limit Exceeded):
N,K=map(int,input().split())
A=N
while A>=K/2:
    A=min(abs(A-K),abs(A+K))
print(A)

Fixed submission:
N,K=map(int,input().split())
B=int(N/K)
A=abs(N-(B-1)*K)
while A>=K/2:
    A=min(abs(A-K),abs(A+K),A)
print(A)
Buggy python submission (verdict: Runtime Error):
R=int(input)
print(R*6.28)

Fixed submission:
R=int(input())
print(R*6.28)
Buggy python submission (verdict: Runtime Error):
N,B,R=map(int,input().split())
b=0
total=0

for i in range(10**100):
    total+=B
    b+=1
    if total>N:
        break
    total+=R
    if total>N:
        break
if B==0:
    print(0)

else:
    print(B*b-(total-N))


Fixed submission:
a=input()
if a[0]==a[1]==a[2]:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
a=input()
if a[1]==a[2]==a[3]:
  print("No")
else:
  print("Yes")

Fixed submission:
a=input()
if a[0]==a[1]==a[2]:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
a=input()
if a[1]==a[2]==a[3]
  print("No")
else:
  print("Yes")

Fixed submission:
a=input()
if a[0]==a[1]==a[2]:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
for i in range(10**100):
    total+=B
    b+=1
    if total>N:
        break
    total+=R
    if total>N:
        break
if B==0:
    print(0)

else:
    print(B*b-(total-N))

Fixed submission:
N,B,R=map(int,input().split())
b=0
i=int(N/(B+R))
tari=N-(i*(B+R))

b+=B*i
if tari >= B:
    b+=B
else:
    b+=tari

print(b)
Buggy python submission (verdict: Runtime Error):
import math 
n=int(input())
print(math.ceil(n/2)

Fixed submission:
import math 
n=int(input())
print(math.ceil(n/2))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
count=1
for i in range(1,100):
    if a/(b**i)>=1:
        count+=1
    else:
        break
print(count)

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

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
count=1
for i in range(1,100):
    if a/(b**i)>1:
        count+=1
    else:
        break
print(count)

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

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
i=1
while a//b>=b:
    a=a//b
    i+=1
if i != 1:
    i+=1
print(i)

Fixed submission:
N,R=map(int,input().split())
if N>= 10:
  print(R)
else:
  print(R+(100*(10-N)))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a==b
    print("Yes")
else:
    print("No")

Fixed submission:
a,b=map(int,input().split())
if a==b:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
Lis=["1","2","3"]
for i in range(3):
  if a!=Lis[i] and b!=Lis[i]:
    print(Lis[i])

Fixed submission:
a=input()
b=input()
Lis=["1","2","3"]
for i in range(3):
  if a!=Lis[i] and b!=Lis[i]:
    print(Lis[i])
Buggy python submission (verdict: Runtime Error):
r=int(input())
print(3*a**2)

Fixed submission:
r=int(input())
print(3*(r**2))
Buggy python submission (verdict: Runtime Error):
Big=["A","B","c"]
Small=["a","b","c"]

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

for i in range(3):
  if S[K]==Big[i]:
    S[K]=Small[i]

print("".join(S))

Fixed submission:
Big=["A","B","C"]
Small=["a","b","c"]

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

for i in range(3):
  if S[K-1]==Big[i]:
    S[K-1]=Small[i]

print("".join(S))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a==b:
    print(a+b)
else:
    c=max(a,b)
print(c+(c-1))


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

if a==b:
    print(a+b)
else:
    c=max(a,b)
    print(c+(c-1))
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
if abs(a-c)<= d 
    print("Yes")
elif abs(a-b)<=d and abs(b-c)<=d:
    print("Yes")
else:
    print("No")

Fixed submission:
a,b,c,d=map(int,input().split())
if abs(a-c)<= d: 
    print("Yes")
elif abs(a-b)<=d and abs(b-c)<=d:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a<=c and a+b<=c
    print("YES")
else:
    print("NO")

Fixed submission:
a,b,c=map(int,input().split())
if a<=c and a+b>=c:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s=[]
s#+=['a']
#s+=['b']
#print(s)
c = 0
ans = 1
for i in range(n):
    s += [input()]
for i in range(1,n):
    for j in range(i):
        if s[i] == s[j]:
            c += 1
    if c == 0:
        ans += 1
    c = 0
print(ans)

Fixed submission:
n = int(input())
s=[]
ans = 1
for i in range(n):
    s += [input()]
s.sort()
for i in range(n-1):
    if s[i] != s[i+1]:
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
if n%2==1:
  ans=(n+1)/(2*n)
else:
  ans=0.5
printa(ans)
    

Fixed submission:
n=int(input())
if n%2==1:
  ans=(n+1)/(2*n)
else:
  ans=0.5
print(ans)
Buggy python submission (verdict: Runtime Error):
n,k＝ map(int,input().split())
if k=1:
    print(0)
else:
    print(n-k)

Fixed submission:
n,k= map(int,input().split())
if k==1:
    ans=0
else:
    ans=n-k
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
s=list(input())
k=int(input())
ans=''
for i in range(n):
    if s[i]==s[k]:
        ans+=s[i]
    else:
        ans+='*'
print(ans)

Fixed submission:
n=int(input())
s=list(input())
k=int(input())
ans=''
for i in range(n):
    if s[i]!=s[k-1]:
        ans+='*'
    else:
        ans+=s[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
b=input()
if b=='A':
  a='T'
elif b=='T':
  a='A':
elif b=='C':
  a='G':
else:
  a='C'
 print(a)

Fixed submission:
b=input()
if b=='A':
    a='T'
elif b=='T':
    a='A'
elif b=='C':
    a='G'
else:
    a='C'
print(a)
Buggy python submission (verdict: Time Limit Exceeded):
n,q=map(int,input().split())
s=input()
l=[0]*q
r=[0]*q
c=[0]*n
ans=0
for i in range(q):
    l[i],r[i]=map(int,input().split())
t=0
for i in range(n-1):
    if s[i]=='A' and s[i+1]=='C':
        c[t]=i+1
        t+=1
for i in range(q):
    t=0
    while(c[t]!=0):
        if c[t]>=l[i] and c[t]<r[i]:
            ans+=1
        t+=1
    print(ans)
    ans=0

Fixed submission:
n,q=map(int,input().split())
s=input()
l=[0]*q
r=[0]*q
c=[0]*n
ans=0
for i in range(q):
    l[i],r[i]=map(int,input().split())
if s[0]=='A' and s[1]=='C':
    c[0]=1
for i in range(1,n-1):
    if s[i]=='A' and s[i+1]=='C':
        c[i]=c[i-1]+1
    else:
        c[i]=c[i-1]
for i in range(q):
    print(c[r[i]-2]-c[l[i]-2])

Buggy python submission (verdict: Time Limit Exceeded):
n,q=map(int,input().split())
s=input()
l=[0]*q
r=[0]*q
c=0
for i in range(q):
    l[i],r[i]=map(int,input().split())
for i in range(q):
    for j in range(l[i],r[i]):
        if s[j-1]=='A':
            if s[j]=='C':
                c+=1
    print(c)
    c=0

Fixed submission:
n,q=map(int,input().split())
s=input()
l=[0]*q
r=[0]*q
c=[0]*n
ans=0
for i in range(q):
    l[i],r[i]=map(int,input().split())
if s[0]=='A' and s[1]=='C':
    c[0]=1
for i in range(1,n-1):
    if s[i]=='A' and s[i+1]=='C':
        c[i]=c[i-1]+1
    else:
        c[i]=c[i-1]
for i in range(q):
    print(c[r[i]-2]-c[l[i]-2])

Buggy python submission (verdict: Time Limit Exceeded):
n,q=map(int,input().split())
s=input()
l=[0]*q
r=[0]*q
c=[0]*q
for i in range(q):
    l[i],r[i]=map(int,input().split())
for i in range(q):
    for j in range(l[i],r[i]):
        if s[j-1]=='A' and s[j]=='C':
            c[i]+=1
for i in range(q):
    print(c[i])

Fixed submission:
n,q=map(int,input().split())
s=input()
l=[0]*q
r=[0]*q
c=[0]*n
ans=0
for i in range(q):
    l[i],r[i]=map(int,input().split())
if s[0]=='A' and s[1]=='C':
    c[0]=1
for i in range(1,n-1):
    if s[i]=='A' and s[i+1]=='C':
        c[i]=c[i-1]+1
    else:
        c[i]=c[i-1]
for i in range(q):
    print(c[r[i]-2]-c[l[i]-2])

Buggy python submission (verdict: Time Limit Exceeded):
n,q=map(int,input().split())
s=input()
l=[0]*q
r=[0]*q
c=[0]*q
for i in range(q):
    l[i],r[i]=map(int,input().split())
for i in range(q):
    for j in range(l[i],r[i]):
        if s[j-1]=='A' and s[j]=='C':
            c[i]+=1
for i in range(q):
    print(c[i])

Fixed submission:
n,q=map(int,input().split())
s=input()
l=[0]*q
r=[0]*q
c=[0]*n
ans=0
for i in range(q):
    l[i],r[i]=map(int,input().split())
if s[0]=='A' and s[1]=='C':
    c[0]=1
for i in range(1,n-1):
    if s[i]=='A' and s[i+1]=='C':
        c[i]=c[i-1]+1
    else:
        c[i]=c[i-1]
for i in range(q):
    print(c[r[i]-2]-c[l[i]-2])
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
c=[0]*m
for i in range(n):
    li=list(map(int,input().split()))
    for j in range(li[0]):
        c[li[j+1]-1]+=1
        ans=0
for i in range(n):
    if c[i]==n:
        ans+=1
print(ans)

Fixed submission:
n,m=map(int,input().split())
c=[0]*m
for i in range(n):
    li=list(map(int,input().split()))
    for j in range(li[0]):
        c[li[j+1]-1]+=1
        ans=0
for i in range(m):
    if c[i]==n:
        ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
s=list(input())
k=int(input())
ans=''
for i in range(n):
    if s[i]==s[k]:
        ans+=s[i]
    else:
        ans+='*'
print(ans)

Fixed submission:
n=int(input())
li=list(map(int,input().split()))
m=max(li)
sum=0
for i in range(n):
    sum+=li[i]
if m<sum-m:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
s,w=map(int,input().split())
if(s<w) 
  print("unsafe")
else
  print("safe")

Fixed submission:
s,w=map(int,input().split())
if s>w: 
	print("safe")
else:
	print("unsafe")

Buggy python submission (verdict: Runtime Error):
s=input()
w=input()
if(s<w) 
  print("unsafe")
else
  print("safe")

Fixed submission:
s,w=map(int,input().split())
if s>w: 
	print("safe")
else:
	print("unsafe")

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int, input().split())
while True:
	b -= c
	if c<=0:
      print"Yes"
      break
	a -=d
	if a<=0:
      print"No"
      break


Fixed submission:
S,W=map(int, input().split())
print("safe" if S>W else "unsafe")
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int, input().split())
while True:
  	b -= c
 	if c<=0:
   		print("Yes")
    	break
    a -=d
    if a<=0:
		print("No")
      	break


Fixed submission:

a, b, c, d = map(int, input().split())

while True:
  c -= b
  if c <= 0:
    print('Yes')
    break
  
  a -= d
  if a <= 0:
    print('No')
    break

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int, input().split())
while True:
	b -= c
	if c<=0:
      print("Yes")
      break
	a -=d
	if a<=0:
      print("No")
      break


Fixed submission:

a, b, c, d = map(int, input().split())

while True:
  c -= b
  if c <= 0:
    print('Yes')
    break
  
  a -= d
  if a <= 0:
    print('No')
    break

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int, input().split())
while True:
	b -= c
	if c<=0 print("Yes"):
      	break
	a -=d
	if a<=0 print("No"):
      	break


Fixed submission:

a, b, c, d = map(int, input().split())

while True:
  c -= b
  if c <= 0:
    print('Yes')
    break
  
  a -= d
  if a <= 0:
    print('No')
    break

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int, input().split())
while True:
	b -= c
	if c<=0 print"Yes":
      	break
	a -=d
	if a<=0 print"No":
      	break


Fixed submission:

a, b, c, d = map(int, input().split())

while True:
  c -= b
  if c <= 0:
    print('Yes')
    break
  
  a -= d
  if a <= 0:
    print('No')
    break

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int, input().split())
while True:
	b -= c
	if c<=0 print"Yes" break
	a -=d
	if a<=0 print"No" break


Fixed submission:

a, b, c, d = map(int, input().split())

while True:
  c -= b
  if c <= 0:
    print('Yes')
    break
  
  a -= d
  if a <= 0:
    print('No')
    break

Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int, input().split())
while
	b -= c
	if c<=0
		print"Yes"
 		break
	a -=d
	if a<=0
      	print"No"
        break

Fixed submission:

a, b, c, d = map(int, input().split())

while True:
  c -= b
  if c <= 0:
    print('Yes')
    break
  
  a -= d
  if a <= 0:
    print('No')
    break
Buggy python submission (verdict: Runtime Error):
 print(int(input())*6.3)


Fixed submission:
r=int(input())
print(2*3.14*r)
Buggy python submission (verdict: Runtime Error):
s = "input()"
if s[0] = 7:
  print("Yes")
elif s[1] = 7:
  print("Yes")
elif s[2] = 7:
  print("Yes")
else:
  print("No")

Fixed submission:
s = str(input())
if s[0] is "7":
  print("Yes")
elif s[1] is "7":
  print("Yes")
elif s[2] is "7":
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
s = "input()"
if s[0] = 7:
  print(Yes)
elif s[1] = 7:
  print(Yes)
elif s[2] = 7:
  print(Yes)
else:
  print(No)

Fixed submission:
s = str(input())
if s[0] is "7":
  print("Yes")
elif s[1] is "7":
  print("Yes")
elif s[2] is "7":
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
s = str(input())
if s[0] = 7:
  print(Yes)
elif s[1] = 7:
  print(Yes)
elif s[2] = 7:
  print(Yes)
else:
  print(No)

Fixed submission:
s = str(input())
if s[0] is "7":
  print("Yes")
elif s[1] is "7":
  print("Yes")
elif s[2] is "7":
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
s = input()
if s[0] = 7:
  print(Yes)
elif s[1] = 7:
  print(Yes)
elif s[2] = 7:
  print(Yes)
else:
  print(No)

Fixed submission:
s = str(input())
if s[0] is "7":
  print("Yes")
elif s[1] is "7":
  print("Yes")
elif s[2] is "7":
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
s = input()
if s in 7:
  print(Yes)
  else:
    print(No)


Fixed submission:
s = str(input())
if s[0] is "7":
  print("Yes")
elif s[1] is "7":
  print("Yes")
elif s[2] is "7":
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s = [input()]
print(s[2], s[0], s[1])

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

Buggy python submission (verdict: Runtime Error):
s = [input(),input(),input()]
print(s[2], s[0], s[1])

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

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
u = input()
print(u, s, t)

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

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
u = inpuy()
print(t, u, s)

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

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
u = input()
print(t u s)

Fixed submission:
a,b,c=map(int,input().split())
print(c, a, b)
Buggy python submission (verdict: Runtime Error):
s = str(input())
if s[2]==s[3] and s[4]==s[5]:
    print(Yes)
else:
    print(No)

Fixed submission:
s = str(input())
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
s = input()
if s[2]==s[3] and s[4]==s[5]:
    print(Yes)
else:
    print(No)

Fixed submission:
s = str(input())
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import math
n,m = map(int,input().split())
if n is 0 or n is 1:
  print(math.factorial(m)/math.factorial(m-2)/2)
if m is 0 or m is 1:
  print(math.factorial(n)/math.factorial(n-2)/2)
else:
  print(math.factorial(n+m)/math.factorial(n+m-2)/2)

Fixed submission:
n,m = map(int,input().split())
print(int(n*(n-1)/2 + m*(m-1)/2))

Buggy python submission (verdict: Runtime Error):
n = input()
m = input()
print(math.factorial(n+m))

Fixed submission:
n,m = map(int,input().split())
print(int(n*(n-1)/2 + m*(m-1)/2))

Buggy python submission (verdict: Runtime Error):
n = input()
m = input()
if n=0 or n=1:
  print(math.factorial(m))
if m=0 or m=1:
  print(math.factorial(n))
else:
  print(math.factorial(n+m))

Fixed submission:
n,m = map(int,input().split())
print(int(n*(n-1)/2 + m*(m-1)/2))
Buggy python submission (verdict: Runtime Error):
s = str(input())
if s="AAA" or s="BBB":
  print("No")
else:
  print("No")  

Fixed submission:
s = str(input())
if s == "AAA":
  print("No")
elif s == "BBB":
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
s = input()
print(s//2 + s%2)

Fixed submission:
s = int(input())
print(s//2 + s%2)
Buggy python submission (verdict: Runtime Error):
n,k = input().split()
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Buggy python submission (verdict: Runtime Error):
n = input()
k = input()
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
if n>=10:
    print("k")
else:
    print("k+(100*(10-n))")

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
if n>=10:
    print(int(k))
else:
    print(int(k+(100*(10-n))))

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Buggy python submission (verdict: Runtime Error):
n = input()
k = input()
if n>=10:
    print(k)
else:
    print(k+(100*(10-n)))

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
if n>=10:
    print(k)
else:
    print(k+(100*(10-n)))

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
if n>=10:
  print(k)
else:
  print(k-(100*(10-n)))

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Buggy python submission (verdict: Runtime Error):
n = int(input())
k = int(input())
if n>=10:
  print(k)
else:
  print(k-(100*(10-n))

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))

Buggy python submission (verdict: Runtime Error):
n = int(input())
k = (input())
if n>=10:
  print(k)
else:
  print(k-(100*(10-n))

Fixed submission:
n,k = map(int,input().split())
if n >= 10:
    print(k)
else:
    print(k+(100*(10-n)))
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if a = b and not a = b = c:
  print("Yes")
elif b = c and not a = b = c:
  print("Yes")
elif c = a and not a = b = c:
  print("Yes")
else:
  print("No")

Fixed submission:
a,b,c = map(int,input().split())
if a is b and not a is b is c:
  print("Yes")
elif b is c and not a is b is c:
  print("Yes")
elif c is a and not a is b is c:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
An = map(int,input().split())
Bn = map(int,input().split())
ans=0
for b in range(len(Bn)):
    left = min(An[b],Bn[b])
    ans+=left
    An[b]-=left
    Bn[b]-=left
    right = min(An[b+1],Bn[b])
    ans+=right
    An[b+1]-=right
    Bn[b]-=right
print(ans)


Fixed submission:
N = int(input())
An = list(map(int,input().split()))
Bn = list(map(int,input().split()))
ans=0
for b in range(len(Bn)):
    left = min(An[b],Bn[b])
    ans+=left
    An[b]-=left
    Bn[b]-=left
    right = min(An[b+1],Bn[b])
    ans+=right
    An[b+1]-=right
    Bn[b]-=right
print(ans)