Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
Tap = input()
len_Tap = len(Tap)
count = 0

for i in range(len_Tap):
    if (i+1) % 2 == 1:
        if Tap[i] == 'R' or Tap[i] == 'U' or Tap[i] == 'D':
            count += 1
    
    else:
        if Tap[i] == 'L' or Tap[i] == 'U' or Tap[i] == 'D':
            count += 1

if count == len_Tap:
    print(Yes)

else:
    print(No)

Fixed submission:
Tap = input()
len_Tap = len(Tap)
count = 0

for i in range(len_Tap):
    if (i+1) % 2 == 1:
        if Tap[i] == 'R' or Tap[i] == 'U' or Tap[i] == 'D':
            count += 1
    
    else:
        if Tap[i] == 'L' or Tap[i] == 'U' or Tap[i] == 'D':
            count += 1

if count == len_Tap:
    print('Yes')

else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N, K, Q = map(int, input().split())
list_winner = []
list_point =[]

for _ in range(Q):
    A = int(input())
    list_winner.append(A)
    list_point.append(K)
    
def add(n):
    return n-Q
    
list_point_new = []

for i in list_point:
    list_point_new.append(add(i))
    
for i in range(Q):
    a = list_winner[i]-1
    list_point_new[a] = list_point_new[a] + 1
    
for i in range(Q):
    if list_point_new[i] <= 0:
        print('No')
    else:
        print('Yes')

Fixed submission:
N, K, Q = map(int, input().split())
list_winner = []
list_point =[]

for _ in range(Q):
    A = int(input())
    list_winner.append(A)

for i in range(N):
    list_point.append(K)
    
    
def add(n):
    return n-Q
    
list_point_new = []

for i in list_point:
    list_point_new.append(add(i))
    
for i in range(Q):
    a = list_winner[i]-1
    list_point_new[a] = list_point_new[a] + 1
    
for i in range(N):
    if list_point_new[i] <= 0:
        print('No')
    else:
        print('Yes')
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())

if A == B:
    print('1')
    
elif B == 1:
    print('0')
    
else:
    AAA = 1
    
    while B > AAA:
        AAA = AAA + A - 1
        
    print(C)

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

if A == B:
    print('1')
    
elif B == 1:
    print('0')
    
else:
    AAA = 1
    C = 0
    
    while B > AAA:
        AAA = AAA + A - 1
        C += 1
        
    print(C)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

list_ans = [A+B, A-B, A*B]

print(max(list_ans))

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

list_ans = [A+B, A-B, A*B]

print(max(list_ans))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
list_A = []
for _ in range(N):
    A = int(input())
    list_A.append(A)
    
A = max(list_A)
index_A = list_A.index(A)
for i in range(N):
    if list_A[i] == A:
      list_B = sorted(list_A, reverse=True)
      B = list_B[1]
      print(B)
    else:
      print(A)


Fixed submission:
N = int(input())
list_A = []

for _ in range(N):
    A = int(input())
    list_A.append(A)
    
A = max(list_A)
index_A = list_A.index(A)

list_B = sorted(list_A, reverse=True)
B = list_B[1]

for i in range(N):    
    if list_A[i] == A:
        print(B)
    else:
        print(A)

Buggy python submission (verdict: Runtime Error):
N = int(input())
list_A = []

for _ in range(N):
    A = int(input())
    list_A.append(A)
    
A = max(list_A)
index_A = list_A.index(A)

for i in range(N):    
    if list_A[i] == A:
    	list_B = sorted(list_A, reverse=True)
     	B = list_B[1]
      	print(B)
    else:
        print(A)

Fixed submission:
N = int(input())
list_A = []

for _ in range(N):
    A = int(input())
    list_A.append(A)
    
A = max(list_A)
index_A = list_A.index(A)

list_B = sorted(list_A, reverse=True)
B = list_B[1]

for i in range(N):    
    if list_A[i] == A:
        print(B)
    else:
        print(A)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
list_A = []

for _ in range(N):
    A = int(input())
    list_A.append(A)
    
A = max(list_A)
index_A = list_A.index(A)

for i in range(N):
    if list_A[i] == A:
        list_A[i] = 0
        print(max(list_A))
        list_A[i] = A
    else:
        print(A)

Fixed submission:
N = int(input())
list_A = []

for _ in range(N):
    A = int(input())
    list_A.append(A)
    
A = max(list_A)
index_A = list_A.index(A)

list_B = sorted(list_A, reverse=True)
B = list_B[1]

for i in range(N):    
    if list_A[i] == A:
        print(B)
    else:
        print(A)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
list_A = []

for _ in range(N):
    A = int(input())
    list_A.append(A)
    
for i in range(N):
    original = list_A[i]
    list_A[i] = 0
    print(max(list_A))
    list_A[i] = original

Fixed submission:
N = int(input())
list_A = []

for _ in range(N):
    A = int(input())
    list_A.append(A)
    
A = max(list_A)
index_A = list_A.index(A)

list_B = sorted(list_A, reverse=True)
B = list_B[1]

for i in range(N):    
    if list_A[i] == A:
        print(B)
    else:
        print(A)
Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
    if a<b:
        tmp = a
        a = b
        b = tmp
    r = a % b
    while r!=0:
      a = b
      b = r
      r = a % b
    return b
  
def main():
    K = int(input())
    list_ = []
    sum_ = 0
    for i in range(K):
        for j in range(K):
            a = gcd(i,j)
            list_.append(a)
    for i in list_:
        for j in range(K):
            a = gcd(i,j)
            sum_ += a
    print(sum_)

main()
  

Fixed submission:
def gcd(a,b):
    if a<b:
        tmp = a
        a = b
        b = tmp
    r = a % b
    while r!=0:
      a = b
      b = r
      r = a % b
    return b
  
def main():
    K = int(input())
    list_ = []
    sum_ = 0
    for i in range(1,K+1):
        for j in range(1,K+1):
            a = gcd(i,j)
            list_.append(a)
    for i in list_:
        for j in range(1,K+1):
            a = gcd(i,j)
            sum_ += a
    print(sum_)

main()
Buggy python submission (verdict: Runtime Error):
N = int(input())
M = int(input())
a = N*(N-1)//2 + M*(M-1)//2
print(a)

Fixed submission:
N,M = map(int,input().split())
print(N*(N-1)//2 + M*(M-1)//2)
Buggy python submission (verdict: Time Limit Exceeded):
S = input()
numQ = int(input())
lead = 1

for i in range(numQ):
  Q = input()
  if Q[0] == "1":
    lead *= -1
  else:
    if Q[2] == "1":
      if lead == 1:
        S = Q[4] + S
      else:
        S = S + Q[4]
    else:
      if lead == 1:
        S = S + Q[4]
      else:
        S = Q[4] + S
if lead == -1:
  S = S[::-1]

print(S)
      
      

Fixed submission:
S = input()
numQ = int(input())
lead = 1
front = ""
rear = ""
for i in range(numQ):
  Q = input()
  if Q[0] == "1":
    lead *= -1
  else:
    if Q[2] == "1":
      if lead == 1:
        front = Q[4] + front
      else:
        rear = rear + Q[4]
    else:
      if lead == 1:
        rear = rear + Q[4]
      else:
        front = Q[4] + front
S = front + S + rear
if lead == -1:
  S = S[::-1]

print(S)
Buggy python submission (verdict: Runtime Error):
N = input()
if N % 2 == 1:
  a = 1
else:
  a = 0
print(N//2+a)

Fixed submission:
N = int(input())
if N % 2 == 1:
  a = 1
else:
  a = 0
print(N//2+a)
Buggy python submission (verdict: Runtime Error):
A,B = input().split()
print(6-A-B)

Fixed submission:
A = int(input())
B = int(input())
print(6-A-B)
Buggy python submission (verdict: Runtime Error):
a = input()
if 7 in a: 
  print("Yes")
else: 
  print("No")

Fixed submission:
a = input()
if "7" in a: 
   print("Yes")
else: 
   print("No")
Buggy python submission (verdict: Time Limit Exceeded):
import math
k = int(input())
a = 0
for m in range(1,k+1):
    for n in range(1,k+1):
        for l in range(1,k+1):
             b = math.gcd(m,n)
             #print("b={}".format(b))
             a = a + math.gcd(b,l)
             #print("a={}".format(a))
print(a)


Fixed submission:
import math
k = int(input())
a = 0
for m in range(1,k+1):
    for n in range(1,k+1):
        b = math.gcd(m,n)
        for l in range(1,k+1):
            a += math.gcd(l,b)
print(a)

Buggy python submission (verdict: Time Limit Exceeded):
import math
K = int(input())
ans = 0
for i in range(K):
  i += 1
  for j in range(K):
    j += 1
    for k in range(K):
      k += 1
      ans += math.gcd(math.gcd(i, j), k)
print(ans)


Fixed submission:
import numpy as np

K = int(input())
r = np.arange(1, K + 1)
print(np.sum(np.gcd.outer(np.gcd.outer(r, r), r)))
Buggy python submission (verdict: Runtime Error):
from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

N, M = map(int, input().split())

print(cmb(N, 2) + cmb(M, 2))


Fixed submission:
N, M = map(int, input().split())
ans = ((N * (N-1)) / 2) + ((M * (M-1)) / 2)
print(int(ans))
Buggy python submission (verdict: Time Limit Exceeded):
import math
a, b, c = map(int, input().split())
for i in range(1, 9):
  while (a % i == 0 and b % i == 0 and c % i == 0):
    if (a == i or b == i or c == i):
      break
    a /= i
    b /= i
    c /= i
left = a * b
right = (c - (a + b)) / 2
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')


Fixed submission:
a, b, c = map(int, input().split())
left = 4 * a * b
right = c - (a + b)
if (right < 0):
  print('No')
  exit()
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
import math
a, b, c = map(int, input().split())
for i in range(1, 9):
while (a % i == 0 and b % i == 0 and c % i == 0):
  if (a == i or b == i or c == i):
    break
  a /= i
  b /= i
  c /= i
left = a * b
right = (c - (a + b)) / 2
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')


Fixed submission:
a, b, c = map(int, input().split())
left = 4 * a * b
right = c - (a + b)
if (right < 0):
  print('No')
  exit()
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
import math
a, b, c = map(int, input().split())
for (a % 2 == 0 and b % 2 == 0 and c % 2 == 0):
  if (a == 2 or b == 2 or c == 2):
    break
  a /= 2
  b /= 2
  c /= 2
left = a * b
right = (c - (a + b)) / 2
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')


Fixed submission:
a, b, c = map(int, input().split())
left = 4 * a * b
right = c - (a + b)
if (right < 0):
  print('No')
  exit()
right = right ** 2
if (left < right):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n, a ,b = map(int, input().split())
ans = 0
length = 0
while length <= n:
  length += a + b
  ans += a
over = length - n
if (over == 0):
  print(ans)
else:
  if (over <= b):
    print(ans)
  else:
    over -= b
    ans -= over
    print(ans)

Fixed submission:
n, a, b = map(int, input().split())
q = n // (a+b)
mod = n % (a+b)
ans = q * a
if (mod > a):
  ans += a
else:
  ans += mod
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n, a, b = map(int, input().split())
tmp = []
while len(tmp) <= n:
  for i in range(a):
    tmp.append('b')
  for j in range(b):
    tmp.append('r')
ans = []
for k in range(n):
  ans.append(tmp[k])
print(ans.count('b'))


Fixed submission:
n, a, b = map(int, input().split())
q = n // (a+b)
mod = n % (a+b)
ans = q * a
if (mod > a):
  ans += a
else:
  ans += mod
print(ans)
Buggy python submission (verdict: Runtime Error):
s, t = input().split(" ")
print(f"{t+s}")

Fixed submission:
s, t = input().split(" ")
print(t+s)
Buggy python submission (verdict: Runtime Error):
N = input()
for i in N:
  if i == '7':
    print('yes')
    return 0
print('no')

    

Fixed submission:
N = input()
flag = 0
for i in N:
    if i == '7':
        flag = 1
        print('Yes')
        break
if flag == 0:
    print('No')

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

r = s.count("R")
g = s.count("G")
b = s.count("B")

a = r * g * b

for i in range(n):
    for j in range(i+1, n):
        k = 2 * j - i 
        if k > n-1:
            continue
        
        if s[i] != s[j] and s[j] != s[k] and s[k] != s[i]:
            a -= 1

print(a)

Fixed submission:
n = int(input())
m = str(n)
l = list(m)
if l.count("7")>0:
    print("Yes")
else:
    print("No")

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

if m.count(7)>0:
    print("Yes")
else:
    print("No")

Fixed submission:
n = int(input())
m = str(n)
l = list(m)
if l.count("7")>0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = list(input())

r = s.count("R")
g = s.count("G")
b = s.count("B")

a = r * g * b

for i in range(n):
    for j in range(i+1, n):
        k = 2 * j - i 
        if k > n-1:
            continue
        
        if s[i] != s[j] and s[j] != s[k] and s[k] != s[i]:
            a -= 1

print(a)

Fixed submission:
n = int(input())
s = list(input())

r = s.count("R")
g = s.count("G")
b = s.count("B")

a = r * g * b

for i in range(n):
    for j in range(i+1, n):
        k = 2 * j - i 
        if k > n-1:
            break
        
        if s[i] != s[j] and s[j] != s[k] and s[k] != s[i]:
            a -= 1

print(a)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools

n,x,y = map(int, input().split())

a = [i for i in range(1, n+1)]
b = list(itertools.combinations(a, 2))
c = [0]*(n-1)

for j in range(len(b)):
    d = min(abs(b[j][0]-b[j][1]), abs(x-b[j][0])+1+abs(b[j][1]-y), abs(y-b[j][0])+1+abs(b[j][1]-x))
    c[d-1] += 1

for k in range(n-1):
    print(c[k])

Fixed submission:
import itertools

n,x,y = map(int, input().split())

a = [i for i in range(1, n+1)]
b = [0]*(n-1)

for j in range(n):
    for k in range(j+1, n):
        c = min(abs(k-j),abs(j-(x-1)) +abs(k-(y-1))+1)
        b[c-1] += 1
    

for l in range(n-1):
    print(b[l])

Buggy python submission (verdict: Time Limit Exceeded):
import itertools

n,x,y = map(int, input().split())

a = [i for i in range(1, n+1)]
b = list(itertools.combinations(a, 2))
c = [0]*len(b)

for j in range(len(b)):
    c[j] = min(abs(b[j][0]-b[j][1]), abs(x-b[j][0])+1+abs(b[j][1]-y), abs(y-b[j][0])+1+abs(b[j][1]-x))

for k in range(1, n):
    print(c.count(k))

Fixed submission:
import itertools

n,x,y = map(int, input().split())

a = [i for i in range(1, n+1)]
b = [0]*(n-1)

for j in range(n):
    for k in range(j+1, n):
        c = min(abs(k-j),abs(j-(x-1)) +abs(k-(y-1))+1)
        b[c-1] += 1
    

for l in range(n-1):
    print(b[l])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [input() for i in range(n)]

a = set(s)
b = list(a)
c = sorted(b)
d = 0
e = []

for j in range(len(c)):
    f = 0
    for k in range(n):
        if c[j]==s[k]:
            f += 1
    if f > d:
        d = f 
        e = [c[j]]
    elif f == d:
        e.append(c[j])

for l in range(len(e)):
    print(e[l])

            
    

Fixed submission:
n = int(input())
s = [input() for i in range(n)]

a = {}

for j in range(n):
    if not(s[j] in a):
        a[s[j]] = 1
    else:
        a[s[j]] += 1

b = 0
for num in a.values():
  if num > b:
    b = num

c = []
for name,num in a.items():
  if num==b:
    c.append(name)

d=sorted(c)

for k in d:
    print(k)

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

a = set(s)
b = list(a)
c = sorted(b)
d = 0
e = []

for j in range(len(c)):
    f = 0
    for k in range(n):
        if c[j]==s[k]:
            f += 1
    if f > d:
        d = f 
        e = [c[j]]
    elif f == d:
        e.append(c[j])

for l in range(len(e)):
    print(e[l])

            
    

Fixed submission:
n = int(input())
s = [input() for i in range(n)]

a = {}

for j in range(n):
    if not(s[j] in a):
        a[s[j]] = 1
    else:
        a[s[j]] += 1

b = 0
for num in a.values():
  if num > b:
    b = num

c = []
for name,num in a.items():
  if num==b:
    c.append(name)

d=sorted(c)

for k in d:
    print(k)
Buggy python submission (verdict: Runtime Error):
n = int(input())
if n<10:
    print(n)
elif n<100:
    print(9)
elif n<1000:
    print(n-(99-9))
elif n<10000:
    print(999-(99-9))
elif n<100000:
    print(n-(9999-999)-(99-9))
elif n==100000:
    print(99999-(9999-999)-(99-9))



Fixed submission:
a,b,c = map(int, input().split())
d = c-(a-b)
if d<0:
    print(0)
else:
    print(d)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
h = list(map(int,input().split()))
a = 0
b = 0
x = [0]*n

def sakana(p, q):
    for i in range(n-1):
        if p[i]>p[i+1] and q[i]==0:
            p[i]=p[i]-1
            q[i]=1

if n==1:
    print("Yes")
else:
    while b<100000:
        sakana(h, x)
        b = b+1

    for j in range(n-1):
        if h[j]>h[j+1]:
            print("No")
            break
        a = a+1
    if a==n-1:
        print("Yes")

Fixed submission:
n = int(input())
h = list(map(int,input().split()))
a = 0
b = 0
x = [0]*n

if n==1:
    print("Yes")
else:
    for i in range(n-1):
        if h[i]>h[i+1]:
            h[i]=h[i]-1
            x[i]=1

    for k in range(n-1):
        if h[n-k-1]<h[n-k-2] and x[n-k-2]==0:
            h[n-k-2]=h[n-k-2]-1


    for j in range(n-1):
        if h[j]>h[j+1]:
            print("No")
            break
        a = a+1
    if a==n-1:
        print("Yes")
Buggy python submission (verdict: Runtime Error):
n,m = map(int, input().split())
listA = [int(input()) for i in range(m)]
listB = [0]*(n+1)
for k in range(m):
    listB[listA[k]] = 1
if(listB[1]==1 and listB[2]==1):
    a,b = 0,0
elif(listB[1]==1):
    a,b = 0,1
elif(listB[2]==1):
    a,b = 1,0
else:
    a,b = 1,2

for j in range(1, n-1):
    if(listB[j+2]!=0):
        a,b = b,0
    if(listB[j+2]==0):
        a,b = b,a+b

print(b%1000000007)

Fixed submission:
n,m = map(int, input().split())
listA = [int(input()) for i in range(m)]
listB = [0]*(n+2)
for k in range(m):
    listB[listA[k]] = 1
if(n==1 and listB[1]==0):
    a,b = 1,1
elif(n==1 and listB[1]==1):
    a,b = 0,0
elif(listB[1]==1 and listB[2]==1):
    a,b = 0,0
elif(listB[1]==1):
    a,b = 0,1
elif(listB[2]==1):
    a,b = 1,0
else:
    a,b = 1,2

for j in range(1, n-1):
    if(listB[j+2]!=0):
        a,b = b,0
    if(listB[j+2]==0):
        a,b = b,a+b

print(b%1000000007)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()
k = int(input())
t = list(s)
u = ""
for i in range(s):
    if t[i]!=t[k-1]:
        t[i]="*"
for j in range(n):
    u = t[j]+u
print(u)

Fixed submission:
a,b,c = map(int, input().split())
if min(a,b)<c and max(a,b)>c:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n,q = map(int, input().split())
s = input()
listA = [list(map(str, input().split())) for i in range(q)]
listB =[]
for l in range(n):
    listB.append(1)

def sakana(listC, y):
    if y==0:
        listC[0]=0
    elif y!=0:
        listC[y-1]=listC[y-1]+listC[y]
        listC[y]=0
        
def sakanasan(listD, z):
    if z==n-1 :
        listD[n-1]=0
    elif z!=n-1 :
        listD[z+1]=listD[z+1]+listD[z]
        listD[z]=0

for j in range(q):
    for k in range(n):
        if s[k]==listA[j][0] and listA[j][1]=="L":
            sakana(listB, k)
        elif s[n-1-k]==listA[j][0] and listA[j][1]=="R":
            sakanasan(listB, n-1-k)
print(sum(listB))

Fixed submission:
a,b,c = map(int, input().split())
if a==b and b==c:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a = int(input())
if a%2==0:
  print(int((a/2)**2))
else:
  print(int(((a-1)/2)**2)


Fixed submission:
a = int(input())
if a%2==0:
  print(int((a/2)**2))
else:
  print(int(((a-1)/2)*((a+1)/2)))
Buggy python submission (verdict: Runtime Error):
x,a,b = map(int, input().split())
if x-a!=0:
	print(0)
else:
	print((x-a)%b)


Fixed submission:
x = int(input())
a = int(input())
b = int(input())
if x-a==0:
   print(0)
else:
   print((x-a)%b)

Buggy python submission (verdict: Runtime Error):
x,a,b = map(int, input().split())
print((x-a)%b)

Fixed submission:
x = int(input())
a = int(input())
b = int(input())
if x-a==0:
   print(0)
else:
   print((x-a)%b)

Buggy python submission (verdict: Runtime Error):
x,a,b = map(int, input().split())
print(int((x-a)/b))

Fixed submission:
x = int(input())
a = int(input())
b = int(input())
if x-a==0:
   print(0)
else:
   print((x-a)%b)

Buggy python submission (verdict: Runtime Error):
x,a,b = map(int, input().split())
print(int((x-a)/b))

Fixed submission:
x = int(input())
a = int(input())
b = int(input())
if x-a==0:
   print(0)
else:
   print((x-a)%b)
Buggy python submission (verdict: Runtime Error):
a,b = map(int(), input().split())
c=a*b
if c%2==0:
  print("Odd")
else:
  print("Even")

Fixed submission:
a,b = map(int, input().split())
c=a*b
if c%2==0:
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
a = int(input().split("/"))
a[0]=2018
print(str(a[0])+"/"+str(a[1])+"/"+str(a[2]))

Fixed submission:
a = input().split("/")
a[0]="2018"
print(a[0]+"/"+a[1]+"/"+a[2])

Buggy python submission (verdict: Runtime Error):
a = input()
a[3]="8"
print(a)

Fixed submission:
a = input().split("/")
a[0]="2018"
print(a[0]+"/"+a[1]+"/"+a[2])

Buggy python submission (verdict: Runtime Error):
a = input()
a[3]=8
print(a)

Fixed submission:
a = input().split("/")
a[0]="2018"
print(a[0]+"/"+a[1]+"/"+a[2])
Buggy python submission (verdict: Runtime Error):
n = input()
k=0
for i in range(10):
  if n.count(str(i))>=3:
    print("Yes")
    k=1
    break
if k=0:
  print("No")
  
   


Fixed submission:
n = input()
if n[0]==n[1] and n[1]==n[2]:
  print("Yes")
elif n[1]==n[2] and n[2]==n[3]:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
k=0
for i in range(10):
  if n.count(i)>=3:
    print("Yes")
    k=1
  break
if k=0:
  print("No")
  
   

Fixed submission:
n = input()
if n[0]==n[1] and n[1]==n[2]:
  print("Yes")
elif n[1]==n[2] and n[2]==n[3]:
  print("Yes")
else:
  print("No")