Problem: A triple of numbers is said to be _poor_ when two of those numbers are equal but the other number is different from those two numbers.  You will be given three integers A, B, and C. If this triple is poor, print `Yes`; otherwise, print `No`.

Submission attempts (in order):
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)

def stringconcant(S,T):
    a = S
    b = T
    c = a+b
    return c

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


x = list(map(int,input().split()))
a = x[0]
b = x[1]
c = x[2]

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

a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if a==b:
    if b==c: 
        print('NO')
    else:
        print('YES')
elif b==c:
    if a==c: 
        print('NO')
    else:
        print('YES')
elif a==c:
    if b==c:
        print('NO')
    else:
        print('YES')
else:
    print('NO')




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")

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")

def poor(a,b,c):
    if (a==b and a!=c) or (b==c and b!=a) or (a==c and a!=b):
        print("Yes")
    else:
        print("No")
        
A,B,C = input().split()
a = A
b = B
c = C
d = poor(a,b,c)
print(d)

a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
l1=list(set([a,b,c]))
if len(l1)==2:
    print('YES')
else:
    print('NO')


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")

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)


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 


a, b, c = list (map (int, input ().split ()))
k = a ^ b ^ c
print ("Yes" if ((k == a) + (k == b) + (k == c) == 1) else "No")

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Accepted