Problem:


Score: 100 points

Problem Statement

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.

Constraints

A, B, and C are all integers between 1 and 9 (inclusive).

Input

Input is given from Standard Input in the following format:

A B C

Output

If the given triple is poor, print Yes; otherwise, print No.

Sample Input 1

5 7 5

Sample Output 1

Yes

A and C are equal, but B is different from those two numbers, so this triple is poor.

Sample Input 2

4 4 4

Sample Output 2

No

A, B, and C are all equal, so this triple is not poor.

Sample Input 3

4 9 6

Sample Output 3

No

Sample Input 4

3 3 4

Sample Output 4

Yes



Sample input:
5 7 5


Sample output:
Yes

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if len(list(set([A, B, C]))) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from bisect import bisect_right, bisect_left
from collections import Counter, deque
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import groupby, permutations, combinations, product
from sys import stdin, stderr


# 最大公約数（ユークリッドの互除法）
# Python3.5 で math.gcd()が追加され、
# AtCoder環境と最新環境でパッケージが分かれてしまったので、自分で書いておく
def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)


# 拡張ユークリッド互除法
# 正整数x, y について、a*x + b*y == gcd(x,y)なるa,bを返す。
# 特に、互いに素なるx, yについては a*x + b*y == 1 となる a, b。
def exgcd(x, y):
    if y == 0:
        return 1, 0
    a, b = exgcd(y, x % y)
    return b, a - (x // y) * b


# 最小公倍数
def lcm(x, y):
    m = gcd(x, y)
    return (x // m) * (y // m)


def main():
    a, b, c = [int(x) for x in input().split()]
    dic = set()
    dic.add(a)
    dic.add(b)
    dic.add(c)
    if len(dic) == 2:
        return 'Yes'
    return 'No'


if __name__ == "__main__":
    print(main())

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))

if len(set(A))==2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
arr = set(map(int, input().split()))
if len(arr) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
if len(set(a))==2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=[0,0,0]
a[0],a[1],a[2]=map(int,input().split())
a.sort()

if a[0]==a[1] or a[1]==a[2]:
    if a[0]==a[1] and a[1]==a[2]:
        print("No")
    else:
        print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if (a == b and b != c) or (b == c and c != a) or (c ==a and a != b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import collections
a = list(map(int,input().split()))
d = collections.Counter(a)
if d.most_common()[0][1] == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def kawaisou(a, b, c):
    if a == b and a != c:
        return True
    if a == c and a != b:
        return True
    if b == c and a != b:
        return True
    return False

def main():
    a, b, c = rli()
    if kawaisou(a, b, c):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))
if len(set(nums)) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))
abc2 = set(abc)
if len(abc2) == 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#A

a = set(map(int,input().split()))
if len(a) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
val = list(map(int,input().split()))
val.sort()
if val[0] == val[1] and val[1] != val[2]:
    print('Yes')
elif val[1] == val[2] and val[1] != val[0]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    A, B, C = MAP()
    c = Counter([A, B, C])

    print("Yes" if len(c.keys()) == 2 else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c = list(map(int, input().split()))
if (a==b and b!=c) or (b==c and b!=a) or (a==c and b!=c):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    abc = list(map(int, args[0].split()))

    ret = 'No'
    if abc.count(abc[0]) == 2:
        ret = 'Yes'
    if abc.count(abc[1]) == 2:
        ret = 'Yes'
    if abc.count(abc[2]) == 2:
        ret = 'Yes'

    return ret


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b and a!=c:
    print("Yes")
elif a==c and a!=b:
    print("Yes")
elif b==c and a!=b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
import math
#n = int(input())
a, b, c = map(int, input().split())
#s = input()
#p = list(map(int, input().split()))

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

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if len(set([A, B, C])) == 2:
    print("Yes")
else:
  	print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if (a == b and b != c) or (c == b and b != a) or (a == c and b != c):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    A,B,C=map(int,input().split())
    if (A==B or B==C or C==A) and not A==B==C:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a == b and a == c:
    print("No")
elif a != b and b != c and c != a:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
A=input().split()
if len(set(A))==2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A == B:
    if A == C:
        print('No')
    else:
        print('Yes')
else:
    if A == C:
        print('Yes')
    elif B == C:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import math
import itertools
#n = int(input())
#n, d = list(input().split())
#n, l = list(map(int, input().split()))

A, B, C= list(map(int, input().split()))
if (A==B and A!=C) or (A==C and A!=B) or (B==C and B!=A):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if (a == b) + (b == c) + (c == a) == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a_s = set(a)

if len(a) - len(a_s) == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from itertools import groupby

A,B,C=map(int,input().split())
X=[A,B,C]
X.sort()
X=groupby(X)
s=0
for key,group in X:
    s+=1
if s==2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
s = set()
s.add(A)
s.add(B)
s.add(C)
if len(s) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a == b and b != c and a != c:
    print("Yes")
elif a == c and a != b and c != b:
    print("Yes")
elif b == c and b != a and  c != a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a=list(set(a))
p=len(a)
if p==1 or p==3:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
#def main(S, b):

if __name__ == '__main__':
    a, b, c = map(int, input().split())

    ans = 0

    if (a == b):
        ans += 1
    if (b == c):
        ans += 1
    if (a == c):
        ans += 1
    if (ans == 1):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
mylist =set(list(map(int, input().split())))
if len(mylist) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def main():
    a, b, c = map(int, input().split())

    if a == b and b == c:
        print('No')
        exit()

    if a == b or a == c or b == c:
        print('Yes')
        exit()
    
    print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
d=set(l)
if len(d)==2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a, b, c = list(map(int, input().split(" ")))
    if a == b and b == c:
        print("No")
    elif a != b and b != c and a != c:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
a, b, c = input().split()
if len(set([a, b, c])) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
l.sort()
if l[0]==l[1]:
    if l[1] != l[2]:
        print("Yes")
    else:
        print("No")
elif l[1] == l[2]:
    if l[0] != l[1]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Accepted

Solution code:
l = set([int(i) for i in input().split()])

if len(l) == 2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
A.sort()
if (A[0] == A[1] and A[1] != A[2]) or (A[0] != A[1] and A[1] == A[2]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
I = list(map(int,input().split()))

if len(set(I)) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if (A == B and A!=C and B!=C) or (C == B and A!=C and B!=A) or (A == C and A!=B and B!=C):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A = set(map(int, input().split()))

if len(A) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().split()
if len(set(a)) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if (A == B and B !=C) or (A == C and B !=C) or(C == B and A !=C):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x = set(map(int,input().split()))
if len(x) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A=set(map(int,input().split()))
print("Yes" if len(A)==2 else "No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

ans = 'No'
if len(list(set([A,B,C])))==2:
  ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if ((A==B)and(B!=C))or((A==C)and(A!=B))or((B==C)and(C!=A)):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split()) 
if a==b and b!=c:
    print('Yes')
elif b == c and c!=a:
    print('Yes')
elif a ==c and c!=b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = sorted(list(map(int, input().split())))

if (a[0] == a[1] and a[1] != a[2]) or (a[0] != a[1] and a[1] == a[2]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
ABC = set(list(map(int, input().split())))
if len(ABC) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
L = set(list(map(int, input().split())))
if len(L) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

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

Submission status: Accepted

Solution code:
res=list(map(int,input().split()))
s=set(res)
if len(s)==2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

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


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b and b!=c:
  print("Yes")
elif c==b and b!=a:
  print("Yes")
elif a==c and b!=c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
A.sort()
if (A[0] == A[1] and A[1] != A[2] )or(A[2] == A[1] and A[1] != A[0] ):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b, c = map(int, input().split())

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

Submission status: Accepted

Solution code:
x = list(map(int, input().split()))
x.sort()
if x[0] == x[1] and x[1] != x[2]:
    print('Yes')
elif x[0] != x[1] and x[1] == x[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
Set = set(list(map(int,input().split())))

if len(Set) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a.sort()
if a[0] == a[1] and a[1] != a[2]:
  print("Yes")
elif a[0] != a[1] and a[1] == a[2]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a = input().split()
if len(set(a)) == 2:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

print("Yes" if len(set([a,b,c])) == 2 else "No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

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

Submission status: Accepted

Solution code:
A, B , C = map(int, input().split())

if A == B and B == C or (A != B and B != C and C != A):
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
#map(int,input().split())
a,b,c=map(int,input().split())
if (a==b and b!=c) or (c==b and b!=a) or (c==a and a!=b):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
A,B,C = sorted(list(map(int,input().split())))

if A==B and B==C:
  print("No")
elif A==B or B==C:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(A: int, B: int, C: int):
    if A == B and A == C:
        print(NO)
    elif A != B and A != C and B != C:
        print(NO)
    else:
        print(YES)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, C = (int(abc) for abc in input().split())
if A == B and A != C:
    print("Yes")
elif A == C and A != B:
    print("Yes")
elif B == C and A != B:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
answer = "Yes" if a==b or b==c or a==c else "No"
print("No" if a==b==c else answer)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())


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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b and b==c:
  print("No")
elif a!=b and b!=c and c!=a:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
a.sort()
if a[0] == a[1] and a[0] != a[2]:
    print('Yes')
elif a[0] != a[1] and a[1] == a[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from sys import setrecursionlimit as srl; srl(10**7)
rr = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())
 
A,B,C = rrm()
if A==B!=C or A==C!=B or B==C!=A:
    print "Yes"
else:
    print "No"

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if len(set([a, b, c])) == 2:
  	print('Yes')
else:
  	print('No')

Submission status: Accepted

Solution code:
ls = list(map(int, input().split()))

st = set(ls)

if len(st) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
abc=input().split(" ")
A=int(abc[0])
B=int(abc[1])
C=int(abc[2])

if A==B or B==C or C==A:
  if A==B and B==C:
    print("No")
  else:
    print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
a.sort()
if a[0] == a[1] and a[0] != a[2] or a[1] == a[2] and a[0] != a[1]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, (input().split()))

s = {a, b, c}

print('Yes' if len(s) == 2 else 'No')

Submission status: Accepted

Solution code:
a = [int(x) for x in input().split()]
if len(set(a)) == 2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
leng = len(set(map(int, input().split())))

if leng == 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
lst = set(list(map(int,input().split())))
if len(lst) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print("No" if (a == b and a == c and b == c) or (a != b and b != c and c != a) else "Yes")

Submission status: Accepted

Solution code:
import sys
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a = IL()

cnt = 0
for i in range(3):
  for j in range(i+1,3):
    if a[i] == a[j]:
      cnt += 1
if cnt == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

s = set(a)

if len(s) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
a.sort()
if a[0] == a[1] and a[1] != a[2]:
    print("Yes")
elif a[0] != a[1] and a[1] == a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b,c = map(int, input().split())
if (a == b and b != c) or (b == c and c != a) or (c == a and a != b):
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b:
    if a != c:
        print("Yes")
        exit(0)
if a == c:
    if a != b:
        print("Yes")
        exit(0)
if b == c:
    if a != b:
        print("Yes")
        exit(0)
print("No")

Submission status: Accepted

Solution code:
def f(a,b,c):
    if a==b and a!=c or  c==b and a!=c or  a==c and a!=b:
        return "Yes"
    else: return "No"
a,b,c=map(int,input().split())
print(f(a,b,c))

Submission status: Accepted

Solution code:
S = set([int(i) for i in input().split()])
if len(S) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if(len(set(a)) == 2):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())


if len(set([a,b,c])) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    a, b, c = [int(s) for s in input().strip().split()]
    if a == b != c or a == c != b or b == c != a:
        print("Yes")
    else:
        print("No")


main()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if (A == B and B != C) or (B == C and A != C) or (A==C and B!= C):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b != c or b == c != a or c == a != b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c=sorted([int(i) for i in input().split()])

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

Submission status: Accepted

Solution code:
A = set(map(int, input().split()))
if len(A) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if (a == b or c == b or a == c ) and not(a == b == c):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
H = set(map(int, input().split()))
if len(H) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
print("Yes" if len(set(list(map(int,input().split()))))==2 else "No")

Submission status: Accepted

Solution code:
A = set(map(int,input().split()))

if len(A) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if (A==B and A!=C) or (C==B and A!=C) or (A==C and A!=B):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a != b and a != c and b != c:
    print('No')
elif a == b == c:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
A = set( list( map(int,input().split()) ) )
if len(A) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
B = set(A)
if len(B) == 2:
    print ('Yes')
else:
    print ('No')

Submission status: Accepted

Solution code:
se = set(map(int, input().split()))

if len(se)==2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if (a!=b and b!=c and c!=a) or (a==b and b==c):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if (a==b and b!=c):
  print("Yes")
elif (b==c and a!=b):
  print("Yes")
elif (a==c and a!=b):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n = list(map(int,input().split()))

a = set(n)

if len(a) == 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c = [int(x) for x in input().split()]

ans = "No"
if a==b and a!=c:
    ans = "Yes"
elif a==c and a!=b:
    ans = "Yes"
elif b==c and b!=a:
    ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()

if (A == B) and (B != C):
	print("Yes")
	exit()
if (A != B) and (B == C):
	print("Yes")
	exit()
if (A == C) and (B != C):
	print("Yes")
	exit()
print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if (A == B and A != C) or (B == C and B != A) or (C == A and C != B):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
ans = len(set(a))

if ans == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]

print('Yes' if len(set([A, B, C])) == 2 else 'No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
A, B, C  = [int(x) for x in input().strip().split()]
if (A == B and A != C) or (A == C and A != B) or (B == C and A != B):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A,B,C = list(map(int,input().split()))


if A == B and A != C:
    print('Yes')
elif B == C and A != B:
    print('Yes')
elif A == C and B != C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

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

Submission status: Accepted

Solution code:
s = set(map(int, input().split()))
if len(s) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print("Yes" if len(list(set([A, B, C]))) == 2 else "No")

Submission status: Accepted

Solution code:
S = set(input().split())
if len(S) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
mod=pow(10,9)+7

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

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

Submission status: Accepted

Solution code:
a = set(map(int,input().split()))
print("Yes" if len(a)==2 else "No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if A == B and B!=C:
    print('Yes')
elif B == C and C != A:
    print('Yes')
elif C == A and A != B:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
cnt=0
if a == b:
    cnt+=1
if c == b:
    cnt+=1
if a == c:
    cnt+=1

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

Submission status: Accepted

Solution code:
print('Yes' if len(set(map(int, input().split())))==2 else 'No')

Submission status: Accepted

Solution code:
l = input().split()

print("Yes" if len(set(l)) == 2 else "No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

if len(set([a,b,c])) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
if (a == b and a != c) or (a == c and a != b) or (b == c and b != a):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
A=[a,b,c]
B=len(set(A))
if B==2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)

A, B, C = map(int, input().split())

ans = 'No'
if A == B and B == C:
    ans = 'No'
elif A == B or B == C or A == C:
    ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
A, B, C = list(map(int, input().split()))
print('Yes' if len(set([A, B, C]))==2 else 'No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
cnt = 0

if a == b:
    cnt += 1
if a == c:
    cnt += 1
if b == c:
    cnt += 1

if cnt == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
v = set(map(lambda x: int(x), input().split(" ")))
print('Yes' if len(v) == 2 else 'No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A == B and B == C:
    ans = 'No'
elif A != B and B != C and C != A:
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

res = "No"

if A == B == C:
    print(res)
elif A == B or B == C or C == A:
    res = "Yes"
    print(res)
else:
    print(res)