Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
H, W = map(int, input())
h, w = map(int, input())

print((H-h)*(W-w))

Fixed submission:
H, W = map(int, input().split())
h, w = map(int, input().split())

print((H-h)*(W-w))
Buggy python submission (verdict: Runtime Error):
ABC = map(int, input().split())
print(ABC[0]*ABC[1]/2)

Fixed submission:
AB, BC, CA = map(int, input().split())
print(int(AB*BC/2))
Buggy python submission (verdict: Runtime Error):
n,k = map(int, input().split())
h = [int(input()) for i in range(n)] 
h.sort()

crr_min = 10^9

for i in range(0,n-k+1):
    tmp = h[n-k+i] - h[0+i]
    if tmp<crr_min:
        crr_min=tmp

print(crr_min)

Fixed submission:
d = int(input())
str = "Christmas"
for i in range(0, 25-d):
    str += " Eve"

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

n,k = map(int, input().split())
h = [int(input()) for i in range(n)] 
h.sort()

crr_min = 10^9

for i in range(0,math.ceil((n-k+1)/2)):
    tmp1 = abs(h[n-k+i] - h[i])
    tmp2 = abs(h[n-1-i] - h[n-k-i])
    if tmp1==0 or tmp2==0:
        crr_min=0
        break

    if tmp1<crr_min:
        crr_min=tmp1

    if tmp2<crr_min:
        crr_min=tmp2


print(crr_min)

Fixed submission:
import math

n,k = map(int, input().split())
h = [int(input()) for i in range(n)] 
h.sort()

crr_min = 10**9

for i in range(0,math.ceil((n-k+1)/2)):
    tmp1 = h[i+k-1] - h[i]
    tmp2 = h[-1-i] - h[-i-k]
    if tmp1==0 or tmp2==0:
        crr_min=0
        break

    if tmp1<crr_min:
        crr_min = tmp1

    if tmp2<crr_min:
        crr_min = tmp2


print(crr_min)

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

n,k = map(int, input().split())
h = [int(input()) for i in range(n)] 
h.sort()

crr_min = 10^9
crr_min += 1

for i in range(0,math.ceil((n-k+1)/2)):
    tmp1 = h[n-k+i] - h[i]
    tmp2 = h[n-1-i] - h[n-k-i]
    if tmp1<crr_min:
        crr_min=tmp1

    if tmp2<crr_min:
        crr_min=tmp2

print(crr_min)

Fixed submission:
import math

n,k = map(int, input().split())
h = [int(input()) for i in range(n)] 
h.sort()

crr_min = 10**9

for i in range(0,math.ceil((n-k+1)/2)):
    tmp1 = h[i+k-1] - h[i]
    tmp2 = h[-1-i] - h[-i-k]
    if tmp1==0 or tmp2==0:
        crr_min=0
        break

    if tmp1<crr_min:
        crr_min = tmp1

    if tmp2<crr_min:
        crr_min = tmp2


print(crr_min)

Buggy python submission (verdict: Runtime Error):
n,k = map(int, input().split())
h = [int(input()) for i in range(n)] 
h.sort()

crr_min = 10^9

for i in range(0,n-k+1):
    tmp = h[n-k+i] - h[0+i]
    if tmp<crr_min:
        crr_min=tmp

print(crr_min)




Fixed submission:
import math

n,k = map(int, input().split())
h = [int(input()) for i in range(n)] 
h.sort()

crr_min = 10**9

for i in range(0,math.ceil((n-k+1)/2)):
    tmp1 = h[i+k-1] - h[i]
    tmp2 = h[-1-i] - h[-i-k]
    if tmp1==0 or tmp2==0:
        crr_min=0
        break

    if tmp1<crr_min:
        crr_min = tmp1

    if tmp2<crr_min:
        crr_min = tmp2


print(crr_min)
Buggy python submission (verdict: Runtime Error):
def add(a):
	if int(a)>n:
		return 0
	else:
		ans = 0
		a = '' if int(a)==0 else a
		if a.find('3')>-1 and a.find('5')>-1 and a.find('7')>-1:
			ans+=1
		for i in [3,5,7]:
			ans+=add(a+str(i))
		return ans

n = int(input())
print(add(''))


Fixed submission:
def add(a):
	if int(a)>n:
		return 0
	else:
		ans = 0
		a = '' if int(a)==0 else a
		if a.find('3')>-1 and a.find('5')>-1 and a.find('7')>-1:
			ans+=1
		for i in [3,5,7]:
			ans+=add(a+str(i))
		return ans

n = int(input())
print(add('0'))
Buggy python submission (verdict: Runtime Error):
import ceil from math
a, b = map(int, input().split())
print(ceil((a+b)/2))

Fixed submission:
from math import ceil 
a, b = map(int, input().split())
print(ceil((a+b)/2))
Buggy python submission (verdict: Runtime Error):
x, y = map(hex, input().split())

if x<y :
	print('<')
elif x>y :
	print('>')
else:
	print('=')



Fixed submission:
from sys import stdin

x,y = stdin.readline().split( )

if x<y :
	print('<')
elif x>y :
	print('>')
else:
	print('=')

Buggy python submission (verdict: Runtime Error):
x, y = map(hex, input().split())

if(x<y){
	print('<')
} else if(x>y){
	print('>')
} else{
	print('=')
	}


Fixed submission:
from sys import stdin

x,y = stdin.readline().split( )

if x<y :
	print('<')
elif x>y :
	print('>')
else:
	print('=')
Buggy python submission (verdict: Runtime Error):
from sys import stdin
 
x,y,z = stdin.readline().split( )

print (int(x)-int(z))/(int(y)+int(z))


Fixed submission:
from sys import stdin
import math
 
x, y, z = stdin.readline().split()
 
print (math.floor(( ( int(x)-int(z) ) / ( int(y) + int(z) ) )))

Buggy python submission (verdict: Runtime Error):
from sys import stdin
 
x,y,z = stdin.readline().split()

print (int(x)-int(z))/(int(y)+int(z))


Fixed submission:
from sys import stdin
import math
 
x, y, z = stdin.readline().split()
 
print (math.floor(( ( int(x)-int(z) ) / ( int(y) + int(z) ) )))

Buggy python submission (verdict: Runtime Error):
from sys import stdin
 
x,y,z = stdin.readline().split()

print (int(x)-int(z))/(int(y)+int(z))


Fixed submission:
from sys import stdin
import math
 
x, y, z = stdin.readline().split()
 
print (math.floor(( ( int(x)-int(z) ) / ( int(y) + int(z) ) )))

Buggy python submission (verdict: Runtime Error):
from sys import stdin
 
x,y,z = stdin.readline().split()

print (int(x)-int(z))/(int(y)+int(z))


Fixed submission:
from sys import stdin
import math
 
x, y, z = stdin.readline().split()
 
print (math.floor(( ( int(x)-int(z) ) / ( int(y) + int(z) ) )))

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

print (x-z)%(x+y)


Fixed submission:
from sys import stdin
import math
 
x, y, z = stdin.readline().split()
 
print (math.floor(( ( int(x)-int(z) ) / ( int(y) + int(z) ) )))
Buggy python submission (verdict: Runtime Error):
s=input()
s[5] = " "
s[13] = " "
print(s)

Fixed submission:
s=input().split(",")
print(s[0],s[1],s[2])
Buggy python submission (verdict: Runtime Error):
n = int(input())
# divisors = []
move =[]
for i in range(1, int(n**0.5)+1):
    if n % i == 0:
#         divisors.append(i)
        move.append(i+n//i)
        if i != n // i:
            divisors.append(n//i)
        
# divisors.sort()
# print(divisors)
# print(move)
print(min(move)-2)

Fixed submission:
n = int(input())
move =[]
for i in range(1, int(n**0.5)+1):
    if n % i == 0:
        move.append(i+n//i)
# print(move)
print(min(move)-2)
Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
# print('N=', N, 'K=', K, 'Q=', Q)

participant_list = [K] * N
# for i in range(N):
#     participant_list.append(K)
# print(participant_list)

def calc_decre(n):
    return n - 1

for i in range(Q):
#     print('num=', i)
    participant_list = list(map(calc_decre, participant_list))
#     print(participant_list)

#     for i in range(N):
#         participant_list[i] -= 1 
    answer = int(input()) - 1
    participant_list[answer] += 1
#     print(participant_list)

for i in participant_list:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Fixed submission:
N, K, Q = map(int, input().split())
# print('N=', N, 'K=', K, 'Q=', Q)

participant_list = [K-Q] * N
# print(participant_list)

for i in range(Q):
    participant_list[int(input())-1] += 1
    
for i in participant_list:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = map(int, input().split())
# print('N=', N, 'K=', K, 'Q=', Q)

participant_list = []
for i in range(N):
    participant_list.append(K)
# print(participant_list)

for i in range(Q):
#     print('num=', i)
    for i in range(N):
        participant_list[i] -= 1 
    answer = int(input()) - 1
    participant_list[answer] += 1
#     print(participant_list)

for i in range(N):
    if participant_list[i] <= 0:
        print('No')
    else:
        print('Yes')

Fixed submission:
N, K, Q = map(int, input().split())
# print('N=', N, 'K=', K, 'Q=', Q)

participant_list = [K-Q] * N
# print(participant_list)

for i in range(Q):
    participant_list[int(input())-1] += 1
    
for i in participant_list:
    if i <= 0:
        print('No')
    else:
        print('Yes')
Buggy python submission (verdict: Runtime Error):
sum = 0
for i in range(N):
    if i == 0:
        sum += list_B[i]
#         print('i == 0')
#         print('i=', i, 'sum=', sum)
    elif i == N-1:
        sum += list_B[i-1]
        print('i == N-1')
#         print(list_B[i-1])
#         print('i=', i, 'sum=', sum)
    else:
        if (list_B[i] >= list_B[i-1]):
            sum += list_B[i-1]
        else:
            sum += list_B[i]
#         print('i=', i, 'sum=', sum)
print(sum)

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

sum = 0
for i in range(N):
    if i == 0:
        sum += list_B[i]
#         print('i == 0')
#         print('i=', i, 'sum=', sum)
    elif i == N-1:
        sum += list_B[i-1]
#         print('i == N-1')
#         print(list_B[i-1])
#         print('i=', i, 'sum=', sum)
    else:
        if (list_B[i] >= list_B[i-1]):
            sum += list_B[i-1]
        else:
            sum += list_B[i]
#         print('i=', i, 'sum=', sum)
print(sum)
Buggy python submission (verdict: Runtime Error):
#2019/10/24
S = list(map(int, list(open(0).read())))
# print(S)
print(S[::2].count(0) + S[1::2].count(1) if S[0]==1 else S[::2].count(1) + S[1::2].count(0)) 

Fixed submission:
#2019/10/24
# S = list(map(int, list(open(0).read())))
S = list(map(int, input()))
# print(S)
print(S[::2].count(0) + S[1::2].count(1) if S[0]==1 else S[::2].count(1) + S[1::2].count(0))
Buggy python submission (verdict: Runtime Error):
#2019/10/04
time = list(map(int, open(0).read().split()))
# print(time)

time_residual = [i%10 for i in time]
# print(time_residual)

time_residual_notZero = [i for i in time_residual if i%10 != 0 ]
# print(time_residual_notZero)

ans = sum([-(-i//10)*10 for i in time]) + min(time_residual_notZero) - 10
#print(ans)

Fixed submission:
#2019/10/04
time = list(map(int, open(0).read().split()))
# print(time)

time_residual = [i%10 for i in time]
# print(time_residual)

time_residual_notZero = [i for i in time_residual if i%10 != 0 ]
# print(time_residual_notZero)

if(time_residual_notZero != []):
    ans = sum([-(-i//10)*10 for i in time]) + min(time_residual_notZero) - 10
else:
    ans = sum(time)
print(ans)

Buggy python submission (verdict: Runtime Error):
#2019/10/04
time = list(map(int, open(0).read().split()))
# print(time)

time_residual = [i%10 for i in time]
# print(time_residual)

time_residual_notZero = [i for i in time_residual if i%10 != 0 ]
# print(time_residual_notZero)

ans = sum([-(-i//10)*10 for i in time]) + min(time_residual_notZero) - 10
print(ans)

Fixed submission:
#2019/10/04
time = list(map(int, open(0).read().split()))
# print(time)

time_residual = [i%10 for i in time]
# print(time_residual)

time_residual_notZero = [i for i in time_residual if i%10 != 0 ]
# print(time_residual_notZero)

if(time_residual_notZero != []):
    ans = sum([-(-i//10)*10 for i in time]) + min(time_residual_notZero) - 10
else:
    ans = sum(time)
print(ans)

Buggy python submission (verdict: Runtime Error):
#2019/10/04
time = list(map(int, open(0).read().split()))
# print(time)

time_residual = [i%10 for i in time]
# print(time_residual)

time_residual_notZero = [i for i in time_residual if i%10 != 0 ]
# print(time_residual_notZero)

min_index = time_residual.index(min(time_residual_notZero))
# print(min_index)

ans = sum([-(-i//10)*10 for i in time]) + time_residual[min_index] - 10
print(ans)

Fixed submission:
#2019/10/04
time = list(map(int, open(0).read().split()))
# print(time)

time_residual = [i%10 for i in time]
# print(time_residual)

time_residual_notZero = [i for i in time_residual if i%10 != 0 ]
# print(time_residual_notZero)

if(time_residual_notZero != []):
    ans = sum([-(-i//10)*10 for i in time]) + min(time_residual_notZero) - 10
else:
    ans = sum(time)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
#2019/10/25
NQ, S, *lr = [s for s in open(0)]
# print(NQ, S, lr)
N, Q = map(int, NQ.split())
lr = [list(map(int, i.split())) for i in lr]
# print(N,Q,S,lr)
cnt=0
for l, r in lr:
    print(S[l-1:r].count("AC"))

Fixed submission:
N, Q = map(int, input().split())
S = input()
# print(S)
t = [0] * (N + 1)
for i in range(N):
    t[i + 1] = t[i] + (1 if S[i : i + 2] == 'AC' else 0)
#     print(i, t[i+1], t[i], S[i:i+2])
# print(t)

for i in range(Q):
    l, r = map(int, input().split())
#     print(r,l,t[r-1],t[l-1])
    print(t[r-1] - t[l-1])
Buggy python submission (verdict: Runtime Error):
S = input()
print(S)
stack = []
ans = 0
for c in S:
    if stack and stack[0] != c:
        print("stack={}, c={} pop!".format(stack, c))
        stack.pop()
        ans += 2
    else:
        print("stack={}, c={} append!".format(stack, c))
        stack.append(c)
#     print("c={0}, st={1}".format(c, stack))
print(ans)

Fixed submission:
S = input()
# print(S)
stack = []
ans = 0
for c in S:
    if stack and stack[0] != c:
#         print("stack={}, c={} pop!".format(stack, c))
        stack.pop()
        ans += 2
    else:
#         print("stack={}, c={} append!".format(stack, c))
        stack.append(c)
#     print("c={0}, st={1}".format(c, stack))
print(ans)

Buggy python submission (verdict: Runtime Error):
# ABC120 C - Unification
# 2019/10/28

def main():
    S = list(map(int, list(open(0).read())))
#     print(S)
    
    cnt = 0
    i=0

    while (i<len(S)-1):
        if (S[i] == 0 and S[i+1] == 1) or (S[i] == 1 and S[i+1] == 0):
            S.pop(i)
            S.pop(i)
            cnt+=2
#             print("i={0}, S={1}, cnt={2}".format(i, S, cnt))
            i=0
        i+=1
    
    print(cnt)
    
    
if __name__ == "__main__":
    main()

Fixed submission:
S = input()
# print(S)
stack = []
ans = 0
for c in S:
    if stack and stack[0] != c:
#         print("stack={}, c={} pop!".format(stack, c))
        stack.pop()
        ans += 2
    else:
#         print("stack={}, c={} append!".format(stack, c))
        stack.append(c)
#     print("c={0}, st={1}".format(c, stack))
print(ans)
Buggy python submission (verdict: Runtime Error):
A,B,K = map(int, open(0).read().split())
intList = [i for i in range(A,B+1)]
ansList = set(intList[:K]+intList[::-1][:K])
# print(intList)
# print(ansList)
for j in sorted(ansList):
    print(j)

Fixed submission:
#2019/10/25
S = open(0).read()
# print(S)
# for i in range(len(S)-2):
#     print(abs(int(S[i:i+3])-753))
print(min([abs(int(S[i:i+3])-753) for i in range(len(S)-2)]))
Buggy python submission (verdict: Time Limit Exceeded):
# A,B,K = map(int, open(0).read().split())
A,B,K = map(int, input().split())
intList = [i for i in range(A,B+1)]
ansList = set(intList[:K]+intList[::-1][:K])
# print(intList)
# print(ansList)
for j in sorted(ansList):
    print(j)

Fixed submission:
# A,B,K = map(int, open(0).read().split())
A,B,K = map(int, input().split())
r=range(A,B+1)
for j in sorted(set(r[:K])|set(r[::-1][:K])):
    print(j)

Buggy python submission (verdict: Time Limit Exceeded):
A,B,K = map(int, open(0).read().split())
intList = [i for i in range(A,B+1)]
ansList = set(intList[:K]+intList[::-1][:K])
# print(intList)
# print(ansList)
for j in sorted(ansList):
    print(j)

Fixed submission:
# A,B,K = map(int, open(0).read().split())
A,B,K = map(int, input().split())
r=range(A,B+1)
for j in sorted(set(r[:K])|set(r[::-1][:K])):
    print(j)
Buggy python submission (verdict: Runtime Error):
#2019/10/12
N = int(open(0).read())
L0 = 2
L1 = 1
for i in range(N-1):
    L2 = L1 + L0
    L1, L0 = L2, L1
    #print(i, L2)
print(L2)

Fixed submission:
#2019/10/12
N = int(open(0).read())
L0 = 2
L1 = 1
L2 = 3
for i in range(N):
    L2 = L1 + L0
    L1, L0 = L2, L1
    #print(i, L2)
print(L0)
Buggy python submission (verdict: Time Limit Exceeded):
# ABC073 C - Write and Erase
# 2019/10/28

def main():
    N, *A = map(int, open(0).read().split())
#     print(N, A)
    set_A = list(set(A))
#     list_count = [A.count(i)%2 for i in set_A]
#     print(list_count)
#     print(sum(list_count))
    
    list_count = 0
    for i in set_A:
        list_count += A.count(i)%2
    print(list_count)
    
    
if __name__ == "__main__":
    main()

Fixed submission:
from collections import Counter

def main():
    N, *A = map(int, open(0).read().split())
#     print(N, A)
    c = Counter(A)
#     print(c)

    print(sum(v & 1 for v in c.values()))

if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
# ABC073 C - Write and Erase
# 2019/10/28

def main():
    N, *A = map(int, open(0).read().split())
#     print(N, A)
    set_A = list(set(A))
    list_count = [A.count(i)%2 for i in set_A]
#     print(list_count)
    print(sum(list_count))
    
    
if __name__ == "__main__":
    main()

Fixed submission:
from collections import Counter

def main():
    N, *A = map(int, open(0).read().split())
#     print(N, A)
    c = Counter(A)
#     print(c)

    print(sum(v & 1 for v in c.values()))

if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
# ABC066 C - pushpush
# 2019/10/29

n ,*a = map(int, open(0).read().split())
# print(n, a)

b=[]
if n%2 == 0:
    for i in range(n):
        if i%2!=0:
            b.insert(0,a[i])
        else:
            b.append(a[i])
#         print(i, b)
else:
    for i in range(n):
        if i%2==0:
            b.insert(0,a[i])
        else:
            b.append(a[i])
#         print(i, b)
        
# print(b)
print(" ".join([str(i) for i in b]))

Fixed submission:
# dequeのappendとappendleftはO(1)、O(1)

from collections import deque

n ,*a = map(int, open(0).read().split())
b = deque()

for i in range(n):
    if i % 2 == 0:
        b.append(a[i])
    else:
        b.appendleft(a[i])
 
if n % 2 == 1:
    b.reverse()
 
print(*b)
Buggy python submission (verdict: Time Limit Exceeded):
#2019/10/16
N, *a = map(int, open(0).read().split())
#print(N, a)
i=0
cnt=1
button=[]
while(True):
    #print("i=",i, "a[i]=",a[i])
    #print("button=", button)
    i=a[i]-1
    if i==1:
        print(cnt)
        break
    elif i in button:
        print("-1")
        break
    else:
        button.append(i)
        cnt+=1

Fixed submission:
#2019/10/16
N, *a = map(int, open(0).read().split())
#print(N, a)
i=0
cnt=0
button=[]
while(True):
    #print("i=",i, "a[i]=",a[i])
    #print("button=", button)
    if i==1:
        print(cnt)
        break
    if cnt >= N:
        print("-1")
        break
    cnt+=1
    i=a[i]-1
Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = [int(s) for s in input().split(' ')]
# A = [int(input()) for s in range(Q)]

# syoki_tokuten = [K for s in range(N)]
syoki_tokuten = [0] * N

# for i in A:
for ii in range(Q):
  i = int(input())
  syoki_tokuten[i-1] += 1
  
for i in range(N):
  genten = sum(syoki_tokuten) - syoki_tokuten[i]

  if genten < K:
    print('Yes')
  else:
    print('No')

Fixed submission:
from collections import Counter 

N, K, Q = [int(s) for s in input().split(' ')]
A = [int(input()) - 1 for s in range(Q)]

c = Counter(A)

sum = sum(c.values())

for i in range(N):
  
  if sum - c[i] < K:
    print('Yes')
  else:
    print('No')

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = [int(s) for s in input().split(' ')]
A = [int(input()) for s in range(Q)]

# syoki_tokuten = [K for s in range(N)]
syoki_tokuten = [0 for s in range(N)]

for i in A:
  syoki_tokuten[i-1] += 1
  
for i in range(N):
  genten = sum(syoki_tokuten) - syoki_tokuten[i]

  if genten < K:
    print('Yes')
  else:
    print('No')

Fixed submission:
from collections import Counter 

N, K, Q = [int(s) for s in input().split(' ')]
A = [int(input()) - 1 for s in range(Q)]

c = Counter(A)

sum = sum(c.values())

for i in range(N):
  
  if sum - c[i] < K:
    print('Yes')
  else:
    print('No')

Buggy python submission (verdict: Time Limit Exceeded):
N, K, Q = [int(s) for s in input().split(' ')]
A = [int(input()) for s in range(Q)]

# syoki_tokuten = [K for s in range(N)]
syoki_tokuten = [0 for s in range(N)]

for i in A:
  syoki_tokuten[i-1] += 1
  
for i in range(N):
  genten = sum(x for i_s,x in enumerate(syoki_tokuten) if i_s != i)

  if genten < K:
    print('Yes')
  else:
    print('No')

Fixed submission:
from collections import Counter 

N, K, Q = [int(s) for s in input().split(' ')]
A = [int(input()) - 1 for s in range(Q)]

c = Counter(A)

sum = sum(c.values())

for i in range(N):
  
  if sum - c[i] < K:
    print('Yes')
  else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = [int(i) for i in input().split(' ')]

max_count = 0
max_i = 0

for i, h in enumerate(H):
  arr = H[i+1:]
  now = h
  count = 0
  for ar in arr:
    migi = ar
    if now >= ar:
      count += 1
    else:
      break
    
    if count > max_count:
      max_i = i
      max_count = count
    now = ar

print(max_count)
    

Fixed submission:
N = int(input())
H = [int(i) for i in input().split(' ')]

max_count = 0
max_i = 0

t_max_count = 0
t_max_i = 0

for i, h in enumerate(H):
  if i == (len(H) - 1):
    break
  
  migi = H[i+1]
  
  if h >= migi:
    t_max_count += 1
    t_max_i = i
  else:
    if max_count < t_max_count:
      max_count = t_max_count
      max_i = t_max_i
    t_max_count = 0
    t_max_i = 0
      
if max_count < t_max_count:
  max_count = t_max_count
  max_i = t_max_i
print(max_count)
Buggy python submission (verdict: Runtime Error):
import argparse

parser = argparse.ArgumentParser()
parser.add_argument('integers', metavar='N', type=int, nargs='+',
               help='an integer for the accumulator')

args = parser.parse_args()
int_list = args.integers

if int_list[0] == int_list[1]: 
    print(-1)
elif int_list[0] < 0 or int_list[1] < 0: 
    print (-1)
else:
    for i in range(1, int(10 ** 10 / int_list[0])):
        if int_list[0] * i % int_list[1] != 0:
            print(int_list[0] * i)
            exit()
        else:
            continue
    print(-1)



Fixed submission:
a, b = (int(i) for i in input().split())  

if a == b: 
    print(-1)
elif a < 0 or b < 0: 
    print (-1)
else:
    for i in range(1, int(10 ** 10 / a)):
        if a * i % b != 0:
            print(a * i)
            exit()
        else:
            continue
    print(-1)

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

parser = argparse.ArgumentParser()
parser.add_argument('integers', metavar='N', type=int, nargs='+',
               help='an integer for the accumulator')

args = parser.parse_args()

if args[0] == args[1]: 
    print(-1)
elif args[0] < 0 or args[1] < 0: 
    print (-1)
else:
    for i in range(1, 10 ** 10 / args[0]):
        if args[0] * i % args[1] != 0:
            print args[0] * i
            break
print(-1)



Fixed submission:
a, b = (int(i) for i in input().split())  

if a == b: 
    print(-1)
elif a < 0 or b < 0: 
    print (-1)
else:
    for i in range(1, int(10 ** 10 / a)):
        if a * i % b != 0:
            print(a * i)
            exit()
        else:
            continue
    print(-1)

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

parser = argparse.ArgumentParser()
parser.add_argument('integers', metavar='N', type=int, nargs='+',
               help='an integer for the accumulator')

args = parser.parse_args()

if args[0] == args[1]: 
    print(-1)
elif args[0] < 0 or args[1] < 0: 
    print (-1)
else:
    for i in range(1, 10 ** 10 / args[0]):
        if args[0] * i % args[1] == 0:
            print args[0] * i
            break
print(-1)



Fixed submission:
a, b = (int(i) for i in input().split())  

if a == b: 
    print(-1)
elif a < 0 or b < 0: 
    print (-1)
else:
    for i in range(1, int(10 ** 10 / a)):
        if a * i % b != 0:
            print(a * i)
            exit()
        else:
            continue
    print(-1)