Buggy python submission (verdict: Runtime Error):
A,B,C=input().split
a,b,c=int(A),int(B),int(C)

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

Fixed submission:
def is_poor(triple_numbers):
    count_map = {}
    for num in triple_numbers:
        if num not in count_map:
            count_map[num] = 1
        else:
            count_map[num] += 1
    
    for key, value in count_map.items():
        if value == 2:
            return True
    return False

is_p = is_poor(list(map(int, input().split())))

if is_p:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
import sys
import math
import numpy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
 
s = int(readline())
if s % 2 == 1:
    print(0)
else:
    s //= 2
    ans = 0
    while s:
        s //= 5
        ans += s
    print(ans)

Fixed submission:
def is_poor(triple_numbers):
    count_map = {}
    for num in triple_numbers:
        if num not in count_map:
            count_map[num] = 1
        else:
            count_map[num] += 1
    
    for key, value in count_map.items():
        if value == 2:
            return True
    return False

is_p = is_poor(list(map(int, input().split())))

if is_p:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
import sys
import math
import numpy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
 
p = int(readline())
if p % 2 == 1:
    print(0)
else:
    p //= 2
    ans = 0
    while p:
        p //= 5
        ans += p
    print(ans)

Fixed submission:
def is_poor(triple_numbers):
    count_map = {}
    for num in triple_numbers:
        if num not in count_map:
            count_map[num] = 1
        else:
            count_map[num] += 1
    
    for key, value in count_map.items():
        if value == 2:
            return True
    return False

is_p = is_poor(list(map(int, input().split())))

if is_p:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
A,B,C=input.split()
a=int(A)
b=int(B)
c=int(C)
if a==b or b==c or a==c:
    if not(a==b and b==c):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Fixed submission:
def is_poor(triple_numbers):
    count_map = {}
    for num in triple_numbers:
        if num not in count_map:
            count_map[num] = 1
        else:
            count_map[num] += 1
    
    for key, value in count_map.items():
        if value == 2:
            return True
    return False

is_p = is_poor(list(map(int, input().split())))

if is_p:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
l=input()
a=int(l[0])
b=int(l[1])
c=int(l[2])
if a==b or b==c or a==c:
    if not(a==b and b==c):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Fixed submission:
def is_poor(triple_numbers):
    count_map = {}
    for num in triple_numbers:
        if num not in count_map:
            count_map[num] = 1
        else:
            count_map[num] += 1
    
    for key, value in count_map.items():
        if value == 2:
            return True
    return False

is_p = is_poor(list(map(int, input().split())))

if is_p:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
def stringconcant(S,T):
    a = S
    b = T
    c = a+b
    return c

S,T= input().split()
a = stringconcant(T,S)
print(a)


Fixed submission:
def is_poor(triple_numbers):
    count_map = {}
    for num in triple_numbers:
        if num not in count_map:
            count_map[num] = 1
        else:
            count_map[num] += 1
    
    for key, value in count_map.items():
        if value == 2:
            return True
    return False

is_p = is_poor(list(map(int, input().split())))

if is_p:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):

def findTriplet(arr, n): 

      

    # sort the array 

    arr.sort() 

   

    # for every element in arr 

    # check if a pair exist(in array) whose 

    # sum is equal to arr element 

    i = n - 1

    while(i >= 0): 

        j = 0

        k = i - 1

        while (j < k): 

            if (arr[i] == arr[j] + arr[k]): 

                 

                # pair found 

                print "numbers are ", arr[i], arr[j], arr[k] 

                return

            elif (arr[i] > arr[j] + arr[k]): 

                j += 1

            else: 

                k -= 1

        i -= 1

          

    # no such triplet is found in array 

    print "No such triplet exists"

   
# driver program 

arr = [ 5, 32, 1, 7, 10, 50, 19, 21, 2 ] 

n = len(arr) 
findTriplet(arr, n) 

  
# This code is contributed by Sachin Bisht 


Fixed submission:
def is_poor(triple_numbers):
    count_map = {}
    for num in triple_numbers:
        if num not in count_map:
            count_map[num] = 1
        else:
            count_map[num] += 1
    
    for key, value in count_map.items():
        if value == 2:
            return True
    return False

is_p = is_poor(list(map(int, input().split())))

if is_p:
    print("Yes")
else:
    print("No")