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 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:
a,b,c=map(int,input().split());P=set();P.add(a);P.add(b);P.add(c);print('Yes' if len(P)==2 else 'No')

Submission status: Accepted

Solution code:
a,b,c=[int(i) for i in input().split()]
if a==b and not b==c:
  print('Yes')
elif c==b and not b==a:
  print('Yes')
elif a==c and not b==c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import collections
import sys
l = list(input().split())
if len(collections.Counter(l)) == 2:
    print('Yes')
    sys.exit()
print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = [int(i) for i in 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)))or((A==C)and((B!=C)or(B!=A))))or((B==C)and((B!=A)or(C!=A))):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])

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 and b==c:
	print("No")
elif a==b or b==c or c==a:
	print("Yes")
else:
	print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
lists = list(map(int, input().split()))
print('Yes' if len(set(lists)) == 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=[]
a=list(map(int,input().split()))
a=set(a)

if len(a)==2:

    print("Yes")

else:print("No")

Submission status: Accepted

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

print("Yes"  if len(set(abc)) == 2 else "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())
Flag = True

if A == B or B == C or C == A:
  Flag = False

if A == B == C:
  Flag = True

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

Submission status: Accepted

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

def main():
    a, b, c = map(int, input().split())
    se = set([a, b, c])
    print("Yes" if len(se) == 2 else "No")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b,c = list(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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = [int(x) for x in input().split()]
if len(set(L)) == 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 (b==c and a!=b)or(c==a and c!=b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abc = list(input().split())
print("Yes" if len(set(abc))==2 else "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 + c != a * 3):
    print('Yes')
  else:
    print('No')
else:
  print('No')

Submission status: Accepted

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

xflag = False
yflag = False
for i, j in ([a,b],[b,c],[c,a]):
    if i == j:
        xflag = True
    else:
        yflag = True

if xflag and yflag:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

# a = set(map(int, input().split())) 

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

#こっちのがわかりやすいかも

Submission status: Accepted

Solution code:

url = "https://atcoder.jp//contests/abc155/tasks/abc155_a"

def main():
    t = list(map(int, input().split()))
    if t[0] == t[1] and t[0] != t[2]:
        print('Yes')
    elif t[1] == t[2] and t[0] != t[1]:
        print('Yes')
    elif t[0] == t[2] and t[0] != t[1]:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#文字列の格納
list_number = list(input().split())

#文字列の重複を確認
if len(list_number) - len(set(list_number)) == 1:
    text = "Yes"
else:
    text = "No"

#結果の表示
print(text)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if ans == 1:
    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 a != c:
    print("Yes")
elif a == c and a != b:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C = (int(i) for i in 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=list(input().split())

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

Submission status: Accepted

Solution code:
A, B, C = input().rstrip().split(' ')

if A == B == C:
  print('No')
elif A == B or B == C or 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:
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())
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,b,c = (x for x in 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())

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 = list(map(int, input().split()))
if len(set(a))==2: print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v):
    print(["Yes", "No"][not v])


def main():
    """エントリーポイント"""
    A, B, C = input([int, 3])
    yesno(len({A, B, C}) == 2)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.buffer.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
A,B,C = map(int,input().split())
if (A == B and A != C ) or (A == C and A != B ) or (C == B and A != C ):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b == c:
    print('No')
elif a == b or b == c or a == c:
    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 a!=b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

# calc 
AB = abs( A - B )
AC = abs( A - C )
BC = abs( B - C )

ans = False
if( AB == 0 and AC != 0 ):
    ans = True
elif( AC == 0 and AB != 0 ):    
    ans = True
elif( BC == 0 and AB != 0 ):    
    ans = True

# output      
if(ans):
    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:
a,b,c = map(int, input().split())
if (a==b or b==c or c==a):
    if (a!=b or b!=c or c!=a):
        print("Yes")
        exit()
print("No")

Submission status: Accepted

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

Submission status: Accepted

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

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    s = set(lmi())
    print('Yes') if len(s) == 2 else print('No')

if __name__ == "__main__":
    main()

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')
    else:
        if b == c:
            print('Yes')
        else:
            print('No')

Submission status: Accepted

Solution code:
A = input().split()
res = []
for i in A:
  if i not in res:
    res.append(i)

if len(res) == 2:
  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 or b == c or a == 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) and not(a==b and b==c):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

A, B, C = rl()

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

Submission status: Accepted

Solution code:
A,B,C=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,b,c=map(int,input().split())
if a==b:
  if a==c:
    print('No')
  else:
    print('Yes')
elif a==c:
  print('Yes')
elif b==c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n = [i for i in input().split()]

n = set(n)

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

Submission status: Accepted

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

def main():
    N = map(int, open(0).read().split())
    N = set(N)
    if len(N) == 2:
        print("Yes")
    else:
        print("No")



main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    ans = 'Yes'
    if a == b and a == c:
        ans = 'No'
    if a != b and b != c and a != c:
        ans = 'No'

    print(ans)


main()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a!=b and b==c:
  print("Yes")
elif b!=a and a==c:
  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())
if A == B == C:
    ans = 'No'
elif A == B or B == C or C == A:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Accepted

Solution code:
A, B, C = (int(x) for x in input().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:
abc = input().split()
#print(a,b,c)
print("Yes" if len(set(abc)) == 2 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

ABC = set(list(map(int, input().split())))
if len(ABC) == 2:
    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, b, c = map(int, input().split())
if (a == b == c) or (a != b and b != c and a != c):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b!=c:
    print('Yes')
elif a==c!=b:
    print('Yes')
elif b==c!=a:
    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:
abc = list(map(int, input().split()))
if len(set(abc)) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a = set(na())

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 (A == C and A != B) or (B == C and B != A):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
'''
INPUT SHORTCUTS
N, K = map(int,input().split())
N ,A,B = map(int,input().split())
string = str(input())
arr = list(map(int,input().split()))
N = int(input())
'''


a,b,c = map(int,input().split())
if( (a==b and a!=c) or (b==c and b!=a) 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 == c:
    result = "No"
elif a==b or a==c or b==c:
    result = "Yes"
else:
    result = "No"
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('YNeos'[len(set(input()[::2]))%2 ::2])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
read = lambda: map(int, input().split())
a, b, c = read()
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 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 = {int(i) for i in input().split()}
print('Yes') if len(a)==2 else print('No')

Submission status: Accepted

Solution code:
# cook your dish here
l= list(map(int, input().split()))
if(l[0]==l[1]!=l[2] or l[0]!=l[1]==l[2] or l[0]==l[2]!=l[1]):
  print("Yes")
else:
  print("No")

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())
ans="Yes"

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

Submission status: Accepted

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

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:
# For sys.std*, sys.argv etc...
import sys

# For cases when input tokens are spread unevenly over many lines.
# This provides methods for reading tokens of various types.
class BufferedTokenizer:
    pass

def read_ints():
    return [int(token) for token in input().split()]

def read_tokens():
    return input().split()

def main():
    print("Yes" if len(set(read_ints())) == 2 else "No")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
ABC = list(map(int, input().split()))
d = collections.Counter(ABC)
if len(d) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#A

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
A, B, C = map(int, input().split())
if (A!=B and B!=C and A!=C) or A==B==C:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a, b, c = input().split()
d = set([a, b, c])
d = list(d)
if len(d) == 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 c !=b) or (b == c and c!=a):
    print('Yes')
    exit()

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 (B == C and A != C):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def f(a, b, c):
    x = sorted([a, b, c])
    if (x[0] == x[1] and x[1] != x[2]) or (x[0] != x[1] and x[1] == x[2]):
        print('Yes')
    else:
        print('No')

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b == c:
    print('No')
elif a == b or b == c or a == c:
    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: print('No')
elif a!=b and b!=c and c!=a: print('No')
else: print('Yes')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if A != B == C or A == C != B or A == 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) or (a != b and b != c and c != a):
    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 a==c and b!=a:
    print('Yes')
elif b==c and b!=a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

if b == c and a != b:
    print('Yes')
elif c == a and b != c:
    print('Yes')
elif b == a and c != a:
    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 (c==b and a!=c):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))





a,b,c=input2()

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b, c = map(int, readline().split())
if (a == b and a != c) or (b == c and a != b) 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 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=input().split()

if a==b and a==c and b==c:
	print("No")
elif a==b or a==c or 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('Yes')
elif A!=B and B==C:
    print('Yes')
elif A==C and B!=C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m,l=map(int,input().split())
if (n==m and n!=l) or (n==l and n!=m) or (m==l and n!=m):
  print("Yes")
else:
  print("No")

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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

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:
a,b,c=map(int,input().split())
if a==b and a!=c or a==c and a!=b or c==b and a!=c:
    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 or a == c or b == c: print("Yes")
else: print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a == 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 = map(int, input().split())
if A == B and not A == C:
  print("Yes")
elif A ==C and not A== B:
  print("Yes")
elif B == C and not B== A:
  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("Yes")
elif A != B and A == C and B != C:
  print("Yes")
elif A != B and A != C and B == C:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    a, b, c = list(map(int, readline().split()))
    if a == b != c or a == c != b or b == c != a:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()