Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
123456789012 123456789012
if b - a == 0:
    answer = a
else:
    answer = 0
    if a % 2 == 0:
        first_odd = a
    else:
        first_odd = a+1
    if b % 2 == 0:
        last_even = b-1
    else:
        last_even = b
    odd_even = int((last_even - first_odd + 1) // 2)
    if a % 2 == 1 and b % 2 == 0:
        answer += (odd_even + 1) % 2
        b2 = []
        while b > 0:
            b2.append(b % 2)
            b = int((b-b%2)//2)
        a2 = []
        for i in range(len(b2)):
            a2.append(a % 2)
            a = int((a-a%2)//2)
        for i in range(1,len(b2)):
            if a2[i]+b2[i] == 1:
                answer += 2**i
    elif a % 2 == 1:
        answer += (odd_even + 1) % 2 + a - 1
    elif b % 2 == 0:
        answer += odd_even % 2 + b
    else:
        answer += odd_even % 2

print(answer)


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

if b - a == 0:
    answer = a
else:
    answer = 0
    if a % 2 == 0:
        first_odd = a
    else:
        first_odd = a+1
    if b % 2 == 0:
        last_even = b-1
    else:
        last_even = b
    odd_even = int((last_even - first_odd + 1) // 2)
    if a % 2 == 1 and b % 2 == 0:
        answer += (odd_even + 1) % 2
        b2 = []
        while b > 0:
            b2.append(b % 2)
            b = int((b-b%2)//2)
        a2 = []
        for i in range(len(b2)):
            a2.append(a % 2)
            a = int((a-a%2)//2)
        for i in range(1,len(b2)):
            if a2[i]+b2[i] == 1:
                answer += 2**i
    elif a % 2 == 1:
        answer += (odd_even + 1) % 2 + a - 1
    elif b % 2 == 0:
        answer += odd_even % 2 + b
    else:
        answer += odd_even % 2

print(answer)
Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())
1 1 1

number = 0
for i in range(min(a,b),0,-1):
    if a % i == 0 and b % i == 0:
        number += 1
        if number == k:
            print(i)
            break


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

number = 0
for i in range(min(a,b),0,-1):
    if a % i == 0 and b % i == 0:
        number += 1
        if number == k:
            print(i)
            break

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

number = 0
for i in range(min(a,b),0,-1):
    if a % i == 0 and b % i == 0:
        number += 1
        if number == k:
            print(i)
            break


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

number = 0
for i in range(min(a,b),0,-1):
    if a % i == 0 and b % i == 0:
        number += 1
        if number == k:
            print(i)
            break
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

x = [a[1],a[0],a[1] % a[0]]
a.sort()
for i in range(1,n+1):
    while x[2] > 0:
        x[0] = x[1]
        x[1] = x[2]
        x[2] = x[0] % x[1]
    x[0] = a[i+1]
    x[2] = x[0] % x[1]

print(x[1])


Fixed submission:
n,m = map(int,input().split())
ka = list(list(map(int,input().split())) for _ in range(n))

like = [0]*m
for i in range(n):
    for j in range(1,ka[i][0]+1):
        like[ka[i][j]-1] += 1

answer = 0
for i in range(m):
    if like[i] == n:
        answer += 1

print(answer)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
ka = list(list(map(int,input().split())) for _ in range(n))

like = [0]*m
for i in range(n):
    for j in range(1,ka[i][0]+1):
        like[ka[i][j]] += 1

answer = 0
for i in range(m):
    if like[i] == n:
        answer += 1

print(answer)


Fixed submission:
n,m = map(int,input().split())
ka = list(list(map(int,input().split())) for _ in range(n))

like = [0]*m
for i in range(n):
    for j in range(1,ka[i][0]+1):
        like[ka[i][j]-1] += 1

answer = 0
for i in range(m):
    if like[i] == n:
        answer += 1

print(answer)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

x = [a[1],a[0],a[1] % a[0]]
a.sort()
for i in range(1,n+1):
    while x[2] > 0:
        x[0] = x[1]
        x[1] = x[2]
        x[2] = x[0] % x[1]
    x[0] = a[i+1]
    x[2] = x[0] % x[1]

print(x[1])


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

a.sort()
x = [a[1],a[0],a[1] % a[0]]
for i in range(1,n):
    while x[2] > 0:
        x[0] = x[1]
        x[1] = x[2]
        x[2] = x[0] % x[1]
    if i != n - 1:
        x[0] = a[i+1]
        x[2] = x[0] % x[1]

print(x[1])
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
x = list(map(int,input().split()))

x.sort()
interval = [0]*(m-1)

for i in range(m-1):
    interval[i] = x[i+1] - x[i]

interval.sort(reverse = True)

answer = x[m-1] - x[0]
for i in range(n-1):
    answer -= interval[i]

print(answer)


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

if n >= m:
    print(0)
else:
    x.sort()
    interval = [0]*(m-1)
    for i in range(m-1):
        interval[i] = x[i+1] - x[i]
    interval.sort(reverse = True)
    answer = x[m-1] - x[0]
    for i in range(min(m,n-1)):
        answer -= interval[i]
    print(answer)
Buggy python submission (verdict: Runtime Error):

K, N = map(int, input().split())
A = list(map(int, input().split()))

diff = K + A[0] - A[-1]

for i in range(N-1):
    diff = max(diff , A[i+1]-A[i])

print(K-diff)


Fixed submission:


s = input()

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):

K, N = map(int, input().split())
A = list(map(int, input().split()))

A.remove(0)
A.append(A[0])

max_distance = 0
pre = 0

for i in A:

    if abs(i - pre) > max_distance:
        max_distance = abs(i - pre)
    pre = i



print (K - max_distance)

Fixed submission:

K, N = map(int, input().split())
A = list(map(int, input().split()))

diff = K + A[0] - A[-1]

for i in range(N-1):
    diff = max(diff , A[i+1]-A[i])

print(K-diff)
Buggy python submission (verdict: Runtime Error):
from scipy.special import comb

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

print(comb(N,2, exact=True) + comb(M,2,exact=True))

Fixed submission:
from scipy.misc import comb

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

print(comb(N,2, exact=True) + comb(M,2,exact=True))
Buggy python submission (verdict: Runtime Error):
lst = []
V = 0

N = int(input())
for i in range(N):
    a = int(input())
    lst.append(a)
lst.sort()
l = lst[2]

for f in lst:
    V += f
print(int(V - (l/2)))

Fixed submission:
n = int(input())
p = [int(input()) for i in range(n)]
p.sort()
print(int(p[-1]/2+sum(p[:-1])))
Buggy python submission (verdict: Runtime Error):
D,N=map(int,input().split())
for _ in range(D):
    N *= 100
print(int(N)

Fixed submission:
a,b=map(int,input().split())
print(int((100**a)*(b+b//100)))
Buggy python submission (verdict: Runtime Error):
x,y,z=map(int,input().split())
if x <= z and x+y => z :
  print("YES")
else:
  print("NO")

Fixed submission:
x,y,z=map(int,input().split())
if x <= z <= x+y :
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
S=input()
print( "Yes" if S in "abc"  or S in "bca" or S in "acb" S in "cab" or S in "cba" or S in "bac" else "No" ) 

Fixed submission:
S=input()
print( "Yes" if S.count("a") == S.count("b") == S.count("c") == 1 else "No")
Buggy python submission (verdict: Runtime Error):
import numpy as np

a,b = map(int,input().split())
print(round(np.mean(a,b)))

Fixed submission:
a = [int(i) for i in input().split()]
print(-(-(a[0]+ a[1] )//2))
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print(a+b if a+B<=c else c)

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

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input.split())
print(a+b if a+B<=c else c)

Fixed submission:
a,b,c=map(int,input().split())
print(a*b if a*b<=c else c)
Buggy python submission (verdict: Runtime Error):
X,A,B = map(int,input().split())
 
if A > B:
    print("delicious")
elif A < B and B-A < X+1:
    print("safe")
elif A < B and B-A > X+1
    print("dangerous")

Fixed submission:
X,A,B = map(int,input().split())
 
if B-A <=0:
    print("delicious")
elif B - A - X <=0:
    print("safe")
else:
    print("dangerous")
Buggy python submission (verdict: Runtime Error):
c=input()
if c == "a" = "i" = "u" = "e" = "o":
    print("vowel")
else:
    print("consonant")

Fixed submission:
c=input()
if c in 'aeiou':
     print("vowel")
else:
     print("consonant")

Buggy python submission (verdict: Runtime Error):
c=input()
if c == a or i or u or e or o:
    print("vowel")
else:
    print("consonant")

Fixed submission:
c=input()
if c in 'aeiou':
     print("vowel")
else:
     print("consonant")
Buggy python submission (verdict: Runtime Error):
N=int(input())
Happoint=(N//500)*1000 + ((n%500)//5)*5
print(int(Happoint))

Fixed submission:
N=int(input())
Hapt=0
if(N>=5):
  Hapt=Hapt+(N//500)*1000 + ((N%500)//5)*5
else:
  Hapt=0
print(Hapt)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
Ans = (A-1)*(B-1)
print(Ans)

Fixed submission:
a,b = map(int,input().split())
ans = (a-1)*(b-1)
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
from fractions import Fraction
from functools import reduce

N = int(input())
A= list(map(int,input().split( )))


def lcm_base(x, y):
    return (x * y) // Fraction.gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


m =  lcm_list(A) -1

B = 0

for j in range(len(A)):
    B += m%A[j]

print(B)

Fixed submission:
import math
from functools import reduce

N = int(input())
A= list(map(int,input().split( )))

def gcd(x,y):
    if x > y:
        x , y = y , x
    while x>0:
        x, y = y%x , x
    return y
    
def lcm_base(x, y):
    return (x * y) // gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


m =  lcm_list(A) -1

B = 0

for j in range(len(A)):
    B += m%A[j]

print(B)

Buggy python submission (verdict: Runtime Error):
import math
from fractions import Fraction
from functools import reduce

N = int(input())
A= list(map(int,input().split( )))


def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


m =  lcm_list(A) -1

B = 0

for j in range(len(A)):
    B += m%A[j]

print(B)

Fixed submission:
import math
from functools import reduce

N = int(input())
A= list(map(int,input().split( )))

def gcd(x,y):
    if x > y:
        x , y = y , x
    while x>0:
        x, y = y%x , x
    return y
    
def lcm_base(x, y):
    return (x * y) // gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


m =  lcm_list(A) -1

B = 0

for j in range(len(A)):
    B += m%A[j]

print(B)

Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce

N = int(input())
A= list(map(int,input().split( )))


def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


m =  lcm_list(A) -1

B = 0

for j in range(len(A)):
    B += m%A[j]

print(B)

Fixed submission:
import math
from functools import reduce

N = int(input())
A= list(map(int,input().split( )))

def gcd(x,y):
    if x > y:
        x , y = y , x
    while x>0:
        x, y = y%x , x
    return y
    
def lcm_base(x, y):
    return (x * y) // gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


m =  lcm_list(A) -1

B = 0

for j in range(len(A)):
    B += m%A[j]

print(B)
Buggy python submission (verdict: Runtime Error):
N = input()
S = list(input())

Ans = 0

for i in range(len(S)):
	X = set(S[:i])
	Y=set(S[i:])
	numAND = len(X & Y)
	if numAND >= Ans:
		Ans = numAND
print(Ans)


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

x = a+b
y= a-b
z = a *b

print(max(x,y,z))
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
c = input()

subitem1 = a
a = b
b = subitem1

subitem2 = a
a = c
c = subitem2

print(a,b,c)

Fixed submission:
x, y, z = map(int, input().split())
 
x_ = y
y_ = x
 
x__ = z
z_ = x_
 
print(x__, y_, z_)
Buggy python submission (verdict: Runtime Error):
n = int(input())
x = list(map(int, input().split()))

min_energy = None

for p in range(x[-1]):
    energy = 0
    for x_i in x:
        energy += (x_i - p) ** 2
    if min_energy is None:
        min_energy = energy
    else:
        min_energy = min(energy, min_energy)

print(min_energy)


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

if n >= 10:
    print(r)
else:
    print(r+100*(10-n))

Buggy python submission (verdict: Runtime Error):
n = int(input())
x = list(map(int, input().split()))

min_energy = None

for p in range(x[-1]):
    energy = 0
    for x_i in x:
        energy += (x_i - p) ** 2
    if min_energy is None:
        min_energy = energy
    else:
        min_energy = min(energy, min_energy)

print(min_energy)



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

if n >= 10:
    print(r)
else:
    print(r+100*(10-n))
Buggy python submission (verdict: Time Limit Exceeded):
import sys


n, k = map(int, input().split())

if n % k == 0:
    print('0')
    sys.exit(0)

n_list = [n]

while(True):
    n = abs(n - k)
    if n in n_list:
        break
    else:
        n_list.append(n)

n_list.sort()
print(n_list[0])

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

m = n // k
n = n - m * k
print(min(n, abs(n-k)))
Buggy python submission (verdict: Runtime Error):
import math


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


mi_stamina = math.inf
for i in range(-1000, 1000):
    def _distance(x):
        return (x-i)**2
    double_list = list(map(_distance, x_list))
    stamina = sum(double_list)
    if mi_stamina > stamina:
        mi_stamina = stamina

print(mi_stamina)

Fixed submission:
import math


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


mi_stamina = 1000000000
for i in range(-1000, 1000):
    def _distance(x):
        return (x-i)**2
    double_list = list(map(_distance, x_list))
    stamina = sum(double_list)
    if mi_stamina > stamina:
        mi_stamina = stamina

print(mi_stamina)

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


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


mi_stamina = math.inf
for i in range(-1000, 1000):
    def _distance(x):
        return (x-i)**2
    double_list = list(map(lambda x: _distance(x), x_list))
    stamina = sum(double_list)
    if mi_stamina > stamina:
        mi_stamina = stamina

print(mi_stamina)

Fixed submission:
import math


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


mi_stamina = 1000000000
for i in range(-1000, 1000):
    def _distance(x):
        return (x-i)**2
    double_list = list(map(_distance, x_list))
    stamina = sum(double_list)
    if mi_stamina > stamina:
        mi_stamina = stamina

print(mi_stamina)

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

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

mi_stamina = math.inf
for i in range(-1000, 1000):
    double_list = list(map(lambda x: (x-i)**2, x_list))
    stamina = sum(double_list)
    if mi_stamina > stamina:
        mi_stamina = stamina

print(mi_stamina)

Fixed submission:
import math


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


mi_stamina = 1000000000
for i in range(-1000, 1000):
    def _distance(x):
        return (x-i)**2
    double_list = list(map(_distance, x_list))
    stamina = sum(double_list)
    if mi_stamina > stamina:
        mi_stamina = stamina

print(mi_stamina)

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

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

mi_stamina = math.inf
for i in range(-1000, 1000):
    print(x_list)
    double_list = list(map(lambda x: (x-i)**2, x_list))
    print(double_list)
    stamina = sum(double_list)
    if mi_stamina > stamina:
        mi_stamina = stamina

print(mi_stamina)

Fixed submission:
import math


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


mi_stamina = 1000000000
for i in range(-1000, 1000):
    def _distance(x):
        return (x-i)**2
    double_list = list(map(_distance, x_list))
    stamina = sum(double_list)
    if mi_stamina > stamina:
        mi_stamina = stamina

print(mi_stamina)
Buggy python submission (verdict: Runtime Error):
from itertools import permutations
def read(): return list(map(int, input().split()))
 
 
INF = 114514810
 
 
def wf(d):
    N = len(d[0])
    for k in range(N):
        for i in range(N):
            for j in range(N):
                if d[i][j] > d[i][k] + d[k][j]:
                    d[i][j] = d[i][k] + d[k][j]
    return d
 
 
def calc_dist(p, d):
    dist = 0
    for i in range(len(p) - 1):
        if d[p[i]][p[i + 1]] >= INF:
            return INF
        dist += d[p[i]][p[i + 1]]
    return dist
 
 
def main():
    N, M, R = read()
    r = map(lambda x: x - 1, sorted(read()))
    d = [[INF for i in range(N)] for j in range(N)]
 
    for i in range(M):
        a, b, c, = read()
        a -= 1
        b -= 1
        d[a][b] = d[b][a] = c
 
    d = wf(d)
 
    min_dist = INF
    for p in list(permutations(r)):
        min_dist = min(min_dist, calc_dist(p, d))
 
    print(min_dist)
 
 
if __name__ == '__main__':
    main()

Fixed submission:
n = input()
print("Yes" if n[0]=='9' or n[1]=='9' else "No")
Buggy python submission (verdict: Runtime Error):
def read(): return list(map(int, input().split()))


h, w = read()
n = int(input())
A = read()

s = ""
for i, a in enumerate(A):
    s += str(i + 1) * a

assert len(s) == h * w

for i in range(h):
    out = s[i * w: i * w + w]
    if i & 1:
        out = out[::-1]

    print(" ".join(out))

Fixed submission:
def read(): return list(map(int, input().split()))


h, w = read()
n = int(input())
A = read()

s = []
for i, a in enumerate(A):
    for j in range(a):
        s.append(str(i + 1))

for i in range(h):
    out = s[i * w: i * w + w]
    if i & 1:
        out = list(reversed(out))

    print(" ".join(out))
Buggy python submission (verdict: Runtime Error):
a, b, x = map(int, input().split())
c = b // x
d = (a-1) // x

if a == 0 and b == 0:
    print(1)
    exit(1)

elif a == 0 or b == 0:
    print(c + 1)
    exit(1)

print(c - d)


Fixed submission:
import sys

a, b, x = map(int, input().split())
c = b // x
d = (a-1) // x

if a == 0 and b == 0:
    print(1)
    sys.exit()

elif a == 0 or b == 0:
    print(c + 1)
    sys.exit()

print(c - d)
Buggy python submission (verdict: Runtime Error):
X,Y = map(int, input(),split())
XY = int(X + Y / 2)
print(XY)

Fixed submission:
X,Y = map(int, input().split())
XY = int(X + Y / 2)
print(XY)

Buggy python submission (verdict: Runtime Error):
X,Y = map(int, input(),split())
XY = X + Y / 2
print(XY)


Fixed submission:
X,Y = map(int, input().split())
XY = int(X + Y / 2)
print(XY)

Buggy python submission (verdict: Runtime Error):
X,Y = map(int, input(),split())
print(X + (Y / 2))

Fixed submission:
X,Y = map(int, input().split())
XY = int(X + Y / 2)
print(XY)
Buggy python submission (verdict: Runtime Error):
N = input()
if len(N) == 3:
    print(::-1)
else:
    print(N)

Fixed submission:
N = input()
if len(N) == 3:
    print(N[::-1])
else:
    print(N)
Buggy python submission (verdict: Runtime Error):
N = int(input())
Even = []
Odd = []
for i in range(1,N+1):
    if i % 2 == 0:
        Even.append(i)
    else:
        Odd.append(i)
print(Even * Odd)

Fixed submission:
N = int(input())
Even = []
Odd = []
for i in range(1,N+1):
    if i % 2 == 0:
        Even.append(i)
    else:
        Odd.append(i)
print(len(Even) * len(Odd))
Buggy python submission (verdict: Runtime Error):

K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(list[K+1])


Fixed submission:
K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(list[K-1])

Buggy python submission (verdict: Runtime Error):
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K=int(input())
print(list[K+1])

Fixed submission:
K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(list[K-1])

Buggy python submission (verdict: Runtime Error):
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K=int(input())
print(list[K])

Fixed submission:
K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(list[K-1])

Buggy python submission (verdict: Runtime Error):
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K=int(input())
print(list[K+1])

Fixed submission:
K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(list[K-1])

Buggy python submission (verdict: Runtime Error):
a=1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
p=a.split(",")
K=4
print([K+1])

Fixed submission:
K=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(list[K-1])
Buggy python submission (verdict: Runtime Error):
N,A,B=map(int(),input().split())
K=A*int(N/(A+B))
amari=N%(A+B)
i=1
while ((amari-i)>0):
  i=i+1
K=K+i
print(K)

Fixed submission:
N,A,B=map(int,input().split())
K=A*int(N/(A+B))
amari=N%(A+B)
if (amari>=A):
  i=A
elif (amari<A):
  i=amari
K=K+i
print(K)

Buggy python submission (verdict: Runtime Error):
N,A,B=map(int(),input().split())
K=A*int(N/(A+B))
amari=N%(A+B)
i=1
while ((amari-i)>0):
  i=i+1
K=K+i
  

Fixed submission:
N,A,B=map(int,input().split())
K=A*int(N/(A+B))
amari=N%(A+B)
if (amari>=A):
  i=A
elif (amari<A):
  i=amari
K=K+i
print(K)
Buggy python submission (verdict: Runtime Error):
S=input()

if(S[1]==S[2]==S[3]):
    print("No")
else:
    print("Yes")
    

Fixed submission:
S=input()

if(S[0]==S[1]==S[2]):
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
N,R= map(int, input().split())  
if N>=10:
  T=R
else :
  T=R+100*(10-N)
pritn(T)

Fixed submission:
N,R=map(int, input().split()) 
if N>=10:
  t=R
else :
  t=R+100*(10-N)
print(t)