Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
S, T = input().split()
s_i, t_i = map(int, input().split())
U = input()

if U == S:
    print(str(s_i - 1) + " " + str(t_i))
else
    print(str(s_i) + " " + str(t_i - 1))

Fixed submission:
S, T = input().split()
s_i, t_i = map(int, input().split())
U = input()

if U == S:
    print(str(s_i - 1) + " " + str(t_i))
else:
    print(str(s_i) + " " + str(t_i - 1))
Buggy python submission (verdict: Runtime Error):
N, D = input().split()
each = D*2 + 1 
print(-(-N // each))


Fixed submission:
N, D = input().split()
each = int(D)*2 + 1 
print(-(-int(N) // each))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
D = []
for _ in range(N):
  D.append(int(input()))
 
for i in range(len(D)):
    TD = D.copy()
    del(TD[i])
    print(max(TD))

Fixed submission:
from copy import copy

N = int(input())
D = []
for _ in range(N):
    D.append(int(input()))

DD = copy(D)
v1 = max(D)
m1 = D.index(v1)

del D[m1]
v2 = max(D)

[print(v2) if i == v1 else print(v1) for i in DD]
Buggy python submission (verdict: Runtime Error):

data = []

data.extend(list(map(int, input().split(str))))
N = data[0]
K = data[1]

if K == 1:
    print(0)
else:
    print(N - K)

Fixed submission:
data = []

data.extend(list(map(int, input().split(" "))))
N = data[0]
K = data[1]

if K == 1:
    print(0)
else:
    print(N - K)

Buggy python submission (verdict: Runtime Error):

data = []

data.extend(list(map(int, input().split(str))))
N = data[0]
K = data[1]

if K == 1:
    print(0)
else:
    print(K - N)

Fixed submission:
data = []

data.extend(list(map(int, input().split(" "))))
N = data[0]
K = data[1]

if K == 1:
    print(0)
else:
    print(N - K)
Buggy python submission (verdict: Time Limit Exceeded):
a, b, m = map(int, input().split())

aa = list(map(int, input().split()))
bb = list(map(int, input().split()))

mm = list()
for ii in range(0,m):
    mm.append(list(map(int, input().split())))

prices = list()

for ml in mm:
    prices.append(aa[ml[0]-1] + bb[ml[1]-1] - ml[2])

for al in aa:
    for bl in bb:
        prices.append(al + bl)

print(min(prices))


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

aa = list(map(int, input().split()))
bb = list(map(int, input().split()))

mm = list()
for ii in range(0,m):
    mm.append(list(map(int, input().split())))

prices = list()

prices.append(int(min(aa)) + int(min(bb)))

for ml in mm:
    prices.append(aa[ml[0]-1] + bb[ml[1]-1] - ml[2])

print(min(prices))
Buggy python submission (verdict: Runtime Error):
S = input()

if S[2] == s[3] and s[4] == s[5]:
  print('Yes')

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):
# 各条件の入力
a, b, c = map(int, input().split())

# 答えの出力
import math

"""
素直にやると誤差で死ぬ
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
    ans = 'Yes'
else:
    ans = 'No'
"""


# 整数でやる
left = a + b + (math.sqrt(a*b))*2
right = c

left2 = ((math.sqrt(a*b))*2) **2
right2 = (c - a - b) **2

left3 = 4*a*b
right3 = right2

if (c - a - b) < 0:
    ans = 'No'
elif left3 < right3:
    ans = 'Yes'
else:
    ans = 'No'

# 出力
print(ans)


Fixed submission:
l = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
i = int(input())-1
print(l[i])

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

# 答えの出力

if (a**2 + b**2) + (2*(a*b)) < c**2:
    ans = 'Yes'
else:
    ans = 'No'

# 出力
print(ans)




Fixed submission:
l = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
i = int(input())-1
print(l[i])

Buggy python submission (verdict: Runtime Error):

l = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
# 各条件の入力
i = int(input())
# 答えの出力
print(l[i])


Fixed submission:
l = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
i = int(input())-1
print(l[i])
Buggy python submission (verdict: Time Limit Exceeded):
a, b, k = [ int(_) for _ in input().split() ]

if k >= a+b:
  print(0, 0)
  exit()

while k > 0:
  k -= 1
  if a >= 1:
    a -= 1
    pass
  elif b >= 1:
    b -= 1
    
print(a, b)

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

if k <= a:
  print(a-k, b)
elif a < k <= a+b:
  print(0, b-(k-a) )
elif a+b < k:
  print(0,0)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = [ int(_) for _ in input().split() ]
h = [ int(_) for _ in input().split() ]

h.sort()

for i in range(len(h)):
  if max(h) < k:
    ans = 0
    break
  elif h[i] >= k:
    ans = len(h[i:])
    break
  
    
print(ans)

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

h.sort(reverse=True)
flag = True
if h[n-1]>k:
	ans = n
	flag = False
elif h[0] < k:
	ans = 0
	flag = False
#k==max(h)とk==min(h)と合致する場合の分岐がなく、ans=0になっていた
elif h[n-1]==k:
	ans = n
elif h[0]==k:
	ans = h.count(h[0])
if flag == True:
	for i in range(0,n):
		if h[i] < k:
			ans = len(h[0:i])
			break

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = [ int(_) for _ in input().split() ]
a = [ int(input()) for _ in range(q) ]

p = [ k for _ in range(n) ]

for x in a:
	p[x-1] += 1
	p = [ y-1 for y in p ]

ans = []

for z in p:
	if z > 0:
		ans.append('Yes')
	else:
		ans.append('No')

for blah in ans:
	print(blah)

Fixed submission:
n, k, q = [ int(_) for _ in input().split() ]
a = [ int(input()) for _ in range(q) ]

p = [ k for _ in range(n) ]

p = [ y-q for y in p ]

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

ans = []

for z in p:
	if z > 0:
		ans.append('Yes')
	else:
		ans.append('No')

for blah in ans:
	print(blah)
Buggy python submission (verdict: Runtime Error):
a = int(input())
s = int(input())

print(s if a >= 3200 else 'red' )

Fixed submission:
a = int(input())
s = input()

print(s if a >= 3200 else 'red' )
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline

def main():
    n = int(input())
    sl = [ list(input()) for _ in range(n) ]
    ans = 0

    
    for i in sl:
        i.sort() #sort() methodは元を変える
    
    st = tuple(sl)
    
    for i in range(len(st)-1):
        for j in range(i+1,len(st)):
            if st[i] == st[j]:
                ans += 1

    print(ans)

if __name__ == '__main__':
    main()

Fixed submission:
A ={}
c = 0
for i in range(int(input())):
    a = str(sorted(input()))
    if a in A:
        A[a] += 1
        c += A[a]
    else:
        A[a] = 0
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    sl = [ list(input()) for _ in range(n) ]
    ans = 0

    
    for i in sl:
        i.sort() #sort() methodは元を変える
    
    st = tuple(sl)
    
    for i in range(len(st)-1):
        for j in range(i+1,len(st)):
            if sl[i] == sl[j]:
                ans += 1

    print(ans)

if __name__ == '__main__':
    main()

Fixed submission:
A ={}
c = 0
for i in range(int(input())):
    a = str(sorted(input()))
    if a in A:
        A[a] += 1
        c += A[a]
    else:
        A[a] = 0
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    sl = [ list(input()) for _ in range(n) ]
    ans = 0

    
    for i in sl:
        i.sort()
        
    st = tuple(sl)
    
    for i in range(len(st)-1):
        for j in range(i+1,len(st)):
            if sl[i] == sl[j]:
                ans += 1

    print(ans)

if __name__ == '__main__':
    main()

Fixed submission:
A ={}
c = 0
for i in range(int(input())):
    a = str(sorted(input()))
    if a in A:
        A[a] += 1
        c += A[a]
    else:
        A[a] = 0
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [ input() for _ in range(n) ]
sl =[]
ans = 0

for i in s:
    sl.append(list(i))
    
for i in sl:
    i.sort() #sort() methodは　元を変える
    
for i in range(len(sl)-1):
    for j in range(i+1,len(sl)):
        if sl[i] == sl[j]:
            ans += 1
            
print(ans)

Fixed submission:
A ={}
c = 0
for i in range(int(input())):
    a = str(sorted(input()))
    if a in A:
        A[a] += 1
        c += A[a]
    else:
        A[a] = 0
print(c)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [ input() for _ in range(n) ]
sl =[]
ans = 0

for i in s:
    sl.append(list(i))
    
for i in sl:
    i.sort() #sort() methodは　元を変える
    
for i in range(len(sl)-1):
    for j in range(i+1,len(sl)):
        if sl[i] == sl[j]:
            ans += 1
            
print(ans)

Fixed submission:
A ={}
c = 0
for i in range(int(input())):
    a = str(sorted(input()))
    if a in A:
        A[a] += 1
        c += A[a]
    else:
        A[a] = 0
print(c)
Buggy python submission (verdict: Runtime Error):
# ABC 136 C
n = int(input())
h = [ int(_) for _ in input().split() ]
flag = True

for i in range(len(h)-1, 0, -1):
    if h[i-1] > h[i] +1:
        h[i-1] = h[i-1]-1  
        
for j in range(0,len(h)-1):
    if h[j] > h[j+1]:
        print('No')
        flag = False
        break
        
if flag == True:
    print('Yes')

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

if c-a+b > 0:
    print(c-a+b)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
# ABC 136 C
n = int(input())
h = [ int(_) for _ in input().split() ]
flag = True

for i in range(len(h)-1, 0, -1):
    if h[i-1] > h[i] +1:
        h[i-1] = h[i-1]-1  
        
for j in range(0,len(h)-1):
    if h[j] > h[j+1]:
        print('No')
        flag = False
        break
        
if flag == True:
    print('Yes')

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

if c-a+b > 0:
    print(c-a+b)
else:
    print(0)

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

if n >= 100000:
    print(90909)
elif n >= 10000:
    print(n-9090)
elif n >= 1000:
    print(909)
elif n >= 100:
    print(n-90)
elif n >= 10:
    print(9)
else:
    print(n)



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

if c-a+b > 0:
    print(c-a+b)
else:
    print(0)

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

if n >= 100000:
    print(90909)
elif n >= 10000:
    print(n-9090)
elif n >= 1000:
    print(909)
elif n >= 100:
    print(n-90)
elif n >= 10:
    print(n)

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

if c-a+b > 0:
    print(c-a+b)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
if n >= 100000:
    print(90909)
elif n >= 10000:
    print(n-9090)
elif n >= 1000:
    print(909)
elif n >= 100:
    print(n-90)
elif n >= 10:
    print(n)

Fixed submission:
n =int(input())

if n < 10:
    print(n)
elif 10 <= n < 100:
    print(9)
elif 100 <= n <1000:
    print(n-90)
elif 1000 <= n < 10000:
    print(909)
elif 10000 <= n < 100000:
    print(n-9090)
elif 100000 <= n < 1000000:
    print(90909)

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

if n < 10:
    print(n)
elif 10 <= n < 100:
    print(9)
elif 100 <= n <1000:
    print(n-90)
elif 1000 <= n < 10000:
    print(909)
elif 10000 <= n < 100000:
    print(n-9090)
elif 100000<= n < 1000000:
    print(90909)



Fixed submission:
n =int(input())

if n < 10:
    print(n)
elif 10 <= n < 100:
    print(9)
elif 100 <= n <1000:
    print(n-90)
elif 1000 <= n < 10000:
    print(909)
elif 10000 <= n < 100000:
    print(n-9090)
elif 100000 <= n < 1000000:
    print(90909)
Buggy python submission (verdict: Runtime Error):
n = int(input())
h = [ int(_) for _ in input().split() ]
flag = True

for i in range(len(h)-1, 0, -1):
    if h[i] == h[i+1] +1:
        h[i] = h[i]-1  
        
for j in range(0,len(h)-1):
    if h[j] > h[j+1]:
        print('No')
        flag = False
        break
        
if flag == True:
    print('Yes')

Fixed submission:
# ABC 136 C
n = int(input())
h = [ int(_) for _ in input().split() ]
flag = True

for i in range(len(h)-1, 0, -1):
    if h[i-1] == h[i] +1:
        h[i-1] = h[i-1]-1  
        
for j in range(0,len(h)-1):
    if h[j] > h[j+1]:
        print('No')
        flag = False
        break
        
if flag == True:
    print('Yes')

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = [ int(_) for _ in input().split() ]

for i in range(0,h-1):
    if h[i] > h[i+1]:
        h[i] = h[i]-1
    print(h)   
        
for i in range(0,h-1):
    if h[j] > h[j+1]:
        print('No')
        exit()
        
print('Yes')

Fixed submission:
# ABC 136 C
n = int(input())
h = [ int(_) for _ in input().split() ]
flag = True

for i in range(len(h)-1, 0, -1):
    if h[i-1] == h[i] +1:
        h[i-1] = h[i-1]-1  
        
for j in range(0,len(h)-1):
    if h[j] > h[j+1]:
        print('No')
        flag = False
        break
        
if flag == True:
    print('Yes')

Buggy python submission (verdict: Runtime Error):
n = int(input())
h = [ int(_) for _ in input().split() ]

flag = True
h_s = [ x-1 for x in h ]
h_sorted = sorted(h)

for i in range(0,h-1):
    if h[i] > h[i+1]:
        h[i] = h[i]-1
    print(h)   
        
for i in range(0,h-1):
    if h[j] > h[j+1]:
        print('No')
        flag = False
        
if flag == True:
    print('Yes')

Fixed submission:
# ABC 136 C
n = int(input())
h = [ int(_) for _ in input().split() ]
flag = True

for i in range(len(h)-1, 0, -1):
    if h[i-1] == h[i] +1:
        h[i-1] = h[i-1]-1  
        
for j in range(0,len(h)-1):
    if h[j] > h[j+1]:
        print('No')
        flag = False
        break
        
if flag == True:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
n, d = [ int(_) for _ in input().split() ]
x  = n / (2*d+1)
if x.is_integer()
    print( x )
else:
    print( x + 1 )





Fixed submission:
n, d = [ int(_) for _ in input().split() ]
x  = n / (2*d+1)

if x.is_integer():
    print( int(x//1) )
else:
    print( int( (x//1) + 1) )
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [ int(input()) for x in range(n) ] 

maximum = max(a)

for i in a:
    if i == maximum:
        b = a.copy()
        b.remove(i)
        print( max(b) )
    else:
        print(maximum)

Fixed submission:
n = int(input())
a = [ int(input()) for x in range(n) ] 

b = sorted(a, reverse = True)
maximum = b[0]

for i in a:
    if i == maximum:
        print(b[1])
    else:
        print(maximum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [ int(input()) for x in range(n) ]

for i in a:
    a.remove(i)
    print( max(b) )
    a.append(i)

Fixed submission:
n = int(input())
a = [ int(input()) for x in range(n) ] 

b = sorted(a, reverse = True)
maximum = b[0]

for i in a:
    if i == maximum:
        print(b[1])
    else:
        print(maximum)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [ int(input()) for x in range(n) ] 
    
for i in a:
    b = a.copy()
    b.remove(i)
    print( max(b) )
    

Fixed submission:
n = int(input())
a = [ int(input()) for x in range(n) ] 

b = sorted(a, reverse = True)
maximum = b[0]

for i in a:
    if i == maximum:
        print(b[1])
    else:
        print(maximum)
Buggy python submission (verdict: Time Limit Exceeded):
l, r = [ int(_) for _ in input().split() ]

ls = [2018]

for i in range(l,r):
    for j in range(i+1,r+1):
        if (i*j) % 2019 < min(x%2019 for x in ls):
            ls.append(i*j)
        
print(min([ x%2019 for x in ls]))

Fixed submission:
#ABC 133 Remainder Minimization 2019
l, r = [ int(_) for _ in input().split() ]

ls = [2018]

for i in range(l,r):
    for j in range(i+1,r+1):
        y = (i*j) % 2019
        if (i*j) % 2019 < min(x%2019 for x in ls):
            ls.append(i*j)
        if y == 0:
            break
    if y == 0:
        break
    
print(min([ x%2019 for x in ls]))

Buggy python submission (verdict: Time Limit Exceeded):
#ABC 133 Remainder Minimization 2019
l, r = [ int(_) for _ in input().split() ]

ls = []

for i in range(l,r):
    for j in range(i+1,r+1):
        ls.append(i*j)
        
print(min([ x%2019 for x in ls]))

Fixed submission:
#ABC 133 Remainder Minimization 2019
l, r = [ int(_) for _ in input().split() ]

ls = [2018]

for i in range(l,r):
    for j in range(i+1,r+1):
        y = (i*j) % 2019
        if (i*j) % 2019 < min(x%2019 for x in ls):
            ls.append(i*j)
        if y == 0:
            break
    if y == 0:
        break
    
print(min([ x%2019 for x in ls]))

Buggy python submission (verdict: Time Limit Exceeded):
l, r = [ int(_) for _ in input().split() ]

ls = []

for i in range(l,r):
    for j in range(l+1,r+1):
        ls.append(i*j)
        
print(min([ x%2019 for x in ls]))

Fixed submission:
#ABC 133 Remainder Minimization 2019
l, r = [ int(_) for _ in input().split() ]

ls = [2018]

for i in range(l,r):
    for j in range(i+1,r+1):
        y = (i*j) % 2019
        if (i*j) % 2019 < min(x%2019 for x in ls):
            ls.append(i*j)
        if y == 0:
            break
    if y == 0:
        break
    
print(min([ x%2019 for x in ls]))
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = int(input())
a <= N

if a % 2 == 1:
    print(a/N)
    

Fixed submission:
N = int(input())

if N%2 == 0:
    print(N/2/N)

else:
    print(((N-1)/2 +1)/N)
Buggy python submission (verdict: Runtime Error):
temp=input()
if temp[2]==temp[3]&&temp[4]==temp[5]:
  print("Yes")
else:
  print("No")

Fixed submission:
temp=input()
if temp[2]==temp[3] and temp[4]==temp[5]:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x = list(map(int, input().split()))
cnt = 0

for i in range(a, b + 1):
    if i % x == 0:
        cnt += 1

print(cnt)

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

if a == 0:
    print(b // x + 1)
else:
    print((b // x + 1) - ((a - 1) // x + 1))
Buggy python submission (verdict: Runtime Error):
N,K = list(map(str, input().split()))
D = sorted(input().split())
W = []
P = ""

for i in range(10):
    if str(i) not in D:
        W.append(str(i))

for i in range(len(N)):
    for j in range(len(W)):
        if N[i] <= W[j]:
            P += W[j]
            break

print(int(P))

Fixed submission:
N,K = list(map(int, input().split()))
D = sorted(input().split())
W = []
for i in range(10):
    if str(i) not in D:
        W.append(i)

while True:
    cnt = 0
    for i in range(len(W)):
        cnt += str(N).count(str(W[i]))
    if cnt == len(str(N)):
        break
    N += 1

print(N)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
text = list(S)
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        prinrt('No')
else:
    print('No')

Fixed submission:
# -*- coding: utf-8 -*-
text = list(input())
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
text = list(input())
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        prinrt('No')
else:
    print('No')

Fixed submission:
# -*- coding: utf-8 -*-
text = list(input())
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
X = int(input())import math
X = int(input())
A = X/500
A=math.floor(A)
Q=1000*A
D=A*500
Y=X-D
B = Y/5
B = math.floor(B)
B= 5*B
print(Q+B)

Fixed submission:
import math
X = int(input())
A = X/500
A=math.floor(A)
Q=1000*A
D=A*500
Y=X-D
B = Y/5
B = math.floor(B)
B= 5*B
print(int(Q+B))
Buggy python submission (verdict: Runtime Error):
N=int(import())
if N==1:
  ans=0
elif N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(ans)

Fixed submission:
N=int(input())
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(int(ans))

Buggy python submission (verdict: Runtime Error):
N=int(import())
 
if N==1orN==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2
  
print(ans)

Fixed submission:
N=int(input())
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(int(ans))

Buggy python submission (verdict: Runtime Error):
import math
N=int(import())
ams=0
 
if N==1orN==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N/2
  ans = math.floor(ans)
  
print(ans)

Fixed submission:
N=int(input())
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(int(ans))

Buggy python submission (verdict: Runtime Error):

import math
N=int(import())
 
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=N/2-1
else:
  ans=N/2
  ans = math.floor(ans)
print(ans)

Fixed submission:
N=int(input())
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(int(ans))

Buggy python submission (verdict: Runtime Error):
from scipy.special import comb
import math
N=int(import())

if N==1 or N==2:
  ans=0
else N%2==0:
  ans=N/2-1
else:
  ans=N/2
  ans = math.floor(ans)
print(ans)

Fixed submission:
N=int(input())
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(int(ans))

Buggy python submission (verdict: Runtime Error):
from scipy.special import comb
import math
N=int(import())
 
a = comb(N, 3, exact=True)
if N==1 or N==2:
  ans=0
else N%2==0:
  ans=a/2-1
else:
  ans=a/2
  ans = math.floor(ans)
print(ans)

Fixed submission:
N=int(input())
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(int(ans))

Buggy python submission (verdict: Runtime Error):
from scipy.special import comb
import math
N=int(import())

a = comb(N, 3, exact=True)
if N%2==0:
  ans=a/2-1
else:
  ans=a/2
  ans = math.floor(ans)
print(ans)

Fixed submission:
N=int(input())
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(int(ans))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
 
if a<=9 and b<=9:
  print(a*b)
  else:
    print(-1)

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
  print(a*b)
else:
  print(-1)

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

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

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
  print(a*b)
else:
  print(-1)

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

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

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
  print(a*b)
else:
  print(-1)

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

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

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
  print(a*b)
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
a,b = random.randint(1, 20)
if a+b <= 18:
  print(a*b)
  else:
    print(-1)

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
  print(a*b)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split()))
 
s=0
for i in range(a):
  for j in range(i+1,a):
    s+=d[i]*d[j]
print(s)

Fixed submission:
a=int(input())
b=list(map(int,input().split()))
 
s=0
for i in range(a):
  for j in range(i+1,a):
    s+=b[i]*b[j]
print(s)

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split())
 
s=0
for i in range(a):
  for j in range(i+1,a):
    s+=b[i]*b[j]
print(s)

Fixed submission:
a=int(input())
b=list(map(int,input().split()))
 
s=0
for i in range(a):
  for j in range(i+1,a):
    s+=b[i]*b[j]
print(s)

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=list(map(int,input().split))
 
s=0
for i in range(a):
  for j in range(i+1,a):
    s+=b[i]*b[j]
print(s)

Fixed submission:
a=int(input())
b=list(map(int,input().split()))
 
s=0
for i in range(a):
  for j in range(i+1,a):
    s+=b[i]*b[j]
print(s)

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

s=0
for i in range(a):
  for j in range(i+1,a):
    s+=d[i]*d[j]
print(s)
  


Fixed submission:
a=int(input())
b=list(map(int,input().split()))
 
s=0
for i in range(a):
  for j in range(i+1,a):
    s+=b[i]*b[j]
print(s)