Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b,c=int(input())


k=int(input())

ans="no"
for i in range(k+1):
  if a<b<c:
    ans="yes"
  else:
    if a>=b:
      b*=2
    elif b>=c:
      c*=2
    else:
      c*=2

print(ans)
print(a)

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

ans="No"
for i in range(k+1):
  if a<b<c:
    ans="Yes"
  else:
    if a>=b:
      b*=2
    elif b>=c:
      c*=2


print(ans)

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

ans="no"
for i in range(k+1):
  if a<b<c:
    ans="yes"
  else:
    if a>=b:
      b*=2
    elif b>=c:
      c*=2
    else:
      c*=2

print(ans)


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

ans="No"
for i in range(k+1):
  if a<b<c:
    ans="Yes"
  else:
    if a>=b:
      b*=2
    elif b>=c:
      c*=2


print(ans)

Buggy python submission (verdict: Runtime Error):
a=int(input("a?"))
b=int(input("b?"))
c=int(input("c?"))
k=int(input("k?"))

ans="no"
for i in range(k+1):
  if a<b<c:
    ans="yes"
  else:
    if a>=b:
      b*=2
    elif b>=c:
      c*=2
    else:
      c*=2

print(ans)

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

ans="No"
for i in range(k+1):
  if a<b<c:
    ans="Yes"
  else:
    if a>=b:
      b*=2
    elif b>=c:
      c*=2


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

sei=[1]*2
b=1
for i in range(k):
  sei[0]*=a[i]
for i in range(n-k):
  sei[1]=sei[0]/a[i]*a[i+k]

  if sei[0]<sei[1]:
    print("Yes")
  else:
    print("No")
  sei[0]=sei[1]




Fixed submission:
n,k=map(int, input().split())
a=list(map(int, input().split()))

for i in range(n-k):

  if  a[i]<a[i+k]:
    print("Yes")
  else:
    print("No")

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

sei=[1]*2
cou=0
while True:
  if cou==n-k:
    break
  for i in range(cou,cou+k):
    sei[0]*=a[i]
    sei[1]*=a[i+1]
  if sei[0]<sei[1]:
    print("Yes")
    sei=[1]*2
  else:
    print("No")
    sei=[1]*2
  cou+=1



Fixed submission:
n,k=map(int, input().split())
a=list(map(int, input().split()))

for i in range(n-k):

  if  a[i]<a[i+k]:
    print("Yes")
  else:
    print("No")

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

sei=[0]*(n-k+1)
for i in range(n-k+1):
  for j in range(i,i+k):
    sei[i]+=a[j]

for i in range(n-k):
  if sei[i]<sei[i+1]:
    print("Yes")
  else:
    print("No")

Fixed submission:
n,k=map(int, input().split())
a=list(map(int, input().split()))

for i in range(n-k):

  if  a[i]<a[i+k]:
    print("Yes")
  else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n=int(input("n?"))
k=int(input("k?"))
a=[int(input("a?")) for i in range(n)]
sei=[0]*(n-k+1)
for i in range(n-k+1):
  for j in range(i,i+k):
    sei[i]+=a[j]

for i in range(n-k):
  if sei[i]<sei[i+1]:
    print("yes")
  else:
    print("no")

Fixed submission:
n,k=map(int, input().split())
a=list(map(int, input().split()))

for i in range(n-k):

  if  a[i]<a[i+k]:
    print("Yes")
  else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int, input().split()))
mon=1000
kai=0
for i in range(n-1):
  if a[i]>a[i+1] and a[i+1]>a[i+2]:
    mon+=kai*a[i]
    kai=0
  elif a[i]<a[i+1] and a[i+1]<a[i+2]:
    kai=int(mon/a[i])
    mon-=kai*a[i]

mon+=kai*a[n-1]

print(mon)


Fixed submission:
n=int(input())
a=list(map(int, input().split()))
mon=1000
kai=0
for i in range(n-1):
  if a[i]>a[i+1]:
    mon+=kai*a[i]
    kai=0
  elif a[i]<a[i+1] and kai==0:
    kai=int(mon/a[i])
    mon-=kai*a[i]

mon+=kai*a[n-1]

print(mon)

Buggy python submission (verdict: Runtime Error):
k=int(input())
a=list(map(int, input().split()))
mon=1000
kai=0
for i in range(n-1):
  if a[i]>a[i+1] and a[i+1]>a[i+2]:
    mon+=kai*a[i]
    kai=0
  elif a[i]<a[i+1] and a[i+1]<a[i+2]:
    kai=int(mon/a[i])
    mon-=kai*a[i]

mon+=kai*a[n-1]

print(mon)


Fixed submission:
n=int(input())
a=list(map(int, input().split()))
mon=1000
kai=0
for i in range(n-1):
  if a[i]>a[i+1]:
    mon+=kai*a[i]
    kai=0
  elif a[i]<a[i+1] and kai==0:
    kai=int(mon/a[i])
    mon-=kai*a[i]

mon+=kai*a[n-1]

print(mon)

Buggy python submission (verdict: Runtime Error):
n=int(input("n?"))
a=[int(input("a?")) for i in range(n)]
mon=1000
kai=0
for i in range(n-1):
  if a[i]>a[i+1]:
    mon+=kai*a[i]
    kai=0
  elif a[i]<a[i+1]:
    kai=int(mon/a[i])
    mon-=kai*a[i]

mon+=kai*a[n-1]

print(mon)

Fixed submission:
n=int(input())
a=list(map(int, input().split()))
mon=1000
kai=0
for i in range(n-1):
  if a[i]>a[i+1]:
    mon+=kai*a[i]
    kai=0
  elif a[i]<a[i+1] and kai==0:
    kai=int(mon/a[i])
    mon-=kai*a[i]

mon+=kai*a[n-1]

print(mon)
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
t = input()

ans = 0
i = 0
while i < len(s):
	if s[i] == t[i]:
		ans += 1

print(ans)

Fixed submission:
s = input()
t = input()

ans = 0
i = 0
while i < len(s):
	if s[i] != t[i]:
		ans += 1
	i += 1

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

ans = "No"
i = 0
while i <= x:
  z = y - 2 * i
  if z == 0:
    ans = "Yes"
    break
  if z % ((x - i) * 4) == 0:
    ans = "Yes"
    break
  i += 1

print(ans)

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

ans = "No"
crane = 0
while crane <= x:
  turtle = x - crane
  if 2 * crane + 4 * turtle == y:
    ans = "Yes"
  crane += 1

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

to = [[] for _ in range(110000)]
ans = [0] * 110000
queue = []
passed = [0] * 110000
passed[1] = 1

def search(i):
  global queue
  global passed
  global ans
  for j in to[i]:
    if passed[j] == 0:
      queue.append(j)
      passed[j] = 1
      ans[j] = i
  if queue:
    return search(queue.pop(0))
  


for _ in range(m):
  a, b = map(int, input().split())
  to[a].append(b)
  to[b].append(a)

search(1)

print("Yes")
for i in ans[2:n + 1]:
  print(i)

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

to = [[] for _ in range(110000)]
ans = [0] * 110000
queue = []
passed = [0] * 110000
passed[1] = 1

def search(i):
  global queue
  global passed
  global ans
  for j in to[i]:
    if passed[j] == 0:
      queue.append(j)
      passed[j] = 1
      ans[j] = i
  


for _ in range(m):
  a, b = map(int, input().split())
  to[a].append(b)
  to[b].append(a)

search(1)
queue.append(1)

while queue:
  que = queue.pop(0)
  search(que)


print("Yes")
for i in ans[2:n + 1]:
  print(i)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())

to = [0]
to += list(map(int, input().split()))


circle = [1]
st = -1
while True:
  point = to[circle[-1]]
  if point in circle:
    st = point
    break
  circle.append(point)

l1 = circle.index(st)
l2 = len(circle) - l1

if k < l1:
  print(circle[k])
elif k < l1 + l2:
  print(circle[k])
else:
  div = (k - l1) % l2
  print(circle[l1+div])

Fixed submission:
n, k = map(int, input().split())

to = [0]
to += list(map(int, input().split()))

passed = [0] * (n + 1)

circle = [1]
st = -1
while True:
  nx = to[circle[-1]]
  if passed[nx] == 1:
    st = nx
    break
  circle.append(nx)
  passed[nx] = 1
  

l1 = circle.index(st)
l2 = len(circle) - l1

if k < l1:
  print(circle[k])
elif k < l1 + l2:
  print(circle[k])
else:
  div = (k - l1) % l2
  print(circle[l1+div])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
collections = []
ans = 0

for _ in range(n):
  s = input()
  if s in collections:
    continue
  ans += 1
  collections.append(s)

print(ans)

Fixed submission:
n = int(input())
collections = {}
ans = 0

for _ in range(n):
  s = input()
  collections[s] = 1


print(sum(collections.values()))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
collections = []
ans = 0

for _ in range(n):
  s = input()
  if s in collections:
    continue
  ans += 1
  collections.append(s)

print(ans)

Fixed submission:
n = int(input())
collections = {}
ans = 0

for _ in range(n):
  s = input()
  collections[s] = 1


print(sum(collections.values()))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a_list = list(map(int, input().split()))

i = 0
while i < n:
  j = i+1
  while j < n:
    if a_list[i] == a_list[j]:
      print("NO")
      exit()
    j += 1
  i += 1

print("YES")

Fixed submission:
import collections

n = int(input())
a_list = list(map(int, input().split()))

a_counter = collections.Counter(a_list)

ans = "YES"
for value in a_counter.values():
  if value > 1:
    ans = "NO"
    break

print(ans)
Buggy python submission (verdict: Runtime Error):
n = 0
S = Input()
for i in range(0,len(S)):
    if i==0:
        if S[i]=="R":
            n += 1
    if i==1:
        if S[i]=="R":
            n += 1
        else:
            n = 0
    if i==2:
        if S[i]=="R":
            n += 1
        else:
            continue
print(n)

Fixed submission:
n = 0
S = input()
for i in range(0,len(S)):
    if i==0:
        if S[i]=="R":
            n += 1
    if i==1:
        if S[i]=="R":
            n += 1
        else:
            n = 0
    if i==2:
        if S[i]=="R":
            n += 1
        else:
            continue
    if S == "RSS":
        n = 1
print(n)
Buggy python submission (verdict: Time Limit Exceeded):
k = int(input())

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

seven = 7
for _ in range(100000000):
    if seven % k == 0:
        print(len(str(seven)))
        break
    seven = int(str(seven) + "7")

Fixed submission:
k = int(input())
 
s = 7
for i in range(1, k+1):			# rangeの上限がk
    if s % k == 0:
        print(i)
        break
    s = (s * 10 + 7) % k		# %kが難しい
else:                           # for文にもelseが使える
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int,input().split())
a = list(map(int,input().split()))


s1 = 1
s2 = 1
for i in range(k):
  s1 = s1 * a[i]
  s2 = s2 * a[i+1]

if s1 < s2:
  print("Yes")
else:
  print("No")


for i in range(1,n-k):
  s1 = s2
  s2 = int(s1 / a[i] * a[k+i])
    
  if s1 < s2:
    print("Yes")
  else:
    print("No")

Fixed submission:
n, k = map(int,input().split())
a = list(map(int,input().split()))


for i in range(n-k):
    
  if a[i] < a[k+i]:
    print("Yes")
  else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())

for n in range(1,N+1):
  cnt = 0
  for x in range(1,int(n**0.5)):
    for y in range(1,int(n**0.5)):
      for z in range(1,int(n**0.5)):
        if x * x + y * y + z * z + x * y + y * z + z * x == n:
          cnt += 1
  print(cnt)

Fixed submission:
l,r,d = map(int,input().split())

cnt = 0
for i in range(l,r+1):
  if i % d == 0:
    cnt += 1
    
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())

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

dp = [float('inf')]*n

dp[0] = 0
dp[1] = abs(arr[0]-arr[1])

for i in range(2, n):
    for j in range(i-1, max(-1, i-k-1), -1):
        dp[i] = min(dp[i], dp[j]+abs(arr[i]-arr[j]))

print(dp[-1])


Fixed submission:
n, k = map(int, input().split())

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

dp = [float('inf')]*n

dp[0] = 0
dp[1] = abs(arr[0]-arr[1])

for i in range(2, n):
    for j in range(i-1, max(-1, i-k-1), -1):
        dp[i] = min(dp[i], dp[j]+abs(arr[i]-arr[j]))

print(dp[-1])

Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())

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

dp = [float('inf')]*n

dp[0] = 0
dp[1] = abs(arr[0]-arr[1])

for i in range(2, n):
    for j in range(i-1, max(-1, i-k-1), -1):
        dp[i] = min(dp[i], dp[j]+abs(arr[i]-arr[j]))

print(dp[-1])

Fixed submission:
n, k = map(int, input().split())

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

dp = [float('inf')]*n

dp[0] = 0
dp[1] = abs(arr[0]-arr[1])

for i in range(2, n):
    for j in range(i-1, max(-1, i-k-1), -1):
        dp[i] = min(dp[i], dp[j]+abs(arr[i]-arr[j]))

print(dp[-1])
Buggy python submission (verdict: Time Limit Exceeded):
n, w = map(int, input().split())

weights = [0]*n
values = [0]*n

for i in range(n):
    weights[i], values[i] = map(int, input().split())

dp = [[0 for _ in range(w+1)] for _ in range(n+1)]
for i in range(1, n+1):
    for j in range(1, w+1):
        if j < weights[i-1]:
            dp[i][j] = dp[i-1][j]
        else:
            dp[i][j] = max(dp[i-1][j], values[i-1]+dp[i-1][j-weights[i-1]])

print(dp[-1][-1])

Fixed submission:
n, w = map(int, input().split())

weights = [0]*n
values = [0]*n

for i in range(n):
    weights[i], values[i] = map(int, input().split())

dp = [[0 for _ in range(w+1)] for _ in range(n+1)]
for i in range(1, n+1):
    for j in range(1, w+1):
        if j < weights[i-1]:
            dp[i][j] = dp[i-1][j]
        else:
            dp[i][j] = max(dp[i-1][j], values[i-1]+dp[i-1][j-weights[i-1]])

print(dp[-1][-1])
Buggy python submission (verdict: Runtime Error):
n, w = map(int, input().split())

weights = [0]*n
values = [0]*n

for i in range(n):
    weights[i], values[i] = map(int, input().split())

v = sum(values)

dp = [[float('inf') for _ in range(v+1)] for _ in range(n+1)]

for i in range(n+1):
    dp[i][0] = 0

for i in range(1, n+1):
    for j in range(1, v+1):
        if v[i] > j:
            dp[i][j] = dp[i-1][j]
        else:
            dp[i][j] = min(w[i] + dp[i-1][j-v[i]], dp[i-1][j])

for j in range(v+1):
    if dp[-1][j] == w:
        print(j)

Fixed submission:
n, w = map(int, input().split())

weights = [0]*n
values = [0]*n

for i in range(n):
    weights[i], values[i] = map(int, input().split())

v = sum(values)

dp = [[float('inf') for _ in range(v+1)] for _ in range(n+1)]

for i in range(n+1):
    dp[i][0] = 0

for i in range(1, n+1):
    for j in range(1, v+1):
        if values[i-1] > j:
            dp[i][j] = dp[i-1][j]
        else:
            dp[i][j] = min(weights[i-1] + dp[i-1][j-values[i-1]], dp[i-1][j])

for j in range(v,-1,-1):
    if dp[-1][j] <= w:
        print(j)
        break
Buggy python submission (verdict: Runtime Error):
from collections import Counter
 
n = int(input())
 
arr = list(map(int, input().split()))
 
counts = Counter(arr)
 
res = 0
 
for k,v in counts.items():
  if v>=2:
    res += v//2
    counts[k] = v%2
    
items = sorted(counts.items())
for i in range(len(items)-1):
  res+=min(items[i], items[i+1])
  
print(res)

Fixed submission:
n = int(input())
 
arr = list(map(int, input().split()))

arr.sort()

res = 0
i=0
l = len(arr)
while i<l:
  res+=min(arr[i], arr[i+1])
  i+=2
  
print(res)

Buggy python submission (verdict: Runtime Error):
from collections import Counter

n = int(input())

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

counts = Counter(arr)

res = 0

for k,v in counts.items():
  if v>=2:
    res += v//2
    counts[k] = v%2
    
items = sorted(counts.items())
for i in range(len(items)-1):
  res+=min(items[i], items[i+1])
  
return res

Fixed submission:
n = int(input())
 
arr = list(map(int, input().split()))

arr.sort()

res = 0
i=0
l = len(arr)
while i<l:
  res+=min(arr[i], arr[i+1])
  i+=2
  
print(res)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())

mn = N
while (True):
    N = abs(N - K)
    if mn > N:
        mn = N
    else:
        break

print(mn)


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


a = N % K
print(a) if a < abs(a-K) else print(abs(a-K))
Buggy python submission (verdict: Time Limit Exceeded):
N, X, Y = map(int, input().split())

for k in range(1, N):
  count = 0
  for i in range(1, N):
    for j in range(i + 1, N + 1):
      if k == min( j - i, abs(X - i) + 1 + abs(Y - j) ):
        count += 1

  print(count)


Fixed submission:
N, X, Y = map(int, input().split())
X -= 1
Y -= 1


count = [0] * N
for i in range(N-1):
  for j in range(i + 1, N):
    count[min( j - i, abs(X - i) + 1 + abs(Y - j) )] += 1

for i in range(1, N):
  print(count[i])
Buggy python submission (verdict: Time Limit Exceeded):
N, A, B = map(int,input().split())
l = []

while (len(l) < N):
  tmp  = ['b' for i in range(A) if (len(l) + i) < N]
  tmp2 = ['r' for i in range(B) if (len(l) + len(tmp) + i) < N]
  l += (tmp + tmp2)

print(l.count('b'))


Fixed submission:

N, A, B = map(int, input().split())
out = N // (A + B) * A
rem = min(N % (A + B), A)
print(out + rem)

Buggy python submission (verdict: Time Limit Exceeded):
N, A, B = map(int,input().split())
l = []

while (len(l) < N):
  tmp  = ['b' for i in range(A) if (len(l) + i) < N]
  tmp2 = ['r' for i in range(B) if (len(l) + len(tmp) + i) < N]
  l.extend(tmp)
  l.extend(tmp2)
print(l.count('b'))


Fixed submission:

N, A, B = map(int, input().split())
out = N // (A + B) * A
rem = min(N % (A + B), A)
print(out + rem)
Buggy python submission (verdict: Runtime Error):
import sys
import numpy as np

input = sys.stdin.readline

N,K = map(int, input().split())
h = [int(i) for i in input().split()]
dp = [float('inf')] * N
h = np.array(h)

dp[0] = 0
for i in range(1, N):
  tmp = i
  if tmp > K:
    tmp = K
  for j in range(1,tmp + 1):
      dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))

print(dp[N-1])


Fixed submission:
N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * 10 ** 5

dp[0] = 0
for i in range(1, N):
  tmp = i
  if tmp > K:
    tmp = K
  for j in range(1,tmp + 1):
      dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))

print(dp[N-1])

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

input = sys.stdin.readline

N,K = map(int, input().split())
h = [int(i) for i in input().split()]
dp = [float('inf')] * N
h = np.array(h)

dp[0] = 0
for i in range(1, N):
  tmp = i
  if tmp > K:
    tmp = K
  for j in range(1,tmp + 1):
      dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))

print(dp[N-1])


Fixed submission:
N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * 10 ** 5

dp[0] = 0
for i in range(1, N):
  tmp = i
  if tmp > K:
    tmp = K
  for j in range(1,tmp + 1):
      dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))

print(dp[N-1])

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline

N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * 10 ** 5

dp[0] = 0
for i in range(1, N):
  tmp = i
  if tmp > K:
    tmp = K
  for j in range(1,tmp + 1):
      dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))

print(dp[N-1])


Fixed submission:
N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * 10 ** 5

dp[0] = 0
for i in range(1, N):
  tmp = i
  if tmp > K:
    tmp = K
  for j in range(1,tmp + 1):
      dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))

print(dp[N-1])

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * 10 ** 5

dp[0] = 0
for i in range(1, N):
  tmp = i
  if tmp > K:
    tmp = K
  for j in range(1,tmp + 1):
      dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))

print(dp[N-1])


Fixed submission:
N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * 10 ** 5

dp[0] = 0
for i in range(1, N):
  tmp = i
  if tmp > K:
    tmp = K
  for j in range(1,tmp + 1):
      dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))

print(dp[N-1])
Buggy python submission (verdict: Runtime Error):
num =input()
lst = num.split()
curtain = lst(1) * 2
ans = lst(0) - curtain

if(ans <= 0):
 print("0")
else:
 print(ans)


Fixed submission:
num =input()
lst = num.split()
curtain = int(lst[1]) * 2
ans = int(lst[0]) - curtain

if(ans <= 0):
 print("0")
else:
 print("{}".format(ans))
Buggy python submission (verdict: Runtime Error):
print(α)

Fixed submission:
s = input()
if s.isupper():
  print('A')
else:
  print('a')
Buggy python submission (verdict: Runtime Error):
a = input()
n = list(map(int, input().split()))
import numpy as np
if np.prod(n) >= 10 ** 18:
  print('-1')
else:
  print(np.prod(n))


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

Buggy python submission (verdict: Runtime Error):
a = input()
n = list(map(int, input().split()))
import numpy as np
if np.prod(n) =>10 ** 18:
  print('-1')
else:
  print(np.prod(n))


Fixed submission:
a, b = map(int, input().split())
print(a*b)
Buggy python submission (verdict: Runtime Error):
a, b, c, d = list(map(int, input().split()))
A = a - d
B = c - b
if A>=B:
  print('Yes')
else:
  print('No')

Fixed submission:
s, w = map(int, input().split())
if w>=s:
    print("unsafe")
else:
    print("safe")
Buggy python submission (verdict: Runtime Error):
import sys
a=0
b=0
c=0
x=3


v,y,z =[int(x) for x in input().split(" ")]

a = v+y
b = y+z
c = z+v

if a<b and a<c:
	print (a)

if b<c and b<a:
	print (b)

if c<b and c<a:
	print (c)

if a=b and b=c:
	print (a)

if a=b and b<c:
	print (a)

if a=c and a<b:
	print (a)

if c=b and b<a:
	print (c)

Fixed submission:
import sys
a=0
b=0
c=0
x=3


v,y,z =[int(x) for x in input().split(" ")]

a = v+y
b = y+z
c = z+v

if a<b and a<c:
	print (a)

if b<c and b<a:
	print (b)

if c<b and c<a:
	print (c)

if a == b and b == c:
	print (a)

if a == b and b<c:
	print (a)

if a ==c and a<b:
	print (a)

if c==b and b<a:
	print (c)
Buggy python submission (verdict: Runtime Error):
import sys
i=0
j=0
k=0
t=0
m=0
s=0
lists=[]
lists2 =[]

#数値の数を受け取る
line = int(input())

#数値を受け取ってリストの作成
while i < line:
	a = int(input())
	#print (a)
	lists.insert(i,a)
	i +=1

#数値の足し合わせ
while j < line:
    s += lists[j]
    j +=1

#正しければ出力
if s%10 != 0:
	print(s)
else:
    #10の倍数以外のリスト作成
    while k < line:
        if lists[k]%10 != 0:
	        lists2.insert(m,lists[k])
	        m +=1
        k +=1
    t = min(lists2)
    print(s-t)

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

ans= A + B

print("error" if ans >=10 else ans)

Buggy python submission (verdict: Runtime Error):
A, B = [int(x) for x in input().split(" ")]

ans= A + B

print("error" if ans >=10 else ans)

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

ans= A + B

print("error" if ans >=10 else ans)

Buggy python submission (verdict: Runtime Error):
A, B = [int(x) for x in input().split(” ”)]

ans= A + B

print("error" if ans >=10 else ans)

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

ans= A + B

print("error" if ans >=10 else ans)