Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import math
N=int(input())
if N==1:
	print(1)
else:
	nmax = math.ceil(math.sqrt(N))
	Bdigimin = 10
	for i in range(nmax):
		if N % (i+1) == 0:
			Bdigi = math.floor(math.log10(N/(i+1)))
			if Bdigimin > Bdigi:
				Bdigimin = Bdigi
	print(int(Bdigimin+1))


Fixed submission:
num = list(map(int, input().split()))
a = num[0] + num[1]
print(int(a%24))

Buggy python submission (verdict: Runtime Error):
import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimin = 10
for i in range(1,nmax):
	if N % i == 0:
		Bdigi = math.floor(math.log10(N/i))
		if Bdigimin > Bdigi:
			Bdigimin = Bdigi
print(int(Bdigimin+1))


Fixed submission:
num = list(map(int, input().split()))
a = num[0] + num[1]
print(int(a%24))

Buggy python submission (verdict: Runtime Error):
import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimin = 10
for i in range(1,nmax):
	if N % i == 0:
		Bdigi = math.floor(math.log10(N/i))
		if Bdigimin > Bdigi:
			Bdigimin = Bdigi
print(int(Bdigimin+1))


Fixed submission:
num = list(map(int, input().split()))
a = num[0] + num[1]
print(int(a%24))

Buggy python submission (verdict: Runtime Error):
import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimin = 10
for i in range(1,nmax):
	if N % i == 0:
		Bdigi = math.floor(math.log10(N/i))
		if Bdigimin > Bdigi:
			Bdigimin = Bdigi
print(int(Bdigimin+1))


Fixed submission:
num = list(map(int, input().split()))
a = num[0] + num[1]
print(int(a%24))

Buggy python submission (verdict: Runtime Error):
import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimin = 10
for i in range(1,nmax):
	if N % i == 0:
		Bdigi = math.floor(math.log10(N/i))
		if Bdigimin > Bdigi:
			Bdigimin = Bdigi
print(int(Bdigimin+1))


Fixed submission:
num = list(map(int, input().split()))
a = num[0] + num[1]
print(int(a%24))

Buggy python submission (verdict: Runtime Error):
import math
N=int(input())
nmax = math.floor(math.sqrt(N))
Bdigimax = 1
for i in range(1,nmax):
	if N % i == 0:
		Bdigi = math.floor(math.log10(N/i))
		if Bdigimax < Bdigi:
			Bdigimax = Bdigi
print(int(Bdigimax))
		

Fixed submission:
num = list(map(int, input().split()))
a = num[0] + num[1]
print(int(a%24))
Buggy python submission (verdict: Runtime Error):
import math
N=int(input())
if N==1:
	print(1)
else:
	nmax = math.ceil(math.sqrt(N))
	Bdigimin = 10
	for i in range(nmax):
		if N % (i+1) == 0:
			Bdigi = math.floor(math.log10(N/i))
			if Bdigimin > Bdigi:
				Bdigimin = Bdigi
	print(int(Bdigimin+1))


Fixed submission:
import math
N=int(input())
nmax = math.ceil(math.sqrt(N))
i = 1
Bdigimin = 10
while ( i <= nmax):
	if N % i == 0:
		Bdigi = math.floor(math.log10(N/i))
		if Bdigimin > Bdigi:
			Bdigimin = Bdigi
	i += 1
print(int(Bdigimin+1))
Buggy python submission (verdict: Runtime Error):
num = list(map(int, input().split()))
if num[0]*num[1] <= num[2]*num[3]:
	print(num[2]*num[3])
else:
	pritn(num[0]*num[1])

Fixed submission:
num = list(map(int, input().split()))
if num[0]*num[1] <= num[2]*num[3]:
	print(num[2]*num[3])
else:
	print(num[0]*num[1])
Buggy python submission (verdict: Runtime Error):
data = input().split()
A = int(data[0])
B = int(data[2])
if op == '+':
	S =  A + B
else:
	S = A - B
print(S)


Fixed submission:
data = input().split()
A = int(data[0])
B = int(data[2])
if data[1] == '+':
	S =  A + B
else:
	S = A - B
print(S)
Buggy python submission (verdict: Runtime Error):
nums = list(map(int, input().split()))
n = 1
if nums[0] != nums[1]:
	n++
if nums[1] != nums[2] and nums[0] != nums[2]:
	n++
print(n)


Fixed submission:
nums = list(map(int, input().split()))
n = 1
if nums[0] != nums[1]:
	n+=1
if nums[1] != nums[2] and nums[0] != nums[2]:
	n+=1
print(n)
Buggy python submission (verdict: Runtime Error):
N = input()
K = input()
X = input()
Y = input()

print(K*X+(N-K)*Y)


Fixed submission:
N = input()
K = input()
X = input()
Y = input()
if(X < Y):
	tmp = X
	X = Y
	Y = tmp

if(N>K):
	print(K*X+(N-K)*Y)
else:
	print(N*X)
Buggy python submission (verdict: Runtime Error):
w = input()

for t in w:
    if any(w.count(t)%2) == 0:
        print('Yes')
    else:
        print('No')

Fixed submission:
w = input()

if any(w.count(t)%2 for t in w) == 0:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = input()
sum = N*(N+1)/2 
print(sum)


Fixed submission:
N = input()
sum = N * (N + 1) / 2 
print(sum)
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, raw_input().split())
if (A != 5 and A!=7):
	print('NO')
if (B != 5 and B!=7):
	print('NO')
if (C != 5 and C!=7):
	print('NO')
if(A + B + C != 17):
	print('NO')
else:
	print('YES')


Fixed submission:
A, B, C = map(int, input().split())
if (A != 5 and A!=7):
	print('NO')
if (B != 5 and B!=7):
	print('NO')
if (C != 5 and C!=7):
	print('NO')
if(A + B + C != 17):
	print('NO')
else:
	print('YES')
Buggy python submission (verdict: Runtime Error):
from numba import jit
import time
import numpy as np
t = time.time()
INF = 1 << 60


@jit
def Nap(h, n, ab, dp):

    for i in range(1, h + 10001):
        val = INF
        for j in range(n):
            if (i >= ab[j][0]):
                val = min(val, dp[i-ab[j][0]] + ab[j][1])
        dp[i] = min(val, dp[i])

    res = INF
    for i in range(h, h+10001):
        res = min(res, dp[i])
    return res


def pri(t):
    print("elapsed time:{:.2f}".format(time.time()-t))


def main():
    h, n = map(int, input().split())
    #ab = [[0, 0] for _ in range(n)]
    ab = np.zeros((n, 2), dtype=int)
    for i in range(n):
        a, b = map(int, input().split())
        ab[i][0] = a
        ab[i][1] = b

    #dp = [INF for _ in range(h+10001)]
    dp = np.full(h+10001, INF, dtype=int)

    dp[0] = 0
    print(Nap(h, n, ab, dp))
    # pri(t)


main()


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

ab = [[0, 0] for _ in range(n)]
for i in range(n):
    a, b = map(int, input().split())
    ab[i][0] = a
    ab[i][1] = b

INF = 1 << 60
dp = [INF for _ in range(h+10001)]

dp[0] = 0

for i in range(1, h+10001):
    for j in range(n):
        if(i >= ab[j][0]):
            dp[i] = min(dp[i-ab[j][0]] + ab[j][1], dp[i])

res = INF
for i in range(h, h+10001):
    res = min(res, dp[i])
print(res)

Buggy python submission (verdict: Time Limit Exceeded):
h, n = map(int, input().split())

ab = []
for i in range(n):
    a, b = map(int, input().split())
    ab.append([a, b])

INF = 1 << 60
dp = [INF for _ in range(h+10001)]

dp[0] = 0

for i in range(1, h+10001):
    for j in range(n):
        if(i >= ab[j][0]):
            dp[i] = min(dp[i-ab[j][0]] + ab[j][1], dp[i])

res = INF
for i in range(h, h+10001):
    res = min(res, dp[i])
print(res)


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

ab = [[0, 0] for _ in range(n)]
for i in range(n):
    a, b = map(int, input().split())
    ab[i][0] = a
    ab[i][1] = b

INF = 1 << 60
dp = [INF for _ in range(h+10001)]

dp[0] = 0

for i in range(1, h+10001):
    for j in range(n):
        if(i >= ab[j][0]):
            dp[i] = min(dp[i-ab[j][0]] + ab[j][1], dp[i])

res = INF
for i in range(h, h+10001):
    res = min(res, dp[i])
print(res)
Buggy python submission (verdict: Runtime Error):
print(2**int(input))

Fixed submission:
n=int(input())
print(n**3)
Buggy python submission (verdict: Runtime Error):
for i in range(n+1):
    for j in range(n+1-i):
        k=n-i-j
        if 10000*i+5000*j+1000*k==y:
            print(i,j,k)
            flag=False
            break

if flag:
    print(-1,-1,-1)


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

for i in range(n+1):
    for j in range(n+1-i):
        k=n-i-j
        if 10000*i+5000*j+1000*k == y:
            print(i,j,k)
            exit()

print(-1,-1,-1)

Buggy python submission (verdict: Runtime Error):
n,y=map(int,input().split())
t=0
flag=True

for x in range(n+1):
    for k in range(n+1):
        z=n-x-k
        if x+k+z==s:
            print(x,k,z)
            flag=False
            break
if flag:
    print(-1,-1,-1)


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

for i in range(n+1):
    for j in range(n+1-i):
        k=n-i-j
        if 10000*i+5000*j+1000*k == y:
            print(i,j,k)
            exit()

print(-1,-1,-1)
Buggy python submission (verdict: Time Limit Exceeded):
k,s=map(int,input().split())
t=0

for i in range(k+1):
    for j in range(k+1):
        for l in range(k+1):
            if i+j+l==s:
                t+=1
print(t)


Fixed submission:
k,s=map(int,input().split())
t=0

for i in range(k+1):
    for j in range(k+1):
        l=s-i-j
        if 0<=l<=k:
            t+=1
print(t)

Buggy python submission (verdict: Time Limit Exceeded):
k,s=map(int,input().split())
t=0

for i in range(k+1):
    for j in range(k+1):
        for k in range(k+1):
            if i+j+k==s:
                t+=1
print(t)


Fixed submission:
k,s=map(int,input().split())
t=0

for i in range(k+1):
    for j in range(k+1):
        l=s-i-j
        if 0<=l<=k:
            t+=1
print(t)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8

n = int(input().rstrip())
bo = [j * -1 for j in sorted([int(i) * -1 for i in input().rstrip().split(" ")])]

def get_count(start:int, num:int):
    if bo[len(bo)-1] > num:
        return len(bo)-1
    if bo[start] <= num:
        return -1
    return get_count_sub(start, len(bo)-1, num)

def get_count_sub(min:int, max:int, target:int):
    if max - min <= 1:
        if bo[max] > target:
            return max
        else:
            return min

    mid = int((max+min)/2)
    if bo[mid] > target:
        return get_count_sub(mid, max, target)
    else:
        return get_count_sub(min, mid, target)

ans = 0
for i in range(n-2):
    for j in range(i+1,n-1):
        if j < int(i/2):
            break
        idx = get_count(j + 1, bo[i] - bo[j])
        if idx < 0:
            break
        ans += idx - j

print(ans)


Fixed submission:
# coding: utf-8
from bisect import bisect_left, bisect_right

n = int(input().rstrip())
bo = sorted([int(i) * -1 for i in input().rstrip().split(" ")])

def get_count(start:int, num:int):
    if bo[len(bo)-1] > num:
        return len(bo)-1
    if bo[start] <= num:
        return -1
    return get_count_sub(start, len(bo)-1, num)

def get_count_sub(min:int, max:int, target:int):
    if max - min <= 1:
        if bo[max] > target:
            return max
        else:
            return min

    mid = int((max+min)/2)
    if bo[mid] > target:
        return get_count_sub(mid, max, target)
    else:
        return get_count_sub(min, mid, target)

ans = 0
for i in range(n-2):
    for j in range(i+1,n-1):
        if j < int(i/2):
            break
        idx = bisect_left(bo, bo[i]-bo[j], j+1)
        ans += idx - j - 1

print(ans)
Buggy python submission (verdict: Runtime Error):


fun main(args:Array<String>) {
    val itemCount = readLine()!!.toInt()
    val items = (1..itemCount).map { readLine()!!.toInt() }.sortedDescending()
    val ans = items[0] / 2 + items.drop(1).sum()
    println(ans)
}

Fixed submission:
# coding: utf-8

itemCount = int(input())

itemList = sorted([ int(input()) for i in range(itemCount)])
itemList.reverse()

ans = sum(itemList) - int(itemList[0] / 2)
print(ans)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import math

(n, m) = [int(i) for i in input().rstrip().split(" ")]

for i in range(n, math.sqrt(m) + 1):
    if m % i == 0:
        print(int(m / i))
        break


Fixed submission:
# coding: utf-8
import math

(n, m) = [int(i) for i in input().rstrip().split(" ")]

ans = 0
divList = []
for i in range(1, int(math.sqrt(m)) + 1):
    if m % i == 0:
        j = m / i
        divList.append(i)
        divList.append(j)
divList = sorted(divList)
for i in divList:
    if i < n:
        continue
    ans = m / i
    break

print(int(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8

(n,m) = [int(i) for i in input().rstrip().split(" ")]

for i in range(n, m + 1):
    if m % i == 0:
        print(int(m/i))
        break

Fixed submission:
# coding: utf-8
import math

(n, m) = [int(i) for i in input().rstrip().split(" ")]

ans = 0
divList = []
for i in range(1, int(math.sqrt(m)) + 1):
    if m % i == 0:
        j = m / i
        divList.append(i)
        divList.append(j)
divList = sorted(divList)
for i in divList:
    if i < n:
        continue
    ans = m / i
    break

print(int(ans))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8

n = int(input().rstrip())

numbers = list(reversed(sorted(map(int, input().rstrip().split(" ")))))

ans = 0
for i in range(n):
    ans += numbers[n*i+1]

print(ans)


Fixed submission:
# coding: utf-8

n = int(input().rstrip())

numbers = list(reversed(sorted(map(int, input().rstrip().split(" ")))))

ans = 0
for i in range(n):
    ans += numbers[i*2+1]

print(ans)
Buggy python submission (verdict: Runtime Error):
N = input()
a = map(int, raw_input().split())
a.sort()
print a[-1] - a[0]


Fixed submission:
a = map(int, raw_input().split())
d = a[0] * 100 + a[1] * 10 + a[2]
if d % 4 == 0:
	print "YES"
else:
	print "NO"
Buggy python submission (verdict: Runtime Error):
import math
A, B, N = map(int,input().split())
ans = 0
for i in range(1,min(N,B)):
  X = math.floor(A*i//B)-A*math.floor(i//B)
  if(X>=ans):
    ans = X
print(ans)


Fixed submission:
N = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
  if i % N == 0:
    print('OK')
    break
else:
  print('NG')

Buggy python submission (verdict: Runtime Error):
K = int(input())
A, B = map(int,input().spilt())
if(A<=(B//K)*K){
  print("OK")
}
else{
  print("NG")
}


Fixed submission:
N = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
  if i % N == 0:
    print('OK')
    break
else:
  print('NG')

Buggy python submission (verdict: Runtime Error):
K = int(input())
A, B = map(int,input().spilt())
if(A<=B/K*K){
  print("OK")
}
else{
  print("NG")
}


Fixed submission:
N = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
  if i % N == 0:
    print('OK')
    break
else:
  print('NG')

Buggy python submission (verdict: Runtime Error):
K = int(input())
A, B = map(int,input.spilt())
if(A<=B/K*K){
  print("OK")
}
else{
  print("NG")
}

Fixed submission:
N = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
  if i % N == 0:
    print('OK')
    break
else:
  print('NG')

Buggy python submission (verdict: Runtime Error):
N = int(input())
A, B = map(int,input.split())
if(A<=B/K*K){
  print("OK")
}
else{
  print("NG")
}

Fixed submission:
N = int(input())
A, B = map(int, input().split())
for i in range(A, B+1):
  if i % N == 0:
    print('OK')
    break
else:
  print('NG')
Buggy python submission (verdict: Runtime Error):
X = int(input())
n = 0
money = 100
while(money<X){
  money = money+money//100
  n = n+1
}
print(n)


Fixed submission:
X = int(input())
n = 0
money = 100
while(money<X):
  money = money+money//100
  n = n+1
print(n)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b,c=map(int,input().split())

flag=False
for i in range(a,b+1):
   if i%a==0:
   flag=True
   break
print("OK" if flag else "NG")
  
  




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

flag=False
for i in range(b,c+1):
   if i%a==0:
    flag=True
    break
print("OK" if flag else "NG")
Buggy python submission (verdict: Runtime Error):
S=input()
print(S.replace("x"))

Fixed submission:
print("x"*len(input()))
Buggy python submission (verdict: Runtime Error):
a,b=int(input().split())
print("Yes" if a==b else "No")

Fixed submission:
a,b=map(int,input().split())
print("Yes" if a==b else "No")
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print(b+a)

Fixed submission:
a,b=map(str,input().split())
print(b+a)
Buggy python submission (verdict: Runtime Error):
N=input()
S,T=input().split
print(*[s+t for s,t in zip(S,T)],sep="")


Fixed submission:
N=input()
S,T=input().split()
print(*[s+t for s,t in zip(S,T)],sep="")
Buggy python submission (verdict: Runtime Error):
weather=["Sunny","Cloudy","Rainy"]
s=input()
print(weather[weather.index[s]-2])

Fixed submission:
weather=["Sunny","Cloudy","Rainy"]
S=input()
print(weather[weather.index(S)-2])

Buggy python submission (verdict: Runtime Error):
weather=["Sunny","Cloudy","Rainy"]
s=input()
print(weather[weather.index[s]-2])

Fixed submission:
weather=["Sunny","Cloudy","Rainy"]
S=input()
print(weather[weather.index(S)-2])

Buggy python submission (verdict: Runtime Error):
weather=["Sunny","Cloudy","Rainy"]
s=input()
pritn(weather[weather.index[s]-2])

Fixed submission:
weather=["Sunny","Cloudy","Rainy"]
S=input()
print(weather[weather.index(S)-2])
Buggy python submission (verdict: Runtime Error):
x,a=int(input().split())
print("10" if a<=x  else "0")

Fixed submission:
x,a=map(int,input().split())
print("10" if a<=x  else "0")
Buggy python submission (verdict: Runtime Error):
s=int(input())
print("Heisei" if s<="2019/04/30" else "TBD")

Fixed submission:
s=input()
print("Heisei" if s<="2019/04/30" else "TBD")

Buggy python submission (verdict: Runtime Error):
s=int(input())
print("Heisei" if s<"2019/04/30" else "TBD")

Fixed submission:
s=input()
print("Heisei" if s<="2019/04/30" else "TBD")
Buggy python submission (verdict: Runtime Error):
a,b,c=int(input().split())
print(a*b/2)

Fixed submission:
a,b,c=map(int,input().split())
print(a*b//2)

Buggy python submission (verdict: Runtime Error):
a,b,c=int(input().split())
print(a*b//2)

Fixed submission:
a,b,c=map(int,input().split())
print(a*b//2)
Buggy python submission (verdict: Runtime Error):
n=int(input())
p=[int(input()) for i in range(n)]
print(sum(p)+max(p//2))

Fixed submission:
n=int(input())
p=[int(input()) for i in range(n)]
print(sum(p)-max(p)//2)

Buggy python submission (verdict: Runtime Error):
n=int(input())
p=[int(input()) for i in range(n)]
print(a/2+p)

Fixed submission:
n=int(input())
p=[int(input()) for i in range(n)]
print(sum(p)-max(p)//2)
Buggy python submission (verdict: Runtime Error):
a,b,x=map(int,input().split())
print("YES" a<=x and x<=a+b else "NO" )

Fixed submission:
a,b,x=map(int,input().split())
print("YES" if a<=x and x<=a+b else "NO" )

Buggy python submission (verdict: Runtime Error):
a,b,x=map(int,input().split())
print("YES" a<=x or x<=a+b else "NO" )

Fixed submission:
a,b,x=map(int,input().split())
print("YES" if a<=x and x<=a+b else "NO" )
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print("Even",if a*b%2=21 else "Odd" )

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

Fixed submission:
a,b,c,d=input()
print("Yes" if a==b==c or b==c==d else "No")

Buggy python submission (verdict: Runtime Error):
a,b,c,d=input()
print("Yes" a==b==c else b==c==d "No")

Fixed submission:
a,b,c,d=input()
print("Yes" if a==b==c or b==c==d else "No")
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print("0" else a-b<0 else a-b)

Fixed submission:
a,b=map(int,input().split())
print("0" if a-b<0 else a-b)

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

Fixed submission:
a,b=map(int,input().split())
print("0" if a-b<0 else a-b)

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

Fixed submission:
a,b=map(int,input().split())
print("0" if a-b<0 else a-b)
Buggy python submission (verdict: Runtime Error):
n=input()
    pirnt("Yes" n[0]==n[2] else "No")

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

Buggy python submission (verdict: Runtime Error):
n=input()
print("Yes" n[0]==n[2] else"No")

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

Buggy python submission (verdict: Runtime Error):
a,b,c=input()
  print("Yes" if a==c else "No")

Fixed submission:
n=input()
print("Yes" if n[0]==n[2] else "No")
Buggy python submission (verdict: Runtime Error):
n=int(input())
print("ABC"+n)

Fixed submission:
print("ABC"+input())
Buggy python submission (verdict: Runtime Error):
;

Fixed submission:
a,b,c=input().split()
print((a[0]+b[0]+c[0]).upper())
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print("YES" b-a==c-a else "NO")

Fixed submission:
a,b,c=map(int,input().split())
print("YES" if b-a==c-b else "NO")

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
print("YES" b-a=c-a else "NO")

Fixed submission:
a,b,c=map(int,input().split())
print("YES" if b-a==c-b else "NO")
Buggy python submission (verdict: Runtime Error):
s=input(),sep","
print(s)

Fixed submission:
print(*input().split(","))
Buggy python submission (verdict: Runtime Error):
orint("A"+input()[8]+"C")

Fixed submission:
print("A"+input()[8]+"C")
Buggy python submission (verdict: Runtime Error):
s=input()
print("Yes" if all([s.count(i)%2==0 for i in set(s)] else "No")

Fixed submission:
s=input()
print("Yes" if all([s.count(i)%2==0 for i in set(s)]) else "No")

Buggy python submission (verdict: Runtime Error):
s=input()
print("Yes" if all([s.count(i)%2==0] for i in set(s)] else "No")

Fixed submission:
s=input()
print("Yes" if all([s.count(i)%2==0 for i in set(s)]) else "No")
Buggy python submission (verdict: Runtime Error):
k = int(input())
a, b = map(int,input().split())

for x in range(a, b+1):
    if x%k == 0:
        print("OK")
        exit(1)

print("NG")        

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

for x in range(a, b+1):
    if x%k == 0:
        print("OK")
        exit()

print("NG")
Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter

n = int(input())
s = []
for _ in range(n):
    s.append(Counter(input()))

i, ans=0, 0
flag=[-1]*n

while i<n:
    if flag[i] == 1:
        i+=1
        continue
    flag[i] = 1
    tmp = 1
    for j in range(i+1, n):
        if s[i] == s[j]:
            flag[j] = 1
            tmp+=1
    ans+=(tmp*(tmp-1)//2)
    i+=1

print(ans)




Fixed submission:
from collections import Counter

n = int(input())
s={}

for _ in range(n):
    ss = str(sorted(input()))
    if ss not in s:
        s[ss] = 1
    else:
        s[ss] += 1

ans=0
for c in s.values():
    ans += (c*(c-1)//2)
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce


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

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

print(gcd_list(a))
           


Fixed submission:

from functools import reduce

def gcd(a, b):
    if a < b:
        a, b = b, a
    if b == 0:
        return a
    c = a % b
    return gcd(b, c)

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

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

print(gcd_list(a))
Buggy python submission (verdict: Runtime Error):
n=int(input())
xyh=[]

ansx,ansy,ansh = -1,-1,-1
nonzero=-1

for i in range(n):
    l = list(map(int,input().split()))
    if l[2] != 0:
        xyh.append(l)
        nonzero=i

for px in range(101):
    for py in range(101):
        nh = xyh[nonzero][2] + abs(xyh[nonzero][0]-px) + abs(xyh[nonzero][1]-py)
        ok = True

        for nn in range(n):
            if (xyh[nn][2] > 0 and nh != xyh[nn][2] + abs(xyh[nn][0]-px) + abs(xyh[nn][1]-py)): 
                ok=False
            if (xyh[nn][2] == 0 and nh >  abs(xyh[nn][0]-px) + abs(xyh[nn][1]-py)):
                ok=False
        if ok:
            ansx,ansy,ansh = px,py,nh
        
       

print(ansx,ansy,ansh)


Fixed submission:
n=int(input())
xyh=[]

ansx,ansy,ansh = -1,-1,-1
nonzero=-1

for i in range(n):
    xyh.append(list(map(int,input().split())))
    if xyh[i][2] != 0:      
        nonzero=i

for px in range(101):
    for py in range(101):
        nh = xyh[nonzero][2] + abs(xyh[nonzero][0]-px) + abs(xyh[nonzero][1]-py)
        ok = True

        for nn in range(n):
            if (xyh[nn][2] > 0 and nh != xyh[nn][2] + abs(xyh[nn][0]-px) + abs(xyh[nn][1]-py)): 
                ok=False
            if (xyh[nn][2] == 0 and nh >  abs(xyh[nn][0]-px) + abs(xyh[nn][1]-py)):
                ok=False
        if ok:
            ansx,ansy,ansh = px,py,nh
        
    
print(ansx,ansy,ansh)