Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    N = int(lines.pop(0))
    S = lines.pop(0)
    RS = S[::-1]
    S = 'x' + S
    RS = 'x' + RS
    slist = []
    rslist = []
    ss = 0
    rss = 0
    for i in range(N):
        if S[i] == 'W':
            ss += 1
        if RS[i] == 'E':
            rss += 1
        slist.append(ss)
        rslist.insert(0,rss)
    #print(S)
    #print(RS)
    #print(list( zip(slist, rslist)))
    print(min([s + r for s, r in zip(slist, rslist)]))

#
# main
#
# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Fixed submission:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    N = int(lines.pop(0))
    S = lines.pop(0)
    RS = S[::-1]
    S = 'x' + S
    RS = 'x' + RS
    slist = []
    rslist = []
    ss = 0
    rss = 0
    for i in range(N):
        if S[i] == 'W':
            ss += 1
        if RS[i] == 'E':
            rss += 1
        slist.append(ss)
        #rslist.insert(0,rss)
        rslist.append(rss)
    #print(S)
    #print(RS)
    #print(list( zip(slist, rslist)))
    rslist.reverse()
    print(min([s + r for s, r in zip(slist, rslist)]))

#
# main
#
# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Buggy python submission (verdict: Runtime Error):
[carbon:~/src/github.com/hilolih/atcoder:148](! master )% cat ABC098/c.py
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    N = int(lines.pop(0))
    S = lines.pop(0)
    RS = S[::-1]
    S = 'x' + S
    RS = 'x' + RS
    slist = []
    rslist = []
    ss = 0
    rss = 0
    for i in range(N):
        if S[i] == 'W':
            ss += 1
        if RS[i] == 'E':
            rss += 1
        slist.append(ss)
        rslist.insert(0,rss)
    #print(S)
    #print(RS)
    #print(list( zip(slist, rslist)))
    print(min([s + r for s, r in zip(slist, rslist)]))

#
# main
#
# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Fixed submission:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    N = int(lines.pop(0))
    S = lines.pop(0)
    RS = S[::-1]
    S = 'x' + S
    RS = 'x' + RS
    slist = []
    rslist = []
    ss = 0
    rss = 0
    for i in range(N):
        if S[i] == 'W':
            ss += 1
        if RS[i] == 'E':
            rss += 1
        slist.append(ss)
        #rslist.insert(0,rss)
        rslist.append(rss)
    #print(S)
    #print(RS)
    #print(list( zip(slist, rslist)))
    rslist.reverse()
    print(min([s + r for s, r in zip(slist, rslist)]))

#
# main
#
# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
from math import sqrt,floor
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    X = int(lines.pop(0))
    s = floor(sqrt(X))
    res = 1
    for c in range(s, 1, -1):
        print(c)
        while( c**n <= X ):
            res = max(res, c**n)
            n += 1

    print(res)
#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Fixed submission:
# -*- coding: utf-8 -*-
import sys
from math import sqrt,floor
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    X = int(lines.pop(0))
    s = floor(sqrt(X))
    res = 1
    for c in range(s, 1, -1):
        n = 2
        while( c**n <= X ):
            res = max(res, c**n)
            n += 1

    print(res)
#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    A,B = map(int, lines.pop(0).split(' '))
    if A <= B:
        print(A)
    else:
        print(A-1)
#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]
#
 # solve !!
#
solve(lines)


Fixed submission:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    K = list(map(int, lines.pop(0).split(' ')))
    N = int(lines.pop(0))
    K.sort()
    a = K.pop(-1)
    print(a * 2**N + sum(K))


#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]
#
# solve !!
#
solve(lines)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    def solve_iter(hi, wi):
        vec = [(0,1),(0,-1),(1,0),(-1,0)]
        for v in vec:
            hn = hi + v[0]
            wn = wi + v[1]
            if hn >= 0 and hn < H and wn >= 0 and wn < W:
                if NLIST[hn][wn] == '#':
                    NLIST[hi][wi] = '.'
                    NLIST[hn][wn] = '.'
                    solve_iter(hn, wn)
        return

    H,W = map(int, lines.pop(0).split(' '))
    NLIST = []
    for i in range(H):
        NLIST.append(list(lines.pop(0)) )

    res = 'Yes'
    for i in range(H):
        for j in range(W):
            if NLIST[i][j] == '#':
                solve_iter(i, j)
            if NLIST[i][j] == '#':
                res = 'No'

    print(res)

#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Fixed submission:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    def solve_iter(hi, wi):
        vec = [(0,1),(0,-1),(1,0),(-1,0)]
        for v in vec:
            hn = hi + v[0]
            wn = wi + v[1]
            if hn >= 0 and hn < H and wn >= 0 and wn < W:
                if NLIST[hn][wn] == '#' or NLIST[hn][wn] == '*':
                    NLIST[hi][wi] = '*'
                    NLIST[hn][wn] = '*'
                    #solve_iter(hn, wn)
        return

    H,W = map(int, lines.pop(0).split(' '))
    NLIST = []
    for i in range(H):
        NLIST.append(list(lines.pop(0)) )

    res = 'Yes'
    for i in range(H):
        for j in range(W):
            if NLIST[i][j] == '#':
                solve_iter(i, j)
            if NLIST[i][j] == '#':
                res = 'No'

    print(res)

#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    S = list(lines.pop(0))
    S.sort()
    S = ''.join(S)
    if S == 'abc':
        print('Yes')
    else:
        print('No')

#
# main
#
lines = contents.split('\n')

# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Fixed submission:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    S = list(lines.pop(0))
    S.sort()
    S = ''.join(S)
    if S == 'abc':
        print('Yes')
    else:
        print('No')

#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    A,B,K = map(int, lines.pop(0).split(' '))
    NLIST = list(range(A,B+1))
    res = list(set(NLIST[:K] +  NLIST[-K:]))
    res.sort()
    for i in res:
        print(i)

#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Fixed submission:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    A,B,K = map(int, lines.pop(0).split(' '))
    NLIST = set()
    for i in range(K):
        if A+i <= B:
            NLIST.add(A+i)
        if A <= B-i:
            NLIST.add(B-i)

    NLIST = list(NLIST)
    NLIST.sort()
    for i in NLIST:
        print(i)

#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    A,B,K = map(int, lines.pop(0).split(' '))
    NLIST = list(range(A,B+1))
    res = list(set(NLIST[:K] +  NLIST[-K:]))
    for i in res:
        print(i)

#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Fixed submission:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    A,B,K = map(int, lines.pop(0).split(' '))
    NLIST = set()
    for i in range(K):
        if A+i <= B:
            NLIST.add(A+i)
        if A <= B-i:
            NLIST.add(B-i)

    NLIST = list(NLIST)
    NLIST.sort()
    for i in NLIST:
        print(i)

#
# main
#
lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)
Buggy python submission (verdict: Runtime Error):
def resolve():
    N = int(input())
    A = list(map(int,input().split()))
    c = collections.Counter(A)
    C = max(c.values())
    if C > 1 :
        print('NO')
    else:
        print('YES')
resolve()

Fixed submission:
import  collections
def resolve():
    N = int(input())
    A = list(map(int,input().split()))
    c = collections.Counter(A)
    C = max(c.values())
    if C > 1 :
        print('NO')
    else:
        print('YES')
resolve()
Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input().split())

Q = K - A
q = A - K
if Q < 0 :
  print (q)
if Q >= 0 :
  W = B - Q
  if W >= 0:
    print ("0",W)
  if W< 0 :
    print("0 0")

Fixed submission:
S,T = input().split()
print(T+S)

Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
print(T + S)

Fixed submission:
S,T = input().split()
print(T+S)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split()

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

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

S = c - a + b
if S > 0 :
            print (S)
else :
            print ("0")
Buggy python submission (verdict: Runtime Error):
N = int (input())
if N < 10:
  print (N)
if N >=10 && N <100:
  print ("9")
if N >=100 && N < 1000:
  print (N - 99 + 9)
if N >= 1000 && N < 10000:
  print ("909")
if N >=10000 && N < 100000:
  print (N - 9999 + 900 + 9)
if N == 100000:
  print ("90909")

Fixed submission:
N = int (input())
if N < 10:
  print (N)
elif N >=10 and N <100:
  print ("9")
elif N >=100 and N < 1000:
  print (N - 99 + 9)
elif N >= 1000 and N < 10000:
  print ("909")
elif N >=10000 and N < 100000:
  print (N - 9999 + 900 + 9)
elif N == 100000:
  print ("90909")
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())
ama1 = a % 2 
ama2 = b % 2

if ana1 == 1 and ama2 == 1 :
    print ("Odd")
else :
    print ("Even")

Fixed submission:
a,b = map(int, input().split())
ama1 = a % 2 
ama2 = b % 2

if ama1 == 1 and ama2 == 1 :
    print ("Odd")
else :
    print ("Even")

Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())
ama1 = a % 2 
ama2 = b % 2

if ana1 == 1 and ama2 == 1 :
    print　("Odd")
else :
    print ("Even")

Fixed submission:
a,b = map(int, input().split())
ama1 = a % 2 
ama2 = b % 2

if ama1 == 1 and ama2 == 1 :
    print ("Odd")
else :
    print ("Even")
Buggy python submission (verdict: Runtime Error):
S = int(input())
N = S.count("1")
print (N)

Fixed submission:
S = input()
N = S.count("1")
print (N)
Buggy python submission (verdict: Runtime Error):
def Base_10_to_n(N, K):
    if (int(N/K)):
        return Base_10_to_n(int(N/K), K)+str(N%K)
    return str(N%K)

x10 = 35
x2 = Base_10_to_n(N, K)
x2 = str(x2)
print(len(x2))

Fixed submission:
N, K = map(int, input().split())
def Base_10_to_n(N, K):
    if (int(N/K)):
        return Base_10_to_n(int(N/K), K)+str(N%K)
    return str(N%K)

x10 = 35
x2 = Base_10_to_n(N, K)
x2 = str(x2)
print(len(x2))
Buggy python submission (verdict: Runtime Error):
N, X = map(int, input().split())


def num(N,X):
    number = 0
    for x in X:
        num = x-N

        num2 = num**2

        number += num2

    return number
    
kekka = str(num(N,X))
print(kekka)
    

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

def num(P, X):
    number = 0
    for x in X:
        num = x-P
        #print(str(num))
        num2 = num**2
        number += num2
    return number

nList = []
for p in range(min(X), max(X) + 1):
    nList.append(num(p, X))

n = str(min(nList))
print(n)
Buggy python submission (verdict: Runtime Error):
n, l = map(int, input(),split())
if l > 0:
    print((n - 1) * (int(n / 2) + l - 1))
else:
    print((n - 1) * (int(n / 2) + l))


Fixed submission:
n, l = map(int, input().split())
if l <= 0 and abs(l) < n:
    a = int((n * (2 * l + n - 1)) / 2)
    print(a)
elif l <= 0 and abs(l) >= n:
    a = int((n - 1) * (2 * l + n - 2) / 2)
    print(a)
else:
    a = int((n - 1) * (2 * l + n) / 2)
    print(a)
Buggy python submission (verdict: Runtime Error):
b = input()

if b == A:
  print("T")
if b == T:
  print("A")
if b == C:
  print("G")
if b == G:
  print("C")

Fixed submission:
b = input()
 
if b == "A":
  print("T")
if b == "T":
  print("A")
if b == "C":
  print("G")
if b == "G":
  print("C")

Buggy python submission (verdict: Runtime Error):
b = input()
 
if b == A:
  print("T")
if b == T:
  print("A")
if b == C:
  print("G")
if b == G:
  print("C")

Fixed submission:
b = input()
 
if b == "A":
  print("T")
if b == "T":
  print("A")
if b == "C":
  print("G")
if b == "G":
  print("C")

Buggy python submission (verdict: Runtime Error):
b = input()
 
if b == A:
  print("T")
elif b == T:
  print("A")
elif b == C:
  print("G")
elif b == G:
  print("C")

Fixed submission:
b = input()
 
if b == "A":
  print("T")
if b == "T":
  print("A")
if b == "C":
  print("G")
if b == "G":
  print("C")

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

if b == A:
  print("T")
elif b == T:
  print("A")
elif b == C:
  print("G")
elif b == G:
  print("C")

Fixed submission:
b = input()
 
if b == "A":
  print("T")
if b == "T":
  print("A")
if b == "C":
  print("G")
if b == "G":
  print("C")
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
cnt = 0

while A <= B:
  B = B - A
  
  if cnt >= C
    break
  cnt+=1
print(cnt)

Fixed submission:
A, B, C = map(int, input().split())
cnt = 0
 
while A <= B:
  B = B - A
  
  if cnt >= C:
    break
  cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
N = int(input())

if N == 1:
    print("Hello World")
elif N == 2:
    A, B = map(int, input().split())

    print(A + B)


Fixed submission:
N = int(input())

if N == 1:
    print("Hello World")
elif N == 2:
    A = int(input())
    B = int(input())
    print(A + B)
Buggy python submission (verdict: Runtime Error):
list(nyu = input())

for i in nyu:
    if i == "1":
        print("9", end="")
    elif  i == "9":
        print("1", end="")
print()


Fixed submission:
nyu = input()
list(nyu)

for i in nyu:
    if i == "1":
        print("9", end="")
    elif  i == "9":
        print("1", end="")
print()

Buggy python submission (verdict: Runtime Error):
list = [int(input().split(''))for i in range(3)]

for i in range(3):
    if list[i] == 1:
        print(9, end="")
    elif list[i] == 9:
        print(9, end="")

print()


Fixed submission:
nyu = input()
list(nyu)

for i in nyu:
    if i == "1":
        print("9", end="")
    elif  i == "9":
        print("1", end="")
print()

Buggy python submission (verdict: Runtime Error):
list = [int(input().splir\t(''))for i in range(3)]

for i in range(3):
    if list[i] == 1:
        print(9, end="")
    elif list[i] == 9:
        print(9, end="")

print()


Fixed submission:
nyu = input()
list(nyu)

for i in nyu:
    if i == "1":
        print("9", end="")
    elif  i == "9":
        print("1", end="")
print()

Buggy python submission (verdict: Runtime Error):
list = [int(input(''))for i in range(3)]

for i in range(3):
    if list[i] == 1:
        print(9, end="")
    elif list[i] == 9:
        print(9, end="")

print()


Fixed submission:
nyu = input()
list(nyu)

for i in nyu:
    if i == "1":
        print("9", end="")
    elif  i == "9":
        print("1", end="")
print()

Buggy python submission (verdict: Runtime Error):
list = [int(input())for i in range(3)]

for i in range(3):
    if list[i] == 1:
        print(9, end="")
    elif list[i] == 9:
        print(9, end="")

print()


Fixed submission:
nyu = input()
list(nyu)

for i in nyu:
    if i == "1":
        print("9", end="")
    elif  i == "9":
        print("1", end="")
print()
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if abs(a - b) < abs(a - c) and abs(a - b) < abs(b - c):
    print(abs(a - b) + abs(b - c))
elif abs(a - c) < abs(a - b) and abs(a - c) < abs(b - c):
    print(abs(a - c) + abs(c - b)
elif abs(b - c) < abs(a - b) and abs(b - c) < abs(a - c):
    print(abs(b - c) + abs(c - a))


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

a.sort()

print(a[2]-a[0])

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

if abs(a - b) < abs(a - c) and abs(a - b) < abs(b - c):
    print(abs(a - b) + abs(b - c))
elif abs(a - c) < abs(a - b) and abs(a - c) < abs(b - c):
    print(abs(a - b) + abs(b - c)
else:
    print(abs(b - c) + abs(c - a))


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

a.sort()

print(a[2]-a[0])

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

if abs(a - b) < abs(a - c) and abs(a - b) < abs(b - c):
    print(abs(a - b) + abs(b - c))
elif abs(a - c) < abs(a - b) and abs(a - c) < abs(b - c):
    print(abs(a - c) + abs(b - c)
else:
    print(abs(a - c) + abs(a - b))


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

a.sort()

print(a[2]-a[0])

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

if abs(a - b) < abs(a - c) and abs(a - b) < abs(b - c):
    print(abs(a - b) + abs(b - c))
elif abs(a - c) < abs(a - b) and abs(a - c) < abs(b - c)
    print(abs(a - c) + abs(b - c)
else:
    print(abs(a - c) + abs(a - b))


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

a.sort()

print(a[2]-a[0])
Buggy python submission (verdict: Runtime Error):
a = list(map(input().split('')))

output = 0

for i in range(len(a)):
    if a[i] == '+':
        output += 1
    elif a[i] == '-':
        output -= 1
}

print(output)


Fixed submission:
a = list(input())

output = 0

for i in a:
    if i == '+':
        output += 1
    elif i == '-':
        output -= 1

print(output)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())

if B < 0:
    print(A - B)
elif A > 1 and B > 1:
    print(A * B)
else A ==1 or B == 1:
    print(A + B)


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

add = A + B
sub = A - B
mul = A * B

if add > sub and add > mul:
    print(add)
elif sub > add and sub > mul:
    print(sub)
elif mul > add and mul > sub:
    print(mul)
else:
    print(add)

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())

if A < 0 or b < 0:
    print(abs(A) + abs(B))
else:
    print(A * B)


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

add = A + B
sub = A - B
mul = A * B

if add > sub and add > mul:
    print(add)
elif sub > add and sub > mul:
    print(sub)
elif mul > add and mul > sub:
    print(mul)
else:
    print(add)
Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())

if abs(a - c) <= d:
    print("Yes")
elif abs(a - b) <= d and abs(b + )c <= d:
    print("Yes")
else:
    print("No")


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

if abs(a - c) <= d:
    print("Yes")
elif abs(a - b) <= d and abs(b - c) <= d:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a = list(input())
if i[0] == i[1] and i[1] == i[2] and i[2] == i[0]:
    print("Yes")
else:
    print("No")


Fixed submission:
a = list(input())
if a[0] == a[1] or a[1] == a[2] or a[2] == a[0]:
    print("No")
else:
    print("Yes")

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

for i in a:
    if i == "a":
        c1 = 1
    elif i == "b":
        c2 = 1
    elif i == "c":
        c3 = 1
if c1 == 1 and c2 == 1 and c3 == 1:
    print("Yes")
else:
    print("No")


Fixed submission:
a = list(input())
if a[0] == a[1] or a[1] == a[2] or a[2] == a[0]:
    print("No")
else:
    print("Yes")

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

for i in a:
    if i == "a":
        c1 = 1
    elif i == "b":
        c2 = 1
    elif i == "c":
        c3 = 1

if c1 == 1 and c2 == 1 and c3 == 1:
    print("Yes")
else:
    print("No")


Fixed submission:
a = list(input())
if a[0] == a[1] or a[1] == a[2] or a[2] == a[0]:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
a = list(input().split(''))

for i in a:
    if i == "a":
        c1 = 1
    elif i == "b":
        c2 = 1
    elif i == "c":
        c3 = 1

if c1 == 1 and c2 == 1 and c3 == 1:
    print("Yes")
else:
    print("No")


Fixed submission:
a = list(input())
if a[0] == a[1] or a[1] == a[2] or a[2] == a[0]:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
#include <stdio.h>

int main(void){
  int l1 = [3];
  int i;
  
  for (i = 0;i < 9;i += 3){
    scanf("%d", &l1[i]);
  }
  print("%d%d%d\n", l1[0], l1[1], l1[2]);
  return 0;
}

Fixed submission:
A, B, C = [input() for i in range(3)]

print(A[0] + B[1] + C[2])

Buggy python submission (verdict: Runtime Error):
a = [input()for i in range(3)]
b = [input()for i in range(3)]
c = [input()for i in range(3)]

print(a[0] + b[1] + c[2])


Fixed submission:
A, B, C = [input() for i in range(3)]

print(A[0] + B[1] + C[2])
Buggy python submission (verdict: Runtime Error):
y, m, d = map(int, input().split('/'))

print(y+1 + "/" + m + "/" + d)


Fixed submission:
y, m, d = input().split('/')

print("2018/01/", end='')
print(d)
Buggy python submission (verdict: Runtime Error):
h = int(input())

print(24 + (24 - h)


Fixed submission:
h = int(input())

print(24 + (24 - h))