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

Fixed submission:
from fractions import gcd
N = int(input())
A = list(map(int, input().split()))
 
ans = 0
MOD = 1000000007
 
LCM = A[0]
for i in range(1, N):
    LCM *= A[i] // gcd(LCM, A[i])
    
for a in A:
  ans += LCM // a
  
print(ans%MOD)

Buggy submission (verdict: Runtime Error):
from math import gcd
N = int(input())
A = list(map(int, input().split()))
 
ans = 0
MOD = 1000000007
 
LCM = A[0]
for i in range(1, N):
    LCM *= A[i] // gcd(LCM, A[i])
    
for a in A:
  ans += LCM // a
  
print(ans%MOD)
Problem p02771 (python)

Fixed submission:
A = 0
B = 0
c = 0
A, B, C = map(int, input().split())
if (A == B or A == C or C == B) and (A != B or A != C or B != C):
	print('Yes')
else:
	print("No")

Buggy submission (verdict: Runtime Error):
A, B, C = map(int, input().split)
if (A == B or A == C or C == B) and (A != B or A != C or B != C):
	print('Yes')
else:
	print("No")

Buggy submission (verdict: Runtime Error):
A, B, C = map(int, input().split)
if (A == B or A == C or C == B) and (A != B or A != C or B != C):
	print('Yes')
else:
	print("No")
Problem p03221 (python)

Fixed submission:
from operator import itemgetter

N,M=map(int,input().split())
PY=[]
P=[[] for i in range(N)]
ans=[0 for i in range(M)]
for i in range(M):
    PYi=list(map(int,input().split()))
    PY.append(PYi)
    P[PYi[0]-1].append([i,PYi[1]])

for i in range(N):
    P[i]=sorted(P[i], key=itemgetter(1))

for i in range(N):
    for j in range(len(P[i])):
        ans[P[i][j][0]]=j+1

for i in range(M):
    a=format(PY[i][0],'06d')
    b=format(ans[i],'06d')
    print(a+b)

Buggy submission (verdict: Runtime Error):
from operator import itemgetter

N,M=map(int,input().split())
PY=[]
P=[[] for i in range(N)]
ans=[0 for i in range(M)]
for i in range(M):
    PYi=list(map(int,input().split()))
    PY.append(PYi)
    P[PYi[0]-1].append([i,PYi[1]])

for i in range(N):
    P[i]=sorted(P[i], key=itemgetter(1))

for i in range(N):
    for j in range(len(P[PY[i][0]-1])):
        ans[P[PY[i][0]-1][j][0]]=j+1

for i in range(M):
    a=format(PY[i][0],'06x')
    b=format(ans[i],'06x')
    print(a+b)

Buggy submission (verdict: Runtime Error):
from operator import itemgetter

N,M=map(int,input().split())
PY=[]
P=[[] for i in range(N)]
Pk=[0 for i in range(N)]
ans=[0 for i in range(M)]
for i in range(M):
    PYi=list(map(int,input().split()))
    PY.append(PYi)
    P[PYi[0]-1].append([i,PYi[1]])
    Pk[PYi[0]-1]+=1

for i in range(N):
    P[i]=sorted(P[i], key=itemgetter(1))

for i in range(N):
    for j in range(Pk[PY[i][0]-1]):
        ans[P[PY[i][0]-1][j][0]]=j+1
        
for i in range(M):
    a=format(PY[i][0],'06x')
    b=format(ans[i],'06x')
    print(a+b)
Problem p03250 (python)

Fixed submission:
a,b,c=[int(i) for i in input().split()]
print(max(a,b,c)*9+a+b+c)

Buggy submission (verdict: Runtime Error):
    a,b,c=[int(i) for i in input().split()]
    print(max(a,b,c)*9+a+b+c)

Buggy submission (verdict: Runtime Error):
a,b,c=[int(i) for i in input().split()
print(max(a,b,c)*9+a+b+c)
Problem p02990 (python)

Fixed submission:
import math
 
MOD = 1000000000 + 7
 
def egcd(a, b):
    if a ==  0:
        return (b, 0, 1)
    else:
        g, y, x = egcd(b%a, a)
        return (g, x - (b//a) * y, y)
 
def modinv(a, m):
    g, x, y = egcd(a, m)
    if g != 1:
        raise Exception("No inverse exists")
    else:
        return x % m
 
def combination(n, r):
    return math.factorial(n)%MOD * modinv(math.factorial(r), MOD) * modinv(math.factorial(n-r), MOD) % MOD
    # return math.factorial(n) // math.factorial(r) // math.factorial(n-r)
 
N, K = [int(x) for x in input().split()]
 
for i in range(1, K+1):
    if N-K+1 < i:
        ans = 0
    else:
        ans = (combination(N-K+1, i) * math.factorial((K-i)+(i-1)))%MOD * (modinv(math.factorial(K-i), MOD)%MOD) * (modinv(math.factorial(i-1), MOD)%MOD)
 
    print(ans%MOD)

Buggy submission (verdict: Runtime Error):
import math
 
MOD = 1000000000 + 7
 
def egcd(a, b):
    if a ==  0:
        return (b, 0, 1)
    else:
        g, y, x = egcd(b%a, a)
        return (g, x - (b//a) * y, y)
 
def modinv(a, m):
    g, x, y = egcd(a, m)
    if g != 1:
        raise Exception("No inverse exists")
    else:
        return x % m
 
def combination(n, r):
    return math.factorial(n)%MOD * modinv(math.factorial(r), MOD) * modinv(math.factorial(n-r), MOD) % MOD
    # return math.factorial(n) // math.factorial(r) // math.factorial(n-r)
 
N, K = [int(x) for x in input().split()]
 
for i in range(1, K+1):
    ans = (combination(N-K+1, i) * math.factorial((K-i)+(i-1)))%MOD // (math.factorial(K-i)%MOD) // (math.factorial(i-1)%MOD)
 
    print(ans%MOD)
Problem p02916 (python)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=0
for i in range(N):
  ans = ans + B[A[i] - 1]
  if i > 0 and A[i] == A[i-1] + 1:
    ans = ans + C[A[i-1] - 1]
print(str(ans))

Buggy submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=0
for i in range(N-1):
  ans = ans + B[A[i]]
  if i > 0 and A[i] == A[i-1] + 1:
    ans = ans + C[A[i-1]]
print(str(ans))

Buggy submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=0
for i in range(N):
  ans = ans + B[A[i]]
  if i > 0 and A[i] == A[i-1] + 1:
    ans = ans + C[A[i-1]]
print(str(ans))

Buggy submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=0
for i in range(N):
  ans = ans + B[A[i]]
  if i > 0 and A[i] == A[i-1] + 1:
    ans = ans + C[A[i-1]]
print(ans)

Buggy submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=0
for i in range(N):
  ans = ans + B[A[i]]
  if i > 0 and A[i] == A[i-1] + 1:
    ans = ans + C[A[i-1]]
print(ans)
Problem p02773 (python)

Fixed submission:

from sys import stdin
def read():
    return stdin.readline().strip()

dict={}
output=[]

iteration=int(read())

max_val=-1

for _ in range(iteration):
    item=read()
    
    if dict.get(item) is None:
        dict[item]=0 
    dict[item]+=1 
    max_val = max(dict[item],max_val)
#max_val=max(dict.values())
for k,v in dict.items():
    
    if(max_val==v):
        output.append(k)
    
    
output.sort()
print('\n'.join(output))

Buggy submission (verdict: Runtime Error):
from sys import stdin
def read():
    return stdin.readline().strip()

dict={}
output=[]

iteration=int(read())

max_val=-1

for _ in range(iteration):
    item=read()
    
    if dict.get(item) is None:
        dict[item]=0 
    dict[item]+=1 
    max_val = max(dict[item],max_val)
#max_val=max(dict.values())
for k,v in dict.items():
    
    if(max_val==v):
        output.append(max_key)
    
    
output.sort()
print('\n'.join(output))

Buggy submission (verdict: Runtime Error):
from sys import stdin
def read():
    return stdin.readline().strip()

dict={}
output=[]

iteration=int(read())

max_val=-1

for _ in range(iteration):
    item=read()
    
    if dict.get(item) is None:
        dict[item]=0 
    dict[item]+=1 
    max_val = max(dict[item],max_val)
#max_val=max(dict.values())
for k,v in dict:
    
    if(max_val==v):
        output.append(k)
    
    
output.sort()
print('\n'.join(output))

Buggy submission (verdict: Runtime Error):
dict={}
output=[]

iteration=read()
if(iteration.isdigit()):
    iteration=int(iteration)
else:
    iteration=int(float(iteration))
for _ in range(iteration):
    item=read()
    
    if dict.get(item) is None:
        dict[item]=0 
    dict[item]+=1 
max_val=max(dict.values())
while(bool(dict)):
    max_key=max(dict,key=dict.get)
    if(max_val!=dict[max_key]):
        break
    output.append(max_key)
    
    del dict[max_key]
output.sort()
print('\n'.join(output))

Buggy submission (verdict: Runtime Error):
dict={}
output=[]

iteration=int(input())
for _ in range(iteration):
    item=input()
    
    if dict.get(item) is None:
        dict[item]=0 
    dict[item]+=1 
max_val=max(dict.values())
for i in range(iteration):
    max_key=max(dict,key=dict.get)
    if(max_val!=dict[max_key]):
        break
    output.append(max_key)
    
    del dict[max_key]
output.sort()
print('\n'.join(output))
Problem p02990 (python)

Fixed submission:
from operator import mul
from functools import reduce
def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

n, k = map(int, input().split())
r_max = n - k
b_max = k
for x in range(k):
    i = x + 1
    b = b_max - i
    r = r_max - i + 1
    if b < 0 or r < 0:
        print(0)
        continue
    r_count = cmb(i + r, i)
    b_count = cmb(b + i - 1, i - 1)
    # print("i({}), r({}), b({}), rc({}), bc({})".format(i, r, b, r_count, b_count))
    print(r_count * b_count % 1000000007)

Buggy submission (verdict: Runtime Error):
from operator import mul
from functools import reduce
def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

n, k = map(int, input().split())
r_max = n - k
b_max = k
for x in range(k):
    i = x + 1
    b = b_max - i
    r = r_max - i + 1
    r_count = cmb(i + r, i)
    b_count = cmb(b + i - 1, i - 1)
    # print("i({}), r({}), b({}), rc({}), bc({})".format(i, r, b, r_count, b_count))
    print(r_count * b_count % 1000000007)

Buggy submission (verdict: Runtime Error):
import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

n, k = map(int, input().split())
r_max = n - k
b_max = k
for x in range(k):
    i = x + 1
    b = b_max - i
    r = r_max - i + 1
    r_count = combinations_count(i + r, i)
    b_count = combinations_count(b + i - 1, i - 1)
    # print("i({}), r({}), b({}), rc({}), bc({})".format(i, r, b, r_count, b_count))
    print(r_count * b_count % 1000000007)
Problem p03107 (python)

Fixed submission:
s = input()
x = 0
for c in s:
    if c == '1':
        x = x + 1
print(min(x, len(s) - x) * 2)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
s = input()
s = list(s)
x = 0
maxIndex = len(s) - 1
count = 0
while True:
    if len(s) == x + 1:
        break
    if s[x] != s[x + 1]:
        s.pop(x)
        s.pop(x)
        count += 1
        x -= 1
    else:
        x += 1
print("{}".format(count * 2))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
s = input()
s = list(s)
x = 0
maxIndex = len(s) - 1
count = 0
while True:
    if len(s) - 1 == x:
        break
    if s[x] != s[x + 1]:
        s.pop(x)
        s.pop(x)
        count += 1
        x -= 1
    else:
        x += 1
print(count * 2)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
s = input()
s = list(s)
x = 0
maxIndex = len(s) - 1
count = 0
while True:
    if len(s) <= x:
        break
    if s[x] != s[x + 1]:
        s.pop(x)
        s.pop(x)
        maxIndex = len(s) - 1
        count += 1
    else:
        x += 1
print(count * 2)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
s = input()
s = list(s)
x = 0
maxIndex = len(s) - 1
count = 0
while True:
    if maxIndex < x + 1:
        break
    if s[x] != s[x + 1]:
        s.pop(x)
        s.pop(x)
        maxIndex = len(s) - 1
        x = min(maxIndex, x - 1)
        count += 1
    else:
        x += 1
print(count * 2)
Problem p02771 (python)

Fixed submission:
A,B,C = map(int,input().split())
if A==B!=C:
    print("Yes")
elif A!=B==C:
    print("Yes")
elif A==C!=B:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
A,B,C = map(int,input().split())
	if A=B=C:
    print("No")
    elif A!=B!=C:
    print("No")
    else :
      print("Yes")
Problem p02819 (python)

Fixed submission:
def is_prime(n):
    for i in range(2, n + 1):
        if i * i > n:
            break
        if n % i == 0:
            return False
    return n != 1


import sys
input = sys.stdin.readline().rstrip
X = int(input())

if X%2 == 0:
    if X == 2:
        print(2)
    else:
        X += 1
        for num in range(X, 10**6, 2):
            if is_prime(num):
                print(num)
                break
else:
    for num in range(X, 10**6, 2):
        if is_prime(num):
            print(num)
            break

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline().rstrip
X = int(input())
if X == 2:
    print(2)
elif X%2 == 0:
    X += 1
    for num in range(X, 10**6, 2):
        if is_prime(num):
            print(num)
            break
else:
    for num in range(X, 10**6, 2):
        if is_prime(num):
            print(num)
            break
Problem p02880 (python)

Fixed submission:
N = int(input())
flag = False
for i in range(1, 10):
    if N%i == 0 and N//i < 10:
        flag = True
if flag:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N = int(input())
flag = False
for i in range(10):
    if N%i == 0 and N//i < 10:
        flag = True
if flag:
    print("Yes")
else:
    print("No")
Problem p02933 (python)

Fixed submission:
a=int(input())
s=input()
if a < 3200:
    print("red")
else:
    print(s)

Buggy submission (verdict: Runtime Error):
a=int(input())
s=input()
if a < 3200:
    print(red)
else:
    print(s)
Problem p03107 (python)

Fixed submission:
from collections import Counter
def counter(li, n):
    count = Counter()
    count.update(li)
    return count[n]

import sys
input = sys.stdin.readline
S = list(input())[:-1]
S = list(map(int, S))
N = len(S)
count_0 = counter(S, 0)
count_1 = N-count_0
print(N-abs(count_1-count_0))

Buggy submission (verdict: Runtime Error):
s = input()
length_s = len(s)
list_s = list()
for i in range(length_s):
    list_s.append(s[:1])
    s = s[1:]
length = length_s
while(length > 2):
    for j in range(length - 1):
        if(list_s[j] != list_s[j+1]):
            del list_s[j:j+2]
            break;
        length = len(list_s)
print(length_s - len(list_s))
Problem p03307 (python)

Fixed submission:
from fractions import gcd
#最小公倍数
def lcm(a, b):
    return a*b // gcd(a, b)

import sys
input = sys.stdin.readline
N = int(input())
print(lcm(2, N))

Buggy submission (verdict: Runtime Error):
import math
import sys
def lcm(a, b):
    return a*b // math.gcd(a, b)

input = sys.stdin.readline
N = int(input())
print(lcm(2, N))

Buggy submission (verdict: Runtime Error):
import math
def lcm(a, b):
    return a*b // math.gcd(a, b)

import sys
input = sys.stdin.readline
N = int(input())
print(lcm(2, N))
Problem p02771 (python)

Fixed submission:

ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]

if a == b and ( a != c or b != c )  :
  print("Yes") 
elif a == c and ( a != b or c != b ) :
  print("Yes") 
elif b == c and ( b != a or c != a ) :
  print("Yes") 
else :
  print("No")

Buggy submission (verdict: Runtime Error):
ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]

if ( a == b and (a != c or b != c) ) or ( a == c and ( a != b and c != b ) ) or ( b == c and ( c != a or b != a ) :
  print("Yes") 
else :
  print("No")

Buggy submission (verdict: Runtime Error):
ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]

if ( a == b and (a != c or b != c) ) :
elif ( a == c and ( a != b and c != b ) ) :
elif ( b == c and ( c != a or b != a ) :
  print("Yes") 
else :
  print("No")
Problem p02777 (python)

Fixed submission:
input_texts = input()
text_list = input_texts.split(" ")
text_s = text_list[0]
text_t = text_list[1]

input_counts = input()
count_list = input_counts.split(" ")
count_s = int(count_list[0])
count_t = int(count_list[1])

pull_text = input()

if pull_text == text_s:
    count_s -= 1
else:
    count_t -= 1
output = str(count_s) + " " + str(count_t)
print(output)

Buggy submission (verdict: Runtime Error):
input_texts = input()
text_list = input_texts.split(" ")
text_s = text_list[0]
text_t = text_list[1]

input_counts = input()
count_list = input_counts.split(" ")
count_s = int(count_list[0])
count_t = int(count_list[1])

pull_text = input()

if pull_text == text_s:
    count_s -= 1
else:
    count_t -= 1

print(f"{str(count_s)} {str(count_t)}")
Problem p02771 (python)

Fixed submission:
x, y, z = input().split()
if x == y:
  if x == z and y == z:
    print("No")
  else:
    print("Yes")
elif x == z:
  if x == y and y == z:
    print("No")
  else:
    print("Yes")
elif y == z:
  if x == y and x == z:
    print("No")
  else:
    print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
n = int(input())
a = [int(i) for i in input().split()]
x = 0
for j in range(0,n):
  if not (((a[j] % 2) == 0) and (((a[j] % 3) != 0) or (a[j] % 5 != 0))):
    x = 1
if x == 1:
  print('APPROVED')
else:
  print('DENIED')

Buggy submission (verdict: Runtime Error):
n = int(input())
a = [int(i) for i in input().split()]
x = 0
for j in range(0,n):
  if not (((a[j] % 2) == 0) and (((a[j] % 3) != 0) and (a[j] % 5 != 0))):
    x = 1
if x == 1:
  print('APPROVED')
else:
  print('DENIED')

Buggy submission (verdict: Runtime Error):
x, y, z = input.split()
if x == y:
  if x == z and y == z:
    print("No")
  elif x != z and y != z:
    print("No")
  else:
    print("Yes")
elif x == z:
  if x == y and y == z:
    print("No")
  elif x != y and y != z:
    print("No")
  else:
    print("Yes")
elif y == z:
  if x == y and x == z:
    print("No")
  elif x != y and x != z:
    print("No")
  else:
    print("Yes")
else:
  print("No")
Problem p02777 (python)

Fixed submission:
s, t = input().split()
a, b = input().split()
u = input()

a = int(a)
b = int(b)

if u == s:
    print(a-1, b)
if u == t:
    print(a, b-1)

Buggy submission (verdict: Runtime Error):
s, t = input.split()
a, b = input.split()
u = input()

if u == s:
    print(a-1, b)
if u == t:
    print(a, b-1)
Problem p02860 (python)

Fixed submission:

N = int(input())
S = input()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):

N, S = input().split()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):

N, S = input().split()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')
Problem p02935 (python)

Fixed submission:
N = int(input())
V = sorted(map(int, input().split()))
a = (V[0] + V[1]) / 2
for i in range(2, N):
  a = (a + V[i]) / 2
print(a)

Buggy submission (verdict: Runtime Error):
N = int(input())
V = map(int, input().split())
a = (V[0] + V[1]) / 2
for i in range(2, N):
  a = (a + V[i]) / 2
print(a)
Problem p02773 (python)

Fixed submission:
import collections

N = int(input())
words = []
top = int()
for i in range(N):
    words.append(input())
c = collections.Counter(words)

c_sorted = sorted(c.items(), reverse=True, key=lambda x : x[1])

top = int(c_sorted[0][1])
answer = []
count = int(0)
length = len(c_sorted)
unko = str()

if length == 1:
    unko = "unko"
else:
    for i in range(N):
        if int(c_sorted[i][1]) == top:
            answer.append(c_sorted[i][0])
            count = count + 1
        else:
            break

answer.sort()

if unko == "unko":
    print(c_sorted[0][0])
else:
    for i in range(count):
        print(answer[i])

Buggy submission (verdict: Runtime Error):
import collections

N = int(input())
words = []
top = int()
for i in range(N):
    words.append(input())
c = collections.Counter(words)

c_sorted = sorted(c.items(), reverse=True, key=lambda x : x[1])

top = int(c_sorted[0][1])
answer = []
count = int(0)
for i in range(N):
    if int(c_sorted[i][1]) == top:
        answer.append(c_sorted[i][0])
        count = count + 1
    else:
        break

answer.sort()

for i in range(count):
    print(answer[i])
Problem p02771 (python)

Fixed submission:
x = input().split(' ')

if  x[0] == x[1] != x[2]:
    print("Yes")
elif x[1] == x[2] != x[0]:
    print("Yes")
elif x[2] == x[0] != x[1]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
A = input()
B = input()
C = input()

if A == B != C:
    print("yes")
elif B == C != A:
    print("yes")
elif C == A != B:
    print("yes")
else:
    print("No")
Problem p02771 (python)

Fixed submission:
nums = input().rstrip().split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2 and n2 == n3 and n1 == n3:
  print("No")
elif n1 != n2 and n2 != n3 and n1 != n3:
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
nums = input(),rstrip(),split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2:
  if n2 == n3:
    print("No")
  else:
    print("Yes")
else if n2 == n3:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
nums = input(),rstrip(),split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2 and n2 == n3:
  print("No")
else if n1 != n2 and n2 =! n3:
  print("No")
else:
  print("Yes")
Problem p02771 (python)

Fixed submission:
a,b,c = map(int, input().split())
ispoor = False
if (a == b and b!=c) or (b == c and a!=b) or (c==a and c!=b):
    ispoor = True
if ispoor:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if a == b or b == c or c == a:
  return "Yes"
else:
  return "No"
Problem p02916 (python)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
 
ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        ans += C[A[i]-1]
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
 
ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        res += C[i]
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list( map(int,input().split()))
 
ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        res += C[A[i]-1]
print(ans)

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

ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        res += C[A[i]]
print(ans)
Problem p02933 (python)

Fixed submission:
a = int(input())

s = input()

if a >= 3200:
    print(s)
else:
    print("red")

Buggy submission (verdict: Runtime Error):
a = int(input())
4000
s = input()
yes
if a >= 3200:
    print(s)
else:
    print("red")

Buggy submission (verdict: Runtime Error):
a = int(input())
4000
s = input()
yes
if a >= 3200:
  print(s)
  else a < 3200:
    print("red")
Problem p02771 (python)

Fixed submission:
i=list(map(int, input().split()))
 
if i[0]==i[1] or i[0]==i[2] or i[1]==i[2]:
	if i[0]==i[1] and i[0]==i[2]:
		print('No')
	else:
		print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
i=list(map(int, input().split()))
 
if i[0]==i[1] | i[0]==i[2] | i[1]==i[2]:
	if i[0]==i[1] & i[0]==i[2]  & i[1]==i[2]:
    	print('No')
	else:
		print('Yes')
else:
	print('No')

Buggy submission (verdict: Runtime Error):
i=list(map(int, input().split()))
 
if i[0]==i[1] | i[0]==i[2] | i[1]==i[2]:
  if i[0]==i[1] & i[0]==i[2]  & i[1]==i[2]:
	print('No')
  else:
	print('Yes')
else:
    print('No')

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

if i[0]==i[1] | i[0]==i[2] | i[1]==i[2]:
  if i[0]==i[1] & i[0]==i[2]:
	print('No')
  else:
	print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
if A==B & A==C:
	print('NO')
if A==B | A==C | B==C:
	print('YES')
else:
    print('NO')
Problem p02831 (python)

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

Buggy submission (verdict: Runtime Error):
from math import gcd
A, B = map(int, input().split())
print(int((A * B)/gcd(A, B)))