Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().sprit())
print(max([a*b,a-b,a+b]))

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

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().sprit())
print(max(a*b,a-b,a+b))

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

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().sprit())
max=int(a+b)
if max<a*b:
  max=int(a*b)
else if max<a-b:
  max=int(a-b)
print(max)

Fixed submission:
a,b=map(int,input().split())
print(max(a*b,a-b,a+b))
Buggy python submission (verdict: Runtime Error):
a=list(map(int,input().split()))
a=sorted(a)
print(a)
if a=[5,5,7]:
    print("YES")
else:
    print("NO")

Fixed submission:
a=list(map(int,input().split()))
a=sorted(a)
if a==[5,5,7]:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
a,b,k = map(int, input().split())
if a + k - 1 < b:
  min_ = a + k - 1
else:
  for i in range(a, b + 1):
    print(i)
  exit(0)
max_ = b - k + 1
for i in range(a, min_ + 1):
    print(i)
for i in range(max_, b + 1):
    print(i)

Fixed submission:
x = input()
a = b = c = 1
for i in range(3):
    if x[i] == 'a':
        a -= 1
    elif x[i] == 'b':
        b -= 1
    else:
        c -= 1
if a == 0 and b == 0 and c == 0: 
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
x[] = input().split()
a = b = c = 1
for i in 3:
    if x[i] == 'a':
        a--;
    elif x[i] == 'b':
        b--;
    else:
        c--;
if a == 0 and b == 0 and c == 0: 
    print("Yes")
else:
    print("No")

Fixed submission:
x = input()
a = b = c = 1
for i in range(3):
    if x[i] == 'a':
        a -= 1
    elif x[i] == 'b':
        b -= 1
    else:
        c -= 1
if a == 0 and b == 0 and c == 0: 
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import math

n = int(input())
c = -1
sum_ = 0
for i in range(n):
    a, b = map(int, input().split())
    sum_ += a
    if a > b:
        if c == -1:
            c = b
        if b > c:
            c = b
if c == -1:
    print("0")
else:
    print(s - c)


Fixed submission:
import math

n = int(input())
c = -1
sum_ = 0
for i in range(n):
    a, b = map(int, input().split())
    sum_ += a
    if a > b:
        if c == -1:
            c = b
        if b < c:
            c = b
if c == -1:
    print(0)
else:
    print(sum_ - c)
Buggy python submission (verdict: Runtime Error):
123456789012 123456789012


Fixed submission:
A,B = list(map(int,input().split()))
x = 1

def xors(X):
  res = 0
  x = 2
  while True:
    if x > X:
      break
    if (X % (x*2)) >= x and (X % (x*2)) % 2 == 0:
      res = res + x
    x = x*2
  if X % 4 <= 2 and X % 4 >= 1:
    res = res + 1
  return res
print(xors(B) ^ xors(A-1))
Buggy python submission (verdict: Runtime Error):
N,K = list(map(int,input().split()))
D = N//(K//2) - N//K
print(int((N//K)**3) if K%2 == 1 else int((N//K)**3)+int(D**3))

Fixed submission:
N,K = list(map(int,input().split()))
print(int((N//K)**3) if K%2 == 1 else int((N//K)**3)+int((N//(K//2) - N//K)**3))
Buggy python submission (verdict: Runtime Error):
a,b,k = map(int, input().split())
import math
import sys
c = math.gcd(a, b)
ls = []
for i in range(1, c):
    if c % i == 0:
        ls.append(i)

print(ls[k-1])


Fixed submission:
a, b, c= map(int, input().split())
print(min(b//a, c))
Buggy python submission (verdict: Runtime Error):
# N = list(map(int, input().split()))
# print(N[0], N[1], N[2])
# print(N[1])
# print(N[2])

N = int(input())
i = 2
a = 2
b = 1

while i <= N:
  c = a + b
  a = b
  b = c
  i = i + 1

print(c)


Fixed submission:

N = int(input())
i = 2
a = 2
b = 1

if N == 1:
  print(1)
else:
  while i <= N:
    c = a + b
    a = b
    b = c
    i = i + 1

  print(c)
Buggy python submission (verdict: Runtime Error):
A,B,C = (int(i) for in input().split())
sho=B//A

if sho >= C :
    print(C)
else:
    print(sho)

Fixed submission:
A,B,C = (int(i) for i in input().split())
sho=B//A

if sho >= C :
    print(C)
else:
    print(sho)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Fri Apr  5 17:16:14 2019

@author: adachi-lab
"""

input_1 = input()
S = input()
l = []
r = []


N = input_1.split()[0]
Q = input_1.split()[1]

for i in range(int(Q)):
    input_3 = input()
    l.append(int(input_3.split()[0]))
    r.append(int(input_3.split()[1]))

W = [(S[x-1:y]).count('AC') for (x, y) in zip(l, r)]

for i in range(len(W)):
    print(W[i])



Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Fri Apr  5 13:45:00 2019

@author: adachi-lab
"""

input_code = input()

list_1 = []

if input_code == 'A' or input_code == 'T':
    list_1 = ['A','T']
    list_1.remove(str(input_code))
    print(list_1[0])
    
else:
    list_1 = ['C','G']
    list_1.remove(str(input_code))
    print(list_1[0])

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Fri Apr  5 17:16:14 2019

@author: adachi-lab
"""

input_1 = input()
S = input()
l = []
r = []


N = input_1.split()[0]
Q = input_1.split()[1]

for i in range(int(Q)):
    input_3 = input()
    l.append(int(input_3.split()[0]))
    r.append(int(input_3.split()[1]))

W = [(S[x-1:y]).count('AC') for (x, y) in zip(l, r)]

for i in range(len(W)):
    print(W[i])



Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Fri Apr  5 13:45:00 2019

@author: adachi-lab
"""

input_code = input()

list_1 = []

if input_code == 'A' or input_code == 'T':
    list_1 = ['A','T']
    list_1.remove(str(input_code))
    print(list_1[0])
    
else:
    list_1 = ['C','G']
    list_1.remove(str(input_code))
    print(list_1[0])
Buggy python submission (verdict: Runtime Error):
a = int(input())
_ = int(input())
_ = int(input())
_ = int(input())
e = int(input())
k = int(input())

if e - a =< k:
  print("Yay!")
else:
  print(":(")



Fixed submission:
a = int(input())
_ = int(input())
_ = int(input())
_ = int(input())
e = int(input())
k = int(input())

if e - a <= k:
  print("Yay!")
else:
  print(":(")

Buggy python submission (verdict: Runtime Error):
a = int(input())
d = int(input())
f = int(input())
h = int(input())
e = int(input())
k = int(input())

if e - a =< k:
  print("Yay!")
else:
  print(":(")



Fixed submission:
a = int(input())
_ = int(input())
_ = int(input())
_ = int(input())
e = int(input())
k = int(input())

if e - a <= k:
  print("Yay!")
else:
  print(":(")
Buggy python submission (verdict: Runtime Error):
#-*- coding: utf-8 -*-

#入力
s = raw_input()

l = list(s)

count = 0
cl = []

for x in l:
    if x == "A" or x == "C" or x =="G" or x == "T":
        count += 1
    else:
        cl.append(count)
        count = 0

#print(cl)
print(max(cl))


Fixed submission:
#-*- coding: utf-8 -*-

#入力
s = raw_input()

l = list(s)

count = 0
cl = []

for x in l:
    if x == "A" or x == "C" or x =="G" or x == "T":
        count += 1
    else:
        cl.append(count)
        count = 0
cl.append(count)

#print(cl)
print(max(cl))
Buggy python submission (verdict: Runtime Error):
a,b,c = int(input().split())
if b//a <= c:
    print(b//a)
else:
    print(c)

Fixed submission:
a,b,c = map(int,input().split())
if b//a <= c:
    print(b//a)
else:
    print(c)
Buggy python submission (verdict: Runtime Error):
n = int(input())
sum = 0
for i in range(n):
    x,u = input()
    if u == "JPY":
        sum += float(x)
    else:
        sum += float(x)*380000
print(sum)

Fixed submission:
n = int(input())
sum = 0
for i in range(n):
    x,u = input().split()
    if u == "JPY":
        sum += float(x)
    else:
        sum += float(x)*380000
print(sum)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
foodlike = [0]*m
for i in range(n):
    data = list(map(int,input().split()))
    for j in range(data[0]):
        foodlike[data[j-1]] += 1
print(foodlike.count(n))

Fixed submission:
n,m = map(int,input().split())
foodlike = [0]*m
for i in range(n):
    data = list(map(int,input().split()))
    for j in range(data[0]):
        foodlike[data[j+1] - 1] += 1
print(foodlike.count(n))
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
x = sorted(list(map(int,input().split())))
gap = [x[i+1]-x[i] for i in range(m-1)]
def dp(n):
    if n == 1:
        return max(x) - min(x)
    else:
        if len(gap) > 0:
            maxGap = max(gap)
            gap.remove(maxGap)
        else:
            maxGap = 0
        return dp(n-1) - maxGap
if n < m:
    print(dp(n))
else:
    print(0)

Fixed submission:
t,x = map(int,input().split())
print(t/x)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
x = sorted(list(map(int,input().split())))
gap = sorted([x[i+1]-x[i] for i in range(m-1)])
length = len(gap)
def dp(n):
    global gap
    global length
    if n == 1:
        return max(x) - min(x)
    else:
        if length > 0:
            maxGap = gap[length - 1]
            gap = gap[:length-1]
        else:
            maxGap = 0
        return dp(n-1) - maxGap
if n < m:
    print(dp(n))
else:
    print(0)


Fixed submission:
n,m = map(int,input().split())
x = sorted(list(map(int,input().split())))
gap = sorted([x[i+1]-x[i] for i in range(m-1)])
if n < m:
    print(sum(gap[:m-n]))
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
x = sorted(list(map(int,input().split())))
gap = [x[i+1]-x[i] for i in range(m-1)]
def dp(n):
    if n == 1:
        return max(x) - min(x)
    else:
        if len(gap) > 0:
            maxGap = max(gap)
            gap.remove(maxGap)
        else:
            maxGap = 0
        return dp(n-1) - maxGap
if n < m:
    print(dp(n))
else:
    print(0)

Fixed submission:
n,m = map(int,input().split())
x = sorted(list(map(int,input().split())))
gap = sorted([x[i+1]-x[i] for i in range(m-1)])
if n < m:
    print(sum(gap[:m-n]))
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
x = sorted(list(map(int,input().split())))
gap = [x[i+1]-x[i] for i in range(m-1)]
def dp(n):
    if n == 1:
        return max(x) - min(x)
    else:
        if len(gap) > 0:
            maxGap = max(gap)
            gap.remove(maxGap)
        else:
            maxGap = 0
        return dp(n-1) - maxGap
print(dp(n))

Fixed submission:
n,m = map(int,input().split())
x = sorted(list(map(int,input().split())))
gap = sorted([x[i+1]-x[i] for i in range(m-1)])
if n < m:
    print(sum(gap[:m-n]))
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
n = int(input())
xyh = [list(map(int,input().split())) for i in range(n)]
flag = 0
for x in range(101):
    for y in range(101):
        for i in range(n-1):
            if xyh[i][2] - xyh[i+1][2] + abs(xyh[i][0] - x) + abs(xyh[i][1] - y) - abs(xyh[i+1][0] - x) - abs(xyh[i+1][1] - y) != 0:
                break
            if i == n-2:
                flag = 1
        if flag == 1:
            ans = [x,y]
            break
    if flag == 1:
        break
ans.append(xyh[0][2] + abs(xyh[0][0] - ans[0]) + abs(xyh[0][1] - ans[1]))
print(str(ans[0])+" "+str(ans[1])+" "+str(ans[2]))


Fixed submission:
n = int(input())
xyh = sorted([list(map(int,input().split())) for i in range(n)],key=lambda x:x[2])[::-1]
flag = 0
for x in range(101):
    for y in range(101):
        H = abs(xyh[0][0]-x) + abs(xyh[0][1]-y)+xyh[0][2]
        for i in range(n):
            if not((xyh[i][2] == 0 and H - abs(xyh[i][0]-x) - abs(xyh[i][1]-y) <= 0) or H - abs(xyh[i][0]-x) - abs(xyh[i][1]-y) == xyh[i][2]):
                break
            if i == n-1:
                flag = 1
        if flag == 1:
            ans = [x,y,H]
            break
    if flag == 1:
        break
print(str(ans[0])+" "+str(ans[1])+" "+str(ans[2]))
Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
k = m
while True:
    if m % k == 0 and m // k >= n:
        print(k)
        break
    k -= 1

Fixed submission:
n,m = map(int,input().split())
divisors = []
for i in range(1,int(m**0.5)+1):
    if m % i == 0:
        divisors.append(i)
        divisors.append(m//i)
divisors.sort()
k = 0
for i in range(len(divisors)):
    if divisors[i] > m/n:
        k = i - 1
        break
    if i == len(divisors) - 1:
        k = len(divisors) - 1
print(divisors[k])

Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
k = n
while True:
    if m % k == 0:
        print(m//k)
        break
    k += 1

Fixed submission:
n,m = map(int,input().split())
divisors = []
for i in range(1,int(m**0.5)+1):
    if m % i == 0:
        divisors.append(i)
        divisors.append(m//i)
divisors.sort()
k = 0
for i in range(len(divisors)):
    if divisors[i] > m/n:
        k = i - 1
        break
    if i == len(divisors) - 1:
        k = len(divisors) - 1
print(divisors[k])
Buggy python submission (verdict: Runtime Error):
s = input()
k = int(input())
onesum = 0
while s[0] == "1" and len(s) > 0:
    s = s[1:]
    onesum += 1
if k <= onesum:
    print(1)
else:
    print(s[0])


Fixed submission:
s = input()
k = int(input())
onesum = 0
while s[0] == "1":
    onesum += 1
    if len(s) == 1:
        break
    s = s[1:]
if k <= onesum:
    print(1)
else:
    print(s[0])

Buggy python submission (verdict: Runtime Error):
s = input()
k = int(input())
onesum = 0
while s[0] == "1" and len(s) > 0
    s = s[1:]
    onesum += 1
if k <= onesum:
    print(1)
else:
    print(s[0])


Fixed submission:
s = input()
k = int(input())
onesum = 0
while s[0] == "1":
    onesum += 1
    if len(s) == 1:
        break
    s = s[1:]
if k <= onesum:
    print(1)
else:
    print(s[0])

Buggy python submission (verdict: Runtime Error):
s = input()
k = int(input())
onesum = 0
while s[0] == "1":
    s = s[1:]
    onesum += 1
if k <= onesum:
    print(1)
else:
    print(s[0])


Fixed submission:
s = input()
k = int(input())
onesum = 0
while s[0] == "1":
    onesum += 1
    if len(s) == 1:
        break
    s = s[1:]
if k <= onesum:
    print(1)
else:
    print(s[0])
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
countAlice = 0
countBob = 0
for i in range(n):
    if i%2 == 0:
        countAlice += a[i]
    else:
        countBob += a[i]
print(coutAlice-countBob)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
countAlice = 0
countBob = 0
for i in range(n):
    if i%2 == 0:
        countAlice += a[i]
    else:
        countBob += a[i]
print(countAlice-countBob)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
x = int(input())
maxa = min([a,x//500])
maxb = min([b,x//100])
maxc = min([c,x/50])
count = 0
for i in range(maxa + 1):
    for j in range(maxb + 1):
        for k in range(maxc + 1):
            if 10*i + 2*j + k == x/50:
                count += 1
print(count)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
x = int(input())
maxa = min([a,x//500])
maxb = min([b,x//100])
maxc = min([c,x//50])
count = 0
for i in range(maxa + 1):
    for j in range(maxb + 1):
        for k in range(maxc + 1):
            if 10*i + 2*j + k == x/50:
                count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
x = int(input())
maxa = min([a,x//500])
maxb = min([b,x//100])
maxc = min([c,x/50])
count = 0
for i in range(maxa + 1):
    for j in range(maxb + 1):
        for k in range(maxc + 1):
            if 10*i + 2*j + k == x/50:
                count += 1
print(count)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
x = int(input())
maxa = min([a,x//500])
maxb = min([b,x//100])
maxc = min([c,x//50])
count = 0
for i in range(maxa + 1):
    for j in range(maxb + 1):
        for k in range(maxc + 1):
            if 10*i + 2*j + k == x/50:
                count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

all = 0

all += (a // 10) * 10
if (a % 10) != 0:
    all += 10

all += (b // 10) * 10
if (b % 10) != 0:
    all += 10

all += (c // 10) * 10
if (c % 10) != 0:
    all += 10

all += (d // 10) * 10
if (d % 10) != 0:
    all += 10

all += (e // 10) * 10
if (e % 10) != 0:
    all += 10

l = [(a % 10), (b % 10), (c % 10), (d % 10), (e % 10)]
l = [x for x in l if x != 0]

#print(l)

mi = min(l)
if mi != 0:
    all -= (10 - mi)

print(all)



Fixed submission:
# -*- coding: utf-8 -*-

a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())

all = 0

all += (a // 10) * 10
if (a % 10) != 0:
    all += 10

all += (b // 10) * 10
if (b % 10) != 0:
    all += 10

all += (c // 10) * 10
if (c % 10) != 0:
    all += 10

all += (d // 10) * 10
if (d % 10) != 0:
    all += 10

all += (e // 10) * 10
if (e % 10) != 0:
    all += 10

l = [(a % 10), (b % 10), (c % 10), (d % 10), (e % 10)]
l = [x for x in l if x != 0]

#print(l)
if len(l) != 0:
    mi = min(l)
    if mi != 0:
        all -= (10 - mi)

print(all)
Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
R = (int)(input())
G = (int)(input())
answer = 2 * G - R
print(answer)
Buggy python submission (verdict: Runtime Error):
N = int(input())　
if N <1000:
	print('ABC') 
else:
	print('ABD') 
	

Fixed submission:
N = int(input())
if N <1000:
	print("ABC")
else:
	print("ABD")

Buggy python submission (verdict: Runtime Error):
N = int(input())　
if N <1000:
	print("ABC") 
else:
	print("ABD") 
	

Fixed submission:
N = int(input())
if N <1000:
	print("ABC")
else:
	print("ABD")

Buggy python submission (verdict: Runtime Error):
N = int(input())　#int=整数
if N <1000:
	print("ABC") #"文字列"
else:
	print("ABD") #else=if以外
	

Fixed submission:
N = int(input())
if N <1000:
	print("ABC")
else:
	print("ABD")
Buggy python submission (verdict: Runtime Error):
N=int(input())
ans=1
for i in range(1,N):
    if i*i<=N:
        ans=i*i
print(ans)

Fixed submission:
a,b,c,d=map(int, input().split())
E=abs(b-a)
F=abs(c-b)
G=abs(c-a)
if E<=d and F<=d:
	print("Yes")
elif G<=d:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
A,B,C=map(int(input().split()))
if A+B>=C:
	print("Yes")
else:
	print("No")

Fixed submission:
A,B,C=map(int, input().split())
if A+B>=C:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
c11,c12,c13=input().split()
c21,c22,c23=input().split()
c31,c32,c33=input().split()
print(c11,c22,c33)

Fixed submission:
A=input()
B=input()
C=input()
target=A
D=target[0]
target=B
E=target[1]
target=C
F=target[2]
print(D+E+F)
Buggy python submission (verdict: Runtime Error):
O=input()
E=input()
T=""
for i in range(len(O)):
    T += O[i]+ E[i]
print(T)

Fixed submission:
O=input()
E=input()
T=""
if len(O)-len(E)==0:
  for i in range(len(O)):
    T += O[i]+ E[i]
  print(T)
else:
  for i in range(len(E)):
    T += O[i]+ E[i]
  T+=O[-1]
  print(T)
Buggy python submission (verdict: Runtime Error):
a,b,x = map(int, input().split())
T = []
for i in range(a,b+1):
	if i%x==0:
		T.append(i)
	else:
		quit
print(len(T))

Fixed submission:
S=input()
print(S[0]+S[8]+S[-7])
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x = map(int, input().split())
T = []
for i in range(a,b+1):
	if i%x==0:
		T.append(i)
	else:
		quit
print(len(T))

Fixed submission:
import math
a,b,x = map(int, input().split())
print(b//x-(a+x-1)//x+1)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int, input()
num = str(N[1])
char_list = list(num)
sum = 0
for i in range(len(char_list)):
    sum += int(char_list[i])

if N[1] % sum == 0:
    print("Yes")
else:
    print("No")


Fixed submission:
# -*- coding: utf-8 -*-
N = int, input()
num = str(N[1])
char_list = list(num)
sum = 0
for i in range(len(char_list)):
    sum += int(char_list[i])

if int(N[1]) % sum == 0:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int, input()
print(N)
num = str(N[1])
char_list = list(num)
sum = 0
for i in range(len(char_list)):
    sum += int(char_list[i])

if N[1] % sum == 0:
    print("Yes")
else:
    print("No")


Fixed submission:
# -*- coding: utf-8 -*-
N = int, input()
num = str(N[1])
char_list = list(num)
sum = 0
for i in range(len(char_list)):
    sum += int(char_list[i])

if int(N[1]) % sum == 0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = map(str, input().split())
out = "No"
N_list = list(N)
if N_list[0]==N_list[1] and N_list[0]==N_list[2]:
    out = "Yes"
elif N_list[1]==N_list[2] and N_list[1]==N_list[3]:
    out = "Yes"

print(out)


Fixed submission:
# -*- coding: utf-8 -*-
N = str, input()
out = "No"
N_list = list(N[1])

if N_list[0]==N_list[1] and N_list[0]==N_list[2]:
    out = "Yes"
elif N_list[1]==N_list[2] and N_list[1]==N_list[3]:
    out = "Yes"

print(out)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = map(str, input().split())
out = "No"
N_list = list(N)
if N_list[0]==N_list[1] and N_list[0]==N_list[2]:
    out = "Yes"
elif N_list[1]==N_list[2] and N_list[1]==N_list[3]:
    out = "Yes"

print(out)

Fixed submission:
# -*- coding: utf-8 -*-
N = str, input()
out = "No"
N_list = list(N[1])

if N_list[0]==N_list[1] and N_list[0]==N_list[2]:
    out = "Yes"
elif N_list[1]==N_list[2] and N_list[1]==N_list[3]:
    out = "Yes"

print(out)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
A, B, C, D = map(int, input().split())

if A+B+C+D == 7:
    print("A+B+C+D =7")
elif A-B+C+D == 7:
    print("A-B+C+D =7")
elif A+B-C+D == 7:
    print("A+B-C+D =7")
elif A-B-C+D == 7:
    print("A-B-C+D =7")
elif A+B+C-D == 7:
    print("A+B+C-D =7")
elif A-B+C-D == 7:
    print("A-B+C-D =7")
elif A+B-C-D == 7:
    print("A+B-C-D =7")
elif A-B-C-D == 7:
    print("A-B-C-D =7")


Fixed submission:
# -*- coding: utf-8 -*-
ABCD = str, input()
ABCD_list = list(ABCD[1])
A = int(ABCD_list[0])
B = int(ABCD_list[1])
C = int(ABCD_list[2])
D = int(ABCD_list[3])
if A+B+C+D == 7:
    print(str(A)+"+"+str(B)+"+"+str(C)+"+"+str(D)+"=7")
elif A-B+C+D == 7:
    print(str(A)+"-"+str(B)+"+"+str(C)+"+"+str(D)+"=7")
elif A+B-C+D == 7:
    print(str(A)+"+"+str(B)+"-"+str(C)+"+"+str(D)+"=7")
elif A-B-C+D == 7:
    print(str(A)+"-"+str(B)+"-"+str(C)+"+"+str(D)+"=7")
elif A+B+C-D == 7:
    print(str(A)+"+"+str(B)+"+"+str(C)+"-"+str(D)+"=7")
elif A-B+C-D == 7:
    print(str(A)+"-"+str(B)+"+"+str(C)+"-"+str(D)+"=7")
elif A+B-C-D == 7:
    print(str(A)+"+"+str(B)+"-"+str(C)+"-"+str(D)+"=7")
elif A-B-C-D == 7:
    print(str(A)+"-"+str(B)+"-"+str(C)+"-"+str(D)+"=7")
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
X, Y, Z = map(int, input().split())
print(int((X-Z)/(Y+Z)))


Fixed submission:
# -*- coding: utf-8 -*-
X, Y = map(str, input().split())
dic = {"A":10,"B":11,"C":12,"D":13,"E":14,"F":15,}
if dic[X]>dic[Y]:
    print(">")
elif dic[X]<dic[Y]:
    print("<")
elif dic[X]==dic[Y]:
    print("=")
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if b-a=<k and c-a=<k and d-a=<k and e-a=<k and c-b=<k and d-b=<k and e-b=<k and d-c=<k and e-c=<k and e-d=<k:
  print('Yay!')
else:
  print(':(')


        

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if b-a<=k and c-a<=k and d-a<=k and e-a<=k and c-b<=k and d-b<=k and e-b<=k and d-c<=k and e-c<=k and e-d<=k:
  print('Yay!')
else:
  print(':(')
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if a+b>c and a+c>b and b+c>a:
  if a=b=c:
    print('Yes')
  else:
    print('No')

Fixed submission:
a,b,c = map(int,input().split())
if a+b>c and a+c>b and b+c>a:
  if a==b==c:
    print('Yes')
  else:
    print('No')

Buggy python submission (verdict: Runtime Error):
x,y,z = map(int,input().split())
if x = y = z:
  print('Yes')
else:
  print('No)

Fixed submission:
a,b,c = map(int,input().split())
if a+b>c and a+c>b and b+c>a:
  if a==b==c:
    print('Yes')
  else:
    print('No')