Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-

A, B, C = [int(x) for x in input().split()]

if B >= C:
    as = C + B
elif (C-B) >= A:
    as = B + A + C
else:
    as = C + B

print(as)

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-

A, B, C = [int(x) for x in input().split()]

if B >= C-1:
    answer = C + B
elif (B+A) >= C-1:
    answer = B + C
else:
    answer = 2*B + A+1

print(answer)
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
p = []
for _ in range(N):
    p.append(int(input())

pmax = max(p)
ans = int(sum(p)-pmax/2)
print(ans)

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
p = []
for _ in range(N):
    p.append(int(input()))

pmax = max(p)
ans = int(sum(p)-pmax/2)
print(ans)

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = input()
p = []
for _ in range(N):
    p.append(int(input())

pmax = max(p)
ans = int(sum(p)-pmax/2)
print(ans)

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
p = []
for _ in range(N):
    p.append(int(input()))

pmax = max(p)
ans = int(sum(p)-pmax/2)
print(ans)
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = [int(x) for x in input().split()]
height = []
for _ in range(N):
    height.append(int(input()))

height.sort()
height.reverse()
sublist = []
for i in range(N-K+1):
    hmax-hmin = height[i]-height[i+K-1]
    sublist.append(hmax-hmin)

print(min(sublist))


Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = [int(x) for x in input().split()]
height = []
for _ in range(N):
    height.append(int(input()))

height.sort()
height.reverse()
sublist = []
for i in range(N-K+1):
    hmaxhmin = height[i]-height[i+K-1]
    sublist.append(hmaxhmin)

print(min(sublist))

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = [int(x) for x in input().split()]
height = []
for _ in range(N):
    height.append(int(input()))

height.sort()
height.reverse()
sublist = []
for i in range(N-K+1):
    hmaxhmin = height[i]-height[i+K]
    sublist.append(hmaxhmin)

print(min(sublist))


Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = [int(x) for x in input().split()]
height = []
for _ in range(N):
    height.append(int(input()))

height.sort()
height.reverse()
sublist = []
for i in range(N-K+1):
    hmaxhmin = height[i]-height[i+K-1]
    sublist.append(hmaxhmin)

print(min(sublist))

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = [int(x) for x in input().split()]
height = []
for _ in range(N):
    height.append(int(input()))

height.sort()
height.reverse()
sublist = []
for i in range(N-K+1):
    hmaxhmin = height[i]-heght[i+K]
    sublist.append(hmaxhmin)

print(min(sublist))



Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = [int(x) for x in input().split()]
height = []
for _ in range(N):
    height.append(int(input()))

height.sort()
height.reverse()
sublist = []
for i in range(N-K+1):
    hmaxhmin = height[i]-height[i+K-1]
    sublist.append(hmaxhmin)

print(min(sublist))

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = [int(x) for x in input().split()]
height = []
for _ in range(N):
    height.append(int(input()))

height.sort()
height.reverse()
sublist = []
for i in range(N-K+1):
    hmax-hmin = height[i]-heght[i+K]
    sublist.append(hmax-hmin)

print(min(sublist))


Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N, K = [int(x) for x in input().split()]
height = []
for _ in range(N):
    height.append(int(input()))

height.sort()
height.reverse()
sublist = []
for i in range(N-K+1):
    hmaxhmin = height[i]-height[i+K-1]
    sublist.append(hmaxhmin)

print(min(sublist))
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
S = list(input())

sublist = []
for i in range(len(S)-2):
    num =  int("".join(S[i:i+3]))
    sublist.append(abs(num-754)

print(min(sublist))

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
S = list(input())

sublist = []
for i in range(len(S)-2):
    num =  int("".join(S[i:i+3]))
    sublist.append(abs(num-753))

print(min(sublist))

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
S = list(input())

sublist = []
for i in range(len(s)-2):
    num =  int("".join(S[i:i+3]))
    sublist.append(num)

print(min(sublist))

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
S = list(input())

sublist = []
for i in range(len(S)-2):
    num =  int("".join(S[i:i+3]))
    sublist.append(abs(num-753))

print(min(sublist))
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
ls = [x+1 for x in range(N)]
candidates = [str(x) for x in ls if "7" in str(x) and "5" in str(x) and "3" in str(x)]
count = 0
for _ in range len(candidates):
    candlist = list(candidates)
    ls2 = [x for x in candlist if x != "7" and x != "5"and x != "3"]
    if ls2 is False:
        count += 1

print(count)


Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())

def dfs(s):
    if int(s) > N:
        return 0
    ret =1 if all (s.count(c) > 0 for c in '753') else 0
    for c in '753':
        ret += dfs (s+c)
    return ret

print(dfs('0'))

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
ls = [x+1 for x in range(N)]
candidates = [str(x) for x in ls if "7" in str(x) and "5" in str(x) and "3" in str(x))
count = 0
for _ in range len(candidates):
    candlist = list(candidates)
    ls2 = [x for x in candlist if x != "7" and x != "5"and x != "3"]
    if ls2 is False:
        count += 1

print(count)


Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())

def dfs(s):
    if int(s) > N:
        return 0
    ret =1 if all (s.count(c) > 0 for c in '753') else 0
    for c in '753':
        ret += dfs (s+c)
    return ret

print(dfs('0'))

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
ls = [x+1 for x in range(N)]
candidates = [str(x) for x in ls if "7" in str(x) and "5" in str(x) and "3" in str(x))
count = 0
for _ in range len(candidates):
    candlist = list(candidates)
    ls2 = [x for x in candlist if x != 7 and x != 5 and x != 3]
    if ls2 is False:
        count += 1

print(count)


Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())

def dfs(s):
    if int(s) > N:
        return 0
    ret =1 if all (s.count(c) > 0 for c in '753') else 0
    for c in '753':
        ret += dfs (s+c)
    return ret

print(dfs('0'))
Buggy python submission (verdict: Runtime Error):
N = int(input())
if N == 1:
  print("Hallo World")
else:
  list = []
  for _ in range(N)
  list.append(int(input()))
  A,B = list
  print(A+B)
    
    

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
if N == 1:
    print('Hello World')
else:
    A,B = [int(input()),int(input())]
    print(A +B)

Buggy python submission (verdict: Runtime Error):
N = int(input())
if N == 1:
  print("Hallo World")
  else:
    list = []
    for _ in range(N):
      list.append(int(input()))
    A,B = list
    print(A+B)
    
    

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
if N == 1:
    print('Hello World')
else:
    A,B = [int(input()),int(input())]
    print(A +B)

Buggy python submission (verdict: Runtime Error):
N = int(input())
if N == 1:
  print("Hallo World")
  else:
    A, B = [int(x) for x in input()]
    print(A+B)
    
    

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
if N == 1:
    print('Hello World')
else:
    A,B = [int(input()),int(input())]
    print(A +B)

Buggy python submission (verdict: Runtime Error):
N = int(input())
if N == 1:
  print("Hallo World")
  else:
    print(int(input()) + int(input()))
    
    

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
if N == 1:
    print('Hello World')
else:
    A,B = [int(input()),int(input())]
    print(A +B)
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N,T = [int(x) for x in input().split]
cost = []
for _ in range(N):
    c,t = [int(x) for x in input().split]
    if t <= T:
        cost.append(c)

if cost == True:
    print(min(cost))
else:
    print("TLE")

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N,T = [int(x) for x in input().split()]
cost = []
for _ in range(N):
    c,t = [int(x) for x in input().split()]
    if t <= T:
        cost.append(c)

if cost:
    print(min(cost))
else:
    print("TLE")

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N,T = [int(x) for x in input().split]
cost = []
for _ in range(n):
    c,t = [int(x) for x in input().split]
    if t <= T:
        cost.append(c)

if cost == True:
    print(min(cost))
else:
    print("TLE")

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N,T = [int(x) for x in input().split()]
cost = []
for _ in range(N):
    c,t = [int(x) for x in input().split()]
    if t <= T:
        cost.append(c)

if cost:
    print(min(cost))
else:
    print("TLE")
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-

n = ls(input())
nans =[]
for i in range (3):
  if n[i] == "1":
    nans.append("9")
    else:
      nans.append("1")
print("".join(nans))
    


Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-


n = list(input())
nans =[]
for i in range (3):
    if n[i] == "1":
        nans.append("9")
    else:
        nans.append("1")
print("".join(nans))

Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-

n = ls[input()]
nans =[]
for i in range (3):
  if n[i] == "1":
    nans.append("9")
    else:
      nans.append("1")
print("".join(nans))
    


Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-


n = list(input())
nans =[]
for i in range (3):
    if n[i] == "1":
        nans.append("9")
    else:
        nans.append("1")
print("".join(nans))
Buggy python submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
wls =[]
for i in range(N):
    wls.append(input())
count =0
if count(wls) != count(set(wls):
    print('No')
else:
    for i in range(N):
        if i == 0:
            continue
        else:
            if wls[i][0] != wls[i-1][-1]:
                count += 1
            
if count == 0:
    print('Yes')
else:
    print('No')
        





Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-
N = int(input())
wls =[]
for i in range(N):
    wls.append(input())
count =0
if len(wls) != len(set(wls)):
    print('No')
else:
    for i in range(N):
        if i == 0:
            continue
        else:
            if wls[i][0] != wls[i-1][-1]:
                count += 1
            
    if count == 0:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
N,L=map(int, input().split())
a=[]
for i in range(N):
    a.append(input())
a.sort()
for i in range(N):
    print(a[i],end='')
    


Fixed submission:
a=input().split()
a.sort()
if a[0]=='5' and a[1]=='5' and a[2]=='7':
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
N,L=input().split()
N=int(N)
a=[]
for i in range(N):
    s=input()
    a.append(s)
a.sort()
for i in range(N):
    print(a[i],end='')
    


Fixed submission:
a=input().split()
a.sort()
if a[0]=='5' and a[1]=='5' and a[2]=='7':
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
aI, aO, aT, aJ, aL, aS, aZ = map(int, input().split())

if aL%2 and aJ%2:
    print(int((aI-1)/2)*2+aO+int(aJ/2)*2+int(aL/2)*2+3)
else:
    print(int(aI/2)*2+aO+int(aJ/2)*2+int(aL/2)*2)


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

a = abs(abs(x)-abs(y))

if (x < 0 and y <= 0 and abs(x) > abs(y)) or (x >= 0 and y >= 0 and abs(x)<abs(y)):
    b = 0
elif (x < 0 and y > 0) or (x >= 0 and y <= 0):
    b = 1
else:
    b = 2

print(a+b)

Buggy python submission (verdict: Runtime Error):
aI, aO, aT, aJ, aL, aS, aZ = map(int, input().split())

if aL%2 and aJ%2:
    print(int((aI-1)/2)*2+aO+int(aJ/2)*2+int(aL/2)*2+3)
else:
    print(int(aI/2)*2+aO+int(aJ/2)*2+int(aL/2)*2)


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

a = abs(abs(x)-abs(y))

if (x < 0 and y <= 0 and abs(x) > abs(y)) or (x >= 0 and y >= 0 and abs(x)<abs(y)):
    b = 0
elif (x < 0 and y > 0) or (x >= 0 and y <= 0):
    b = 1
else:
    b = 2

print(a+b)
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, raw_input().split(' '))
P = 1000000007

skip = []
for i in range(M):
    skip.append(int(raw_input()))


steps = [0] * (N + 2)
steps[0] = 1

for i in range(0, N):
    if i+1 not in skip:
        steps[i+1] += steps[i]
        steps[i+1] %= P

    if i+2 not in skip:
        steps[i+2] += steps[i]
        steps[i+2] %= P

print steps[N]


Fixed submission:
N, M = map(int, raw_input().split(' '))
P = 1000000007

skip = []
for i in range(M):
    skip.append(int(raw_input()))

nums = set(range(N)) - set(skip)

steps = [0] * (N + 2)
steps[0] = 1

for i in nums:
    steps[i+1] = (steps[i+1] + steps[i]) % P
    steps[i+2] = (steps[i+2] + steps[i]) % P

print steps[N]

Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, raw_input().split(' '))
P = 1000000007

skip = []
for i in range(M):
    skip.append(int(raw_input()))


steps = [0] * (N + 2)
steps[0] = 1

for i in range(0, N):
    if i+1 not in skip:
        steps[i+1] += steps[i]
        steps[i+1] %= P

    if i+2 not in skip:
        steps[i+2] += steps[i]
        steps[i+1] %= P

print steps[N]


Fixed submission:
N, M = map(int, raw_input().split(' '))
P = 1000000007

skip = []
for i in range(M):
    skip.append(int(raw_input()))

nums = set(range(N)) - set(skip)

steps = [0] * (N + 2)
steps[0] = 1

for i in nums:
    steps[i+1] = (steps[i+1] + steps[i]) % P
    steps[i+2] = (steps[i+2] + steps[i]) % P

print steps[N]
Buggy python submission (verdict: Runtime Error):
import collections

def inputN(typ=str):
    return map(typ, raw_input().split())


N = inputN(int)[0]
v = inputN(int)

col0 = collections.Counter(v[::2])
col1 = collections.Counter(v[1::2])
X0 = col0.most_common()
X1 = col1.most_common()
#print X0
#print X1

if X0[0][0] == X1[0][0]:
    if len(X0) == 1 and len(X1) == 1:
        k0 = X[0][1]
        k1 = 0
    elif len(X0) == 1:
        k0 = X0[0][1]
        k1 = X1[1][1]
    elif len(X1) == 1:
        k0 = X0[1][1]
        k1 = X1[0][1]
    elif X0[1][1] >= X1[1][1]:
        k0 = X0[1][1]
        k1 = X1[0][1]
    elif X0[1][1] < X1[1][1]:
        k0 = X0[0][1]
        k1 = X1[1][1]
else:
    k0 = X0[0][1]
    k1 = X1[0][1]

print N - k0 - k1


Fixed submission:
import collections

def inputN(typ=str):
    return map(typ, raw_input().split())


N = inputN(int)[0]
v = inputN(int)

col0 = collections.Counter(v[::2])
col1 = collections.Counter(v[1::2])
X0 = col0.most_common()
X1 = col1.most_common()
#print X0
#print X1

if X0[0][0] == X1[0][0]:
    if len(X0) == 1 and len(X1) == 1:
        k0 = X0[0][1]
        k1 = 0
    elif len(X0) == 1:
        k0 = X0[0][1]
        k1 = X1[1][1]
    elif len(X1) == 1:
        k0 = X0[1][1]
        k1 = X1[0][1]
    elif X0[1][1] >= X1[1][1]:
        k0 = X0[1][1]
        k1 = X1[0][1]
    elif X0[1][1] < X1[1][1]:
        k0 = X0[0][1]
        k1 = X1[1][1]
else:
    k0 = X0[0][1]
    k1 = X1[0][1]

print N - k0 - k1

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

def inputN(typ=str):
    return map(typ, raw_input().split())


N = inputN(int)[0]
v = inputN(int)

col0 = collections.Counter(v[::2])
col1 = collections.Counter(v[1::2])
X0 = col0.most_common()
X1 = col1.most_common()
#print X0
#print X1

if X0[0][0] == X1[0][0]:
    if len(X0) == 1 and len(X1) == 1:
        k0 = X[0][1]
        k1 = 0
    elif len(X0) == 1:
        k0 = X0[0][1]
        k1 = X1[1][1]
    elif len(X1) == 1:
        k0 = X0[1][1]
        k1 = X1[0][1]
    elif X0[1][1] >= X1[1][1]:
        k0 = X0[0][1]
        k1 = X1[1][1]
    elif X0[1][1] < X1[1][1]:
        k0 = X0[1][1]
        k1 = X1[0][1]
else:
    k0 = X0[0][1]
    k1 = X1[0][1]

print N - k0 - k1


Fixed submission:
import collections

def inputN(typ=str):
    return map(typ, raw_input().split())


N = inputN(int)[0]
v = inputN(int)

col0 = collections.Counter(v[::2])
col1 = collections.Counter(v[1::2])
X0 = col0.most_common()
X1 = col1.most_common()
#print X0
#print X1

if X0[0][0] == X1[0][0]:
    if len(X0) == 1 and len(X1) == 1:
        k0 = X0[0][1]
        k1 = 0
    elif len(X0) == 1:
        k0 = X0[0][1]
        k1 = X1[1][1]
    elif len(X1) == 1:
        k0 = X0[1][1]
        k1 = X1[0][1]
    elif X0[1][1] >= X1[1][1]:
        k0 = X0[1][1]
        k1 = X1[0][1]
    elif X0[1][1] < X1[1][1]:
        k0 = X0[0][1]
        k1 = X1[1][1]
else:
    k0 = X0[0][1]
    k1 = X1[0][1]

print N - k0 - k1
Buggy python submission (verdict: Runtime Error):
def Fib(n):
    a, b = 0, 1
    if n == 1:
        return a
    elif n == 2:
        return b
    else:
        for i in range(n-2):
            a, b = b, a + b
        return b

N,M = map(int,input().split())
if M == 0:
  P = Fib(N+2)
  print(P%1000000007)
else:
  S = []
  for _ in range(M):
    S.append(int(input()))
  S.append(-1)
  S.append(N+1)
  S.sort()  
  P = 1

  for i in range(M+1):
    P *= Fib(S[i+1]-S[i]) 

  print(P%1000000007)


Fixed submission:
a = [int(i) for i in input().split()]
a.sort()
print(a[0]+a[1])

Buggy python submission (verdict: Runtime Error):
def Fib(n):
    a, b = 0, 1
    if n == 1:
        return a
    elif n == 2:
        return b
    else:
        for i in range(n-2):
            a, b = b, a + b
        return b

N,M = map(int,input().split())
if M == 0:
  print(Fib(N+2))
else:
  S = []
  for _ in range(M):
    S.append(int(input()))
  S.append(-1)
  S.append(N+1)
  S.sort()  
  P = 1

  for i in range(M+1):
    P *= Fib(S[i+1]-S[i]) 

  print(P%1000000007)


Fixed submission:
a = [int(i) for i in input().split()]
a.sort()
print(a[0]+a[1])

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
S = []
for _ in range(M):
  S.append(int(input()))
S.append(-1)
S.append(N+1)
S.sort()  
P = 1

def Fib(n):    
    if n == 1:
        return 0
    elif n == 2:
        return 1
    else:
        return Fib(n-1)+Fib(n-2)
      
for i in range(M+1):
  P *= Fib(S[i+1]-S[i]) 

print(P%1000000007)

Fixed submission:
a = [int(i) for i in input().split()]
a.sort()
print(a[0]+a[1])
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
ListA = list(map(int,input().split()))
dictionary = {}
for i in range(M):
    B,C = map(int,input().split())
    dictionary[C] = B
    
ListA =  sorted(ListA)
dict_keys = sorted(dictionary.keys())
for dict_key in dict_keys:
    for i in range(dictionary[dict_key]):
        if dict_key > ListA[i]:
            ListA[i] = dict_key
        else:
            ListA[i] = ListA[i]
    ListA = sorted(ListA)
print(sum(ListA))

Fixed submission:
A,B = map(int,input().split())
if A <= 5:
  price = 0
elif A >=6 and A <= 12:
  price = B/2
else:
  price = B
print(int(price))

Buggy python submission (verdict: Runtime Error):
A,B = int(input().split())
if A <= 5:
  price = B
elif A >=6 and A <= 12:
  price = B/2
else:
  price = B
print(price)


Fixed submission:
A,B = map(int,input().split())
if A <= 5:
  price = 0
elif A >=6 and A <= 12:
  price = B/2
else:
  price = B
print(int(price))

Buggy python submission (verdict: Runtime Error):
A,B = int(input().split())
if A <= 5:
  price = B
elif A >=6 and A <= 12:
  price = B/2
else:
  price = B
print(B)

Fixed submission:
A,B = map(int,input().split())
if A <= 5:
  price = 0
elif A >=6 and A <= 12:
  price = B/2
else:
  price = B
print(int(price))
Buggy python submission (verdict: Runtime Error):
N = int(input())

if N == 1:
  print("Hello World")
else N == 2:
  A = int(input())
  B = int(input())
  print(A + B)

Fixed submission:
N = int(input())

if N == 1:
  print("Hello World")
else :
  A = int(input())
  B = int(input())
  print(A + B)

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

if N == 1:
  print("Hello World")
else if N == 2:
  A = int(input())
  B = int(input())
  print(A + B)


Fixed submission:
N = int(input())

if N == 1:
  print("Hello World")
else :
  A = int(input())
  B = int(input())
  print(A + B)

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

if N == 1:
  print("Hello World")
else if N == 2:
  A, B = input() for i in 2
  print(A + B)


Fixed submission:
N = int(input())

if N == 1:
  print("Hello World")
else :
  A = int(input())
  B = int(input())
  print(A + B)

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

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


Fixed submission:
N = int(input())

if N == 1:
  print("Hello World")
else :
  A = int(input())
  B = int(input())
  print(A + B)
Buggy python submission (verdict: Runtime Error):
import collections
n = int(input())
v = list(input().split())
 
v_odd = []
v_even = []
 
for i in range(int(n)):
  if i % 2 == 1:
  	v_odd.append(i)
  
for i in range(int(n)):
  if i % 2 == 0:
  	v_even.append(i)
  
v_odd_counter = collections.Counter(v_odd)
a = v_odd_counter.most_common()[0][1]
 
v_even_counter = collections.Counter(v_even)
b = v_even_counter.most_common()[0][1]
 
print(n - a - b)

Fixed submission:
n = int(input())

print(1110 - n)
Buggy python submission (verdict: Runtime Error):
N = int(input())

if N % 111 == 0:
  print (N)
else:
  print((math.floor(N / 111) + 1) * 111 )

Fixed submission:
import math
N = int(input())

if N % 111 == 0:
  print (N)
else:
  print((math.floor(N / 111) + 1) * 111 )
Buggy python submission (verdict: Runtime Error):
N = int(input())
 
W = [[list(input())]]
 
def shiritori(N):
  for i in range(N):
    if any(W[i]):
      return "No"
    else:
    	if W[i-1][-1] == W[i][0]:
          return "Yes"
    	else:
          return "No"
    

        
print(shiritori(N))

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

if A*B % 2 == 0:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
import math

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

L = [list(input().split())]

print(math.gcd_list(L))

Fixed submission:
import fractions
from functools import reduce
 
N, X = map(int, input().split())
 
L = []

def minus_X(n):
  return abs(n - X)

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)

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

L2 = map(minus_X, L)
 
print(gcd_list(L2))
Buggy python submission (verdict: Runtime Error):
x1, y1, x2, y2 = map(int, input().split())

y3 = y2 + x2- x1
y4 = x2 - x1 + y1
x3 = y1 - y2 + x2
x4 = y1 - y2 + x1

print(x3, y3, x4, y4)


Fixed submission:
K = int(input())
 
if K % 2 == 0:
  print(int(K/2*K/2))
else:
  print(int((K-1)*(K+1)/4))
Buggy python submission (verdict: Runtime Error):
x1, y1, x2, y2 = map(int, input().split())

y3 = y2 + x2- x1
y4 = x2 - x1 + y1
x3 = y1 - y2 + x2
x4 = y1 - y2 + x1

print(x3 y3 x4 y4)

Fixed submission:
x1, y1, x2, y2 = map(int, input().split())

y3 = y2 + x2- x1
y4 = x2 - x1 + y1
x3 = y1 - y2 + x2
x4 = y1 - y2 + x1

print(x3, y3, x4, y4)
Buggy python submission (verdict: Runtime Error):
S = int(input())

lst = []
while i > 0:
    lst.append(S%10)
    S //= 10 # 必須
lst.reverse()

print(sum(lst))
 

Fixed submission:
S = int(input())

lst = []
while S > 0:
    lst.append(S%10)
    S //= 10 # 必須
lst.reverse()

print(sum(lst))