Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02759 (python)

Fixed submission:
print((int(input())+1)//2)

Buggy submission (verdict: Runtime Error):
import numpy as np
N = int(input())
S = list(input())
Q = int(input())
Q_list = [input().split() for _ in range(Q)]
t_list = []
for q in Q_list:
  type = int(q[0])
  if(type==1):
    S[int(q[1])-1] = q[2]
  else:
    s, e = int(q[1]), int(q[2])
    t = 0
    str_list = []
    t = len(np.unique(S[s-1:e]))
    t_list.append(t)
[print(t) for t in t_list]

Buggy submission (verdict: Runtime Error):
return int(input())//2+1
Problem p02759 (python)

Fixed submission:
x = int(input())
if (x % 2 == 0):
  y = x // 2
else:
  y = x//2 + 1

print(y)

Buggy submission (verdict: Runtime Error):
x = input()
if (x % 2 == 0):
  y = x // 2
else:
  y = x//2 + 1

print(y)

Buggy submission (verdict: Runtime Error):
x = input()
y = x // 2
if(x % 2 != 0):
  y += 1
  
print(y)
Problem p02831 (python)

Fixed submission:
import fractions

a, b = map(int, input().split())

print(int(a * b / fractions.gcd(a, b)))

Buggy submission (verdict: Runtime Error):
import math

a, b = map(int, input().split())

print(int(a * b / math.gcd(a, b)))
Problem p02759 (python)

Fixed submission:
str = input()
num = int(str)
print('%d' % (num/2)) if num % 2 == 0 else print('%d' % ((num+1)/2))

Buggy submission (verdict: Runtime Error):
num = input()
if num % 2 == 0:
  print(num/2);
else:
  print(num+1/2);
Problem p02763 (python)

Fixed submission:
import math

n = int(input())
s = input()
S = [ord(i) - 97 for i in s]
q = int(input())
HEIGHT = math.ceil(math.log(n) / math.log(2))
SIZE = 1 << HEIGHT

def build_tree():
    tree = [0 for _ in range(SIZE<<1)]

    for i, letter in enumerate(s):
        tree[i+SIZE] = 1<<(ord(letter)-97)

    for i in range(HEIGHT - 1, -1, -1):
        for x in range(1<<i, 2<<i):
            tree[x] = tree[x<<1] | tree[(x<<1)+1]

    return tree




def update(x, number):
    tree[x] = number
    while x > 1:
        x >>= 1
        tree[x] = tree[x << 1] | tree[(x << 1) + 1]


def query(l, r):
    total = 0
    while l < r:
        if l&1:
            total |= tree[l]
            l += 1
        l >>= 1
        if r&1:
            r -= 1
            total |= tree[r]
        r >>= 1
    return bin(total).count('1')



tree = build_tree()

for i in range(q):
    a, b, c = input().split()
    b = int(b) - 1
    if int(a) == 1:
        update(b + SIZE, S[b])
        c = 1 << (ord(c) - 97)
        S[b] = c
        update(b + SIZE, c)
    else:
        print(query(b + SIZE, int(c)+SIZE))

Buggy submission (verdict: Runtime Error):
import math

n = int(input())
s = input()
S = [ord(i) - 97 for i in s]
q = int(input())
HEIGHT = math.ceil(math.log(n) / math.log(2))
SIZE = 1 << HEIGHT

def build_tree_for_letter(letter):
    tree = [False for _ in range(2 << HEIGHT)]
    for i in range(1 << HEIGHT):
        tree[i + (1 << HEIGHT)] = True if i < n and s[i] == chr(97 + letter) else False

    for i in range(HEIGHT - 1, -1, -1):
        for x in range(1<<i, 2<<i):
            tree[x] = any((tree[x<<1], tree[(x<<1)+1]))

    return tree


def build():
    return [build_tree_for_letter(letter) for letter in range(26)]



def update(x, letter, positive=True):
    trees[letter][x] = (positive == True)
    while x > 1:
        x >>= 1
        trees[letter][x] = any((trees[letter][x << 1], trees[letter][(x << 1) + 1]))


def query(ll, rr):

    # print("query: ", l, r)
    total = 0
    for letter in range(26):
        l, r = ll, rr
        is_letter = False
        while l < r:
            if l%(2) != 0:
                is_letter = any((is_letter, trees[letter][l]))
                l += 1
            l >>= 1
            if r%(2) != 0:
                r -= 1
                is_letter = any((is_letter, trees[letter][r]))
            r >>= 1
        total += is_letter
    return total



trees = build()

for i in range(q):
    a, b, c = input().split()
    b = int(b) - 1 + SIZE
    if int(a) == 1:
        c = ord(c) - 97
        update(b, S[b], positive=False)
        S[b] = c
        update(b, c, positive=True)
    else:
        print(query(b, int(c)+SIZE))
Problem p02773 (python)

Fixed submission:
n = int(input())
m = {}
for i in range(n):
    s = input()
    if s in m:
        m[s] += 1
    else:
        m[s] = 1

maxim = max(m.values())
mySet = set(key for key, value in m.items() if value == maxim)
for i in sorted(mySet):
    print(i)

Buggy submission (verdict: Runtime Error):
n = int(input())
m = {}
for i in n:
  s = input()
  if s in m:
    m[s] += 1
  else:
    m[s] = 1
    
maxim = max(m.values())
mySet = set(key if value == maxim for key, value in m.items())
for i in mySet:
  print(i)
Problem p02777 (python)

Fixed submission:
s, t = input().split()
a, b = map(int, input().split())
i = input()
if t == i:
  print(a, b-1)
else:
  print(a-1, b)

Buggy submission (verdict: Runtime Error):
    b = input().split()
    a = list(map(int, input().split()))
    c = {b[i]:a[i] for i in range(len(b))}
    print(c[input()] - 1)

Buggy submission (verdict: Runtime Error):
b = input().split()
a = map(int, input().split())
c = {b[i]:a[i] for i in range(len(b))}
print(c[input()] - 1)
Problem p02836 (python)

Fixed submission:
s = list(input())

cnt = 0

for i in range(int(len(s) / 2)):
    if s[i] != s[-(i + 1)]:
        cnt += 1

print(cnt)

Buggy submission (verdict: Runtime Error):
import random

S = list(input())
n = len(S)
reS = list(reversed(S))

diffeNum_list = []
alphabets = [chr(ord("a") + i) for i in range(26)]
countLi = []

if S == reS:
    print(0)
else:
    for i in range(n):
        if S[i] != reS[i]:
            diffeNum_list.append(i)

    def hantei(S):
        count = 0
        for i in diffeNum_list:
            tempNum = random.choice(alphabets)
            if S[i] != tempNum:
                S[i] = tempNum
                count += 1

            if S == reS:
                countLi.append(count)

    for i in range(10000):
        hantei(S)

    print(min(countLi))
Problem p02829 (python)

Fixed submission:
a = int(input())
b = int(input())
 
print(6-a-b)

Buggy submission (verdict: Runtime Error):
n = int(input())
base = 10

if n%2 != 0:
  print(0)
else:
  ans = 0
  for i in range(10000)
    ans += n//base
    base *= 5   
  print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
 
s = 1
t = 0
 
for i in range(n):
    if s == a[i]:
        s += 1
    else:
        t += 1
if t == n:
    t = -1
print(t)

Buggy submission (verdict: Runtime Error):
n = int(input())
 
a = list(map(int,input().split()))
 
s = 1
t = 0
 
for i in range(n):
   if s == a[i]:
      s += 1
   else:
      t +=1
      
if t != n:
  print(t)
else:
  print(-1)

Buggy submission (verdict: Runtime Error):
import math
 
a,b = map(int,input().split())
 
x = math.gcd(a,b)
 
print(a*b//x)
Problem p02831 (python)

Fixed submission:
from fractions import gcd
a,b = map(int, input().split())
print((a*b) // gcd(a,b))

Buggy submission (verdict: Runtime Error):
import math

a,b = map(int,input().split())

x = math.gcd(a,b)

s = -(-a//x)
t = -(-b//x)

if a >= b:
  print(s)
else:
  print(t)
Problem p02832 (python)

Fixed submission:
n = int(input())
renga = list(map(int,input().split()))
 
next = 1
ans = 0
 
for i in range(n):
    if next == renga[i]:
        next += 1
    else:
        ans += 1
if ans == n:
    ans = -1
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
 
a = list(map(int,input().split()))
 
s = 1
t = 0
 
for i in range(n):
 if s == a[i]:
      s += 1
   else:
      t +=1
      
if t != n:
  print(t)
else:
  print(-1)

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

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

s = 1
t = 0

for i in range(n):
	if s == a[i]:
      s += 1
    else:
      t +=1
      
if t != n:
  print(t)
else:
  print(-1)
Problem p02833 (python)

Fixed submission:
n = int(input())
base = 10
ans = 0
 
if n%2 == 1:
  print(0)
else:
  for i in range(1,100):
    ans += n//base    
    base *= 5   
  print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
base = 10
ans = 0
 
if n%2 == 1:
  print(0)
else:
  for i in range(1,100):
    ans += n//base    base *= 5   
  print(ans

Buggy submission (verdict: Runtime Error):
n = int(input())
base = 10
ans = 0
if n%2 != 0:
  print(0)
else:
  for i in range(1,10000)
    ans += n//base
    base *= 5   
  print(ans)

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

if n%2 != 0:
  print(0)
else:
  ans = 0
  while n > 0:
    n //= 5
    ans += n//2
print(ans)
Problem p02835 (python)

Fixed submission:
a1, a2, a3 = map(int, input().split())
 
if a1 + a2 + a3 >= 22:
  print('bust')
else:
  print('win')

Buggy submission (verdict: Runtime Error):
a1, a2, a3 = map(int, input(), split())
 
if a1 + a2 + a3 >= 22:
  print("bust")
else:
  print("win")

Buggy submission (verdict: Runtime Error):
a1, a2, a3 = map(int, input(), split())

if a1 + a2 + a3 >= 22:
  print('bust')
else:
  print('win')

Buggy submission (verdict: Runtime Error):
a1 = input()
a2 = input()
a3 = input()
a = a1 + a2 + a3

if a >= 22:
  print('bust')
else:
  print('win')

Buggy submission (verdict: Runtime Error):
a1 = int(input())
a2 = int(input())
a3 = int(input())
 
A = a1 + a2 + a3
 
if A >= 22:
  print('bust')
else:
   print('win')

Buggy submission (verdict: Runtime Error):
a1 = int(input())
a2 = int(input())
a3 = int(input())
 
A = a1 + a2 + a3
 
if A >= 22:
  print('bust')
 else:
    print('win')

Buggy submission (verdict: Runtime Error):
a1 = int(input())
a2 = int(input())
a3 = int(input())

A = a1 + a2 + a3

if A >= 22:
  print('bust')
  else:
    print('win')

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
 
A = a + b+ c
 
if A >= 22:
 print('bust')
  else:
  print('win')

Buggy submission (verdict: Runtime Error):
a = int(input());
b = int(input());
c = int(input());

A = a + b+ c;

if A >= 22
 print('bust');
  else
  print('win');
Problem p02933 (python)

Fixed submission:
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print('red')

Buggy submission (verdict: Runtime Error):
lst = imput().split()
if int(lst[0]) >= 3200:
  print(lst[1])
else:
  print('red')

Buggy submission (verdict: Runtime Error):
a,s = input().split()
if a >= 3200:
  print(s)
else:
  print('red')
Problem p02836 (python)

Fixed submission:
S = input()
len_ = int(len(S)/2)

cnt = 0
for i in range(0, len_):
    if S[i] !=  S[-(i+1)]:
        cnt += 1
print(cnt)

Buggy submission (verdict: Runtime Error):
S = input()
len_ = int(7/2)

cnt = 0
for i in range(0, len_+1):
    if S[i] !=  S[-(i+1)]:
        cnt += 1
print(cnt)
Problem p02881 (python)

Fixed submission:
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    divisors.sort()
    return divisors
N = int(input())
i, j = 1, 1
l = make_divisors(N)
len_l = len(l)
if len_l % 2 == 1:
    idx = int((len_l-1)/2)
    print((l[idx]-i) + (l[idx]-j))
else:
    idx = int(len_l / 2)
    print(sum(l[idx-1:idx+1])-2)

Buggy submission (verdict: Runtime Error):
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    divisors.sort()
    return divisors
N = int(input())
i, j = 1, 1
l = make_divisors(N)
len_l = len(l)
if len_l % 2 == 1:
    idx = (len_l-1)/2
    print((l[idx]-i) + (l[idx]-j))
else:
    idx = int(len_l / 2)
    print(sum(l[idx-1:idx+1])-2)
Problem p03075 (python)

Fixed submission:
import numpy as np

N = 5
A = np.array([int(input()) for i in range(N)])
k = int(input())

xx, yy = np.meshgrid(A, A)
comb = np.c_[xx.flatten(), yy.flatten()]

diff_ = np.abs(comb[:, 0] - comb[:, 1])
max_diff = np.max(diff_)

if max_diff <= k:
    print('Yay!')
else:
    print(':(')

Buggy submission (verdict: Runtime Error):
from sys import exit


a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

num_list = [a, b, c, d, e]
len_num_list = len(num_list)

for i in range(len_num_list):
    for j in range(len_num_list):
        if i == j:
            pass
        else:
            tnum = abs(num_list[i] - num_list[j])
            if tnum > k:
                print(':(')
                exit()

if res == 0:
    print('Yay!')

Buggy submission (verdict: Runtime Error):
from sys import exit


a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

num_list = [a, b, c, d, e]
len_num_list = len(num_list)

for i in range(len_num_list):
    for j in range(len_num_list):
        if i == j:
            pass
        else:
            tnum = abs(num_list[i] - num_list[j])
            if tnum > k:
                print(':(')
                exit()

if res == 0:
    print('Yay!')

Buggy submission (verdict: Runtime Error):
from sys import exit


a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

num_list = [a, b, c, d, e]
len_num_list = len(num_list)

for i in range(len_num_list):
    for j in range(len_num_list):
        if i == j:
            pass
        else:
            tnum = abs(num_list[i] - num_list[j])
            if tnum > k:
                print(':(')
                exit()

if res == 0:
    print('Yay!')
Problem p02759 (python)

Fixed submission:
N = int(input())
 
if N % 2 == 0:
  print(N//2)
  
if N % 2 != 0:
  print((N//2)+1)

Buggy submission (verdict: Runtime Error):
if N % 2 == 0:
  print(N/2)
  
if N % 2 != 0:
  print((N//2)+1)

Buggy submission (verdict: Runtime Error):
N = N // 2
 
if N % 2 == 0:
  print(N)
  
if N % 2 != 0:
  print(N+1)

Buggy submission (verdict: Runtime Error):
N = N / 2

if N % 2 == 0:
  print(N)
  
if N % 2 != 0:
  print(N+1)
Problem p02771 (python)

Fixed submission:
a,b,c=(int(x) for x in input().split())
 
if a == b or a == c or b == c:
    if a == b == c:
        print("No")
    else:
        print("Yes")
  
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c=(int(x) for x in input().split())

if a == b or a == c or b == c:
  print(yes)
  
else:
  print(no)
Problem p02777 (python)

Fixed submission:
S,T=input().split()
A,B=(int(x) for x in input().split())
U = input()
 
if S == U:
  A = A - 1
  print(A, B)
  
else:
  B = B - 1
  print(A, B)

Buggy submission (verdict: Runtime Error):
S,T=input().split()
A,B=(int(x) for x in input().split())
U = input()
 
if S == U:
  A = A - 1
  print(A +" " + B)
  
else:
  B = B - 1
  print(A + " " + B)

Buggy submission (verdict: Runtime Error):
S,T=input().split()
A,B=(int(x) for x in input().split())
U = input()

if S == U:
  A = A - 1
  print(A B)
  
else:
  B = B - 1
  print(A B)
Problem p02766 (python)

Fixed submission:
n, k = (int(z) for z in input().split())
ans = 0
while n:
  n //= k
  ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
n, k = (int(z) for z in input().split())
ans = 0
while n:
	n /= k
    ans += 1
print(ans)
Problem p02793 (python)

Fixed submission:
def main():
  from sys import stdin
  from fractions import gcd
  n = int(stdin.readline())
  a = [int(z) for z in stdin.readline().split()]
  lcm = a[0]
  for i in range(1, n):
    lcm = lcm * a[i] // gcd(lcm, a[i])
  sm = 0
  for i in range(n):
    sm += lcm // a[i]
  print(sm % (10**9 + 7))

main()

Buggy submission (verdict: Runtime Error):
def main():
  from sys import stdin
  from math import gcd
  n = int(stdin.readline())
  a = [int(z) for z in stdin.readline().split()]
  lcm = a[0]
  for i in range(1, n):
    lcm = lcm * a[i] // gcd(lcm, a[i])
  sm = 0
  for i in range(n):
    sm += lcm // a[i]
  print(sm)

main()

Buggy submission (verdict: Runtime Error):
def main():
  from sys import *
  from math import gcd
  n = int(stdin.readline())
  a = [int(z) for z in stdin.readline().split()]
  lcm = a[0]
  for i in range(1, n):
    lcm = lcm * a[i] / gcd(lcm, a[i])
  sm = 0
  for i in range(n):
    sm += lcm // a[i]
  print(sm)
Problem p02759 (python)

Fixed submission:
N=int(input())
pages=N // 2
if N % 2==0:
        pass
else:
    pages=pages+1
print(pages)

Buggy submission (verdict: Runtime Error):
#N=int(input())
pages=N // 2
if N % 2==0:
  	pass
  else:
    pages=pages+1
print(pages)

Buggy submission (verdict: Runtime Error):
N=int(input())
pages=N // 2
if N % 2==0:
  	pass
  else:
    pages=pages+1
print(pages)

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

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

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

Buggy submission (verdict: Runtime Error):
pages=N // 2
print(pages)
Problem p02759 (python)

Fixed submission:

n = input()
n = int(n)
if(n%2 == 0):
	n= n/2
else:
    n = (n+1)/2
   
print(round(n))

Buggy submission (verdict: Runtime Error):
n = input()

if(n%2 == 0:
	n= n/2
else:
   n = (n+1)/2
   
print(n)
Problem p02881 (python)

Fixed submission:
N = int(input())
import math
def is_prime(n):
  if n == 1: return False
  for k in range(2, int(math.sqrt(n)) + 1):
    if n % k == 0:
      return False
  return True
if is_prime(N):
  print(N-1)
else:
  a = math.floor(math.sqrt(N))
  while True:
    if N%a==0:
      break
    a=a-1
  print(int(a+N/a-2))

Buggy submission (verdict: Runtime Error):
N = int(input())
import math
def is_prime(n):
  if n == 1: return False
  for k in range(2, int(math.sqrt(n)) + 1):
    if n % k == 0:
      return False
  return True
if is_prime(N):
  print(N-1)
else:
  a = np.floor(math.sqrt(N))
  while True:
    if N%a==0:
      break
      a=a-1
      b=N/a
      print(int(a+b-2))
Problem p02771 (python)

Fixed submission:
n = list(map(int,input().split()))
ans = 'No'
 
if len(set(n)) == 2:
  ans = 'Yes'
 
print(ans)

Buggy submission (verdict: Runtime Error):
n = input()
a = list(map(int,input().split()))
ans = 'APPROVED'
 
for i in a:
  if i % 2 == 0:
    if i % 3 != 0:
      ans = 'DENIED'
      break
    elif i % 5 != 0:
      ans = 'DENIED'
      break
 
 
print(ans)
Problem p02777 (python)

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


if s[0] == u:
  a[0] -= 1
else:
  a[1] -= 1

print(str(a[0]) + " " + str(a[1]))

Buggy submission (verdict: Runtime Error):
s = list(map(input().split()))
a = list(map(int,input().split()))
u = input()


if s[0] == u:
  a[0] -= 1
else:
  a[1] -= 1

print(str(a[0]) + " " + str(a[1]))
Problem p02831 (python)

Fixed submission:
import fractions

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

print((s[0] * s[1]) // fractions.gcd(s[0], s[1]))

Buggy submission (verdict: Runtime Error):
import math

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

print((s[0] * s[1]) // math.gcd(s[0], s[1]))

Buggy submission (verdict: Runtime Error):
import math

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

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

print(lcm(s[0], s[1]))
Problem p02832 (python)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
num = 1
ans = 0
 
for i in range(n):
  if num == a[i]:
    num += 1
 
if num == 1:
  ans = -1
else:
  ans = n - num + 1
 
print(ans)

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

num = 1
ans = 0

if i in range(n):
  if num == a[i]:
    num += 1

if num == 1:
  ans = -1
else:
  ans = n - num + 1

print(ans)
Problem p02771 (python)

Fixed submission:
a, b, c= map(int, input().split())
kawaiso = 0 
if a==b and a!=c:
    kawaiso = 1
 
elif  b==c and b!=a:
    kawaiso = 1
 
elif c==a and c!=b:
    kawaiso = 1
    
else:
    kawaiso = 0
  
 
if kawaiso == 1:
    print ("Yes")
    
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a, b, c= map(int, .input().split())
kawaiso = 0 
if a==b and a!=c:
    kawaiso = 1
 
 else if  b==c and b!=a :
    kawaiso = 1
 
 else if c==a and c!=b :
    kawaiso = 1

if kawaiso == 1 :
    print ('Yes')
    
    else :
      print('No')

Buggy submission (verdict: Runtime Error):
a, b, c= map(int, input().split())
kawaiso = 0 
if a==b && a!=c:
    kawaiso = 1

else if b==c && b!=a :
    kawaiso = 1

else if c==a && c!=b :
    kawaiso = 1
else :
    kawaiso = 0

if kawaiso == 1 :
    print ('yes')

else :
    print('No')

Buggy submission (verdict: Runtime Error):
a, b, c= map(int, input().split())
kawaiso = 0 
if a==b && a!=c:
    kawaiso = 1

if b==c && b!=a :
    kawaiso = 1

if c==a && c!=b :
    kawaiso = 1
else :
    kawaiso = 0
    
if kawaiso == 1 :
    print ('yes')

else :
    print('No')

Buggy submission (verdict: Runtime Error):
a, b, c= map(int, input().split())
kawaiso = 0 
if a==b && a!=c:
    kawaiso = 1

if b==c && b!=a :
    kawaiso = 1

if c==a && c!=b :
    kawaiso = 1

if kawaiso == 1 :
    print ('yes')

else :
    print('No')

Buggy submission (verdict: Runtime Error):
a, b, c= map(int, input().split())
kawaiso = 0 
if a==b && a!=c:
    kawaiso = 1

if b==c && b!=a :
    kawaiso = 1
]
if c==a && c!=b :
    kawaiso = 1

if kawaiso == 1 :
    print ('yes')

else :
    print('No')

Buggy submission (verdict: Runtime Error):
a, b, c= map(int, input().split())
kawaiso = 0 
if a==b && a!=c [
    kawaiso = 1
]
if b==c && b!=a [
    kawaiso = 1
]
if c==a && c!=b [
    kawaiso = 1
]
if kawaiso == 1 [
    print (yes)
]
else [
    print(No)
]
Problem p02779 (python)

Fixed submission:
a=int(input())
b=list(input().split())
c=sorted(b)
count=0
for i in range (a-1):
	if c[i]==c[i+1]:
		count=1
		break
	
if count==1:
	print("NO")	
else:print("YES")

Buggy submission (verdict: Runtime Error):
a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a):
	if c[i]==c[i+1]:
		print("No")
		break
	else:print("Yes")
Problem p02785 (python)

Fixed submission:
n,k=map(int, input().split())
h=list(map(int,input().split()))
H=sorted(h,reverse=True)
if n>=k:
 for i in range(k):
  H[i]=0
 print(sum(H))
else: 
 print(0)

Buggy submission (verdict: Runtime Error):
n,k=map(int, input().split())
h=list(map(int,input().split()))
H=sorted(h,reverse=True)
if n>=k:
	for i in range(k):
		H[i]=0
print(sum(H))
else: 
	print(0)
Problem p02829 (python)

Fixed submission:
A=int(input())
B=int(input())  
C=6-A-B
print(C)

Buggy submission (verdict: Runtime Error):
A=map(int,input())
B=map(int,input())
C=6-A-B
print(C)

Buggy submission (verdict: Runtime Error):
A=int(input())
B=int(input())
if (A=1 and B=2)or(A=2 and B=1):
  print(3)
if (A=2 and B=3)or(A=3 and B=2):
  print(1)
else:
  print(2)

Buggy submission (verdict: Runtime Error):
A=map(int,input())
B=map(int,input())
if (A=1 and B=2)or(A=2 and B=1):
  print(3)
if (A=2 and B=3)or(A=3 and B=2):
  print(1)
else:
  print(2)

Buggy submission (verdict: Runtime Error):
A=map(int,input())
B=map(int,input())
if (A=1 and B=2)or(A=2 and B=1):
  print(3)
if (A=2 and B=3)or(A=3 and B=2):
  print(1)
if (A=3 and B=1)or(A=1 and B=3):
  print(2)

Buggy submission (verdict: Runtime Error):
A=input()
B=input()
if A=1 and B=2:
  print(3)
if A=2 and B=3:
  print(1)
if A=3 and B=1:
  print(2)
if A=2 and B=1:
  print(3)
if A=3 and B=2:
  print(1)
if A=1 and B=3:
  print(2)

Buggy submission (verdict: Runtime Error):
A=input()
B=input()
if (A=1 and B=2)or(A=2 and B=1):
  print(3)
if (A=2 and B=3)or(A=3 and B=2):
  print(1)
if (A=3 and B=1)or(A=1 and B=3):
  print(2)
Problem p02836 (python)

Fixed submission:
a=list(input())
n=len(a)
count=0
for i in range(n):
	 if a[i]!=a[n-1-i]:
	 	a[i]=a[n-1-i]
	 	count+=1
print(count)

Buggy submission (verdict: Runtime Error):
a=input()
n=len(a)
count=0
for i in range(n):
	 if a[i]!=a[n+1-i]:
	 	a[i]=a[n+1-i]
	 	count+=1
print(count)

Buggy submission (verdict: Runtime Error):
a=input()
n=len(a)
count=0
for i in range (n)
	 if a[i]!=a[n+1-i]:
	 	a[i]=a[n+1-i]
	 	count+=1
print(count)

Buggy submission (verdict: Runtime Error):
a=input()
n=len(a)
count=0
for i in range (n)
	 if a[i]!=a[n+1-i]:
	 	a[i]=a[n+1-i]
	 	count+=1
Problem p02859 (python)

Fixed submission:
A=int(input())
print(A*A)

Buggy submission (verdict: Runtime Error):
A=input()
print(A*A)